[INFO] fetching crate omnitigs 5.0.1... [INFO] testing omnitigs-5.0.1 against try#8de4c7234dd9b97c9d76b58671343fdbbc9a433e+target=x86_64-unknown-linux-musl for musl_upgrade_1_2_5_with_libc_patch_0 [INFO] extracting crate omnitigs 5.0.1 into /workspace/builds/worker-3-tc1/source [INFO] started tweaking crates.io crate omnitigs 5.0.1 [INFO] finished tweaking crates.io crate omnitigs 5.0.1 [INFO] tweaked toml for crates.io crate omnitigs 5.0.1 written to /workspace/builds/worker-3-tc1/source/Cargo.toml [INFO] validating manifest of crates.io crate omnitigs 5.0.1 on toolchain 8de4c7234dd9b97c9d76b58671343fdbbc9a433e [INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+8de4c7234dd9b97c9d76b58671343fdbbc9a433e" "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" "+8de4c7234dd9b97c9d76b58671343fdbbc9a433e" "generate-lockfile" "--manifest-path" "Cargo.toml", kill_on_drop: false }` [INFO] [stderr] Updating crates.io index [INFO] [stderr] Locking 106 packages to latest compatible versions [INFO] [stderr] Adding criterion v0.5.1 (available: v0.6.0) [INFO] [stderr] Adding rand v0.8.5 (available: v0.9.1) [INFO] [stderr] Adding rand_chacha v0.3.1 (available: v0.9.0) [INFO] [stderr] Adding traitgraph v5.0.0 (available: v8.1.2) [INFO] [stderr] Adding traitsequence v2.0.0 (available: v8.1.2) [INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+8de4c7234dd9b97c9d76b58671343fdbbc9a433e" "fetch" "--manifest-path" "Cargo.toml", kill_on_drop: false }` [INFO] [stderr] Downloading crates ... [INFO] [stderr] Downloaded traitsequence v8.1.2 [INFO] [stderr] Downloaded traitsequence v2.0.0 [INFO] [stderr] Downloaded traitgraph-algo v8.1.2 [INFO] [stderr] Downloaded bigraph v5.0.1 [INFO] [stderr] Downloaded traitgraph v8.1.2 [INFO] [stderr] Downloaded bitvector v0.1.5 [INFO] [stderr] Downloaded traitgraph v5.0.0 [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-3-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-3-tc1/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:90999bfc7ae267e83380e433d8e61a7c072ca6729e92edbae886d3423b3a6f4c" "/opt/rustwide/cargo-home/bin/cargo" "+8de4c7234dd9b97c9d76b58671343fdbbc9a433e" "metadata" "--no-deps" "--format-version=1", kill_on_drop: false }` [INFO] [stdout] 36f670f820cb6d51d92da6c7f991793a4d2fd36c9e7d65759cd55b2e84f855a0 [INFO] running `Command { std: "docker" "start" "-a" "36f670f820cb6d51d92da6c7f991793a4d2fd36c9e7d65759cd55b2e84f855a0", kill_on_drop: false }` [INFO] running `Command { std: "docker" "inspect" "36f670f820cb6d51d92da6c7f991793a4d2fd36c9e7d65759cd55b2e84f855a0", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "36f670f820cb6d51d92da6c7f991793a4d2fd36c9e7d65759cd55b2e84f855a0", kill_on_drop: false }` [INFO] [stdout] 36f670f820cb6d51d92da6c7f991793a4d2fd36c9e7d65759cd55b2e84f855a0 [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-3-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-3-tc1/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_INCREMENTAL=0" "-e" "RUST_BACKTRACE=full" "-e" "RUSTFLAGS=--cap-lints=forbid" "-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:90999bfc7ae267e83380e433d8e61a7c072ca6729e92edbae886d3423b3a6f4c" "/opt/rustwide/cargo-home/bin/cargo" "+8de4c7234dd9b97c9d76b58671343fdbbc9a433e" "build" "--frozen" "--message-format=json" "--target" "x86_64-unknown-linux-musl", kill_on_drop: false }` [INFO] [stdout] 3cfe9ea6da5aa2bced1fb0cd333e57cc7a5e5d2ce9432555153d425e5a5663ee [INFO] running `Command { std: "docker" "start" "-a" "3cfe9ea6da5aa2bced1fb0cd333e57cc7a5e5d2ce9432555153d425e5a5663ee", kill_on_drop: false }` [INFO] [stderr] Compiling libc v0.2.174 [INFO] [stderr] Compiling equivalent v1.0.2 [INFO] [stderr] Compiling allocator-api2 v0.2.21 [INFO] [stderr] Compiling foldhash v0.1.5 [INFO] [stderr] Compiling getrandom v0.3.3 [INFO] [stderr] Compiling radium v0.7.0 [INFO] [stderr] Compiling tap v1.0.1 [INFO] [stderr] Compiling funty v2.0.0 [INFO] [stderr] Compiling num-traits v0.2.19 [INFO] [stderr] Compiling fixedbitset v0.5.7 [INFO] [stderr] Compiling traitsequence v8.1.2 [INFO] [stderr] Compiling fixedbitset v0.4.2 [INFO] [stderr] Compiling bitvector v0.1.5 [INFO] [stderr] Compiling traitsequence v2.0.0 [INFO] [stderr] Compiling log v0.4.27 [INFO] [stderr] Compiling wyz v0.5.1 [INFO] [stderr] Compiling hashbrown v0.15.4 [INFO] [stderr] Compiling bitvec v1.0.1 [INFO] [stderr] Compiling getrandom v0.2.16 [INFO] [stderr] Compiling rand_core v0.6.4 [INFO] [stderr] Compiling rand_core v0.9.3 [INFO] [stderr] Compiling indexmap v2.10.0 [INFO] [stderr] Compiling rand_chacha v0.3.1 [INFO] [stderr] Compiling rand_chacha v0.9.0 [INFO] [stderr] Compiling rand v0.8.5 [INFO] [stderr] Compiling rand v0.9.1 [INFO] [stderr] Compiling petgraph v0.7.1 [INFO] [stderr] Compiling petgraph v0.6.5 [INFO] [stderr] Compiling traitgraph v5.0.0 [INFO] [stderr] Compiling traitgraph v8.1.2 [INFO] [stderr] Compiling traitgraph-algo v8.1.2 [INFO] [stderr] Compiling bigraph v5.0.1 [INFO] [stderr] Compiling omnitigs v5.0.1 (/opt/rustwide/workdir) [INFO] [stdout] error[E0277]: the trait bound `Graph: traitgraph::interface::GraphBase` is not satisfied [INFO] [stdout] --> src/omnitigs/mod.rs:397:39 [INFO] [stdout] | [INFO] [stdout] 397 | impl Omnitigs [INFO] [stdout] | ^^^^^^^^^^^^^^^ the trait `traitgraph::interface::GraphBase` is not implemented for `Graph` [INFO] [stdout] | [INFO] [stdout] note: required by a bound in `Omnitigs` [INFO] [stdout] --> src/omnitigs/mod.rs:201:28 [INFO] [stdout] | [INFO] [stdout] 201 | pub struct Omnitigs { [INFO] [stdout] | ^^^^^^^^^ required by this bound in `Omnitigs` [INFO] [stdout] help: consider further restricting type parameter `Graph` with trait `GraphBase` [INFO] [stdout] | [INFO] [stdout] 397 | impl Omnitigs [INFO] [stdout] | ++++++++++++++++++++++++++++++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0277]: the trait bound `Graph: traitgraph::interface::GraphBase` is not satisfied [INFO] [stdout] --> src/omnitigs/mod.rs:485:21 [INFO] [stdout] | [INFO] [stdout] 485 | walks: &mut Vec>, [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ the trait `traitgraph::interface::GraphBase` is not implemented for `Graph` [INFO] [stdout] | [INFO] [stdout] help: consider further restricting type parameter `Graph` with trait `GraphBase` [INFO] [stdout] | [INFO] [stdout] 484 | pub fn remove_subwalks_and_reverse_complements_from_walks( [INFO] [stdout] | ++++++++++++++++++++++++++++++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0277]: the trait bound `Graph: traitgraph::interface::GraphBase` is not satisfied [INFO] [stdout] --> src/omnitigs/mod.rs:556:14 [INFO] [stdout] | [INFO] [stdout] 556 | walk_a: &VecEdgeWalk, [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ the trait `traitgraph::interface::GraphBase` is not implemented for `Graph` [INFO] [stdout] | [INFO] [stdout] help: consider further restricting type parameter `Graph` with trait `GraphBase` [INFO] [stdout] | [INFO] [stdout] 555 | fn is_subwalk_or_reverse_complement( [INFO] [stdout] | ++++++++++++++++++++++++++++++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0277]: the trait bound `Graph: traitgraph::interface::GraphBase` is not satisfied [INFO] [stdout] --> src/unitigs/mod.rs:257:39 [INFO] [stdout] | [INFO] [stdout] 257 | impl EdgeUnitigs [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ the trait `traitgraph::interface::GraphBase` is not implemented for `Graph` [INFO] [stdout] | [INFO] [stdout] note: required by a bound in `EdgeUnitigs` [INFO] [stdout] --> src/unitigs/mod.rs:205:31 [INFO] [stdout] | [INFO] [stdout] 205 | pub struct EdgeUnitigs { [INFO] [stdout] | ^^^^^^^^^ required by this bound in `EdgeUnitigs` [INFO] [stdout] help: consider further restricting type parameter `Graph` with trait `GraphBase` [INFO] [stdout] | [INFO] [stdout] 257 | impl EdgeUnitigs [INFO] [stdout] | ++++++++++++++++++++++++++++++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0277]: the trait bound `Graph: traitgraph::interface::GraphBase` is not satisfied [INFO] [stdout] --> src/omnitigs/mod.rs:406:44 [INFO] [stdout] | [INFO] [stdout] 406 | pub fn remove_reverse_complements(&mut self, graph: &Graph) { [INFO] [stdout] | ^^^^ the trait `traitgraph::interface::GraphBase` is not implemented for `Graph` [INFO] [stdout] | [INFO] [stdout] note: required by a bound in `Omnitigs` [INFO] [stdout] --> src/omnitigs/mod.rs:201:28 [INFO] [stdout] | [INFO] [stdout] 201 | pub struct Omnitigs { [INFO] [stdout] | ^^^^^^^^^ required by this bound in `Omnitigs` [INFO] [stdout] help: consider further restricting type parameter `Graph` with trait `GraphBase` [INFO] [stdout] | [INFO] [stdout] 397 | impl Omnitigs [INFO] [stdout] | ++++++++++++++++++++++++++++++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0277]: the trait bound `Graph: traitgraph::interface::GraphBase` is not satisfied [INFO] [stdout] --> src/unitigs/mod.rs:262:44 [INFO] [stdout] | [INFO] [stdout] 262 | pub fn remove_reverse_complements(&mut self, graph: &Graph) { [INFO] [stdout] | ^^^^ the trait `traitgraph::interface::GraphBase` is not implemented for `Graph` [INFO] [stdout] | [INFO] [stdout] note: required by a bound in `EdgeUnitigs` [INFO] [stdout] --> src/unitigs/mod.rs:205:31 [INFO] [stdout] | [INFO] [stdout] 205 | pub struct EdgeUnitigs { [INFO] [stdout] | ^^^^^^^^^ required by this bound in `EdgeUnitigs` [INFO] [stdout] help: consider further restricting type parameter `Graph` with trait `GraphBase` [INFO] [stdout] | [INFO] [stdout] 257 | impl EdgeUnitigs [INFO] [stdout] | ++++++++++++++++++++++++++++++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0277]: the trait bound `Graph: bigraph::traitgraph::interface::NavigableGraph` is not satisfied [INFO] [stdout] --> src/hydrostructure/static_hydrostructure.rs:37:70 [INFO] [stdout] | [INFO] [stdout] 37 | compute_hydrostructure_forward_reachability(graph, &azb, &mut r_plus); [INFO] [stdout] | ------------------------------------------- ^^^^^^^^^^^ the trait `bigraph::traitgraph::interface::NavigableGraph` is not implemented for `Graph` [INFO] [stdout] | | [INFO] [stdout] | required by a bound introduced by this call [INFO] [stdout] | [INFO] [stdout] note: required by a bound in `compute_hydrostructure_forward_reachability` [INFO] [stdout] --> src/restricted_reachability.rs:267:56 [INFO] [stdout] | [INFO] [stdout] 259 | pub fn compute_hydrostructure_forward_reachability< [INFO] [stdout] | ------------------------------------------- required by a bound in this function [INFO] [stdout] ... [INFO] [stdout] 267 | SubgraphType::RootGraph: ImmutableGraphContainer + NavigableGraph, [INFO] [stdout] | ^^^^^^^^^^^^^^ required by this bound in `compute_hydrostructure_forward_reachability` [INFO] [stdout] help: consider further restricting type parameter `Graph` with trait `NavigableGraph` [INFO] [stdout] | [INFO] [stdout] 28 | impl<'a, Graph: StaticGraph + SubgraphBase + bigraph::traitgraph::interface::NavigableGraph> [INFO] [stdout] | ++++++++++++++++++++++++++++++++++++++++++++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0277]: the trait bound `Graph: bigraph::traitgraph::interface::NavigableGraph` is not satisfied [INFO] [stdout] --> src/hydrostructure/static_hydrostructure.rs:40:71 [INFO] [stdout] | [INFO] [stdout] 40 | compute_hydrostructure_backward_reachability(graph, &azb, &mut r_minus); [INFO] [stdout] | -------------------------------------------- ^^^^^^^^^^^^ the trait `bigraph::traitgraph::interface::NavigableGraph` is not implemented for `Graph` [INFO] [stdout] | | [INFO] [stdout] | required by a bound introduced by this call [INFO] [stdout] | [INFO] [stdout] note: required by a bound in `compute_hydrostructure_backward_reachability` [INFO] [stdout] --> src/restricted_reachability.rs:307:56 [INFO] [stdout] | [INFO] [stdout] 299 | pub fn compute_hydrostructure_backward_reachability< [INFO] [stdout] | -------------------------------------------- required by a bound in this function [INFO] [stdout] ... [INFO] [stdout] 307 | SubgraphType::RootGraph: ImmutableGraphContainer + NavigableGraph, [INFO] [stdout] | ^^^^^^^^^^^^^^ required by this bound in `compute_hydrostructure_backward_reachability` [INFO] [stdout] help: consider further restricting type parameter `Graph` with trait `NavigableGraph` [INFO] [stdout] | [INFO] [stdout] 28 | impl<'a, Graph: StaticGraph + SubgraphBase + bigraph::traitgraph::interface::NavigableGraph> [INFO] [stdout] | ++++++++++++++++++++++++++++++++++++++++++++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0277]: the trait bound `::RootGraph: NavigableGraph` is not satisfied [INFO] [stdout] --> src/hydrostructure/static_hydrostructure.rs:86:70 [INFO] [stdout] | [INFO] [stdout] 86 | compute_hydrostructure_forward_reachability(graph, &azb, &mut r_plus); [INFO] [stdout] | ------------------------------------------- ^^^^^^^^^^^ unsatisfied trait bound [INFO] [stdout] | | [INFO] [stdout] | required by a bound introduced by this call [INFO] [stdout] | [INFO] [stdout] = help: the trait `bigraph::traitgraph::interface::NavigableGraph` is not implemented for `::RootGraph` [INFO] [stdout] note: required by a bound in `compute_hydrostructure_forward_reachability` [INFO] [stdout] --> src/restricted_reachability.rs:267:56 [INFO] [stdout] | [INFO] [stdout] 259 | pub fn compute_hydrostructure_forward_reachability< [INFO] [stdout] | ------------------------------------------- required by a bound in this function [INFO] [stdout] ... [INFO] [stdout] 267 | SubgraphType::RootGraph: ImmutableGraphContainer + NavigableGraph, [INFO] [stdout] | ^^^^^^^^^^^^^^ required by this bound in `compute_hydrostructure_forward_reachability` [INFO] [stdout] = note: the full name for the type has been written to '/opt/rustwide/target/x86_64-unknown-linux-musl/debug/deps/omnitigs-8935f53bd9c69327.long-type-16438353385571389001.txt' [INFO] [stdout] = note: consider using `--verbose` to print the full type name to the console [INFO] [stdout] help: consider further restricting the associated type [INFO] [stdout] | [INFO] [stdout] 83 | ) -> Self where ::RootGraph: bigraph::traitgraph::interface::NavigableGraph { [INFO] [stdout] | ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0277]: the trait bound `::RootGraph: NavigableGraph` is not satisfied [INFO] [stdout] --> src/hydrostructure/static_hydrostructure.rs:89:71 [INFO] [stdout] | [INFO] [stdout] 89 | compute_hydrostructure_backward_reachability(graph, &azb, &mut r_minus); [INFO] [stdout] | -------------------------------------------- ^^^^^^^^^^^^ unsatisfied trait bound [INFO] [stdout] | | [INFO] [stdout] | required by a bound introduced by this call [INFO] [stdout] | [INFO] [stdout] = help: the trait `bigraph::traitgraph::interface::NavigableGraph` is not implemented for `::RootGraph` [INFO] [stdout] note: required by a bound in `compute_hydrostructure_backward_reachability` [INFO] [stdout] --> src/restricted_reachability.rs:307:56 [INFO] [stdout] | [INFO] [stdout] 299 | pub fn compute_hydrostructure_backward_reachability< [INFO] [stdout] | -------------------------------------------- required by a bound in this function [INFO] [stdout] ... [INFO] [stdout] 307 | SubgraphType::RootGraph: ImmutableGraphContainer + NavigableGraph, [INFO] [stdout] | ^^^^^^^^^^^^^^ required by this bound in `compute_hydrostructure_backward_reachability` [INFO] [stdout] = note: the full name for the type has been written to '/opt/rustwide/target/x86_64-unknown-linux-musl/debug/deps/omnitigs-8935f53bd9c69327.long-type-16438353385571389001.txt' [INFO] [stdout] = note: consider using `--verbose` to print the full type name to the console [INFO] [stdout] help: consider further restricting the associated type [INFO] [stdout] | [INFO] [stdout] 83 | ) -> Self where ::RootGraph: bigraph::traitgraph::interface::NavigableGraph { [INFO] [stdout] | ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0277]: the trait bound `Graph: bigraph::traitgraph::interface::StaticGraph` is not satisfied [INFO] [stdout] --> src/macrotigs/macrotigs/default_macrotig_link_algorithm.rs:46:46 [INFO] [stdout] | [INFO] [stdout] 46 | if is_edge_self_bivalent(graph, *first_edge) { [INFO] [stdout] | --------------------- ^^^^^ the trait `bigraph::traitgraph::interface::NavigableGraph` is not implemented for `Graph` [INFO] [stdout] | | [INFO] [stdout] | required by a bound introduced by this call [INFO] [stdout] | [INFO] [stdout] = note: required for `Graph` to implement `bigraph::traitgraph::interface::StaticGraph` [INFO] [stdout] note: required by a bound in `is_edge_self_bivalent` [INFO] [stdout] --> /opt/rustwide/cargo-home/registry/src/index.crates.io-1949cf8c6b5b557f/traitgraph-algo-8.1.2/src/traversal/univocal_traversal.rs:138:37 [INFO] [stdout] | [INFO] [stdout] 138 | pub fn is_edge_self_bivalent(graph: &Graph, edge_id: Graph::EdgeIndex) -> bool { [INFO] [stdout] | ^^^^^^^^^^^ required by this bound in `is_edge_self_bivalent` [INFO] [stdout] help: consider further restricting type parameter `Graph` with trait `NavigableGraph` [INFO] [stdout] | [INFO] [stdout] 12 | impl MaximalMacrotigsAlgorithm for DefaultMacrotigLinkAlgorithm { [INFO] [stdout] | ++++++++++++++++++++++++++++++++++++++++++++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0277]: the trait bound `Graph: bigraph::traitgraph::interface::GraphBase` is not satisfied [INFO] [stdout] --> src/macrotigs/macrotigs/default_macrotig_link_algorithm.rs:46:24 [INFO] [stdout] | [INFO] [stdout] 46 | if is_edge_self_bivalent(graph, *first_edge) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ the trait `bigraph::traitgraph::interface::GraphBase` is not implemented for `Graph` [INFO] [stdout] | [INFO] [stdout] help: consider further restricting type parameter `Graph` with trait `GraphBase` [INFO] [stdout] | [INFO] [stdout] 12 | impl MaximalMacrotigsAlgorithm for DefaultMacrotigLinkAlgorithm { [INFO] [stdout] | +++++++++++++++++++++++++++++++++++++++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0277]: the trait bound `Graph: bigraph::traitgraph::interface::StaticGraph` is not satisfied [INFO] [stdout] --> src/macrotigs/macrotigs/default_macrotig_link_algorithm.rs:80:46 [INFO] [stdout] | [INFO] [stdout] 80 | if is_edge_self_bivalent(graph, *last_edge) { [INFO] [stdout] | --------------------- ^^^^^ the trait `bigraph::traitgraph::interface::NavigableGraph` is not implemented for `Graph` [INFO] [stdout] | | [INFO] [stdout] | required by a bound introduced by this call [INFO] [stdout] | [INFO] [stdout] = note: required for `Graph` to implement `bigraph::traitgraph::interface::StaticGraph` [INFO] [stdout] note: required by a bound in `is_edge_self_bivalent` [INFO] [stdout] --> /opt/rustwide/cargo-home/registry/src/index.crates.io-1949cf8c6b5b557f/traitgraph-algo-8.1.2/src/traversal/univocal_traversal.rs:138:37 [INFO] [stdout] | [INFO] [stdout] 138 | pub fn is_edge_self_bivalent(graph: &Graph, edge_id: Graph::EdgeIndex) -> bool { [INFO] [stdout] | ^^^^^^^^^^^ required by this bound in `is_edge_self_bivalent` [INFO] [stdout] help: consider further restricting type parameter `Graph` with trait `NavigableGraph` [INFO] [stdout] | [INFO] [stdout] 12 | impl MaximalMacrotigsAlgorithm for DefaultMacrotigLinkAlgorithm { [INFO] [stdout] | ++++++++++++++++++++++++++++++++++++++++++++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0277]: the trait bound `Graph: bigraph::traitgraph::interface::GraphBase` is not satisfied [INFO] [stdout] --> src/macrotigs/macrotigs/default_macrotig_link_algorithm.rs:80:24 [INFO] [stdout] | [INFO] [stdout] 80 | if is_edge_self_bivalent(graph, *last_edge) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ the trait `bigraph::traitgraph::interface::GraphBase` is not implemented for `Graph` [INFO] [stdout] | [INFO] [stdout] help: consider further restricting type parameter `Graph` with trait `GraphBase` [INFO] [stdout] | [INFO] [stdout] 12 | impl MaximalMacrotigsAlgorithm for DefaultMacrotigLinkAlgorithm { [INFO] [stdout] | +++++++++++++++++++++++++++++++++++++++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0277]: the trait bound `Graph: bigraph::traitgraph::interface::GraphBase` is not satisfied [INFO] [stdout] --> src/macrotigs/macrotigs/default_macrotig_link_algorithm.rs:46:53 [INFO] [stdout] | [INFO] [stdout] 46 | if is_edge_self_bivalent(graph, *first_edge) { [INFO] [stdout] | ^^^^^^^^^^^ the trait `bigraph::traitgraph::interface::GraphBase` is not implemented for `Graph` [INFO] [stdout] | [INFO] [stdout] help: consider further restricting type parameter `Graph` with trait `GraphBase` [INFO] [stdout] | [INFO] [stdout] 12 | impl MaximalMacrotigsAlgorithm for DefaultMacrotigLinkAlgorithm { [INFO] [stdout] | +++++++++++++++++++++++++++++++++++++++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0277]: the trait bound `Graph: bigraph::traitgraph::interface::NavigableGraph` is not satisfied [INFO] [stdout] --> src/macrotigs/microtigs/strongly_connected_hydrostructure_based_maximal_microtig_algorithm.rs:48:78 [INFO] [stdout] | [INFO] [stdout] 48 | compute_inverse_restricted_forward_reachability(graph, out_edge, &mut inverse_r_plus); [INFO] [stdout] | ----------------------------------------------- ^^^^^^^^^^^^^^^^^^^ the trait `bigraph::traitgraph::interface::NavigableGraph` is not implemented for `Graph` [INFO] [stdout] | | [INFO] [stdout] | required by a bound introduced by this call [INFO] [stdout] | [INFO] [stdout] note: required by a bound in `compute_inverse_restricted_forward_reachability` [INFO] [stdout] --> src/restricted_reachability.rs:209:56 [INFO] [stdout] | [INFO] [stdout] 202 | pub fn compute_inverse_restricted_forward_reachability< [INFO] [stdout] | ----------------------------------------------- required by a bound in this function [INFO] [stdout] ... [INFO] [stdout] 209 | SubgraphType::RootGraph: ImmutableGraphContainer + NavigableGraph, [INFO] [stdout] | ^^^^^^^^^^^^^^ required by this bound in `compute_inverse_restricted_forward_reachability` [INFO] [stdout] help: consider further restricting type parameter `Graph` with trait `NavigableGraph` [INFO] [stdout] | [INFO] [stdout] 17 | impl + bigraph::traitgraph::interface::NavigableGraph> MaximalMicrotigsAlgorithm [INFO] [stdout] | ++++++++++++++++++++++++++++++++++++++++++++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0277]: the trait bound `Graph: bigraph::traitgraph::interface::NavigableGraph` is not satisfied [INFO] [stdout] --> src/macrotigs/microtigs/strongly_connected_hydrostructure_based_maximal_microtig_algorithm.rs:177:65 [INFO] [stdout] | [INFO] [stdout] 177 | compute_restricted_backward_reachability(graph, first_edge, &mut r_minus); [INFO] [stdout] | ---------------------------------------- ^^^^^^^^^^^^ the trait `bigraph::traitgraph::interface::NavigableGraph` is not implemented for `Graph` [INFO] [stdout] | | [INFO] [stdout] | required by a bound introduced by this call [INFO] [stdout] | [INFO] [stdout] note: required by a bound in `compute_restricted_backward_reachability` [INFO] [stdout] --> src/restricted_reachability.rs:190:56 [INFO] [stdout] | [INFO] [stdout] 185 | pub fn compute_restricted_backward_reachability( [INFO] [stdout] | ---------------------------------------- required by a bound in this function [INFO] [stdout] ... [INFO] [stdout] 190 | SubgraphType::RootGraph: ImmutableGraphContainer + NavigableGraph, [INFO] [stdout] | ^^^^^^^^^^^^^^ required by this bound in `compute_restricted_backward_reachability` [INFO] [stdout] help: consider further restricting type parameter `Graph` with trait `NavigableGraph` [INFO] [stdout] | [INFO] [stdout] 172 | fn extend_right_micro_omnitig + bigraph::traitgraph::interface::NavigableGraph>( [INFO] [stdout] | ++++++++++++++++++++++++++++++++++++++++++++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0277]: the trait bound `Graph: bigraph::traitgraph::interface::NavigableGraph` is not satisfied [INFO] [stdout] --> src/macrotigs/microtigs/strongly_connected_hydrostructure_based_maximal_microtig_algorithm.rs:225:64 [INFO] [stdout] | [INFO] [stdout] 225 | compute_restricted_forward_reachability(graph, first_edge, &mut r_plus); [INFO] [stdout] | --------------------------------------- ^^^^^^^^^^^ the trait `bigraph::traitgraph::interface::NavigableGraph` is not implemented for `Graph` [INFO] [stdout] | | [INFO] [stdout] | required by a bound introduced by this call [INFO] [stdout] | [INFO] [stdout] note: required by a bound in `compute_restricted_forward_reachability` [INFO] [stdout] --> src/restricted_reachability.rs:173:56 [INFO] [stdout] | [INFO] [stdout] 168 | pub fn compute_restricted_forward_reachability( [INFO] [stdout] | --------------------------------------- required by a bound in this function [INFO] [stdout] ... [INFO] [stdout] 173 | SubgraphType::RootGraph: ImmutableGraphContainer + NavigableGraph, [INFO] [stdout] | ^^^^^^^^^^^^^^ required by this bound in `compute_restricted_forward_reachability` [INFO] [stdout] help: consider further restricting type parameter `Graph` with trait `NavigableGraph` [INFO] [stdout] | [INFO] [stdout] 220 | fn extend_left_micro_omnitig + bigraph::traitgraph::interface::NavigableGraph>( [INFO] [stdout] | ++++++++++++++++++++++++++++++++++++++++++++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0277]: the trait bound `Graph: bigraph::traitgraph::interface::GraphBase` is not satisfied [INFO] [stdout] --> src/omnitigs/default_trivial_omnitigs.rs:45:9 [INFO] [stdout] | [INFO] [stdout] 45 | UnivocalIterator::new_backward_without_start(graph, NodeOrEdge::Edge(edge)) [INFO] [stdout] | ^^^^^^^^^^^^^^^^ the trait `bigraph::traitgraph::interface::GraphBase` is not implemented for `Graph` [INFO] [stdout] | [INFO] [stdout] note: required by a bound in `UnivocalIterator` [INFO] [stdout] --> /opt/rustwide/cargo-home/registry/src/index.crates.io-1949cf8c6b5b557f/traitgraph-algo-8.1.2/src/traversal/univocal_traversal.rs:11:40 [INFO] [stdout] | [INFO] [stdout] 11 | pub struct UnivocalIterator<'a, Graph: GraphBase, NeighborStrategy> { [INFO] [stdout] | ^^^^^^^^^ required by this bound in `UnivocalIterator` [INFO] [stdout] help: consider further restricting type parameter `Graph` with trait `GraphBase` [INFO] [stdout] | [INFO] [stdout] 38 | pub fn is_edge_in_maximal_trivial_omnitig_heart( [INFO] [stdout] | +++++++++++++++++++++++++++++++++++++++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0277]: the trait bound `Graph: bigraph::traitgraph::interface::NavigableGraph` is not satisfied [INFO] [stdout] --> src/omnitigs/default_trivial_omnitigs.rs:45:54 [INFO] [stdout] | [INFO] [stdout] 45 | UnivocalIterator::new_backward_without_start(graph, NodeOrEdge::Edge(edge)) [INFO] [stdout] | -------------------------------------------- ^^^^^ the trait `bigraph::traitgraph::interface::NavigableGraph` is not implemented for `Graph` [INFO] [stdout] | | [INFO] [stdout] | required by a bound introduced by this call [INFO] [stdout] | [INFO] [stdout] note: required by a bound in `UnivocalIterator::<'a, Graph, BackwardNeighborStrategy>::new_backward_without_start` [INFO] [stdout] --> /opt/rustwide/cargo-home/registry/src/index.crates.io-1949cf8c6b5b557f/traitgraph-algo-8.1.2/src/traversal/univocal_traversal.rs:68:17 [INFO] [stdout] | [INFO] [stdout] 68 | impl<'a, Graph: NavigableGraph> UnivocalIterator<'a, Graph, BackwardNeighborStrategy> [INFO] [stdout] | ^^^^^^^^^^^^^^ required by this bound in `UnivocalIterator::<'a, Graph, BackwardNeighborStrategy>::new_backward_without_start` [INFO] [stdout] ... [INFO] [stdout] 81 | pub fn new_backward_without_start( [INFO] [stdout] | -------------------------- required by a bound in this associated function [INFO] [stdout] help: consider further restricting type parameter `Graph` with trait `NavigableGraph` [INFO] [stdout] | [INFO] [stdout] 38 | pub fn is_edge_in_maximal_trivial_omnitig_heart( [INFO] [stdout] | ++++++++++++++++++++++++++++++++++++++++++++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0277]: the trait bound `Graph: bigraph::traitgraph::interface::GraphBase` is not satisfied [INFO] [stdout] --> src/omnitigs/default_trivial_omnitigs.rs:45:9 [INFO] [stdout] | [INFO] [stdout] 45 | UnivocalIterator::new_backward_without_start(graph, NodeOrEdge::Edge(edge)) [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ the trait `bigraph::traitgraph::interface::GraphBase` is not implemented for `Graph` [INFO] [stdout] | [INFO] [stdout] help: consider further restricting type parameter `Graph` with trait `GraphBase` [INFO] [stdout] | [INFO] [stdout] 38 | pub fn is_edge_in_maximal_trivial_omnitig_heart( [INFO] [stdout] | +++++++++++++++++++++++++++++++++++++++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0308]: mismatched types [INFO] [stdout] --> src/omnitigs/default_trivial_omnitigs.rs:45:61 [INFO] [stdout] | [INFO] [stdout] 45 | UnivocalIterator::new_backward_without_start(graph, NodeOrEdge::Edge(edge)) [INFO] [stdout] | -------------------------------------------- ^^^^^^^^^^^^^^^^^^^^^^ expected `NodeOrEdge<_, _>`, found `NodeOrEdge<_, ...>` [INFO] [stdout] | | [INFO] [stdout] | arguments to this function are incorrect [INFO] [stdout] | [INFO] [stdout] note: two different versions of crate `traitgraph` are being used; two types coming from two different versions of the same crate are different types even if they look the same [INFO] [stdout] --> /opt/rustwide/cargo-home/registry/src/index.crates.io-1949cf8c6b5b557f/traitgraph-5.0.0/src/interface/mod.rs:327:1 [INFO] [stdout] | [INFO] [stdout] 327 | pub enum NodeOrEdge { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ this is the found type `traitgraph::interface::NodeOrEdge` [INFO] [stdout] | [INFO] [stdout] ::: /opt/rustwide/cargo-home/registry/src/index.crates.io-1949cf8c6b5b557f/traitgraph-8.1.2/src/interface/mod.rs:327:1 [INFO] [stdout] | [INFO] [stdout] 327 | pub enum NodeOrEdge { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ this is the expected type `bigraph::traitgraph::interface::NodeOrEdge` [INFO] [stdout] | [INFO] [stdout] ::: src/macrotigs/macrotigs/default_macrotig_link_algorithm.rs:6:5 [INFO] [stdout] | [INFO] [stdout] 6 | use traitgraph_algo::traversal::univocal_traversal::is_edge_self_bivalent; [INFO] [stdout] | --------------- one version of crate `traitgraph` used here, as a dependency of crate `traitgraph_algo` [INFO] [stdout] | [INFO] [stdout] ::: src/hydrostructure/incremental_hydrostructure/mod.rs:9:5 [INFO] [stdout] | [INFO] [stdout] 9 | use traitgraph::implementation::subgraphs::incremental_subgraph::IncrementalSubgraph; [INFO] [stdout] | ---------- one version of crate `traitgraph` used here, as a direct dependency of the current crate [INFO] [stdout] = help: you can use `cargo tree` to explore your dependency tree [INFO] [stdout] note: associated function defined here [INFO] [stdout] --> /opt/rustwide/cargo-home/registry/src/index.crates.io-1949cf8c6b5b557f/traitgraph-algo-8.1.2/src/traversal/univocal_traversal.rs:81:12 [INFO] [stdout] | [INFO] [stdout] 81 | pub fn new_backward_without_start( [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] help: try wrapping the expression in a variant of `bigraph::traitgraph::interface::NodeOrEdge` [INFO] [stdout] | [INFO] [stdout] 45 | UnivocalIterator::new_backward_without_start(graph, bigraph::traitgraph::interface::NodeOrEdge::Node(NodeOrEdge::Edge(edge))) [INFO] [stdout] | +++++++++++++++++++++++++++++++++++++++++++++++++ + [INFO] [stdout] 45 | UnivocalIterator::new_backward_without_start(graph, bigraph::traitgraph::interface::NodeOrEdge::Edge(NodeOrEdge::Edge(edge))) [INFO] [stdout] | +++++++++++++++++++++++++++++++++++++++++++++++++ + [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0277]: the trait bound `Graph: bigraph::traitgraph::interface::GraphBase` is not satisfied [INFO] [stdout] --> src/omnitigs/default_trivial_omnitigs.rs:46:14 [INFO] [stdout] | [INFO] [stdout] 46 | .filter_map(|n_or_e| match n_or_e { [INFO] [stdout] | ^^^^^^^^^^ the trait `bigraph::traitgraph::interface::GraphBase` is not implemented for `Graph` [INFO] [stdout] | [INFO] [stdout] help: consider further restricting type parameter `Graph` with trait `GraphBase` [INFO] [stdout] | [INFO] [stdout] 38 | pub fn is_edge_in_maximal_trivial_omnitig_heart( [INFO] [stdout] | +++++++++++++++++++++++++++++++++++++++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0277]: the trait bound `Graph: bigraph::traitgraph::interface::NavigableGraph` is not satisfied [INFO] [stdout] --> src/omnitigs/default_trivial_omnitigs.rs:45:9 [INFO] [stdout] | [INFO] [stdout] 45 | UnivocalIterator::new_backward_without_start(graph, NodeOrEdge::Edge(edge)) [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ the trait `bigraph::traitgraph::interface::NavigableGraph` is not implemented for `Graph` [INFO] [stdout] | [INFO] [stdout] note: required by a bound in `UnivocalIterator<'a, Graph, BackwardNeighborStrategy>` [INFO] [stdout] --> /opt/rustwide/cargo-home/registry/src/index.crates.io-1949cf8c6b5b557f/traitgraph-algo-8.1.2/src/traversal/univocal_traversal.rs:68:17 [INFO] [stdout] | [INFO] [stdout] 68 | impl<'a, Graph: NavigableGraph> UnivocalIterator<'a, Graph, BackwardNeighborStrategy> [INFO] [stdout] | ^^^^^^^^^^^^^^ required by this bound in `UnivocalIterator<'a, Graph, BackwardNeighborStrategy>` [INFO] [stdout] help: consider further restricting type parameter `Graph` with trait `NavigableGraph` [INFO] [stdout] | [INFO] [stdout] 38 | pub fn is_edge_in_maximal_trivial_omnitig_heart( [INFO] [stdout] | ++++++++++++++++++++++++++++++++++++++++++++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0308]: mismatched types [INFO] [stdout] --> src/omnitigs/default_trivial_omnitigs.rs:47:17 [INFO] [stdout] | [INFO] [stdout] 47 | NodeOrEdge::Node(node) => { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ expected `NodeOrEdge<_, _>`, found `traitgraph::interface::NodeOrEdge<_, _>` [INFO] [stdout] | [INFO] [stdout] note: two different versions of crate `traitgraph` are being used; two types coming from two different versions of the same crate are different types even if they look the same [INFO] [stdout] --> /opt/rustwide/cargo-home/registry/src/index.crates.io-1949cf8c6b5b557f/traitgraph-5.0.0/src/interface/mod.rs:327:1 [INFO] [stdout] | [INFO] [stdout] 327 | pub enum NodeOrEdge { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ this is the found type `traitgraph::interface::NodeOrEdge` [INFO] [stdout] | [INFO] [stdout] ::: /opt/rustwide/cargo-home/registry/src/index.crates.io-1949cf8c6b5b557f/traitgraph-8.1.2/src/interface/mod.rs:327:1 [INFO] [stdout] | [INFO] [stdout] 327 | pub enum NodeOrEdge { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ this is the expected type `bigraph::traitgraph::interface::NodeOrEdge` [INFO] [stdout] | [INFO] [stdout] ::: src/macrotigs/macrotigs/default_macrotig_link_algorithm.rs:6:5 [INFO] [stdout] | [INFO] [stdout] 6 | use traitgraph_algo::traversal::univocal_traversal::is_edge_self_bivalent; [INFO] [stdout] | --------------- one version of crate `traitgraph` used here, as a dependency of crate `traitgraph_algo` [INFO] [stdout] | [INFO] [stdout] ::: src/hydrostructure/incremental_hydrostructure/mod.rs:9:5 [INFO] [stdout] | [INFO] [stdout] 9 | use traitgraph::implementation::subgraphs::incremental_subgraph::IncrementalSubgraph; [INFO] [stdout] | ---------- one version of crate `traitgraph` used here, as a direct dependency of the current crate [INFO] [stdout] = help: you can use `cargo tree` to explore your dependency tree [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0599]: the method `next` exists for struct `FilterMap>, ...>`, but its trait bounds were not satisfied [INFO] [stdout] --> src/omnitigs/default_trivial_omnitigs.rs:56:14 [INFO] [stdout] | [INFO] [stdout] 45 | / UnivocalIterator::new_backward_without_start(graph, NodeOrEdge::Edge(edge)) [INFO] [stdout] 46 | | .filter_map(|n_or_e| match n_or_e { [INFO] [stdout] 47 | | NodeOrEdge::Node(node) => { [INFO] [stdout] 48 | | if !graph.is_biunivocal_node(node) || node == edge_endpoints.to_node { [INFO] [stdout] ... | [INFO] [stdout] 55 | | }) [INFO] [stdout] 56 | | .next() [INFO] [stdout] | | -^^^^ method cannot be called due to unsatisfied trait bounds [INFO] [stdout] | |_____________| [INFO] [stdout] | [INFO] [stdout] | [INFO] [stdout] = note: the following trait bounds were not satisfied: [INFO] [stdout] `Graph: bigraph::traitgraph::interface::GraphBase` [INFO] [stdout] which is required by `FilterMap::NodeIndex, ::EdgeIndex>> + '_, {closure@src/omnitigs/default_trivial_omnitigs.rs:46:25: 46:33}>: Iterator` [INFO] [stdout] help: consider restricting the type parameter to satisfy the trait bound [INFO] [stdout] | [INFO] [stdout] 41 | ) -> EdgeInTrivialOmnitigHeart where Graph: bigraph::traitgraph::interface::GraphBase { [INFO] [stdout] | ++++++++++++++++++++++++++++++++++++++++++++++++++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0277]: the trait bound `Graph: bigraph::traitgraph::interface::GraphBase` is not satisfied [INFO] [stdout] --> src/omnitigs/default_trivial_omnitigs.rs:63:9 [INFO] [stdout] | [INFO] [stdout] 63 | UnivocalIterator::new_forward_without_start(graph, NodeOrEdge::Edge(edge)) [INFO] [stdout] | ^^^^^^^^^^^^^^^^ the trait `bigraph::traitgraph::interface::GraphBase` is not implemented for `Graph` [INFO] [stdout] | [INFO] [stdout] note: required by a bound in `UnivocalIterator` [INFO] [stdout] --> /opt/rustwide/cargo-home/registry/src/index.crates.io-1949cf8c6b5b557f/traitgraph-algo-8.1.2/src/traversal/univocal_traversal.rs:11:40 [INFO] [stdout] | [INFO] [stdout] 11 | pub struct UnivocalIterator<'a, Graph: GraphBase, NeighborStrategy> { [INFO] [stdout] | ^^^^^^^^^ required by this bound in `UnivocalIterator` [INFO] [stdout] help: consider further restricting type parameter `Graph` with trait `GraphBase` [INFO] [stdout] | [INFO] [stdout] 38 | pub fn is_edge_in_maximal_trivial_omnitig_heart( [INFO] [stdout] | +++++++++++++++++++++++++++++++++++++++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0277]: the trait bound `Graph: bigraph::traitgraph::interface::NavigableGraph` is not satisfied [INFO] [stdout] --> src/omnitigs/default_trivial_omnitigs.rs:63:53 [INFO] [stdout] | [INFO] [stdout] 63 | UnivocalIterator::new_forward_without_start(graph, NodeOrEdge::Edge(edge)) [INFO] [stdout] | ------------------------------------------- ^^^^^ the trait `bigraph::traitgraph::interface::NavigableGraph` is not implemented for `Graph` [INFO] [stdout] | | [INFO] [stdout] | required by a bound introduced by this call [INFO] [stdout] | [INFO] [stdout] note: required by a bound in `UnivocalIterator::<'a, Graph, ForwardNeighborStrategy>::new_forward_without_start` [INFO] [stdout] --> /opt/rustwide/cargo-home/registry/src/index.crates.io-1949cf8c6b5b557f/traitgraph-algo-8.1.2/src/traversal/univocal_traversal.rs:47:17 [INFO] [stdout] | [INFO] [stdout] 47 | impl<'a, Graph: NavigableGraph> UnivocalIterator<'a, Graph, ForwardNeighborStrategy> [INFO] [stdout] | ^^^^^^^^^^^^^^ required by this bound in `UnivocalIterator::<'a, Graph, ForwardNeighborStrategy>::new_forward_without_start` [INFO] [stdout] ... [INFO] [stdout] 60 | pub fn new_forward_without_start( [INFO] [stdout] | ------------------------- required by a bound in this associated function [INFO] [stdout] help: consider further restricting type parameter `Graph` with trait `NavigableGraph` [INFO] [stdout] | [INFO] [stdout] 38 | pub fn is_edge_in_maximal_trivial_omnitig_heart( [INFO] [stdout] | ++++++++++++++++++++++++++++++++++++++++++++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0277]: the trait bound `Graph: bigraph::traitgraph::interface::GraphBase` is not satisfied [INFO] [stdout] --> src/omnitigs/default_trivial_omnitigs.rs:63:9 [INFO] [stdout] | [INFO] [stdout] 63 | UnivocalIterator::new_forward_without_start(graph, NodeOrEdge::Edge(edge)) [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ the trait `bigraph::traitgraph::interface::GraphBase` is not implemented for `Graph` [INFO] [stdout] | [INFO] [stdout] help: consider further restricting type parameter `Graph` with trait `GraphBase` [INFO] [stdout] | [INFO] [stdout] 38 | pub fn is_edge_in_maximal_trivial_omnitig_heart( [INFO] [stdout] | +++++++++++++++++++++++++++++++++++++++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0308]: mismatched types [INFO] [stdout] --> src/omnitigs/default_trivial_omnitigs.rs:63:60 [INFO] [stdout] | [INFO] [stdout] 63 | UnivocalIterator::new_forward_without_start(graph, NodeOrEdge::Edge(edge)) [INFO] [stdout] | ------------------------------------------- ^^^^^^^^^^^^^^^^^^^^^^ expected `NodeOrEdge<_, _>`, found `NodeOrEdge<_, ...>` [INFO] [stdout] | | [INFO] [stdout] | arguments to this function are incorrect [INFO] [stdout] | [INFO] [stdout] note: two different versions of crate `traitgraph` are being used; two types coming from two different versions of the same crate are different types even if they look the same [INFO] [stdout] --> /opt/rustwide/cargo-home/registry/src/index.crates.io-1949cf8c6b5b557f/traitgraph-5.0.0/src/interface/mod.rs:327:1 [INFO] [stdout] | [INFO] [stdout] 327 | pub enum NodeOrEdge { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ this is the found type `traitgraph::interface::NodeOrEdge` [INFO] [stdout] | [INFO] [stdout] ::: /opt/rustwide/cargo-home/registry/src/index.crates.io-1949cf8c6b5b557f/traitgraph-8.1.2/src/interface/mod.rs:327:1 [INFO] [stdout] | [INFO] [stdout] 327 | pub enum NodeOrEdge { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ this is the expected type `bigraph::traitgraph::interface::NodeOrEdge` [INFO] [stdout] | [INFO] [stdout] ::: src/macrotigs/macrotigs/default_macrotig_link_algorithm.rs:6:5 [INFO] [stdout] | [INFO] [stdout] 6 | use traitgraph_algo::traversal::univocal_traversal::is_edge_self_bivalent; [INFO] [stdout] | --------------- one version of crate `traitgraph` used here, as a dependency of crate `traitgraph_algo` [INFO] [stdout] | [INFO] [stdout] ::: src/hydrostructure/incremental_hydrostructure/mod.rs:9:5 [INFO] [stdout] | [INFO] [stdout] 9 | use traitgraph::implementation::subgraphs::incremental_subgraph::IncrementalSubgraph; [INFO] [stdout] | ---------- one version of crate `traitgraph` used here, as a direct dependency of the current crate [INFO] [stdout] = help: you can use `cargo tree` to explore your dependency tree [INFO] [stdout] note: associated function defined here [INFO] [stdout] --> /opt/rustwide/cargo-home/registry/src/index.crates.io-1949cf8c6b5b557f/traitgraph-algo-8.1.2/src/traversal/univocal_traversal.rs:60:12 [INFO] [stdout] | [INFO] [stdout] 60 | pub fn new_forward_without_start( [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] help: try wrapping the expression in a variant of `bigraph::traitgraph::interface::NodeOrEdge` [INFO] [stdout] | [INFO] [stdout] 63 | UnivocalIterator::new_forward_without_start(graph, bigraph::traitgraph::interface::NodeOrEdge::Node(NodeOrEdge::Edge(edge))) [INFO] [stdout] | +++++++++++++++++++++++++++++++++++++++++++++++++ + [INFO] [stdout] 63 | UnivocalIterator::new_forward_without_start(graph, bigraph::traitgraph::interface::NodeOrEdge::Edge(NodeOrEdge::Edge(edge))) [INFO] [stdout] | +++++++++++++++++++++++++++++++++++++++++++++++++ + [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0277]: the trait bound `Graph: bigraph::traitgraph::interface::GraphBase` is not satisfied [INFO] [stdout] --> src/omnitigs/default_trivial_omnitigs.rs:64:14 [INFO] [stdout] | [INFO] [stdout] 64 | .filter_map(|n_or_e| match n_or_e { [INFO] [stdout] | ^^^^^^^^^^ the trait `bigraph::traitgraph::interface::GraphBase` is not implemented for `Graph` [INFO] [stdout] | [INFO] [stdout] help: consider further restricting type parameter `Graph` with trait `GraphBase` [INFO] [stdout] | [INFO] [stdout] 38 | pub fn is_edge_in_maximal_trivial_omnitig_heart( [INFO] [stdout] | +++++++++++++++++++++++++++++++++++++++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0277]: the trait bound `Graph: bigraph::traitgraph::interface::NavigableGraph` is not satisfied [INFO] [stdout] --> src/omnitigs/default_trivial_omnitigs.rs:63:9 [INFO] [stdout] | [INFO] [stdout] 63 | UnivocalIterator::new_forward_without_start(graph, NodeOrEdge::Edge(edge)) [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ the trait `bigraph::traitgraph::interface::NavigableGraph` is not implemented for `Graph` [INFO] [stdout] | [INFO] [stdout] note: required by a bound in `UnivocalIterator<'a, Graph, ForwardNeighborStrategy>` [INFO] [stdout] --> /opt/rustwide/cargo-home/registry/src/index.crates.io-1949cf8c6b5b557f/traitgraph-algo-8.1.2/src/traversal/univocal_traversal.rs:47:17 [INFO] [stdout] | [INFO] [stdout] 47 | impl<'a, Graph: NavigableGraph> UnivocalIterator<'a, Graph, ForwardNeighborStrategy> [INFO] [stdout] | ^^^^^^^^^^^^^^ required by this bound in `UnivocalIterator<'a, Graph, ForwardNeighborStrategy>` [INFO] [stdout] help: consider further restricting type parameter `Graph` with trait `NavigableGraph` [INFO] [stdout] | [INFO] [stdout] 38 | pub fn is_edge_in_maximal_trivial_omnitig_heart( [INFO] [stdout] | ++++++++++++++++++++++++++++++++++++++++++++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0308]: mismatched types [INFO] [stdout] --> src/omnitigs/default_trivial_omnitigs.rs:65:17 [INFO] [stdout] | [INFO] [stdout] 65 | NodeOrEdge::Node(node) => { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ expected `NodeOrEdge<_, _>`, found `traitgraph::interface::NodeOrEdge<_, _>` [INFO] [stdout] | [INFO] [stdout] note: two different versions of crate `traitgraph` are being used; two types coming from two different versions of the same crate are different types even if they look the same [INFO] [stdout] --> /opt/rustwide/cargo-home/registry/src/index.crates.io-1949cf8c6b5b557f/traitgraph-5.0.0/src/interface/mod.rs:327:1 [INFO] [stdout] | [INFO] [stdout] 327 | pub enum NodeOrEdge { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ this is the found type `traitgraph::interface::NodeOrEdge` [INFO] [stdout] | [INFO] [stdout] ::: /opt/rustwide/cargo-home/registry/src/index.crates.io-1949cf8c6b5b557f/traitgraph-8.1.2/src/interface/mod.rs:327:1 [INFO] [stdout] | [INFO] [stdout] 327 | pub enum NodeOrEdge { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ this is the expected type `bigraph::traitgraph::interface::NodeOrEdge` [INFO] [stdout] | [INFO] [stdout] ::: src/macrotigs/macrotigs/default_macrotig_link_algorithm.rs:6:5 [INFO] [stdout] | [INFO] [stdout] 6 | use traitgraph_algo::traversal::univocal_traversal::is_edge_self_bivalent; [INFO] [stdout] | --------------- one version of crate `traitgraph` used here, as a dependency of crate `traitgraph_algo` [INFO] [stdout] | [INFO] [stdout] ::: src/hydrostructure/incremental_hydrostructure/mod.rs:9:5 [INFO] [stdout] | [INFO] [stdout] 9 | use traitgraph::implementation::subgraphs::incremental_subgraph::IncrementalSubgraph; [INFO] [stdout] | ---------- one version of crate `traitgraph` used here, as a direct dependency of the current crate [INFO] [stdout] = help: you can use `cargo tree` to explore your dependency tree [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0599]: the method `next` exists for struct `FilterMap>, ...>`, but its trait bounds were not satisfied [INFO] [stdout] --> src/omnitigs/default_trivial_omnitigs.rs:74:14 [INFO] [stdout] | [INFO] [stdout] 63 | / UnivocalIterator::new_forward_without_start(graph, NodeOrEdge::Edge(edge)) [INFO] [stdout] 64 | | .filter_map(|n_or_e| match n_or_e { [INFO] [stdout] 65 | | NodeOrEdge::Node(node) => { [INFO] [stdout] 66 | | if !graph.is_biunivocal_node(node) || node == edge_endpoints.from_node { [INFO] [stdout] ... | [INFO] [stdout] 73 | | }) [INFO] [stdout] 74 | | .next() [INFO] [stdout] | | -^^^^ method cannot be called due to unsatisfied trait bounds [INFO] [stdout] | |_____________| [INFO] [stdout] | [INFO] [stdout] | [INFO] [stdout] = note: the following trait bounds were not satisfied: [INFO] [stdout] `Graph: bigraph::traitgraph::interface::GraphBase` [INFO] [stdout] which is required by `FilterMap::NodeIndex, ::EdgeIndex>> + '_, {closure@src/omnitigs/default_trivial_omnitigs.rs:64:25: 64:33}>: Iterator` [INFO] [stdout] help: consider restricting the type parameter to satisfy the trait bound [INFO] [stdout] | [INFO] [stdout] 41 | ) -> EdgeInTrivialOmnitigHeart where Graph: bigraph::traitgraph::interface::GraphBase { [INFO] [stdout] | ++++++++++++++++++++++++++++++++++++++++++++++++++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0277]: the trait bound `Graph: bigraph::traitgraph::interface::GraphBase` is not satisfied [INFO] [stdout] --> src/omnitigs/default_trivial_omnitigs.rs:45:61 [INFO] [stdout] | [INFO] [stdout] 45 | UnivocalIterator::new_backward_without_start(graph, NodeOrEdge::Edge(edge)) [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ the trait `bigraph::traitgraph::interface::GraphBase` is not implemented for `Graph` [INFO] [stdout] | [INFO] [stdout] help: consider further restricting type parameter `Graph` with trait `GraphBase` [INFO] [stdout] | [INFO] [stdout] 38 | pub fn is_edge_in_maximal_trivial_omnitig_heart( [INFO] [stdout] | +++++++++++++++++++++++++++++++++++++++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0599]: the method `len` exists for mutable reference `&mut Omnitigs`, but its trait bounds were not satisfied [INFO] [stdout] --> src/omnitigs/mod.rs:408:32 [INFO] [stdout] | [INFO] [stdout] 201 | pub struct Omnitigs { [INFO] [stdout] | ------------------------------------- doesn't satisfy `Omnitigs: ExactSizeIterator` [INFO] [stdout] ... [INFO] [stdout] 408 | let initial_len = self.len(); [INFO] [stdout] | ^^^ method cannot be called on `&mut Omnitigs` due to unsatisfied trait bounds [INFO] [stdout] | [INFO] [stdout] note: trait bound `Graph: traitgraph::interface::GraphBase` was not satisfied [INFO] [stdout] --> src/omnitigs/mod.rs:614:13 [INFO] [stdout] | [INFO] [stdout] 614 | impl Omnitigs { [INFO] [stdout] | ^^^^^^^^^ --------------- [INFO] [stdout] | | [INFO] [stdout] | unsatisfied trait bound introduced here [INFO] [stdout] = note: the following trait bounds were not satisfied: [INFO] [stdout] `Omnitigs: ExactSizeIterator` [INFO] [stdout] which is required by `&mut Omnitigs: ExactSizeIterator` [INFO] [stdout] note: the trait `ExactSizeIterator` must be implemented [INFO] [stdout] --> /rustc/8de4c7234dd9b97c9d76b58671343fdbbc9a433e/library/core/src/iter/traits/exact_size.rs:86:1 [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 `len`, perhaps you need to implement one of them: [INFO] [stdout] candidate #1: `BidirectedQueue` [INFO] [stdout] candidate #2: `ExactSizeIterator` [INFO] [stdout] candidate #3: `bigraph::traitgraph::traitsequence::interface::Sequence` [INFO] [stdout] candidate #4: `rand::seq::slice::IndexedRandom` [INFO] [stdout] candidate #5: `traitsequence::interface::Sequence` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0599]: the method `iter` exists for mutable reference `&mut Omnitigs`, but its trait bounds were not satisfied [INFO] [stdout] --> src/omnitigs/mod.rs:411:34 [INFO] [stdout] | [INFO] [stdout] 411 | for (i, omnitig) in self.iter().enumerate() { [INFO] [stdout] | ^^^^ method cannot be called on `&mut Omnitigs` due to unsatisfied trait bounds [INFO] [stdout] | [INFO] [stdout] note: trait bound `Graph: traitgraph::interface::GraphBase` was not satisfied [INFO] [stdout] --> src/omnitigs/mod.rs:614:13 [INFO] [stdout] | [INFO] [stdout] 614 | impl Omnitigs { [INFO] [stdout] | ^^^^^^^^^ --------------- [INFO] [stdout] | | [INFO] [stdout] | unsatisfied trait bound introduced here [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 `iter`, perhaps you need to implement one of them: [INFO] [stdout] candidate #1: `bigraph::traitgraph::implementation::petgraph_impl::petgraph::visit::Walker` [INFO] [stdout] candidate #2: `bigraph::traitgraph::traitsequence::interface::Sequence` [INFO] [stdout] candidate #3: `traitgraph::implementation::petgraph_impl::petgraph::visit::Walker` [INFO] [stdout] candidate #4: `traitsequence::interface::Sequence` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0599]: the method `len` exists for mutable reference `&mut Omnitigs`, but its trait bounds were not satisfied [INFO] [stdout] --> src/omnitigs/mod.rs:422:58 [INFO] [stdout] | [INFO] [stdout] 201 | pub struct Omnitigs { [INFO] [stdout] | ------------------------------------- doesn't satisfy `Omnitigs: ExactSizeIterator` [INFO] [stdout] ... [INFO] [stdout] 422 | let mut retain_indices = Vec::with_capacity(self.len()); [INFO] [stdout] | ^^^ method cannot be called on `&mut Omnitigs` due to unsatisfied trait bounds [INFO] [stdout] | [INFO] [stdout] note: trait bound `Graph: traitgraph::interface::GraphBase` was not satisfied [INFO] [stdout] --> src/omnitigs/mod.rs:614:13 [INFO] [stdout] | [INFO] [stdout] 614 | impl Omnitigs { [INFO] [stdout] | ^^^^^^^^^ --------------- [INFO] [stdout] | | [INFO] [stdout] | unsatisfied trait bound introduced here [INFO] [stdout] = note: the following trait bounds were not satisfied: [INFO] [stdout] `Omnitigs: ExactSizeIterator` [INFO] [stdout] which is required by `&mut Omnitigs: ExactSizeIterator` [INFO] [stdout] note: the trait `ExactSizeIterator` must be implemented [INFO] [stdout] --> /rustc/8de4c7234dd9b97c9d76b58671343fdbbc9a433e/library/core/src/iter/traits/exact_size.rs:86:1 [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 `len`, perhaps you need to implement one of them: [INFO] [stdout] candidate #1: `BidirectedQueue` [INFO] [stdout] candidate #2: `ExactSizeIterator` [INFO] [stdout] candidate #3: `bigraph::traitgraph::traitsequence::interface::Sequence` [INFO] [stdout] candidate #4: `rand::seq::slice::IndexedRandom` [INFO] [stdout] candidate #5: `traitsequence::interface::Sequence` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0599]: the method `iter` exists for mutable reference `&mut Omnitigs`, but its trait bounds were not satisfied [INFO] [stdout] --> src/omnitigs/mod.rs:423:34 [INFO] [stdout] | [INFO] [stdout] 423 | for (i, omnitig) in self.iter().enumerate() { [INFO] [stdout] | ^^^^ method cannot be called on `&mut Omnitigs` due to unsatisfied trait bounds [INFO] [stdout] | [INFO] [stdout] note: trait bound `Graph: traitgraph::interface::GraphBase` was not satisfied [INFO] [stdout] --> src/omnitigs/mod.rs:614:13 [INFO] [stdout] | [INFO] [stdout] 614 | impl Omnitigs { [INFO] [stdout] | ^^^^^^^^^ --------------- [INFO] [stdout] | | [INFO] [stdout] | unsatisfied trait bound introduced here [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 `iter`, perhaps you need to implement one of them: [INFO] [stdout] candidate #1: `bigraph::traitgraph::implementation::petgraph_impl::petgraph::visit::Walker` [INFO] [stdout] candidate #2: `bigraph::traitgraph::traitsequence::interface::Sequence` [INFO] [stdout] candidate #3: `traitgraph::implementation::petgraph_impl::petgraph::visit::Walker` [INFO] [stdout] candidate #4: `traitsequence::interface::Sequence` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0599]: no method named `as_usize` found for associated type `::EdgeIndex` in the current scope [INFO] [stdout] --> src/omnitigs/mod.rs:430:74 [INFO] [stdout] | [INFO] [stdout] 430 | first_heart_edge_map[reverse_complement_first_heart_edge.as_usize()]; [INFO] [stdout] | ^^^^^^^^ method not found in `::EdgeIndex` [INFO] [stdout] | [INFO] [stdout] note: there are multiple different versions of crate `traitgraph` in the dependency graph [INFO] [stdout] --> /opt/rustwide/cargo-home/registry/src/index.crates.io-1949cf8c6b5b557f/traitgraph-8.1.2/src/index.rs:79:1 [INFO] [stdout] | [INFO] [stdout] 79 | / pub trait GraphIndex>: [INFO] [stdout] 80 | | std::fmt::Debug [INFO] [stdout] 81 | | + Eq [INFO] [stdout] 82 | | + Ord [INFO] [stdout] ... | [INFO] [stdout] 88 | | + std::ops::Add [INFO] [stdout] 89 | | + std::ops::Sub [INFO] [stdout] | |_________________________________________^ this is the trait that is needed [INFO] [stdout] ... [INFO] [stdout] 93 | fn as_usize(self) -> usize; [INFO] [stdout] | --------------------------- the method is available for `::EdgeIndex` here [INFO] [stdout] | [INFO] [stdout] ::: src/omnitigs/mod.rs:29:5 [INFO] [stdout] | [INFO] [stdout] 29 | use traitgraph::index::GraphIndex; [INFO] [stdout] | ----------------------------- `GraphIndex` imported here doesn't correspond to the right version of crate `traitgraph` [INFO] [stdout] | [INFO] [stdout] ::: /opt/rustwide/cargo-home/registry/src/index.crates.io-1949cf8c6b5b557f/traitgraph-5.0.0/src/index.rs:76:1 [INFO] [stdout] | [INFO] [stdout] 76 | / pub trait GraphIndex>: [INFO] [stdout] 77 | | std::fmt::Debug [INFO] [stdout] 78 | | + Eq [INFO] [stdout] 79 | | + Ord [INFO] [stdout] ... | [INFO] [stdout] 85 | | + std::ops::Add [INFO] [stdout] 86 | | + std::ops::Sub [INFO] [stdout] | |__________________________________________- this is the trait that was imported [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0277]: the trait bound `Graph: traitgraph::interface::GraphBase` is not satisfied [INFO] [stdout] --> src/omnitigs/mod.rs:461:9 [INFO] [stdout] | [INFO] [stdout] 461 | std::mem::swap(&mut omnitigs, &mut self.omnitigs); [INFO] [stdout] | ^^^^^^^^^^^^^^ the trait `traitgraph::interface::GraphBase` is not implemented for `Graph` [INFO] [stdout] | [INFO] [stdout] note: required by a bound in `Omnitig` [INFO] [stdout] --> src/omnitigs/mod.rs:37:27 [INFO] [stdout] | [INFO] [stdout] 37 | pub struct Omnitig { [INFO] [stdout] | ^^^^^^^^^ required by this bound in `Omnitig` [INFO] [stdout] help: consider further restricting type parameter `Graph` with trait `GraphBase` [INFO] [stdout] | [INFO] [stdout] 397 | impl Omnitigs [INFO] [stdout] | ++++++++++++++++++++++++++++++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0277]: the trait bound `Graph: traitgraph::interface::GraphBase` is not satisfied [INFO] [stdout] --> src/omnitigs/mod.rs:460:28 [INFO] [stdout] | [INFO] [stdout] 460 | let mut omnitigs = Vec::new(); [INFO] [stdout] | ^^^ the trait `traitgraph::interface::GraphBase` is not implemented for `Graph` [INFO] [stdout] | [INFO] [stdout] note: required by a bound in `Omnitig` [INFO] [stdout] --> src/omnitigs/mod.rs:37:27 [INFO] [stdout] | [INFO] [stdout] 37 | pub struct Omnitig { [INFO] [stdout] | ^^^^^^^^^ required by this bound in `Omnitig` [INFO] [stdout] help: consider further restricting type parameter `Graph` with trait `GraphBase` [INFO] [stdout] | [INFO] [stdout] 397 | impl Omnitigs [INFO] [stdout] | ++++++++++++++++++++++++++++++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0277]: the trait bound `Graph: traitgraph::interface::GraphBase` is not satisfied [INFO] [stdout] --> src/omnitigs/mod.rs:462:29 [INFO] [stdout] | [INFO] [stdout] 462 | for (i, omnitig) in omnitigs.into_iter().enumerate() { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ the trait `traitgraph::interface::GraphBase` is not implemented for `Graph` [INFO] [stdout] | [INFO] [stdout] note: required by a bound in `Omnitig` [INFO] [stdout] --> src/omnitigs/mod.rs:37:27 [INFO] [stdout] | [INFO] [stdout] 37 | pub struct Omnitig { [INFO] [stdout] | ^^^^^^^^^ required by this bound in `Omnitig` [INFO] [stdout] help: consider further restricting type parameter `Graph` with trait `GraphBase` [INFO] [stdout] | [INFO] [stdout] 397 | impl Omnitigs [INFO] [stdout] | ++++++++++++++++++++++++++++++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0277]: the trait bound `Graph: traitgraph::interface::GraphBase` is not satisfied [INFO] [stdout] --> src/omnitigs/mod.rs:462:29 [INFO] [stdout] | [INFO] [stdout] 462 | for (i, omnitig) in omnitigs.into_iter().enumerate() { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ the trait `traitgraph::interface::GraphBase` is not implemented for `Graph` [INFO] [stdout] | [INFO] [stdout] note: required by a bound in `Omnitig` [INFO] [stdout] --> src/omnitigs/mod.rs:37:27 [INFO] [stdout] | [INFO] [stdout] 37 | pub struct Omnitig { [INFO] [stdout] | ^^^^^^^^^ required by this bound in `Omnitig` [INFO] [stdout] help: consider further restricting type parameter `Graph` with trait `GraphBase` [INFO] [stdout] | [INFO] [stdout] 397 | impl Omnitigs [INFO] [stdout] | ++++++++++++++++++++++++++++++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0277]: the trait bound `Graph: traitgraph::interface::GraphBase` is not satisfied [INFO] [stdout] --> src/omnitigs/mod.rs:467:36 [INFO] [stdout] | [INFO] [stdout] 467 | if i == retain_indices[self.omnitigs.len()] { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ the trait `traitgraph::interface::GraphBase` is not implemented for `Graph` [INFO] [stdout] | [INFO] [stdout] note: required by a bound in `Omnitig` [INFO] [stdout] --> src/omnitigs/mod.rs:37:27 [INFO] [stdout] | [INFO] [stdout] 37 | pub struct Omnitig { [INFO] [stdout] | ^^^^^^^^^ required by this bound in `Omnitig` [INFO] [stdout] help: consider further restricting type parameter `Graph` with trait `GraphBase` [INFO] [stdout] | [INFO] [stdout] 397 | impl Omnitigs [INFO] [stdout] | ++++++++++++++++++++++++++++++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0308]: mismatched types [INFO] [stdout] --> src/omnitigs/mod.rs:467:21 [INFO] [stdout] | [INFO] [stdout] 467 | if i == retain_indices[self.omnitigs.len()] { [INFO] [stdout] | - ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ expected `usize`, found associated type [INFO] [stdout] | | [INFO] [stdout] | expected because this is `usize` [INFO] [stdout] | [INFO] [stdout] = note: expected type `usize` [INFO] [stdout] found associated type `::EdgeData` [INFO] [stdout] = help: consider constraining the associated type `::EdgeData` to `usize` [INFO] [stdout] = note: for more information, visit https://doc.rust-lang.org/book/ch19-03-advanced-traits.html [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0277]: the trait bound `Graph: traitgraph::interface::GraphBase` is not satisfied [INFO] [stdout] --> src/omnitigs/mod.rs:468:17 [INFO] [stdout] | [INFO] [stdout] 468 | self.omnitigs.push(omnitig); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^ the trait `traitgraph::interface::GraphBase` is not implemented for `Graph` [INFO] [stdout] | [INFO] [stdout] note: required by a bound in `Omnitig` [INFO] [stdout] --> src/omnitigs/mod.rs:37:27 [INFO] [stdout] | [INFO] [stdout] 37 | pub struct Omnitig { [INFO] [stdout] | ^^^^^^^^^ required by this bound in `Omnitig` [INFO] [stdout] help: consider further restricting type parameter `Graph` with trait `GraphBase` [INFO] [stdout] | [INFO] [stdout] 397 | impl Omnitigs [INFO] [stdout] | ++++++++++++++++++++++++++++++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0599]: the method `len` exists for mutable reference `&mut Omnitigs`, but its trait bounds were not satisfied [INFO] [stdout] --> src/omnitigs/mod.rs:472:48 [INFO] [stdout] | [INFO] [stdout] 201 | pub struct Omnitigs { [INFO] [stdout] | ------------------------------------- doesn't satisfy `Omnitigs: ExactSizeIterator` [INFO] [stdout] ... [INFO] [stdout] 472 | let removed_count = initial_len - self.len(); [INFO] [stdout] | ^^^ method cannot be called on `&mut Omnitigs` due to unsatisfied trait bounds [INFO] [stdout] | [INFO] [stdout] note: trait bound `Graph: traitgraph::interface::GraphBase` was not satisfied [INFO] [stdout] --> src/omnitigs/mod.rs:614:13 [INFO] [stdout] | [INFO] [stdout] 614 | impl Omnitigs { [INFO] [stdout] | ^^^^^^^^^ --------------- [INFO] [stdout] | | [INFO] [stdout] | unsatisfied trait bound introduced here [INFO] [stdout] = note: the following trait bounds were not satisfied: [INFO] [stdout] `Omnitigs: ExactSizeIterator` [INFO] [stdout] which is required by `&mut Omnitigs: ExactSizeIterator` [INFO] [stdout] note: the trait `ExactSizeIterator` must be implemented [INFO] [stdout] --> /rustc/8de4c7234dd9b97c9d76b58671343fdbbc9a433e/library/core/src/iter/traits/exact_size.rs:86:1 [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 `len`, perhaps you need to implement one of them: [INFO] [stdout] candidate #1: `BidirectedQueue` [INFO] [stdout] candidate #2: `ExactSizeIterator` [INFO] [stdout] candidate #3: `bigraph::traitgraph::traitsequence::interface::Sequence` [INFO] [stdout] candidate #4: `rand::seq::slice::IndexedRandom` [INFO] [stdout] candidate #5: `traitsequence::interface::Sequence` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0599]: the method `len` exists for mutable reference `&mut Omnitigs`, but its trait bounds were not satisfied [INFO] [stdout] --> src/omnitigs/mod.rs:477:18 [INFO] [stdout] | [INFO] [stdout] 201 | pub struct Omnitigs { [INFO] [stdout] | ------------------------------------- doesn't satisfy `Omnitigs: ExactSizeIterator` [INFO] [stdout] ... [INFO] [stdout] 477 | self.len() [INFO] [stdout] | ^^^ method cannot be called on `&mut Omnitigs` due to unsatisfied trait bounds [INFO] [stdout] | [INFO] [stdout] note: trait bound `Graph: traitgraph::interface::GraphBase` was not satisfied [INFO] [stdout] --> src/omnitigs/mod.rs:614:13 [INFO] [stdout] | [INFO] [stdout] 614 | impl Omnitigs { [INFO] [stdout] | ^^^^^^^^^ --------------- [INFO] [stdout] | | [INFO] [stdout] | unsatisfied trait bound introduced here [INFO] [stdout] = note: the following trait bounds were not satisfied: [INFO] [stdout] `Omnitigs: ExactSizeIterator` [INFO] [stdout] which is required by `&mut Omnitigs: ExactSizeIterator` [INFO] [stdout] note: the trait `ExactSizeIterator` must be implemented [INFO] [stdout] --> /rustc/8de4c7234dd9b97c9d76b58671343fdbbc9a433e/library/core/src/iter/traits/exact_size.rs:86:1 [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 `len`, perhaps you need to implement one of them: [INFO] [stdout] candidate #1: `BidirectedQueue` [INFO] [stdout] candidate #2: `ExactSizeIterator` [INFO] [stdout] candidate #3: `bigraph::traitgraph::traitsequence::interface::Sequence` [INFO] [stdout] candidate #4: `rand::seq::slice::IndexedRandom` [INFO] [stdout] candidate #5: `traitsequence::interface::Sequence` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0277]: the trait bound `Graph: traitgraph::interface::GraphBase` is not satisfied [INFO] [stdout] --> src/omnitigs/mod.rs:485:12 [INFO] [stdout] | [INFO] [stdout] 485 | walks: &mut Vec>, [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^ the trait `traitgraph::interface::GraphBase` is not implemented for `Graph` [INFO] [stdout] | [INFO] [stdout] help: consider further restricting type parameter `Graph` with trait `GraphBase` [INFO] [stdout] | [INFO] [stdout] 484 | pub fn remove_subwalks_and_reverse_complements_from_walks( [INFO] [stdout] | ++++++++++++++++++++++++++++++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0277]: the trait bound `Graph: traitgraph::interface::GraphBase` is not satisfied [INFO] [stdout] --> src/omnitigs/mod.rs:509:19 [INFO] [stdout] | [INFO] [stdout] 509 | match is_subwalk_or_reverse_complement(walk_a, walk_b, graph) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ the trait `traitgraph::interface::GraphBase` is not implemented for `Graph` [INFO] [stdout] | [INFO] [stdout] help: consider further restricting type parameter `Graph` with trait `GraphBase` [INFO] [stdout] | [INFO] [stdout] 484 | pub fn remove_subwalks_and_reverse_complements_from_walks( [INFO] [stdout] | ++++++++++++++++++++++++++++++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0277]: the trait bound `Graph: traitgraph::interface::GraphBase` is not satisfied [INFO] [stdout] --> src/omnitigs/mod.rs:509:52 [INFO] [stdout] | [INFO] [stdout] 509 | match is_subwalk_or_reverse_complement(walk_a, walk_b, graph) { [INFO] [stdout] | ^^^^^^ the trait `traitgraph::interface::GraphBase` is not implemented for `Graph` [INFO] [stdout] | [INFO] [stdout] help: consider further restricting type parameter `Graph` with trait `GraphBase` [INFO] [stdout] | [INFO] [stdout] 484 | pub fn remove_subwalks_and_reverse_complements_from_walks( [INFO] [stdout] | ++++++++++++++++++++++++++++++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0277]: the trait bound `Graph: traitgraph::interface::GraphBase` is not satisfied [INFO] [stdout] --> src/omnitigs/mod.rs:556:13 [INFO] [stdout] | [INFO] [stdout] 556 | walk_a: &VecEdgeWalk, [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ the trait `traitgraph::interface::GraphBase` is not implemented for `Graph` [INFO] [stdout] | [INFO] [stdout] help: consider further restricting type parameter `Graph` with trait `GraphBase` [INFO] [stdout] | [INFO] [stdout] 555 | fn is_subwalk_or_reverse_complement( [INFO] [stdout] | ++++++++++++++++++++++++++++++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0277]: the trait bound `Graph: traitgraph::interface::GraphBase` is not satisfied [INFO] [stdout] --> src/omnitigs/mod.rs:600:26 [INFO] [stdout] | [INFO] [stdout] 600 | return match is_subwalk_or_reverse_complement(walk_b, walk_a, graph) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ the trait `traitgraph::interface::GraphBase` is not implemented for `Graph` [INFO] [stdout] | [INFO] [stdout] help: consider further restricting type parameter `Graph` with trait `GraphBase` [INFO] [stdout] | [INFO] [stdout] 555 | fn is_subwalk_or_reverse_complement( [INFO] [stdout] | ++++++++++++++++++++++++++++++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0277]: the trait bound `Graph: traitgraph::interface::GraphBase` is not satisfied [INFO] [stdout] --> src/omnitigs/mod.rs:600:59 [INFO] [stdout] | [INFO] [stdout] 600 | return match is_subwalk_or_reverse_complement(walk_b, walk_a, graph) { [INFO] [stdout] | ^^^^^^ the trait `traitgraph::interface::GraphBase` is not implemented for `Graph` [INFO] [stdout] | [INFO] [stdout] help: consider further restricting type parameter `Graph` with trait `GraphBase` [INFO] [stdout] | [INFO] [stdout] 555 | fn is_subwalk_or_reverse_complement( [INFO] [stdout] | ++++++++++++++++++++++++++++++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0308]: mismatched types [INFO] [stdout] --> src/omnitigs/mod.rs:796:30 [INFO] [stdout] | [INFO] [stdout] 796 | .mirror_node(*omnitig.last().expect("Omnitig is empty")) [INFO] [stdout] | ----------- ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ expected `bigraph::traitgraph::interface::GraphBase::NodeIndex`, found `traitgraph::interface::GraphBase::NodeIndex` [INFO] [stdout] | | [INFO] [stdout] | arguments to this method are incorrect [INFO] [stdout] | [INFO] [stdout] = note: expected associated type `::NodeIndex` [INFO] [stdout] found associated type `::NodeIndex` [INFO] [stdout] = note: an associated type was expected, but a different one was found [INFO] [stdout] note: method defined here [INFO] [stdout] --> /opt/rustwide/cargo-home/registry/src/index.crates.io-1949cf8c6b5b557f/bigraph-5.0.1/src/interface/static_bigraph.rs:13:8 [INFO] [stdout] | [INFO] [stdout] 13 | fn mirror_node(&self, node_id: Self::NodeIndex) -> Option; [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0599]: no method named `as_usize` found for associated type `::NodeIndex` in the current scope [INFO] [stdout] --> src/omnitigs/mod.rs:802:63 [INFO] [stdout] | [INFO] [stdout] 802 | &first_node_map[reverse_complement_first_node.as_usize()] [INFO] [stdout] | ^^^^^^^^ method not found in `::NodeIndex` [INFO] [stdout] | [INFO] [stdout] note: there are multiple different versions of crate `traitgraph` in the dependency graph [INFO] [stdout] --> /opt/rustwide/cargo-home/registry/src/index.crates.io-1949cf8c6b5b557f/traitgraph-8.1.2/src/index.rs:79:1 [INFO] [stdout] | [INFO] [stdout] 79 | / pub trait GraphIndex>: [INFO] [stdout] 80 | | std::fmt::Debug [INFO] [stdout] 81 | | + Eq [INFO] [stdout] 82 | | + Ord [INFO] [stdout] ... | [INFO] [stdout] 88 | | + std::ops::Add [INFO] [stdout] 89 | | + std::ops::Sub [INFO] [stdout] | |_________________________________________^ this is the trait that is needed [INFO] [stdout] ... [INFO] [stdout] 93 | fn as_usize(self) -> usize; [INFO] [stdout] | --------------------------- the method is available for `::NodeIndex` here [INFO] [stdout] | [INFO] [stdout] ::: src/omnitigs/mod.rs:29:5 [INFO] [stdout] | [INFO] [stdout] 29 | use traitgraph::index::GraphIndex; [INFO] [stdout] | ----------------------------- `GraphIndex` imported here doesn't correspond to the right version of crate `traitgraph` [INFO] [stdout] | [INFO] [stdout] ::: /opt/rustwide/cargo-home/registry/src/index.crates.io-1949cf8c6b5b557f/traitgraph-5.0.0/src/index.rs:76:1 [INFO] [stdout] | [INFO] [stdout] 76 | / pub trait GraphIndex>: [INFO] [stdout] 77 | | std::fmt::Debug [INFO] [stdout] 78 | | + Eq [INFO] [stdout] 79 | | + Ord [INFO] [stdout] ... | [INFO] [stdout] 85 | | + std::ops::Add [INFO] [stdout] 86 | | + std::ops::Sub [INFO] [stdout] | |__________________________________________- this is the trait that was imported [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0282]: type annotations needed for `&_` [INFO] [stdout] --> src/omnitigs/mod.rs:804:21 [INFO] [stdout] | [INFO] [stdout] 804 | let reverse_complement_candidate = &self[reverse_complement_candidate_index]; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 807 | .zip(reverse_complement_candidate.iter().rev()) [INFO] [stdout] | ---- type must be known at this point [INFO] [stdout] | [INFO] [stdout] help: consider giving `reverse_complement_candidate` an explicit type, where the placeholders `_` are specified [INFO] [stdout] | [INFO] [stdout] 804 | let reverse_complement_candidate: &_ = &self[reverse_complement_candidate_index]; [INFO] [stdout] | ++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0308]: mismatched types [INFO] [stdout] --> src/restricted_reachability.rs:27:19 [INFO] [stdout] | [INFO] [stdout] 22 | let mut traversal = PreOrderTraversal::< [INFO] [stdout] | _________________________- [INFO] [stdout] 23 | | _, [INFO] [stdout] 24 | | NeighborStrategy, [INFO] [stdout] 25 | | BfsQueueStrategy, [INFO] [stdout] 26 | | std::collections::VecDeque<_>, [INFO] [stdout] 27 | | >::new(graph, start_node); [INFO] [stdout] | | - ^^^^^^^^^^ expected `bigraph::traitgraph::interface::GraphBase::NodeIndex`, found `traitgraph::interface::GraphBase::NodeIndex` [INFO] [stdout] | |__________| [INFO] [stdout] | arguments to this function are incorrect [INFO] [stdout] | [INFO] [stdout] = note: expected associated type `<::RootGraph as bigraph::traitgraph::interface::GraphBase>::NodeIndex` [INFO] [stdout] found associated type `::NodeIndex` [INFO] [stdout] = note: an associated type was expected, but a different one was found [INFO] [stdout] note: associated function defined here [INFO] [stdout] --> /opt/rustwide/cargo-home/registry/src/index.crates.io-1949cf8c6b5b557f/traitgraph-algo-8.1.2/src/traversal/mod.rs:118:12 [INFO] [stdout] | [INFO] [stdout] 118 | pub fn new(graph: &'a Graph, start: Graph::NodeIndex) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0271]: type mismatch resolving `<<... as SubgraphBase>::RootGraph as GraphBase>::EdgeIndex == <... as GraphBase>::EdgeIndex` [INFO] [stdout] --> src/restricted_reachability.rs:30:75 [INFO] [stdout] | [INFO] [stdout] 30 | while let Some(node_or_edge) = traversal.next_with_forbidden_subgraph(&forbidden_edge) { [INFO] [stdout] | ---------------------------- ^^^^^^^^^^^^^^^ expected `traitgraph::interface::GraphBase::EdgeIndex`, found `bigraph::traitgraph::interface::GraphBase::EdgeIndex` [INFO] [stdout] | | [INFO] [stdout] | required by a bound introduced by this call [INFO] [stdout] | [INFO] [stdout] = note: expected associated type `::EdgeIndex` [INFO] [stdout] found associated type `<::RootGraph as bigraph::traitgraph::interface::GraphBase>::EdgeIndex` [INFO] [stdout] = note: an associated type was expected, but a different one was found [INFO] [stdout] note: required by a bound in `PreOrderTraversal::<'a, Graph, NeighborStrategy, QueueStrategy, Queue>::next_with_forbidden_subgraph` [INFO] [stdout] --> /opt/rustwide/cargo-home/registry/src/index.crates.io-1949cf8c6b5b557f/traitgraph-algo-8.1.2/src/traversal/mod.rs:175:45 [INFO] [stdout] | [INFO] [stdout] 175 | pub fn next_with_forbidden_subgraph>( [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^ required by this bound in `PreOrderTraversal::<'a, Graph, NeighborStrategy, QueueStrategy, Queue>::next_with_forbidden_subgraph` [INFO] [stdout] = note: the full name for the type has been written to '/opt/rustwide/target/x86_64-unknown-linux-musl/debug/deps/omnitigs-8935f53bd9c69327.long-type-18377200037191735150.txt' [INFO] [stdout] = note: consider using `--verbose` to print the full type name to the console [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0308]: mismatched types [INFO] [stdout] --> src/restricted_reachability.rs:32:13 [INFO] [stdout] | [INFO] [stdout] 32 | NodeOrEdge::Node(node) => target_subgraph.enable_node(node), [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ expected `NodeOrEdge<..., ...>`, found `NodeOrEdge<_, _>` [INFO] [stdout] | [INFO] [stdout] note: two different versions of crate `traitgraph` are being used; two types coming from two different versions of the same crate are different types even if they look the same [INFO] [stdout] --> /opt/rustwide/cargo-home/registry/src/index.crates.io-1949cf8c6b5b557f/traitgraph-5.0.0/src/interface/mod.rs:327:1 [INFO] [stdout] | [INFO] [stdout] 327 | pub enum NodeOrEdge { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ this is the found type `traitgraph::interface::NodeOrEdge` [INFO] [stdout] | [INFO] [stdout] ::: /opt/rustwide/cargo-home/registry/src/index.crates.io-1949cf8c6b5b557f/traitgraph-8.1.2/src/interface/mod.rs:327:1 [INFO] [stdout] | [INFO] [stdout] 327 | pub enum NodeOrEdge { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ this is the expected type `bigraph::traitgraph::interface::NodeOrEdge` [INFO] [stdout] | [INFO] [stdout] ::: src/macrotigs/macrotigs/default_macrotig_link_algorithm.rs:6:5 [INFO] [stdout] | [INFO] [stdout] 6 | use traitgraph_algo::traversal::univocal_traversal::is_edge_self_bivalent; [INFO] [stdout] | --------------- one version of crate `traitgraph` used here, as a dependency of crate `traitgraph_algo` [INFO] [stdout] | [INFO] [stdout] ::: src/hydrostructure/incremental_hydrostructure/mod.rs:9:5 [INFO] [stdout] | [INFO] [stdout] 9 | use traitgraph::implementation::subgraphs::incremental_subgraph::IncrementalSubgraph; [INFO] [stdout] | ---------- one version of crate `traitgraph` used here, as a direct dependency of the current crate [INFO] [stdout] = help: you can use `cargo tree` to explore your dependency tree [INFO] [stdout] = note: the full name for the type has been written to '/opt/rustwide/target/x86_64-unknown-linux-musl/debug/deps/omnitigs-8935f53bd9c69327.long-type-13148743845574754167.txt' [INFO] [stdout] = note: consider using `--verbose` to print the full type name to the console [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0308]: mismatched types [INFO] [stdout] --> src/restricted_reachability.rs:33:13 [INFO] [stdout] | [INFO] [stdout] 33 | NodeOrEdge::Edge(edge) => target_subgraph.enable_edge(edge), [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ expected `NodeOrEdge<..., ...>`, found `NodeOrEdge<_, _>` [INFO] [stdout] | [INFO] [stdout] note: two different versions of crate `traitgraph` are being used; two types coming from two different versions of the same crate are different types even if they look the same [INFO] [stdout] --> /opt/rustwide/cargo-home/registry/src/index.crates.io-1949cf8c6b5b557f/traitgraph-5.0.0/src/interface/mod.rs:327:1 [INFO] [stdout] | [INFO] [stdout] 327 | pub enum NodeOrEdge { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ this is the found type `traitgraph::interface::NodeOrEdge` [INFO] [stdout] | [INFO] [stdout] ::: /opt/rustwide/cargo-home/registry/src/index.crates.io-1949cf8c6b5b557f/traitgraph-8.1.2/src/interface/mod.rs:327:1 [INFO] [stdout] | [INFO] [stdout] 327 | pub enum NodeOrEdge { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ this is the expected type `bigraph::traitgraph::interface::NodeOrEdge` [INFO] [stdout] | [INFO] [stdout] ::: src/macrotigs/macrotigs/default_macrotig_link_algorithm.rs:6:5 [INFO] [stdout] | [INFO] [stdout] 6 | use traitgraph_algo::traversal::univocal_traversal::is_edge_self_bivalent; [INFO] [stdout] | --------------- one version of crate `traitgraph` used here, as a dependency of crate `traitgraph_algo` [INFO] [stdout] | [INFO] [stdout] ::: src/hydrostructure/incremental_hydrostructure/mod.rs:9:5 [INFO] [stdout] | [INFO] [stdout] 9 | use traitgraph::implementation::subgraphs::incremental_subgraph::IncrementalSubgraph; [INFO] [stdout] | ---------- one version of crate `traitgraph` used here, as a direct dependency of the current crate [INFO] [stdout] = help: you can use `cargo tree` to explore your dependency tree [INFO] [stdout] = note: the full name for the type has been written to '/opt/rustwide/target/x86_64-unknown-linux-musl/debug/deps/omnitigs-8935f53bd9c69327.long-type-13148743845574754167.txt' [INFO] [stdout] = note: consider using `--verbose` to print the full type name to the console [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0277]: the trait bound `Graph: bigraph::traitgraph::interface::GraphBase` is not satisfied [INFO] [stdout] --> src/restricted_reachability.rs:52:25 [INFO] [stdout] | [INFO] [stdout] 52 | let mut traversal = PreOrderTraversal::< [INFO] [stdout] | _________________________^ [INFO] [stdout] 53 | | _, [INFO] [stdout] 54 | | ForwardNeighborStrategy, [INFO] [stdout] 55 | | BfsQueueStrategy, [INFO] [stdout] 56 | | std::collections::VecDeque<_>, [INFO] [stdout] 57 | | >::new_without_start(graph); [INFO] [stdout] | |_____^ the trait `bigraph::traitgraph::interface::GraphBase` is not implemented for `Graph` [INFO] [stdout] | [INFO] [stdout] note: required by a bound in `PreOrderTraversal` [INFO] [stdout] --> /opt/rustwide/cargo-home/registry/src/index.crates.io-1949cf8c6b5b557f/traitgraph-algo-8.1.2/src/traversal/mod.rs:95:12 [INFO] [stdout] | [INFO] [stdout] 93 | pub struct PreOrderTraversal< [INFO] [stdout] | ----------------- required by a bound in this struct [INFO] [stdout] 94 | 'a, [INFO] [stdout] 95 | Graph: GraphBase, [INFO] [stdout] | ^^^^^^^^^ required by this bound in `PreOrderTraversal` [INFO] [stdout] help: consider further restricting type parameter `Graph` with trait `GraphBase` [INFO] [stdout] | [INFO] [stdout] 41 | Graph: StaticGraph + SubgraphBase + bigraph::traitgraph::interface::GraphBase, [INFO] [stdout] | +++++++++++++++++++++++++++++++++++++++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0277]: the trait bound `Graph: bigraph::traitgraph::interface::NavigableGraph` is not satisfied [INFO] [stdout] --> src/restricted_reachability.rs:57:26 [INFO] [stdout] | [INFO] [stdout] 52 | let mut traversal = PreOrderTraversal::< [INFO] [stdout] | _________________________- [INFO] [stdout] 53 | | _, [INFO] [stdout] 54 | | ForwardNeighborStrategy, [INFO] [stdout] 55 | | BfsQueueStrategy, [INFO] [stdout] 56 | | std::collections::VecDeque<_>, [INFO] [stdout] 57 | | >::new_without_start(graph); [INFO] [stdout] | | - ^^^^^ the trait `bigraph::traitgraph::interface::NavigableGraph` is not implemented for `Graph` [INFO] [stdout] | |________________________| [INFO] [stdout] | required by a bound introduced by this call [INFO] [stdout] | [INFO] [stdout] = note: required for `Graph` to implement `bigraph::traitgraph::interface::StaticGraph` [INFO] [stdout] note: required by a bound in `PreOrderTraversal::<'a, Graph, NeighborStrategy, QueueStrategy, Queue>::new_without_start` [INFO] [stdout] --> /opt/rustwide/cargo-home/registry/src/index.crates.io-1949cf8c6b5b557f/traitgraph-algo-8.1.2/src/traversal/mod.rs:111:16 [INFO] [stdout] | [INFO] [stdout] 111 | Graph: StaticGraph, [INFO] [stdout] | ^^^^^^^^^^^ required by this bound in `PreOrderTraversal::<'a, Graph, NeighborStrategy, QueueStrategy, Queue>::new_without_start` [INFO] [stdout] ... [INFO] [stdout] 136 | pub fn new_without_start(graph: &'a Graph) -> Self { [INFO] [stdout] | ----------------- required by a bound in this associated function [INFO] [stdout] help: consider further restricting type parameter `Graph` with trait `NavigableGraph` [INFO] [stdout] | [INFO] [stdout] 41 | Graph: StaticGraph + SubgraphBase + bigraph::traitgraph::interface::NavigableGraph, [INFO] [stdout] | ++++++++++++++++++++++++++++++++++++++++++++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0277]: the trait bound `Graph: bigraph::traitgraph::interface::GraphBase` is not satisfied [INFO] [stdout] --> src/restricted_reachability.rs:52:25 [INFO] [stdout] | [INFO] [stdout] 52 | let mut traversal = PreOrderTraversal::< [INFO] [stdout] | _________________________^ [INFO] [stdout] 53 | | _, [INFO] [stdout] 54 | | ForwardNeighborStrategy, [INFO] [stdout] 55 | | BfsQueueStrategy, [INFO] [stdout] 56 | | std::collections::VecDeque<_>, [INFO] [stdout] 57 | | >::new_without_start(graph); [INFO] [stdout] | |_______________________________^ the trait `bigraph::traitgraph::interface::GraphBase` is not implemented for `Graph` [INFO] [stdout] | [INFO] [stdout] = note: required for `BfsQueueStrategy` to implement `TraversalQueueStrategy>` [INFO] [stdout] note: required by a bound in `PreOrderTraversal::<'a, Graph, NeighborStrategy, QueueStrategy, Queue>::new_without_start` [INFO] [stdout] --> /opt/rustwide/cargo-home/registry/src/index.crates.io-1949cf8c6b5b557f/traitgraph-algo-8.1.2/src/traversal/mod.rs:113:24 [INFO] [stdout] | [INFO] [stdout] 113 | QueueStrategy: TraversalQueueStrategy, [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ required by this bound in `PreOrderTraversal::<'a, Graph, NeighborStrategy, QueueStrategy, Queue>::new_without_start` [INFO] [stdout] ... [INFO] [stdout] 136 | pub fn new_without_start(graph: &'a Graph) -> Self { [INFO] [stdout] | ----------------- required by a bound in this associated function [INFO] [stdout] help: consider further restricting type parameter `Graph` with trait `GraphBase` [INFO] [stdout] | [INFO] [stdout] 41 | Graph: StaticGraph + SubgraphBase + bigraph::traitgraph::interface::GraphBase, [INFO] [stdout] | +++++++++++++++++++++++++++++++++++++++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0277]: the trait bound `Graph: bigraph::traitgraph::interface::NavigableGraph` is not satisfied [INFO] [stdout] --> src/restricted_reachability.rs:52:25 [INFO] [stdout] | [INFO] [stdout] 52 | let mut traversal = PreOrderTraversal::< [INFO] [stdout] | _________________________^ [INFO] [stdout] 53 | | _, [INFO] [stdout] 54 | | ForwardNeighborStrategy, [INFO] [stdout] 55 | | BfsQueueStrategy, [INFO] [stdout] 56 | | std::collections::VecDeque<_>, [INFO] [stdout] 57 | | >::new_without_start(graph); [INFO] [stdout] | |_______________________________^ the trait `bigraph::traitgraph::interface::NavigableGraph` is not implemented for `Graph` [INFO] [stdout] | [INFO] [stdout] = note: required for `ForwardNeighborStrategy` to implement `TraversalNeighborStrategy` [INFO] [stdout] note: required by a bound in `PreOrderTraversal` [INFO] [stdout] --> /opt/rustwide/cargo-home/registry/src/index.crates.io-1949cf8c6b5b557f/traitgraph-algo-8.1.2/src/traversal/mod.rs:96:28 [INFO] [stdout] | [INFO] [stdout] 93 | pub struct PreOrderTraversal< [INFO] [stdout] | ----------------- required by a bound in this struct [INFO] [stdout] ... [INFO] [stdout] 96 | NeighborStrategy: 'a + TraversalNeighborStrategy, [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ required by this bound in `PreOrderTraversal` [INFO] [stdout] help: consider further restricting type parameter `Graph` with trait `NavigableGraph` [INFO] [stdout] | [INFO] [stdout] 41 | Graph: StaticGraph + SubgraphBase + bigraph::traitgraph::interface::NavigableGraph, [INFO] [stdout] | ++++++++++++++++++++++++++++++++++++++++++++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0599]: the method `continue_traversal_from` exists for struct `PreOrderTraversal<'_, Graph, ForwardNeighborStrategy, BfsQueueStrategy, VecDeque<_>>`, but its trait bounds were not satisfied [INFO] [stdout] --> src/restricted_reachability.rs:66:19 [INFO] [stdout] | [INFO] [stdout] 66 | traversal.continue_traversal_from(start_node); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^ method cannot be called due to unsatisfied trait bounds [INFO] [stdout] | [INFO] [stdout] = note: the following trait bounds were not satisfied: [INFO] [stdout] `Graph: bigraph::traitgraph::interface::GraphBase` [INFO] [stdout] `Graph: bigraph::traitgraph::interface::ImmutableGraphContainer` [INFO] [stdout] which is required by `Graph: bigraph::traitgraph::interface::StaticGraph` [INFO] [stdout] `Graph: bigraph::traitgraph::interface::NavigableGraph` [INFO] [stdout] which is required by `Graph: bigraph::traitgraph::interface::StaticGraph` [INFO] [stdout] help: consider restricting the type parameters to satisfy the trait bounds [INFO] [stdout] | [INFO] [stdout] 45 | ) -> IncrementalSubgraph<'a, Graph> where Graph: bigraph::traitgraph::interface::GraphBase, Graph: bigraph::traitgraph::interface::ImmutableGraphContainer, Graph: bigraph::traitgraph::interface::NavigableGraph { [INFO] [stdout] | +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0599]: the method `next_with_forbidden_subgraph` exists for struct `PreOrderTraversal<'_, Graph, ForwardNeighborStrategy, BfsQueueStrategy, VecDeque<_>>`, but its trait bounds were not satisfied [INFO] [stdout] --> src/restricted_reachability.rs:69:50 [INFO] [stdout] | [INFO] [stdout] 69 | while let Some(node_or_edge) = traversal.next_with_forbidden_subgraph(&forbidden_edge) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^ method cannot be called due to unsatisfied trait bounds [INFO] [stdout] | [INFO] [stdout] = note: the following trait bounds were not satisfied: [INFO] [stdout] `Graph: bigraph::traitgraph::interface::GraphBase` [INFO] [stdout] `Graph: bigraph::traitgraph::interface::ImmutableGraphContainer` [INFO] [stdout] which is required by `Graph: bigraph::traitgraph::interface::StaticGraph` [INFO] [stdout] `Graph: bigraph::traitgraph::interface::NavigableGraph` [INFO] [stdout] which is required by `Graph: bigraph::traitgraph::interface::StaticGraph` [INFO] [stdout] help: consider restricting the type parameters to satisfy the trait bounds [INFO] [stdout] | [INFO] [stdout] 45 | ) -> IncrementalSubgraph<'a, Graph> where Graph: bigraph::traitgraph::interface::GraphBase, Graph: bigraph::traitgraph::interface::ImmutableGraphContainer, Graph: bigraph::traitgraph::interface::NavigableGraph { [INFO] [stdout] | +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0277]: the trait bound `Graph: bigraph::traitgraph::interface::GraphBase` is not satisfied [INFO] [stdout] --> src/restricted_reachability.rs:103:25 [INFO] [stdout] | [INFO] [stdout] 103 | let mut traversal = PreOrderTraversal::< [INFO] [stdout] | _________________________^ [INFO] [stdout] 104 | | _, [INFO] [stdout] 105 | | BackwardNeighborStrategy, [INFO] [stdout] 106 | | BfsQueueStrategy, [INFO] [stdout] 107 | | std::collections::VecDeque<_>, [INFO] [stdout] 108 | | >::new_without_start(graph); [INFO] [stdout] | |_____^ the trait `bigraph::traitgraph::interface::GraphBase` is not implemented for `Graph` [INFO] [stdout] | [INFO] [stdout] note: required by a bound in `PreOrderTraversal` [INFO] [stdout] --> /opt/rustwide/cargo-home/registry/src/index.crates.io-1949cf8c6b5b557f/traitgraph-algo-8.1.2/src/traversal/mod.rs:95:12 [INFO] [stdout] | [INFO] [stdout] 93 | pub struct PreOrderTraversal< [INFO] [stdout] | ----------------- required by a bound in this struct [INFO] [stdout] 94 | 'a, [INFO] [stdout] 95 | Graph: GraphBase, [INFO] [stdout] | ^^^^^^^^^ required by this bound in `PreOrderTraversal` [INFO] [stdout] help: consider further restricting type parameter `Graph` with trait `GraphBase` [INFO] [stdout] | [INFO] [stdout] 97 | Graph: StaticGraph + SubgraphBase + bigraph::traitgraph::interface::GraphBase, [INFO] [stdout] | +++++++++++++++++++++++++++++++++++++++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0277]: the trait bound `Graph: bigraph::traitgraph::interface::NavigableGraph` is not satisfied [INFO] [stdout] --> src/restricted_reachability.rs:108:26 [INFO] [stdout] | [INFO] [stdout] 103 | let mut traversal = PreOrderTraversal::< [INFO] [stdout] | _________________________- [INFO] [stdout] 104 | | _, [INFO] [stdout] 105 | | BackwardNeighborStrategy, [INFO] [stdout] 106 | | BfsQueueStrategy, [INFO] [stdout] 107 | | std::collections::VecDeque<_>, [INFO] [stdout] 108 | | >::new_without_start(graph); [INFO] [stdout] | | - ^^^^^ the trait `bigraph::traitgraph::interface::NavigableGraph` is not implemented for `Graph` [INFO] [stdout] | |________________________| [INFO] [stdout] | required by a bound introduced by this call [INFO] [stdout] | [INFO] [stdout] = note: required for `Graph` to implement `bigraph::traitgraph::interface::StaticGraph` [INFO] [stdout] note: required by a bound in `PreOrderTraversal::<'a, Graph, NeighborStrategy, QueueStrategy, Queue>::new_without_start` [INFO] [stdout] --> /opt/rustwide/cargo-home/registry/src/index.crates.io-1949cf8c6b5b557f/traitgraph-algo-8.1.2/src/traversal/mod.rs:111:16 [INFO] [stdout] | [INFO] [stdout] 111 | Graph: StaticGraph, [INFO] [stdout] | ^^^^^^^^^^^ required by this bound in `PreOrderTraversal::<'a, Graph, NeighborStrategy, QueueStrategy, Queue>::new_without_start` [INFO] [stdout] ... [INFO] [stdout] 136 | pub fn new_without_start(graph: &'a Graph) -> Self { [INFO] [stdout] | ----------------- required by a bound in this associated function [INFO] [stdout] help: consider further restricting type parameter `Graph` with trait `NavigableGraph` [INFO] [stdout] | [INFO] [stdout] 97 | Graph: StaticGraph + SubgraphBase + bigraph::traitgraph::interface::NavigableGraph, [INFO] [stdout] | ++++++++++++++++++++++++++++++++++++++++++++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0277]: the trait bound `Graph: bigraph::traitgraph::interface::GraphBase` is not satisfied [INFO] [stdout] --> src/restricted_reachability.rs:103:25 [INFO] [stdout] | [INFO] [stdout] 103 | let mut traversal = PreOrderTraversal::< [INFO] [stdout] | _________________________^ [INFO] [stdout] 104 | | _, [INFO] [stdout] 105 | | BackwardNeighborStrategy, [INFO] [stdout] 106 | | BfsQueueStrategy, [INFO] [stdout] 107 | | std::collections::VecDeque<_>, [INFO] [stdout] 108 | | >::new_without_start(graph); [INFO] [stdout] | |_______________________________^ the trait `bigraph::traitgraph::interface::GraphBase` is not implemented for `Graph` [INFO] [stdout] | [INFO] [stdout] = note: required for `BfsQueueStrategy` to implement `TraversalQueueStrategy>` [INFO] [stdout] note: required by a bound in `PreOrderTraversal::<'a, Graph, NeighborStrategy, QueueStrategy, Queue>::new_without_start` [INFO] [stdout] --> /opt/rustwide/cargo-home/registry/src/index.crates.io-1949cf8c6b5b557f/traitgraph-algo-8.1.2/src/traversal/mod.rs:113:24 [INFO] [stdout] | [INFO] [stdout] 113 | QueueStrategy: TraversalQueueStrategy, [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ required by this bound in `PreOrderTraversal::<'a, Graph, NeighborStrategy, QueueStrategy, Queue>::new_without_start` [INFO] [stdout] ... [INFO] [stdout] 136 | pub fn new_without_start(graph: &'a Graph) -> Self { [INFO] [stdout] | ----------------- required by a bound in this associated function [INFO] [stdout] help: consider further restricting type parameter `Graph` with trait `GraphBase` [INFO] [stdout] | [INFO] [stdout] 97 | Graph: StaticGraph + SubgraphBase + bigraph::traitgraph::interface::GraphBase, [INFO] [stdout] | +++++++++++++++++++++++++++++++++++++++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0277]: the trait bound `Graph: bigraph::traitgraph::interface::NavigableGraph` is not satisfied [INFO] [stdout] --> src/restricted_reachability.rs:103:25 [INFO] [stdout] | [INFO] [stdout] 103 | let mut traversal = PreOrderTraversal::< [INFO] [stdout] | _________________________^ [INFO] [stdout] 104 | | _, [INFO] [stdout] 105 | | BackwardNeighborStrategy, [INFO] [stdout] 106 | | BfsQueueStrategy, [INFO] [stdout] 107 | | std::collections::VecDeque<_>, [INFO] [stdout] 108 | | >::new_without_start(graph); [INFO] [stdout] | |_______________________________^ the trait `bigraph::traitgraph::interface::NavigableGraph` is not implemented for `Graph` [INFO] [stdout] | [INFO] [stdout] = note: required for `BackwardNeighborStrategy` to implement `TraversalNeighborStrategy` [INFO] [stdout] note: required by a bound in `PreOrderTraversal` [INFO] [stdout] --> /opt/rustwide/cargo-home/registry/src/index.crates.io-1949cf8c6b5b557f/traitgraph-algo-8.1.2/src/traversal/mod.rs:96:28 [INFO] [stdout] | [INFO] [stdout] 93 | pub struct PreOrderTraversal< [INFO] [stdout] | ----------------- required by a bound in this struct [INFO] [stdout] ... [INFO] [stdout] 96 | NeighborStrategy: 'a + TraversalNeighborStrategy, [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ required by this bound in `PreOrderTraversal` [INFO] [stdout] help: consider further restricting type parameter `Graph` with trait `NavigableGraph` [INFO] [stdout] | [INFO] [stdout] 97 | Graph: StaticGraph + SubgraphBase + bigraph::traitgraph::interface::NavigableGraph, [INFO] [stdout] | ++++++++++++++++++++++++++++++++++++++++++++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0599]: the method `continue_traversal_from` exists for struct `PreOrderTraversal<'_, Graph, BackwardNeighborStrategy, BfsQueueStrategy, VecDeque<_>>`, but its trait bounds were not satisfied [INFO] [stdout] --> src/restricted_reachability.rs:117:19 [INFO] [stdout] | [INFO] [stdout] 117 | traversal.continue_traversal_from(start_node); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^ method cannot be called due to unsatisfied trait bounds [INFO] [stdout] | [INFO] [stdout] = note: the following trait bounds were not satisfied: [INFO] [stdout] `Graph: bigraph::traitgraph::interface::GraphBase` [INFO] [stdout] `Graph: bigraph::traitgraph::interface::ImmutableGraphContainer` [INFO] [stdout] which is required by `Graph: bigraph::traitgraph::interface::StaticGraph` [INFO] [stdout] `Graph: bigraph::traitgraph::interface::NavigableGraph` [INFO] [stdout] which is required by `Graph: bigraph::traitgraph::interface::StaticGraph` [INFO] [stdout] help: consider restricting the type parameters to satisfy the trait bounds [INFO] [stdout] | [INFO] [stdout] 101 | ) -> IncrementalSubgraph<'a, Graph> where Graph: bigraph::traitgraph::interface::GraphBase, Graph: bigraph::traitgraph::interface::ImmutableGraphContainer, Graph: bigraph::traitgraph::interface::NavigableGraph { [INFO] [stdout] | +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0599]: the method `next_with_forbidden_subgraph` exists for struct `PreOrderTraversal<'_, Graph, BackwardNeighborStrategy, BfsQueueStrategy, VecDeque<_>>`, but its trait bounds were not satisfied [INFO] [stdout] --> src/restricted_reachability.rs:120:50 [INFO] [stdout] | [INFO] [stdout] 120 | while let Some(node_or_edge) = traversal.next_with_forbidden_subgraph(&forbidden_edge) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^ method cannot be called due to unsatisfied trait bounds [INFO] [stdout] | [INFO] [stdout] = note: the following trait bounds were not satisfied: [INFO] [stdout] `Graph: bigraph::traitgraph::interface::GraphBase` [INFO] [stdout] `Graph: bigraph::traitgraph::interface::ImmutableGraphContainer` [INFO] [stdout] which is required by `Graph: bigraph::traitgraph::interface::StaticGraph` [INFO] [stdout] `Graph: bigraph::traitgraph::interface::NavigableGraph` [INFO] [stdout] which is required by `Graph: bigraph::traitgraph::interface::StaticGraph` [INFO] [stdout] help: consider restricting the type parameters to satisfy the trait bounds [INFO] [stdout] | [INFO] [stdout] 101 | ) -> IncrementalSubgraph<'a, Graph> where Graph: bigraph::traitgraph::interface::GraphBase, Graph: bigraph::traitgraph::interface::ImmutableGraphContainer, Graph: bigraph::traitgraph::interface::NavigableGraph { [INFO] [stdout] | +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0308]: mismatched types [INFO] [stdout] --> src/restricted_reachability.rs:156:19 [INFO] [stdout] | [INFO] [stdout] 151 | let mut traversal = PreOrderTraversal::< [INFO] [stdout] | _________________________- [INFO] [stdout] 152 | | _, [INFO] [stdout] 153 | | NeighborStrategy, [INFO] [stdout] 154 | | BfsQueueStrategy, [INFO] [stdout] 155 | | std::collections::VecDeque<_>, [INFO] [stdout] 156 | | >::new(graph, start_node); [INFO] [stdout] | | - ^^^^^^^^^^ expected `bigraph::traitgraph::interface::GraphBase::NodeIndex`, found `traitgraph::interface::GraphBase::NodeIndex` [INFO] [stdout] | |__________| [INFO] [stdout] | arguments to this function are incorrect [INFO] [stdout] | [INFO] [stdout] = note: expected associated type `<::RootGraph as bigraph::traitgraph::interface::GraphBase>::NodeIndex` [INFO] [stdout] found associated type `::NodeIndex` [INFO] [stdout] = note: an associated type was expected, but a different one was found [INFO] [stdout] note: associated function defined here [INFO] [stdout] --> /opt/rustwide/cargo-home/registry/src/index.crates.io-1949cf8c6b5b557f/traitgraph-algo-8.1.2/src/traversal/mod.rs:118:12 [INFO] [stdout] | [INFO] [stdout] 118 | pub fn new(graph: &'a Graph, start: Graph::NodeIndex) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0271]: type mismatch resolving `<<... as SubgraphBase>::RootGraph as GraphBase>::NodeIndex == <... as GraphBase>::NodeIndex` [INFO] [stdout] --> src/restricted_reachability.rs:159:75 [INFO] [stdout] | [INFO] [stdout] 159 | while let Some(node_or_edge) = traversal.next_with_forbidden_subgraph(&forbidden_node) { [INFO] [stdout] | ---------------------------- ^^^^^^^^^^^^^^^ expected `traitgraph::interface::GraphBase::NodeIndex`, found `bigraph::traitgraph::interface::GraphBase::NodeIndex` [INFO] [stdout] | | [INFO] [stdout] | required by a bound introduced by this call [INFO] [stdout] | [INFO] [stdout] = note: expected associated type `::NodeIndex` [INFO] [stdout] found associated type `<::RootGraph as bigraph::traitgraph::interface::GraphBase>::NodeIndex` [INFO] [stdout] = note: an associated type was expected, but a different one was found [INFO] [stdout] note: required by a bound in `PreOrderTraversal::<'a, Graph, NeighborStrategy, QueueStrategy, Queue>::next_with_forbidden_subgraph` [INFO] [stdout] --> /opt/rustwide/cargo-home/registry/src/index.crates.io-1949cf8c6b5b557f/traitgraph-algo-8.1.2/src/traversal/mod.rs:175:45 [INFO] [stdout] | [INFO] [stdout] 175 | pub fn next_with_forbidden_subgraph>( [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^ required by this bound in `PreOrderTraversal::<'a, Graph, NeighborStrategy, QueueStrategy, Queue>::next_with_forbidden_subgraph` [INFO] [stdout] = note: the full name for the type has been written to '/opt/rustwide/target/x86_64-unknown-linux-musl/debug/deps/omnitigs-8935f53bd9c69327.long-type-12880374494071213347.txt' [INFO] [stdout] = note: consider using `--verbose` to print the full type name to the console [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0308]: mismatched types [INFO] [stdout] --> src/restricted_reachability.rs:161:13 [INFO] [stdout] | [INFO] [stdout] 161 | NodeOrEdge::Node(node) => target_subgraph.enable_node(node), [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ expected `NodeOrEdge<..., ...>`, found `NodeOrEdge<_, _>` [INFO] [stdout] | [INFO] [stdout] note: two different versions of crate `traitgraph` are being used; two types coming from two different versions of the same crate are different types even if they look the same [INFO] [stdout] --> /opt/rustwide/cargo-home/registry/src/index.crates.io-1949cf8c6b5b557f/traitgraph-5.0.0/src/interface/mod.rs:327:1 [INFO] [stdout] | [INFO] [stdout] 327 | pub enum NodeOrEdge { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ this is the found type `traitgraph::interface::NodeOrEdge` [INFO] [stdout] | [INFO] [stdout] ::: /opt/rustwide/cargo-home/registry/src/index.crates.io-1949cf8c6b5b557f/traitgraph-8.1.2/src/interface/mod.rs:327:1 [INFO] [stdout] | [INFO] [stdout] 327 | pub enum NodeOrEdge { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ this is the expected type `bigraph::traitgraph::interface::NodeOrEdge` [INFO] [stdout] | [INFO] [stdout] ::: src/macrotigs/macrotigs/default_macrotig_link_algorithm.rs:6:5 [INFO] [stdout] | [INFO] [stdout] 6 | use traitgraph_algo::traversal::univocal_traversal::is_edge_self_bivalent; [INFO] [stdout] | --------------- one version of crate `traitgraph` used here, as a dependency of crate `traitgraph_algo` [INFO] [stdout] | [INFO] [stdout] ::: src/hydrostructure/incremental_hydrostructure/mod.rs:9:5 [INFO] [stdout] | [INFO] [stdout] 9 | use traitgraph::implementation::subgraphs::incremental_subgraph::IncrementalSubgraph; [INFO] [stdout] | ---------- one version of crate `traitgraph` used here, as a direct dependency of the current crate [INFO] [stdout] = help: you can use `cargo tree` to explore your dependency tree [INFO] [stdout] = note: the full name for the type has been written to '/opt/rustwide/target/x86_64-unknown-linux-musl/debug/deps/omnitigs-8935f53bd9c69327.long-type-13148743845574754167.txt' [INFO] [stdout] = note: consider using `--verbose` to print the full type name to the console [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0308]: mismatched types [INFO] [stdout] --> src/restricted_reachability.rs:162:13 [INFO] [stdout] | [INFO] [stdout] 162 | NodeOrEdge::Edge(edge) => target_subgraph.enable_edge(edge), [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ expected `NodeOrEdge<..., ...>`, found `NodeOrEdge<_, _>` [INFO] [stdout] | [INFO] [stdout] note: two different versions of crate `traitgraph` are being used; two types coming from two different versions of the same crate are different types even if they look the same [INFO] [stdout] --> /opt/rustwide/cargo-home/registry/src/index.crates.io-1949cf8c6b5b557f/traitgraph-5.0.0/src/interface/mod.rs:327:1 [INFO] [stdout] | [INFO] [stdout] 327 | pub enum NodeOrEdge { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ this is the found type `traitgraph::interface::NodeOrEdge` [INFO] [stdout] | [INFO] [stdout] ::: /opt/rustwide/cargo-home/registry/src/index.crates.io-1949cf8c6b5b557f/traitgraph-8.1.2/src/interface/mod.rs:327:1 [INFO] [stdout] | [INFO] [stdout] 327 | pub enum NodeOrEdge { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ this is the expected type `bigraph::traitgraph::interface::NodeOrEdge` [INFO] [stdout] | [INFO] [stdout] ::: src/macrotigs/macrotigs/default_macrotig_link_algorithm.rs:6:5 [INFO] [stdout] | [INFO] [stdout] 6 | use traitgraph_algo::traversal::univocal_traversal::is_edge_self_bivalent; [INFO] [stdout] | --------------- one version of crate `traitgraph` used here, as a dependency of crate `traitgraph_algo` [INFO] [stdout] | [INFO] [stdout] ::: src/hydrostructure/incremental_hydrostructure/mod.rs:9:5 [INFO] [stdout] | [INFO] [stdout] 9 | use traitgraph::implementation::subgraphs::incremental_subgraph::IncrementalSubgraph; [INFO] [stdout] | ---------- one version of crate `traitgraph` used here, as a direct dependency of the current crate [INFO] [stdout] = help: you can use `cargo tree` to explore your dependency tree [INFO] [stdout] = note: the full name for the type has been written to '/opt/rustwide/target/x86_64-unknown-linux-musl/debug/deps/omnitigs-8935f53bd9c69327.long-type-13148743845574754167.txt' [INFO] [stdout] = note: consider using `--verbose` to print the full type name to the console [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0308]: mismatched types [INFO] [stdout] --> src/restricted_reachability.rs:281:44 [INFO] [stdout] | [INFO] [stdout] 281 | for incoming in graph.in_neighbors(node) { [INFO] [stdout] | ------------ ^^^^ expected `bigraph::traitgraph::interface::GraphBase::NodeIndex`, found `traitgraph::interface::GraphBase::NodeIndex` [INFO] [stdout] | | [INFO] [stdout] | arguments to this method are incorrect [INFO] [stdout] | [INFO] [stdout] = note: expected associated type `<::RootGraph as bigraph::traitgraph::interface::GraphBase>::NodeIndex` [INFO] [stdout] found associated type `::NodeIndex` [INFO] [stdout] = note: an associated type was expected, but a different one was found [INFO] [stdout] note: method defined here [INFO] [stdout] --> /opt/rustwide/cargo-home/registry/src/index.crates.io-1949cf8c6b5b557f/traitgraph-8.1.2/src/interface/mod.rs:190:8 [INFO] [stdout] | [INFO] [stdout] 190 | fn in_neighbors(&self, node_id: Self::NodeIndex) -> Self::InNeighbors<'_>; [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0308]: mismatched types [INFO] [stdout] --> src/restricted_reachability.rs:283:28 [INFO] [stdout] | [INFO] [stdout] 283 | if incoming != edge && target_subgraph.contains_edge_index(incoming) { [INFO] [stdout] | ^^^^ expected `bigraph::traitgraph::interface::GraphBase::EdgeIndex`, found `traitgraph::interface::GraphBase::EdgeIndex` [INFO] [stdout] | [INFO] [stdout] = note: expected associated type `<::RootGraph as bigraph::traitgraph::interface::GraphBase>::EdgeIndex` [INFO] [stdout] found associated type `::EdgeIndex` [INFO] [stdout] = note: an associated type was expected, but a different one was found [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0308]: mismatched types [INFO] [stdout] --> src/restricted_reachability.rs:283:72 [INFO] [stdout] | [INFO] [stdout] 283 | if incoming != edge && target_subgraph.contains_edge_index(incoming) { [INFO] [stdout] | ------------------- ^^^^^^^^ expected `traitgraph::interface::GraphBase::EdgeIndex`, found `bigraph::traitgraph::interface::GraphBase::EdgeIndex` [INFO] [stdout] | | [INFO] [stdout] | arguments to this method are incorrect [INFO] [stdout] | [INFO] [stdout] = note: expected associated type `::EdgeIndex` [INFO] [stdout] found associated type `<::RootGraph as bigraph::traitgraph::interface::GraphBase>::EdgeIndex` [INFO] [stdout] = note: an associated type was expected, but a different one was found [INFO] [stdout] note: method defined here [INFO] [stdout] --> /opt/rustwide/cargo-home/registry/src/index.crates.io-1949cf8c6b5b557f/traitgraph-5.0.0/src/interface/mod.rs:85:8 [INFO] [stdout] | [INFO] [stdout] 85 | fn contains_edge_index(&self, edge_id: Self::EdgeIndex) -> bool; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0308]: mismatched types [INFO] [stdout] --> src/restricted_reachability.rs:321:45 [INFO] [stdout] | [INFO] [stdout] 321 | for outgoing in graph.out_neighbors(node) { [INFO] [stdout] | ------------- ^^^^ expected `bigraph::traitgraph::interface::GraphBase::NodeIndex`, found `traitgraph::interface::GraphBase::NodeIndex` [INFO] [stdout] | | [INFO] [stdout] | arguments to this method are incorrect [INFO] [stdout] | [INFO] [stdout] = note: expected associated type `<::RootGraph as bigraph::traitgraph::interface::GraphBase>::NodeIndex` [INFO] [stdout] found associated type `::NodeIndex` [INFO] [stdout] = note: an associated type was expected, but a different one was found [INFO] [stdout] note: method defined here [INFO] [stdout] --> /opt/rustwide/cargo-home/registry/src/index.crates.io-1949cf8c6b5b557f/traitgraph-8.1.2/src/interface/mod.rs:188:8 [INFO] [stdout] | [INFO] [stdout] 188 | fn out_neighbors(&self, node_id: Self::NodeIndex) -> Self::OutNeighbors<'_>; [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0308]: mismatched types [INFO] [stdout] --> src/restricted_reachability.rs:323:28 [INFO] [stdout] | [INFO] [stdout] 323 | if outgoing != edge && target_subgraph.contains_edge_index(outgoing) { [INFO] [stdout] | ^^^^ expected `bigraph::traitgraph::interface::GraphBase::EdgeIndex`, found `traitgraph::interface::GraphBase::EdgeIndex` [INFO] [stdout] | [INFO] [stdout] = note: expected associated type `<::RootGraph as bigraph::traitgraph::interface::GraphBase>::EdgeIndex` [INFO] [stdout] found associated type `::EdgeIndex` [INFO] [stdout] = note: an associated type was expected, but a different one was found [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0308]: mismatched types [INFO] [stdout] --> src/restricted_reachability.rs:323:72 [INFO] [stdout] | [INFO] [stdout] 323 | if outgoing != edge && target_subgraph.contains_edge_index(outgoing) { [INFO] [stdout] | ------------------- ^^^^^^^^ expected `traitgraph::interface::GraphBase::EdgeIndex`, found `bigraph::traitgraph::interface::GraphBase::EdgeIndex` [INFO] [stdout] | | [INFO] [stdout] | arguments to this method are incorrect [INFO] [stdout] | [INFO] [stdout] = note: expected associated type `::EdgeIndex` [INFO] [stdout] found associated type `<::RootGraph as bigraph::traitgraph::interface::GraphBase>::EdgeIndex` [INFO] [stdout] = note: an associated type was expected, but a different one was found [INFO] [stdout] note: method defined here [INFO] [stdout] --> /opt/rustwide/cargo-home/registry/src/index.crates.io-1949cf8c6b5b557f/traitgraph-5.0.0/src/interface/mod.rs:85:8 [INFO] [stdout] | [INFO] [stdout] 85 | fn contains_edge_index(&self, edge_id: Self::EdgeIndex) -> bool; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0599]: the method `iter` exists for mutable reference `&mut EdgeUnitigs`, but its trait bounds were not satisfied [INFO] [stdout] --> src/unitigs/mod.rs:265:33 [INFO] [stdout] | [INFO] [stdout] 205 | pub struct EdgeUnitigs { [INFO] [stdout] | ---------------------------------------- doesn't satisfy `_: Sequence, [EdgeUnitig]>` [INFO] [stdout] ... [INFO] [stdout] 265 | for (i, unitig) in self.iter().enumerate() { [INFO] [stdout] | ^^^^ method cannot be called on `&mut EdgeUnitigs` due to unsatisfied trait bounds [INFO] [stdout] | [INFO] [stdout] note: trait bound `Graph: traitgraph::interface::GraphBase` was not satisfied [INFO] [stdout] --> src/unitigs/mod.rs:379:13 [INFO] [stdout] | [INFO] [stdout] 379 | impl Sequence, [EdgeUnitig]> for EdgeUnitigs { [INFO] [stdout] | ^^^^^^^^^ ------------------------------------------------ ------------------ [INFO] [stdout] | | [INFO] [stdout] | unsatisfied trait bound introduced here [INFO] [stdout] help: consider restricting the type parameter to satisfy the trait bound [INFO] [stdout] | [INFO] [stdout] 205 | pub struct EdgeUnitigs where Graph: traitgraph::interface::GraphBase { [INFO] [stdout] | +++++++++++++++++++++++++++++++++++++++++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0599]: the method `len` exists for mutable reference `&mut EdgeUnitigs`, but its trait bounds were not satisfied [INFO] [stdout] --> src/unitigs/mod.rs:275:58 [INFO] [stdout] | [INFO] [stdout] 205 | pub struct EdgeUnitigs { [INFO] [stdout] | ---------------------------------------- doesn't satisfy `EdgeUnitigs: ExactSizeIterator` or `_: Sequence, [EdgeUnitig]>` [INFO] [stdout] ... [INFO] [stdout] 275 | let mut retain_indices = Vec::with_capacity(self.len()); [INFO] [stdout] | ^^^ method cannot be called on `&mut EdgeUnitigs` due to unsatisfied trait bounds [INFO] [stdout] | [INFO] [stdout] note: trait bound `Graph: traitgraph::interface::GraphBase` was not satisfied [INFO] [stdout] --> src/unitigs/mod.rs:379:13 [INFO] [stdout] | [INFO] [stdout] 379 | impl Sequence, [EdgeUnitig]> for EdgeUnitigs { [INFO] [stdout] | ^^^^^^^^^ ------------------------------------------------ ------------------ [INFO] [stdout] | | [INFO] [stdout] | unsatisfied trait bound introduced here [INFO] [stdout] = note: the following trait bounds were not satisfied: [INFO] [stdout] `EdgeUnitigs: ExactSizeIterator` [INFO] [stdout] which is required by `&mut EdgeUnitigs: ExactSizeIterator` [INFO] [stdout] note: the trait `ExactSizeIterator` must be implemented [INFO] [stdout] --> /rustc/8de4c7234dd9b97c9d76b58671343fdbbc9a433e/library/core/src/iter/traits/exact_size.rs:86:1 [INFO] [stdout] help: consider restricting the type parameter to satisfy the trait bound [INFO] [stdout] | [INFO] [stdout] 205 | pub struct EdgeUnitigs where Graph: traitgraph::interface::GraphBase { [INFO] [stdout] | +++++++++++++++++++++++++++++++++++++++++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0599]: the method `iter` exists for mutable reference `&mut EdgeUnitigs`, but its trait bounds were not satisfied [INFO] [stdout] --> src/unitigs/mod.rs:276:33 [INFO] [stdout] | [INFO] [stdout] 205 | pub struct EdgeUnitigs { [INFO] [stdout] | ---------------------------------------- doesn't satisfy `_: Sequence, [EdgeUnitig]>` [INFO] [stdout] ... [INFO] [stdout] 276 | for (i, unitig) in self.iter().enumerate() { [INFO] [stdout] | ^^^^ method cannot be called on `&mut EdgeUnitigs` due to unsatisfied trait bounds [INFO] [stdout] | [INFO] [stdout] note: trait bound `Graph: traitgraph::interface::GraphBase` was not satisfied [INFO] [stdout] --> src/unitigs/mod.rs:379:13 [INFO] [stdout] | [INFO] [stdout] 379 | impl Sequence, [EdgeUnitig]> for EdgeUnitigs { [INFO] [stdout] | ^^^^^^^^^ ------------------------------------------------ ------------------ [INFO] [stdout] | | [INFO] [stdout] | unsatisfied trait bound introduced here [INFO] [stdout] help: consider restricting the type parameter to satisfy the trait bound [INFO] [stdout] | [INFO] [stdout] 205 | pub struct EdgeUnitigs where Graph: traitgraph::interface::GraphBase { [INFO] [stdout] | +++++++++++++++++++++++++++++++++++++++++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0599]: no method named `as_usize` found for associated type `::EdgeIndex` in the current scope [INFO] [stdout] --> src/unitigs/mod.rs:281:62 [INFO] [stdout] | [INFO] [stdout] 281 | first_edge_map[reverse_complement_first_edge.as_usize()]; [INFO] [stdout] | ^^^^^^^^ method not found in `::EdgeIndex` [INFO] [stdout] | [INFO] [stdout] note: there are multiple different versions of crate `traitgraph` in the dependency graph [INFO] [stdout] --> /opt/rustwide/cargo-home/registry/src/index.crates.io-1949cf8c6b5b557f/traitgraph-8.1.2/src/index.rs:79:1 [INFO] [stdout] | [INFO] [stdout] 79 | / pub trait GraphIndex>: [INFO] [stdout] 80 | | std::fmt::Debug [INFO] [stdout] 81 | | + Eq [INFO] [stdout] 82 | | + Ord [INFO] [stdout] ... | [INFO] [stdout] 88 | | + std::ops::Add [INFO] [stdout] 89 | | + std::ops::Sub [INFO] [stdout] | |_________________________________________^ this is the trait that is needed [INFO] [stdout] ... [INFO] [stdout] 93 | fn as_usize(self) -> usize; [INFO] [stdout] | --------------------------- the method is available for `::EdgeIndex` here [INFO] [stdout] | [INFO] [stdout] ::: src/unitigs/mod.rs:3:5 [INFO] [stdout] | [INFO] [stdout] 3 | use traitgraph::index::GraphIndex; [INFO] [stdout] | ----------------------------- `GraphIndex` imported here doesn't correspond to the right version of crate `traitgraph` [INFO] [stdout] | [INFO] [stdout] ::: /opt/rustwide/cargo-home/registry/src/index.crates.io-1949cf8c6b5b557f/traitgraph-5.0.0/src/index.rs:76:1 [INFO] [stdout] | [INFO] [stdout] 76 | / pub trait GraphIndex>: [INFO] [stdout] 77 | | std::fmt::Debug [INFO] [stdout] 78 | | + Eq [INFO] [stdout] 79 | | + Ord [INFO] [stdout] ... | [INFO] [stdout] 85 | | + std::ops::Add [INFO] [stdout] 86 | | + std::ops::Sub [INFO] [stdout] | |__________________________________________- this is the trait that was imported [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0277]: the trait bound `Graph: traitgraph::interface::GraphBase` is not satisfied [INFO] [stdout] --> src/unitigs/mod.rs:301:9 [INFO] [stdout] | [INFO] [stdout] 301 | std::mem::swap(&mut unitigs, &mut self.unitigs); [INFO] [stdout] | ^^^^^^^^^^^^^^ the trait `traitgraph::interface::GraphBase` is not implemented for `Graph` [INFO] [stdout] | [INFO] [stdout] note: required by a bound in `EdgeUnitig` [INFO] [stdout] --> src/unitigs/mod.rs:90:30 [INFO] [stdout] | [INFO] [stdout] 90 | pub struct EdgeUnitig { [INFO] [stdout] | ^^^^^^^^^ required by this bound in `EdgeUnitig` [INFO] [stdout] help: consider further restricting type parameter `Graph` with trait `GraphBase` [INFO] [stdout] | [INFO] [stdout] 257 | impl EdgeUnitigs [INFO] [stdout] | ++++++++++++++++++++++++++++++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0277]: the trait bound `Graph: traitgraph::interface::GraphBase` is not satisfied [INFO] [stdout] --> src/unitigs/mod.rs:300:27 [INFO] [stdout] | [INFO] [stdout] 300 | let mut unitigs = Vec::new(); [INFO] [stdout] | ^^^ the trait `traitgraph::interface::GraphBase` is not implemented for `Graph` [INFO] [stdout] | [INFO] [stdout] note: required by a bound in `EdgeUnitig` [INFO] [stdout] --> src/unitigs/mod.rs:90:30 [INFO] [stdout] | [INFO] [stdout] 90 | pub struct EdgeUnitig { [INFO] [stdout] | ^^^^^^^^^ required by this bound in `EdgeUnitig` [INFO] [stdout] help: consider further restricting type parameter `Graph` with trait `GraphBase` [INFO] [stdout] | [INFO] [stdout] 257 | impl EdgeUnitigs [INFO] [stdout] | ++++++++++++++++++++++++++++++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0277]: the trait bound `Graph: traitgraph::interface::GraphBase` is not satisfied [INFO] [stdout] --> src/unitigs/mod.rs:302:28 [INFO] [stdout] | [INFO] [stdout] 302 | for (i, unitig) in unitigs.into_iter().enumerate() { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ the trait `traitgraph::interface::GraphBase` is not implemented for `Graph` [INFO] [stdout] | [INFO] [stdout] note: required by a bound in `EdgeUnitig` [INFO] [stdout] --> src/unitigs/mod.rs:90:30 [INFO] [stdout] | [INFO] [stdout] 90 | pub struct EdgeUnitig { [INFO] [stdout] | ^^^^^^^^^ required by this bound in `EdgeUnitig` [INFO] [stdout] help: consider further restricting type parameter `Graph` with trait `GraphBase` [INFO] [stdout] | [INFO] [stdout] 257 | impl EdgeUnitigs [INFO] [stdout] | ++++++++++++++++++++++++++++++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0277]: the trait bound `Graph: traitgraph::interface::GraphBase` is not satisfied [INFO] [stdout] --> src/unitigs/mod.rs:302:28 [INFO] [stdout] | [INFO] [stdout] 302 | for (i, unitig) in unitigs.into_iter().enumerate() { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ the trait `traitgraph::interface::GraphBase` is not implemented for `Graph` [INFO] [stdout] | [INFO] [stdout] note: required by a bound in `EdgeUnitig` [INFO] [stdout] --> src/unitigs/mod.rs:90:30 [INFO] [stdout] | [INFO] [stdout] 90 | pub struct EdgeUnitig { [INFO] [stdout] | ^^^^^^^^^ required by this bound in `EdgeUnitig` [INFO] [stdout] help: consider further restricting type parameter `Graph` with trait `GraphBase` [INFO] [stdout] | [INFO] [stdout] 257 | impl EdgeUnitigs [INFO] [stdout] | ++++++++++++++++++++++++++++++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0277]: the trait bound `Graph: traitgraph::interface::GraphBase` is not satisfied [INFO] [stdout] --> src/unitigs/mod.rs:307:36 [INFO] [stdout] | [INFO] [stdout] 307 | if i == retain_indices[self.unitigs.len()] { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ the trait `traitgraph::interface::GraphBase` is not implemented for `Graph` [INFO] [stdout] | [INFO] [stdout] note: required by a bound in `EdgeUnitig` [INFO] [stdout] --> src/unitigs/mod.rs:90:30 [INFO] [stdout] | [INFO] [stdout] 90 | pub struct EdgeUnitig { [INFO] [stdout] | ^^^^^^^^^ required by this bound in `EdgeUnitig` [INFO] [stdout] help: consider further restricting type parameter `Graph` with trait `GraphBase` [INFO] [stdout] | [INFO] [stdout] 257 | impl EdgeUnitigs [INFO] [stdout] | ++++++++++++++++++++++++++++++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0308]: mismatched types [INFO] [stdout] --> src/unitigs/mod.rs:307:21 [INFO] [stdout] | [INFO] [stdout] 307 | if i == retain_indices[self.unitigs.len()] { [INFO] [stdout] | - ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ expected `usize`, found associated type [INFO] [stdout] | | [INFO] [stdout] | expected because this is `usize` [INFO] [stdout] | [INFO] [stdout] = note: expected type `usize` [INFO] [stdout] found associated type `::EdgeData` [INFO] [stdout] = help: consider constraining the associated type `::EdgeData` to `usize` [INFO] [stdout] = note: for more information, visit https://doc.rust-lang.org/book/ch19-03-advanced-traits.html [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0277]: the trait bound `Graph: traitgraph::interface::GraphBase` is not satisfied [INFO] [stdout] --> src/unitigs/mod.rs:308:17 [INFO] [stdout] | [INFO] [stdout] 308 | self.unitigs.push(unitig); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^ the trait `traitgraph::interface::GraphBase` is not implemented for `Graph` [INFO] [stdout] | [INFO] [stdout] note: required by a bound in `EdgeUnitig` [INFO] [stdout] --> src/unitigs/mod.rs:90:30 [INFO] [stdout] | [INFO] [stdout] 90 | pub struct EdgeUnitig { [INFO] [stdout] | ^^^^^^^^^ required by this bound in `EdgeUnitig` [INFO] [stdout] help: consider further restricting type parameter `Graph` with trait `GraphBase` [INFO] [stdout] | [INFO] [stdout] 257 | impl EdgeUnitigs [INFO] [stdout] | ++++++++++++++++++++++++++++++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0277]: the trait bound `Graph: bigraph::traitgraph::interface::GraphBase` is not satisfied [INFO] [stdout] --> src/walks.rs:102:29 [INFO] [stdout] | [INFO] [stdout] 102 | for node_or_edge in UnivocalIterator::new_backward_without_start( [INFO] [stdout] | ^^^^^^^^^^^^^^^^ the trait `bigraph::traitgraph::interface::GraphBase` is not implemented for `Graph` [INFO] [stdout] | [INFO] [stdout] note: required by a bound in `UnivocalIterator` [INFO] [stdout] --> /opt/rustwide/cargo-home/registry/src/index.crates.io-1949cf8c6b5b557f/traitgraph-algo-8.1.2/src/traversal/univocal_traversal.rs:11:40 [INFO] [stdout] | [INFO] [stdout] 11 | pub struct UnivocalIterator<'a, Graph: GraphBase, NeighborStrategy> { [INFO] [stdout] | ^^^^^^^^^ required by this bound in `UnivocalIterator` [INFO] [stdout] help: consider further restricting type parameter `Graph` with trait `GraphBase` [INFO] [stdout] | [INFO] [stdout] 7 | pub trait NodeOmnitigLikeExt + ?Sized>: [INFO] [stdout] | +++++++++++++++++++++++++++++++++++++++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0277]: the trait bound `Graph: bigraph::traitgraph::interface::NavigableGraph` is not satisfied [INFO] [stdout] --> src/walks.rs:103:13 [INFO] [stdout] | [INFO] [stdout] 102 | for node_or_edge in UnivocalIterator::new_backward_without_start( [INFO] [stdout] | -------------------------------------------- required by a bound introduced by this call [INFO] [stdout] 103 | graph, [INFO] [stdout] | ^^^^^ the trait `bigraph::traitgraph::interface::NavigableGraph` is not implemented for `Graph` [INFO] [stdout] | [INFO] [stdout] note: required by a bound in `UnivocalIterator::<'a, Graph, BackwardNeighborStrategy>::new_backward_without_start` [INFO] [stdout] --> /opt/rustwide/cargo-home/registry/src/index.crates.io-1949cf8c6b5b557f/traitgraph-algo-8.1.2/src/traversal/univocal_traversal.rs:68:17 [INFO] [stdout] | [INFO] [stdout] 68 | impl<'a, Graph: NavigableGraph> UnivocalIterator<'a, Graph, BackwardNeighborStrategy> [INFO] [stdout] | ^^^^^^^^^^^^^^ required by this bound in `UnivocalIterator::<'a, Graph, BackwardNeighborStrategy>::new_backward_without_start` [INFO] [stdout] ... [INFO] [stdout] 81 | pub fn new_backward_without_start( [INFO] [stdout] | -------------------------- required by a bound in this associated function [INFO] [stdout] help: consider further restricting type parameter `Graph` with trait `NavigableGraph` [INFO] [stdout] | [INFO] [stdout] 7 | pub trait NodeOmnitigLikeExt + ?Sized>: [INFO] [stdout] | ++++++++++++++++++++++++++++++++++++++++++++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0277]: the trait bound `Graph: bigraph::traitgraph::interface::GraphBase` is not satisfied [INFO] [stdout] --> src/walks.rs:102:29 [INFO] [stdout] | [INFO] [stdout] 102 | for node_or_edge in UnivocalIterator::new_backward_without_start( [INFO] [stdout] | _____________________________^ [INFO] [stdout] 103 | | graph, [INFO] [stdout] 104 | | NodeOrEdge::Node(*self.first().unwrap()), [INFO] [stdout] 105 | | ) { [INFO] [stdout] | |_________^ the trait `bigraph::traitgraph::interface::GraphBase` is not implemented for `Graph` [INFO] [stdout] | [INFO] [stdout] help: consider further restricting type parameter `Graph` with trait `GraphBase` [INFO] [stdout] | [INFO] [stdout] 7 | pub trait NodeOmnitigLikeExt + ?Sized>: [INFO] [stdout] | +++++++++++++++++++++++++++++++++++++++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0308]: mismatched types [INFO] [stdout] --> src/walks.rs:104:13 [INFO] [stdout] | [INFO] [stdout] 102 | for node_or_edge in UnivocalIterator::new_backward_without_start( [INFO] [stdout] | -------------------------------------------- arguments to this function are incorrect [INFO] [stdout] 103 | graph, [INFO] [stdout] 104 | NodeOrEdge::Node(*self.first().unwrap()), [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ expected `NodeOrEdge<_, _>`, found `NodeOrEdge<..., _>` [INFO] [stdout] | [INFO] [stdout] note: two different versions of crate `traitgraph` are being used; two types coming from two different versions of the same crate are different types even if they look the same [INFO] [stdout] --> /opt/rustwide/cargo-home/registry/src/index.crates.io-1949cf8c6b5b557f/traitgraph-5.0.0/src/interface/mod.rs:327:1 [INFO] [stdout] | [INFO] [stdout] 327 | pub enum NodeOrEdge { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ this is the found type `traitgraph::interface::NodeOrEdge` [INFO] [stdout] | [INFO] [stdout] ::: /opt/rustwide/cargo-home/registry/src/index.crates.io-1949cf8c6b5b557f/traitgraph-8.1.2/src/interface/mod.rs:327:1 [INFO] [stdout] | [INFO] [stdout] 327 | pub enum NodeOrEdge { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ this is the expected type `bigraph::traitgraph::interface::NodeOrEdge` [INFO] [stdout] | [INFO] [stdout] ::: src/macrotigs/macrotigs/default_macrotig_link_algorithm.rs:6:5 [INFO] [stdout] | [INFO] [stdout] 6 | use traitgraph_algo::traversal::univocal_traversal::is_edge_self_bivalent; [INFO] [stdout] | --------------- one version of crate `traitgraph` used here, as a dependency of crate `traitgraph_algo` [INFO] [stdout] | [INFO] [stdout] ::: src/hydrostructure/incremental_hydrostructure/mod.rs:9:5 [INFO] [stdout] | [INFO] [stdout] 9 | use traitgraph::implementation::subgraphs::incremental_subgraph::IncrementalSubgraph; [INFO] [stdout] | ---------- one version of crate `traitgraph` used here, as a direct dependency of the current crate [INFO] [stdout] = help: you can use `cargo tree` to explore your dependency tree [INFO] [stdout] note: associated function defined here [INFO] [stdout] --> /opt/rustwide/cargo-home/registry/src/index.crates.io-1949cf8c6b5b557f/traitgraph-algo-8.1.2/src/traversal/univocal_traversal.rs:81:12 [INFO] [stdout] | [INFO] [stdout] 81 | pub fn new_backward_without_start( [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] help: try wrapping the expression in a variant of `bigraph::traitgraph::interface::NodeOrEdge` [INFO] [stdout] | [INFO] [stdout] 104 | bigraph::traitgraph::interface::NodeOrEdge::Node(NodeOrEdge::Node(*self.first().unwrap())), [INFO] [stdout] | +++++++++++++++++++++++++++++++++++++++++++++++++ + [INFO] [stdout] 104 | bigraph::traitgraph::interface::NodeOrEdge::Edge(NodeOrEdge::Node(*self.first().unwrap())), [INFO] [stdout] | +++++++++++++++++++++++++++++++++++++++++++++++++ + [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0277]: the trait bound `Graph: bigraph::traitgraph::interface::NavigableGraph` is not satisfied [INFO] [stdout] --> src/walks.rs:102:29 [INFO] [stdout] | [INFO] [stdout] 102 | for node_or_edge in UnivocalIterator::new_backward_without_start( [INFO] [stdout] | _____________________________^ [INFO] [stdout] 103 | | graph, [INFO] [stdout] 104 | | NodeOrEdge::Node(*self.first().unwrap()), [INFO] [stdout] 105 | | ) { [INFO] [stdout] | |_________^ the trait `bigraph::traitgraph::interface::NavigableGraph` is not implemented for `Graph` [INFO] [stdout] | [INFO] [stdout] note: required by a bound in `UnivocalIterator<'a, Graph, BackwardNeighborStrategy>` [INFO] [stdout] --> /opt/rustwide/cargo-home/registry/src/index.crates.io-1949cf8c6b5b557f/traitgraph-algo-8.1.2/src/traversal/univocal_traversal.rs:68:17 [INFO] [stdout] | [INFO] [stdout] 68 | impl<'a, Graph: NavigableGraph> UnivocalIterator<'a, Graph, BackwardNeighborStrategy> [INFO] [stdout] | ^^^^^^^^^^^^^^ required by this bound in `UnivocalIterator<'a, Graph, BackwardNeighborStrategy>` [INFO] [stdout] help: consider further restricting type parameter `Graph` with trait `NavigableGraph` [INFO] [stdout] | [INFO] [stdout] 7 | pub trait NodeOmnitigLikeExt + ?Sized>: [INFO] [stdout] | ++++++++++++++++++++++++++++++++++++++++++++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0308]: mismatched types [INFO] [stdout] --> src/walks.rs:107:17 [INFO] [stdout] | [INFO] [stdout] 107 | NodeOrEdge::Node(node) => { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ expected `NodeOrEdge<_, _>`, found `traitgraph::interface::NodeOrEdge<_, _>` [INFO] [stdout] | [INFO] [stdout] note: two different versions of crate `traitgraph` are being used; two types coming from two different versions of the same crate are different types even if they look the same [INFO] [stdout] --> /opt/rustwide/cargo-home/registry/src/index.crates.io-1949cf8c6b5b557f/traitgraph-5.0.0/src/interface/mod.rs:327:1 [INFO] [stdout] | [INFO] [stdout] 327 | pub enum NodeOrEdge { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ this is the found type `traitgraph::interface::NodeOrEdge` [INFO] [stdout] | [INFO] [stdout] ::: /opt/rustwide/cargo-home/registry/src/index.crates.io-1949cf8c6b5b557f/traitgraph-8.1.2/src/interface/mod.rs:327:1 [INFO] [stdout] | [INFO] [stdout] 327 | pub enum NodeOrEdge { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ this is the expected type `bigraph::traitgraph::interface::NodeOrEdge` [INFO] [stdout] | [INFO] [stdout] ::: src/macrotigs/macrotigs/default_macrotig_link_algorithm.rs:6:5 [INFO] [stdout] | [INFO] [stdout] 6 | use traitgraph_algo::traversal::univocal_traversal::is_edge_self_bivalent; [INFO] [stdout] | --------------- one version of crate `traitgraph` used here, as a dependency of crate `traitgraph_algo` [INFO] [stdout] | [INFO] [stdout] ::: src/hydrostructure/incremental_hydrostructure/mod.rs:9:5 [INFO] [stdout] | [INFO] [stdout] 9 | use traitgraph::implementation::subgraphs::incremental_subgraph::IncrementalSubgraph; [INFO] [stdout] | ---------- one version of crate `traitgraph` used here, as a direct dependency of the current crate [INFO] [stdout] = help: you can use `cargo tree` to explore your dependency tree [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0308]: mismatched types [INFO] [stdout] --> src/walks.rs:114:17 [INFO] [stdout] | [INFO] [stdout] 114 | NodeOrEdge::Edge(_) => {} [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ expected `NodeOrEdge<_, _>`, found `traitgraph::interface::NodeOrEdge<_, _>` [INFO] [stdout] | [INFO] [stdout] note: two different versions of crate `traitgraph` are being used; two types coming from two different versions of the same crate are different types even if they look the same [INFO] [stdout] --> /opt/rustwide/cargo-home/registry/src/index.crates.io-1949cf8c6b5b557f/traitgraph-5.0.0/src/interface/mod.rs:327:1 [INFO] [stdout] | [INFO] [stdout] 327 | pub enum NodeOrEdge { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ this is the found type `traitgraph::interface::NodeOrEdge` [INFO] [stdout] | [INFO] [stdout] ::: /opt/rustwide/cargo-home/registry/src/index.crates.io-1949cf8c6b5b557f/traitgraph-8.1.2/src/interface/mod.rs:327:1 [INFO] [stdout] | [INFO] [stdout] 327 | pub enum NodeOrEdge { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ this is the expected type `bigraph::traitgraph::interface::NodeOrEdge` [INFO] [stdout] | [INFO] [stdout] ::: src/macrotigs/macrotigs/default_macrotig_link_algorithm.rs:6:5 [INFO] [stdout] | [INFO] [stdout] 6 | use traitgraph_algo::traversal::univocal_traversal::is_edge_self_bivalent; [INFO] [stdout] | --------------- one version of crate `traitgraph` used here, as a dependency of crate `traitgraph_algo` [INFO] [stdout] | [INFO] [stdout] ::: src/hydrostructure/incremental_hydrostructure/mod.rs:9:5 [INFO] [stdout] | [INFO] [stdout] 9 | use traitgraph::implementation::subgraphs::incremental_subgraph::IncrementalSubgraph; [INFO] [stdout] | ---------- one version of crate `traitgraph` used here, as a direct dependency of the current crate [INFO] [stdout] = help: you can use `cargo tree` to explore your dependency tree [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0277]: the trait bound `Graph: bigraph::traitgraph::interface::GraphBase` is not satisfied [INFO] [stdout] --> src/walks.rs:122:29 [INFO] [stdout] | [INFO] [stdout] 122 | for node_or_edge in UnivocalIterator::new_forward_without_start( [INFO] [stdout] | ^^^^^^^^^^^^^^^^ the trait `bigraph::traitgraph::interface::GraphBase` is not implemented for `Graph` [INFO] [stdout] | [INFO] [stdout] note: required by a bound in `UnivocalIterator` [INFO] [stdout] --> /opt/rustwide/cargo-home/registry/src/index.crates.io-1949cf8c6b5b557f/traitgraph-algo-8.1.2/src/traversal/univocal_traversal.rs:11:40 [INFO] [stdout] | [INFO] [stdout] 11 | pub struct UnivocalIterator<'a, Graph: GraphBase, NeighborStrategy> { [INFO] [stdout] | ^^^^^^^^^ required by this bound in `UnivocalIterator` [INFO] [stdout] help: consider further restricting type parameter `Graph` with trait `GraphBase` [INFO] [stdout] | [INFO] [stdout] 7 | pub trait NodeOmnitigLikeExt + ?Sized>: [INFO] [stdout] | +++++++++++++++++++++++++++++++++++++++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0277]: the trait bound `Graph: bigraph::traitgraph::interface::NavigableGraph` is not satisfied [INFO] [stdout] --> src/walks.rs:123:13 [INFO] [stdout] | [INFO] [stdout] 122 | for node_or_edge in UnivocalIterator::new_forward_without_start( [INFO] [stdout] | ------------------------------------------- required by a bound introduced by this call [INFO] [stdout] 123 | graph, [INFO] [stdout] | ^^^^^ the trait `bigraph::traitgraph::interface::NavigableGraph` is not implemented for `Graph` [INFO] [stdout] | [INFO] [stdout] note: required by a bound in `UnivocalIterator::<'a, Graph, ForwardNeighborStrategy>::new_forward_without_start` [INFO] [stdout] --> /opt/rustwide/cargo-home/registry/src/index.crates.io-1949cf8c6b5b557f/traitgraph-algo-8.1.2/src/traversal/univocal_traversal.rs:47:17 [INFO] [stdout] | [INFO] [stdout] 47 | impl<'a, Graph: NavigableGraph> UnivocalIterator<'a, Graph, ForwardNeighborStrategy> [INFO] [stdout] | ^^^^^^^^^^^^^^ required by this bound in `UnivocalIterator::<'a, Graph, ForwardNeighborStrategy>::new_forward_without_start` [INFO] [stdout] ... [INFO] [stdout] 60 | pub fn new_forward_without_start( [INFO] [stdout] | ------------------------- required by a bound in this associated function [INFO] [stdout] help: consider further restricting type parameter `Graph` with trait `NavigableGraph` [INFO] [stdout] | [INFO] [stdout] 7 | pub trait NodeOmnitigLikeExt + ?Sized>: [INFO] [stdout] | ++++++++++++++++++++++++++++++++++++++++++++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0277]: the trait bound `Graph: bigraph::traitgraph::interface::GraphBase` is not satisfied [INFO] [stdout] --> src/walks.rs:122:29 [INFO] [stdout] | [INFO] [stdout] 122 | for node_or_edge in UnivocalIterator::new_forward_without_start( [INFO] [stdout] | _____________________________^ [INFO] [stdout] 123 | | graph, [INFO] [stdout] 124 | | NodeOrEdge::Node(*self.last().unwrap()), [INFO] [stdout] 125 | | ) { [INFO] [stdout] | |_________^ the trait `bigraph::traitgraph::interface::GraphBase` is not implemented for `Graph` [INFO] [stdout] | [INFO] [stdout] help: consider further restricting type parameter `Graph` with trait `GraphBase` [INFO] [stdout] | [INFO] [stdout] 7 | pub trait NodeOmnitigLikeExt + ?Sized>: [INFO] [stdout] | +++++++++++++++++++++++++++++++++++++++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0308]: mismatched types [INFO] [stdout] --> src/walks.rs:124:13 [INFO] [stdout] | [INFO] [stdout] 122 | for node_or_edge in UnivocalIterator::new_forward_without_start( [INFO] [stdout] | ------------------------------------------- arguments to this function are incorrect [INFO] [stdout] 123 | graph, [INFO] [stdout] 124 | NodeOrEdge::Node(*self.last().unwrap()), [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ expected `NodeOrEdge<_, _>`, found `NodeOrEdge<..., _>` [INFO] [stdout] | [INFO] [stdout] note: two different versions of crate `traitgraph` are being used; two types coming from two different versions of the same crate are different types even if they look the same [INFO] [stdout] --> /opt/rustwide/cargo-home/registry/src/index.crates.io-1949cf8c6b5b557f/traitgraph-5.0.0/src/interface/mod.rs:327:1 [INFO] [stdout] | [INFO] [stdout] 327 | pub enum NodeOrEdge { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ this is the found type `traitgraph::interface::NodeOrEdge` [INFO] [stdout] | [INFO] [stdout] ::: /opt/rustwide/cargo-home/registry/src/index.crates.io-1949cf8c6b5b557f/traitgraph-8.1.2/src/interface/mod.rs:327:1 [INFO] [stdout] | [INFO] [stdout] 327 | pub enum NodeOrEdge { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ this is the expected type `bigraph::traitgraph::interface::NodeOrEdge` [INFO] [stdout] | [INFO] [stdout] ::: src/macrotigs/macrotigs/default_macrotig_link_algorithm.rs:6:5 [INFO] [stdout] | [INFO] [stdout] 6 | use traitgraph_algo::traversal::univocal_traversal::is_edge_self_bivalent; [INFO] [stdout] | --------------- one version of crate `traitgraph` used here, as a dependency of crate `traitgraph_algo` [INFO] [stdout] | [INFO] [stdout] ::: src/hydrostructure/incremental_hydrostructure/mod.rs:9:5 [INFO] [stdout] | [INFO] [stdout] 9 | use traitgraph::implementation::subgraphs::incremental_subgraph::IncrementalSubgraph; [INFO] [stdout] | ---------- one version of crate `traitgraph` used here, as a direct dependency of the current crate [INFO] [stdout] = help: you can use `cargo tree` to explore your dependency tree [INFO] [stdout] note: associated function defined here [INFO] [stdout] --> /opt/rustwide/cargo-home/registry/src/index.crates.io-1949cf8c6b5b557f/traitgraph-algo-8.1.2/src/traversal/univocal_traversal.rs:60:12 [INFO] [stdout] | [INFO] [stdout] 60 | pub fn new_forward_without_start( [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] help: try wrapping the expression in a variant of `bigraph::traitgraph::interface::NodeOrEdge` [INFO] [stdout] | [INFO] [stdout] 124 | bigraph::traitgraph::interface::NodeOrEdge::Node(NodeOrEdge::Node(*self.last().unwrap())), [INFO] [stdout] | +++++++++++++++++++++++++++++++++++++++++++++++++ + [INFO] [stdout] 124 | bigraph::traitgraph::interface::NodeOrEdge::Edge(NodeOrEdge::Node(*self.last().unwrap())), [INFO] [stdout] | +++++++++++++++++++++++++++++++++++++++++++++++++ + [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0277]: the trait bound `Graph: bigraph::traitgraph::interface::NavigableGraph` is not satisfied [INFO] [stdout] --> src/walks.rs:122:29 [INFO] [stdout] | [INFO] [stdout] 122 | for node_or_edge in UnivocalIterator::new_forward_without_start( [INFO] [stdout] | _____________________________^ [INFO] [stdout] 123 | | graph, [INFO] [stdout] 124 | | NodeOrEdge::Node(*self.last().unwrap()), [INFO] [stdout] 125 | | ) { [INFO] [stdout] | |_________^ the trait `bigraph::traitgraph::interface::NavigableGraph` is not implemented for `Graph` [INFO] [stdout] | [INFO] [stdout] note: required by a bound in `UnivocalIterator<'a, Graph, ForwardNeighborStrategy>` [INFO] [stdout] --> /opt/rustwide/cargo-home/registry/src/index.crates.io-1949cf8c6b5b557f/traitgraph-algo-8.1.2/src/traversal/univocal_traversal.rs:47:17 [INFO] [stdout] | [INFO] [stdout] 47 | impl<'a, Graph: NavigableGraph> UnivocalIterator<'a, Graph, ForwardNeighborStrategy> [INFO] [stdout] | ^^^^^^^^^^^^^^ required by this bound in `UnivocalIterator<'a, Graph, ForwardNeighborStrategy>` [INFO] [stdout] help: consider further restricting type parameter `Graph` with trait `NavigableGraph` [INFO] [stdout] | [INFO] [stdout] 7 | pub trait NodeOmnitigLikeExt + ?Sized>: [INFO] [stdout] | ++++++++++++++++++++++++++++++++++++++++++++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0308]: mismatched types [INFO] [stdout] --> src/walks.rs:127:17 [INFO] [stdout] | [INFO] [stdout] 127 | NodeOrEdge::Node(node) => { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ expected `NodeOrEdge<_, _>`, found `traitgraph::interface::NodeOrEdge<_, _>` [INFO] [stdout] | [INFO] [stdout] note: two different versions of crate `traitgraph` are being used; two types coming from two different versions of the same crate are different types even if they look the same [INFO] [stdout] --> /opt/rustwide/cargo-home/registry/src/index.crates.io-1949cf8c6b5b557f/traitgraph-5.0.0/src/interface/mod.rs:327:1 [INFO] [stdout] | [INFO] [stdout] 327 | pub enum NodeOrEdge { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ this is the found type `traitgraph::interface::NodeOrEdge` [INFO] [stdout] | [INFO] [stdout] ::: /opt/rustwide/cargo-home/registry/src/index.crates.io-1949cf8c6b5b557f/traitgraph-8.1.2/src/interface/mod.rs:327:1 [INFO] [stdout] | [INFO] [stdout] 327 | pub enum NodeOrEdge { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ this is the expected type `bigraph::traitgraph::interface::NodeOrEdge` [INFO] [stdout] | [INFO] [stdout] ::: src/macrotigs/macrotigs/default_macrotig_link_algorithm.rs:6:5 [INFO] [stdout] | [INFO] [stdout] 6 | use traitgraph_algo::traversal::univocal_traversal::is_edge_self_bivalent; [INFO] [stdout] | --------------- one version of crate `traitgraph` used here, as a dependency of crate `traitgraph_algo` [INFO] [stdout] | [INFO] [stdout] ::: src/hydrostructure/incremental_hydrostructure/mod.rs:9:5 [INFO] [stdout] | [INFO] [stdout] 9 | use traitgraph::implementation::subgraphs::incremental_subgraph::IncrementalSubgraph; [INFO] [stdout] | ---------- one version of crate `traitgraph` used here, as a direct dependency of the current crate [INFO] [stdout] = help: you can use `cargo tree` to explore your dependency tree [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0308]: mismatched types [INFO] [stdout] --> src/walks.rs:134:17 [INFO] [stdout] | [INFO] [stdout] 134 | NodeOrEdge::Edge(_) => {} [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ expected `NodeOrEdge<_, _>`, found `traitgraph::interface::NodeOrEdge<_, _>` [INFO] [stdout] | [INFO] [stdout] note: two different versions of crate `traitgraph` are being used; two types coming from two different versions of the same crate are different types even if they look the same [INFO] [stdout] --> /opt/rustwide/cargo-home/registry/src/index.crates.io-1949cf8c6b5b557f/traitgraph-5.0.0/src/interface/mod.rs:327:1 [INFO] [stdout] | [INFO] [stdout] 327 | pub enum NodeOrEdge { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ this is the found type `traitgraph::interface::NodeOrEdge` [INFO] [stdout] | [INFO] [stdout] ::: /opt/rustwide/cargo-home/registry/src/index.crates.io-1949cf8c6b5b557f/traitgraph-8.1.2/src/interface/mod.rs:327:1 [INFO] [stdout] | [INFO] [stdout] 327 | pub enum NodeOrEdge { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ this is the expected type `bigraph::traitgraph::interface::NodeOrEdge` [INFO] [stdout] | [INFO] [stdout] ::: src/macrotigs/macrotigs/default_macrotig_link_algorithm.rs:6:5 [INFO] [stdout] | [INFO] [stdout] 6 | use traitgraph_algo::traversal::univocal_traversal::is_edge_self_bivalent; [INFO] [stdout] | --------------- one version of crate `traitgraph` used here, as a dependency of crate `traitgraph_algo` [INFO] [stdout] | [INFO] [stdout] ::: src/hydrostructure/incremental_hydrostructure/mod.rs:9:5 [INFO] [stdout] | [INFO] [stdout] 9 | use traitgraph::implementation::subgraphs::incremental_subgraph::IncrementalSubgraph; [INFO] [stdout] | ---------- one version of crate `traitgraph` used here, as a direct dependency of the current crate [INFO] [stdout] = help: you can use `cargo tree` to explore your dependency tree [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0277]: the trait bound `Graph: bigraph::traitgraph::interface::GraphBase` is not satisfied [INFO] [stdout] --> src/walks.rs:104:13 [INFO] [stdout] | [INFO] [stdout] 104 | NodeOrEdge::Node(*self.first().unwrap()), [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ the trait `bigraph::traitgraph::interface::GraphBase` is not implemented for `Graph` [INFO] [stdout] | [INFO] [stdout] help: consider further restricting type parameter `Graph` with trait `GraphBase` [INFO] [stdout] | [INFO] [stdout] 7 | pub trait NodeOmnitigLikeExt + ?Sized>: [INFO] [stdout] | +++++++++++++++++++++++++++++++++++++++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0277]: the trait bound `Graph: bigraph::traitgraph::interface::GraphBase` is not satisfied [INFO] [stdout] --> src/walks.rs:161:29 [INFO] [stdout] | [INFO] [stdout] 161 | for node_or_edge in UnivocalIterator::new_backward_without_start( [INFO] [stdout] | ^^^^^^^^^^^^^^^^ the trait `bigraph::traitgraph::interface::GraphBase` is not implemented for `Graph` [INFO] [stdout] | [INFO] [stdout] note: required by a bound in `UnivocalIterator` [INFO] [stdout] --> /opt/rustwide/cargo-home/registry/src/index.crates.io-1949cf8c6b5b557f/traitgraph-algo-8.1.2/src/traversal/univocal_traversal.rs:11:40 [INFO] [stdout] | [INFO] [stdout] 11 | pub struct UnivocalIterator<'a, Graph: GraphBase, NeighborStrategy> { [INFO] [stdout] | ^^^^^^^^^ required by this bound in `UnivocalIterator` [INFO] [stdout] help: consider further restricting type parameter `Graph` with trait `GraphBase` [INFO] [stdout] | [INFO] [stdout] 7 | pub trait NodeOmnitigLikeExt + ?Sized>: [INFO] [stdout] | +++++++++++++++++++++++++++++++++++++++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0277]: the trait bound `Graph: bigraph::traitgraph::interface::NavigableGraph` is not satisfied [INFO] [stdout] --> src/walks.rs:162:13 [INFO] [stdout] | [INFO] [stdout] 161 | for node_or_edge in UnivocalIterator::new_backward_without_start( [INFO] [stdout] | -------------------------------------------- required by a bound introduced by this call [INFO] [stdout] 162 | graph, [INFO] [stdout] | ^^^^^ the trait `bigraph::traitgraph::interface::NavigableGraph` is not implemented for `Graph` [INFO] [stdout] | [INFO] [stdout] note: required by a bound in `UnivocalIterator::<'a, Graph, BackwardNeighborStrategy>::new_backward_without_start` [INFO] [stdout] --> /opt/rustwide/cargo-home/registry/src/index.crates.io-1949cf8c6b5b557f/traitgraph-algo-8.1.2/src/traversal/univocal_traversal.rs:68:17 [INFO] [stdout] | [INFO] [stdout] 68 | impl<'a, Graph: NavigableGraph> UnivocalIterator<'a, Graph, BackwardNeighborStrategy> [INFO] [stdout] | ^^^^^^^^^^^^^^ required by this bound in `UnivocalIterator::<'a, Graph, BackwardNeighborStrategy>::new_backward_without_start` [INFO] [stdout] ... [INFO] [stdout] 81 | pub fn new_backward_without_start( [INFO] [stdout] | -------------------------- required by a bound in this associated function [INFO] [stdout] help: consider further restricting type parameter `Graph` with trait `NavigableGraph` [INFO] [stdout] | [INFO] [stdout] 7 | pub trait NodeOmnitigLikeExt + ?Sized>: [INFO] [stdout] | ++++++++++++++++++++++++++++++++++++++++++++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0277]: the trait bound `Graph: bigraph::traitgraph::interface::GraphBase` is not satisfied [INFO] [stdout] --> src/walks.rs:161:29 [INFO] [stdout] | [INFO] [stdout] 161 | for node_or_edge in UnivocalIterator::new_backward_without_start( [INFO] [stdout] | _____________________________^ [INFO] [stdout] 162 | | graph, [INFO] [stdout] 163 | | NodeOrEdge::Node(*self.first().unwrap()), [INFO] [stdout] 164 | | ) { [INFO] [stdout] | |_________^ the trait `bigraph::traitgraph::interface::GraphBase` is not implemented for `Graph` [INFO] [stdout] | [INFO] [stdout] help: consider further restricting type parameter `Graph` with trait `GraphBase` [INFO] [stdout] | [INFO] [stdout] 7 | pub trait NodeOmnitigLikeExt + ?Sized>: [INFO] [stdout] | +++++++++++++++++++++++++++++++++++++++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0308]: mismatched types [INFO] [stdout] --> src/walks.rs:163:13 [INFO] [stdout] | [INFO] [stdout] 161 | for node_or_edge in UnivocalIterator::new_backward_without_start( [INFO] [stdout] | -------------------------------------------- arguments to this function are incorrect [INFO] [stdout] 162 | graph, [INFO] [stdout] 163 | NodeOrEdge::Node(*self.first().unwrap()), [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ expected `NodeOrEdge<_, _>`, found `NodeOrEdge<..., _>` [INFO] [stdout] | [INFO] [stdout] note: two different versions of crate `traitgraph` are being used; two types coming from two different versions of the same crate are different types even if they look the same [INFO] [stdout] --> /opt/rustwide/cargo-home/registry/src/index.crates.io-1949cf8c6b5b557f/traitgraph-5.0.0/src/interface/mod.rs:327:1 [INFO] [stdout] | [INFO] [stdout] 327 | pub enum NodeOrEdge { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ this is the found type `traitgraph::interface::NodeOrEdge` [INFO] [stdout] | [INFO] [stdout] ::: /opt/rustwide/cargo-home/registry/src/index.crates.io-1949cf8c6b5b557f/traitgraph-8.1.2/src/interface/mod.rs:327:1 [INFO] [stdout] | [INFO] [stdout] 327 | pub enum NodeOrEdge { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ this is the expected type `bigraph::traitgraph::interface::NodeOrEdge` [INFO] [stdout] | [INFO] [stdout] ::: src/macrotigs/macrotigs/default_macrotig_link_algorithm.rs:6:5 [INFO] [stdout] | [INFO] [stdout] 6 | use traitgraph_algo::traversal::univocal_traversal::is_edge_self_bivalent; [INFO] [stdout] | --------------- one version of crate `traitgraph` used here, as a dependency of crate `traitgraph_algo` [INFO] [stdout] | [INFO] [stdout] ::: src/hydrostructure/incremental_hydrostructure/mod.rs:9:5 [INFO] [stdout] | [INFO] [stdout] 9 | use traitgraph::implementation::subgraphs::incremental_subgraph::IncrementalSubgraph; [INFO] [stdout] | ---------- one version of crate `traitgraph` used here, as a direct dependency of the current crate [INFO] [stdout] = help: you can use `cargo tree` to explore your dependency tree [INFO] [stdout] note: associated function defined here [INFO] [stdout] --> /opt/rustwide/cargo-home/registry/src/index.crates.io-1949cf8c6b5b557f/traitgraph-algo-8.1.2/src/traversal/univocal_traversal.rs:81:12 [INFO] [stdout] | [INFO] [stdout] 81 | pub fn new_backward_without_start( [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] help: try wrapping the expression in a variant of `bigraph::traitgraph::interface::NodeOrEdge` [INFO] [stdout] | [INFO] [stdout] 163 | bigraph::traitgraph::interface::NodeOrEdge::Node(NodeOrEdge::Node(*self.first().unwrap())), [INFO] [stdout] | +++++++++++++++++++++++++++++++++++++++++++++++++ + [INFO] [stdout] 163 | bigraph::traitgraph::interface::NodeOrEdge::Edge(NodeOrEdge::Node(*self.first().unwrap())), [INFO] [stdout] | +++++++++++++++++++++++++++++++++++++++++++++++++ + [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0277]: the trait bound `Graph: bigraph::traitgraph::interface::NavigableGraph` is not satisfied [INFO] [stdout] --> src/walks.rs:161:29 [INFO] [stdout] | [INFO] [stdout] 161 | for node_or_edge in UnivocalIterator::new_backward_without_start( [INFO] [stdout] | _____________________________^ [INFO] [stdout] 162 | | graph, [INFO] [stdout] 163 | | NodeOrEdge::Node(*self.first().unwrap()), [INFO] [stdout] 164 | | ) { [INFO] [stdout] | |_________^ the trait `bigraph::traitgraph::interface::NavigableGraph` is not implemented for `Graph` [INFO] [stdout] | [INFO] [stdout] note: required by a bound in `UnivocalIterator<'a, Graph, BackwardNeighborStrategy>` [INFO] [stdout] --> /opt/rustwide/cargo-home/registry/src/index.crates.io-1949cf8c6b5b557f/traitgraph-algo-8.1.2/src/traversal/univocal_traversal.rs:68:17 [INFO] [stdout] | [INFO] [stdout] 68 | impl<'a, Graph: NavigableGraph> UnivocalIterator<'a, Graph, BackwardNeighborStrategy> [INFO] [stdout] | ^^^^^^^^^^^^^^ required by this bound in `UnivocalIterator<'a, Graph, BackwardNeighborStrategy>` [INFO] [stdout] help: consider further restricting type parameter `Graph` with trait `NavigableGraph` [INFO] [stdout] | [INFO] [stdout] 7 | pub trait NodeOmnitigLikeExt + ?Sized>: [INFO] [stdout] | ++++++++++++++++++++++++++++++++++++++++++++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0308]: mismatched types [INFO] [stdout] --> src/walks.rs:166:17 [INFO] [stdout] | [INFO] [stdout] 166 | NodeOrEdge::Node(node) => { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ expected `NodeOrEdge<_, _>`, found `traitgraph::interface::NodeOrEdge<_, _>` [INFO] [stdout] | [INFO] [stdout] note: two different versions of crate `traitgraph` are being used; two types coming from two different versions of the same crate are different types even if they look the same [INFO] [stdout] --> /opt/rustwide/cargo-home/registry/src/index.crates.io-1949cf8c6b5b557f/traitgraph-5.0.0/src/interface/mod.rs:327:1 [INFO] [stdout] | [INFO] [stdout] 327 | pub enum NodeOrEdge { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ this is the found type `traitgraph::interface::NodeOrEdge` [INFO] [stdout] | [INFO] [stdout] ::: /opt/rustwide/cargo-home/registry/src/index.crates.io-1949cf8c6b5b557f/traitgraph-8.1.2/src/interface/mod.rs:327:1 [INFO] [stdout] | [INFO] [stdout] 327 | pub enum NodeOrEdge { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ this is the expected type `bigraph::traitgraph::interface::NodeOrEdge` [INFO] [stdout] | [INFO] [stdout] ::: src/macrotigs/macrotigs/default_macrotig_link_algorithm.rs:6:5 [INFO] [stdout] | [INFO] [stdout] 6 | use traitgraph_algo::traversal::univocal_traversal::is_edge_self_bivalent; [INFO] [stdout] | --------------- one version of crate `traitgraph` used here, as a dependency of crate `traitgraph_algo` [INFO] [stdout] | [INFO] [stdout] ::: src/hydrostructure/incremental_hydrostructure/mod.rs:9:5 [INFO] [stdout] | [INFO] [stdout] 9 | use traitgraph::implementation::subgraphs::incremental_subgraph::IncrementalSubgraph; [INFO] [stdout] | ---------- one version of crate `traitgraph` used here, as a direct dependency of the current crate [INFO] [stdout] = help: you can use `cargo tree` to explore your dependency tree [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0308]: mismatched types [INFO] [stdout] --> src/walks.rs:173:17 [INFO] [stdout] | [INFO] [stdout] 173 | NodeOrEdge::Edge(_) => {} [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ expected `NodeOrEdge<_, _>`, found `traitgraph::interface::NodeOrEdge<_, _>` [INFO] [stdout] | [INFO] [stdout] note: two different versions of crate `traitgraph` are being used; two types coming from two different versions of the same crate are different types even if they look the same [INFO] [stdout] --> /opt/rustwide/cargo-home/registry/src/index.crates.io-1949cf8c6b5b557f/traitgraph-5.0.0/src/interface/mod.rs:327:1 [INFO] [stdout] | [INFO] [stdout] 327 | pub enum NodeOrEdge { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ this is the found type `traitgraph::interface::NodeOrEdge` [INFO] [stdout] | [INFO] [stdout] ::: /opt/rustwide/cargo-home/registry/src/index.crates.io-1949cf8c6b5b557f/traitgraph-8.1.2/src/interface/mod.rs:327:1 [INFO] [stdout] | [INFO] [stdout] 327 | pub enum NodeOrEdge { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ this is the expected type `bigraph::traitgraph::interface::NodeOrEdge` [INFO] [stdout] | [INFO] [stdout] ::: src/macrotigs/macrotigs/default_macrotig_link_algorithm.rs:6:5 [INFO] [stdout] | [INFO] [stdout] 6 | use traitgraph_algo::traversal::univocal_traversal::is_edge_self_bivalent; [INFO] [stdout] | --------------- one version of crate `traitgraph` used here, as a dependency of crate `traitgraph_algo` [INFO] [stdout] | [INFO] [stdout] ::: src/hydrostructure/incremental_hydrostructure/mod.rs:9:5 [INFO] [stdout] | [INFO] [stdout] 9 | use traitgraph::implementation::subgraphs::incremental_subgraph::IncrementalSubgraph; [INFO] [stdout] | ---------- one version of crate `traitgraph` used here, as a direct dependency of the current crate [INFO] [stdout] = help: you can use `cargo tree` to explore your dependency tree [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0277]: the trait bound `Graph: bigraph::traitgraph::interface::GraphBase` is not satisfied [INFO] [stdout] --> src/walks.rs:182:29 [INFO] [stdout] | [INFO] [stdout] 182 | for node_or_edge in UnivocalIterator::new_forward_without_start( [INFO] [stdout] | ^^^^^^^^^^^^^^^^ the trait `bigraph::traitgraph::interface::GraphBase` is not implemented for `Graph` [INFO] [stdout] | [INFO] [stdout] note: required by a bound in `UnivocalIterator` [INFO] [stdout] --> /opt/rustwide/cargo-home/registry/src/index.crates.io-1949cf8c6b5b557f/traitgraph-algo-8.1.2/src/traversal/univocal_traversal.rs:11:40 [INFO] [stdout] | [INFO] [stdout] 11 | pub struct UnivocalIterator<'a, Graph: GraphBase, NeighborStrategy> { [INFO] [stdout] | ^^^^^^^^^ required by this bound in `UnivocalIterator` [INFO] [stdout] help: consider further restricting type parameter `Graph` with trait `GraphBase` [INFO] [stdout] | [INFO] [stdout] 7 | pub trait NodeOmnitigLikeExt + ?Sized>: [INFO] [stdout] | +++++++++++++++++++++++++++++++++++++++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0277]: the trait bound `Graph: bigraph::traitgraph::interface::NavigableGraph` is not satisfied [INFO] [stdout] --> src/walks.rs:183:13 [INFO] [stdout] | [INFO] [stdout] 182 | for node_or_edge in UnivocalIterator::new_forward_without_start( [INFO] [stdout] | ------------------------------------------- required by a bound introduced by this call [INFO] [stdout] 183 | graph, [INFO] [stdout] | ^^^^^ the trait `bigraph::traitgraph::interface::NavigableGraph` is not implemented for `Graph` [INFO] [stdout] | [INFO] [stdout] note: required by a bound in `UnivocalIterator::<'a, Graph, ForwardNeighborStrategy>::new_forward_without_start` [INFO] [stdout] --> /opt/rustwide/cargo-home/registry/src/index.crates.io-1949cf8c6b5b557f/traitgraph-algo-8.1.2/src/traversal/univocal_traversal.rs:47:17 [INFO] [stdout] | [INFO] [stdout] 47 | impl<'a, Graph: NavigableGraph> UnivocalIterator<'a, Graph, ForwardNeighborStrategy> [INFO] [stdout] | ^^^^^^^^^^^^^^ required by this bound in `UnivocalIterator::<'a, Graph, ForwardNeighborStrategy>::new_forward_without_start` [INFO] [stdout] ... [INFO] [stdout] 60 | pub fn new_forward_without_start( [INFO] [stdout] | ------------------------- required by a bound in this associated function [INFO] [stdout] help: consider further restricting type parameter `Graph` with trait `NavigableGraph` [INFO] [stdout] | [INFO] [stdout] 7 | pub trait NodeOmnitigLikeExt + ?Sized>: [INFO] [stdout] | ++++++++++++++++++++++++++++++++++++++++++++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0277]: the trait bound `Graph: bigraph::traitgraph::interface::GraphBase` is not satisfied [INFO] [stdout] --> src/walks.rs:182:29 [INFO] [stdout] | [INFO] [stdout] 182 | for node_or_edge in UnivocalIterator::new_forward_without_start( [INFO] [stdout] | _____________________________^ [INFO] [stdout] 183 | | graph, [INFO] [stdout] 184 | | NodeOrEdge::Node(*self.last().unwrap()), [INFO] [stdout] 185 | | ) { [INFO] [stdout] | |_________^ the trait `bigraph::traitgraph::interface::GraphBase` is not implemented for `Graph` [INFO] [stdout] | [INFO] [stdout] help: consider further restricting type parameter `Graph` with trait `GraphBase` [INFO] [stdout] | [INFO] [stdout] 7 | pub trait NodeOmnitigLikeExt + ?Sized>: [INFO] [stdout] | +++++++++++++++++++++++++++++++++++++++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0308]: mismatched types [INFO] [stdout] --> src/walks.rs:184:13 [INFO] [stdout] | [INFO] [stdout] 182 | for node_or_edge in UnivocalIterator::new_forward_without_start( [INFO] [stdout] | ------------------------------------------- arguments to this function are incorrect [INFO] [stdout] 183 | graph, [INFO] [stdout] 184 | NodeOrEdge::Node(*self.last().unwrap()), [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ expected `NodeOrEdge<_, _>`, found `NodeOrEdge<..., _>` [INFO] [stdout] | [INFO] [stdout] note: two different versions of crate `traitgraph` are being used; two types coming from two different versions of the same crate are different types even if they look the same [INFO] [stdout] --> /opt/rustwide/cargo-home/registry/src/index.crates.io-1949cf8c6b5b557f/traitgraph-5.0.0/src/interface/mod.rs:327:1 [INFO] [stdout] | [INFO] [stdout] 327 | pub enum NodeOrEdge { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ this is the found type `traitgraph::interface::NodeOrEdge` [INFO] [stdout] | [INFO] [stdout] ::: /opt/rustwide/cargo-home/registry/src/index.crates.io-1949cf8c6b5b557f/traitgraph-8.1.2/src/interface/mod.rs:327:1 [INFO] [stdout] | [INFO] [stdout] 327 | pub enum NodeOrEdge { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ this is the expected type `bigraph::traitgraph::interface::NodeOrEdge` [INFO] [stdout] | [INFO] [stdout] ::: src/macrotigs/macrotigs/default_macrotig_link_algorithm.rs:6:5 [INFO] [stdout] | [INFO] [stdout] 6 | use traitgraph_algo::traversal::univocal_traversal::is_edge_self_bivalent; [INFO] [stdout] | --------------- one version of crate `traitgraph` used here, as a dependency of crate `traitgraph_algo` [INFO] [stdout] | [INFO] [stdout] ::: src/hydrostructure/incremental_hydrostructure/mod.rs:9:5 [INFO] [stdout] | [INFO] [stdout] 9 | use traitgraph::implementation::subgraphs::incremental_subgraph::IncrementalSubgraph; [INFO] [stdout] | ---------- one version of crate `traitgraph` used here, as a direct dependency of the current crate [INFO] [stdout] = help: you can use `cargo tree` to explore your dependency tree [INFO] [stdout] note: associated function defined here [INFO] [stdout] --> /opt/rustwide/cargo-home/registry/src/index.crates.io-1949cf8c6b5b557f/traitgraph-algo-8.1.2/src/traversal/univocal_traversal.rs:60:12 [INFO] [stdout] | [INFO] [stdout] 60 | pub fn new_forward_without_start( [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] help: try wrapping the expression in a variant of `bigraph::traitgraph::interface::NodeOrEdge` [INFO] [stdout] | [INFO] [stdout] 184 | bigraph::traitgraph::interface::NodeOrEdge::Node(NodeOrEdge::Node(*self.last().unwrap())), [INFO] [stdout] | +++++++++++++++++++++++++++++++++++++++++++++++++ + [INFO] [stdout] 184 | bigraph::traitgraph::interface::NodeOrEdge::Edge(NodeOrEdge::Node(*self.last().unwrap())), [INFO] [stdout] | +++++++++++++++++++++++++++++++++++++++++++++++++ + [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0277]: the trait bound `Graph: bigraph::traitgraph::interface::NavigableGraph` is not satisfied [INFO] [stdout] --> src/walks.rs:182:29 [INFO] [stdout] | [INFO] [stdout] 182 | for node_or_edge in UnivocalIterator::new_forward_without_start( [INFO] [stdout] | _____________________________^ [INFO] [stdout] 183 | | graph, [INFO] [stdout] 184 | | NodeOrEdge::Node(*self.last().unwrap()), [INFO] [stdout] 185 | | ) { [INFO] [stdout] | |_________^ the trait `bigraph::traitgraph::interface::NavigableGraph` is not implemented for `Graph` [INFO] [stdout] | [INFO] [stdout] note: required by a bound in `UnivocalIterator<'a, Graph, ForwardNeighborStrategy>` [INFO] [stdout] --> /opt/rustwide/cargo-home/registry/src/index.crates.io-1949cf8c6b5b557f/traitgraph-algo-8.1.2/src/traversal/univocal_traversal.rs:47:17 [INFO] [stdout] | [INFO] [stdout] 47 | impl<'a, Graph: NavigableGraph> UnivocalIterator<'a, Graph, ForwardNeighborStrategy> [INFO] [stdout] | ^^^^^^^^^^^^^^ required by this bound in `UnivocalIterator<'a, Graph, ForwardNeighborStrategy>` [INFO] [stdout] help: consider further restricting type parameter `Graph` with trait `NavigableGraph` [INFO] [stdout] | [INFO] [stdout] 7 | pub trait NodeOmnitigLikeExt + ?Sized>: [INFO] [stdout] | ++++++++++++++++++++++++++++++++++++++++++++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0308]: mismatched types [INFO] [stdout] --> src/walks.rs:187:17 [INFO] [stdout] | [INFO] [stdout] 187 | NodeOrEdge::Node(node) => { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ expected `NodeOrEdge<_, _>`, found `traitgraph::interface::NodeOrEdge<_, _>` [INFO] [stdout] | [INFO] [stdout] note: two different versions of crate `traitgraph` are being used; two types coming from two different versions of the same crate are different types even if they look the same [INFO] [stdout] --> /opt/rustwide/cargo-home/registry/src/index.crates.io-1949cf8c6b5b557f/traitgraph-5.0.0/src/interface/mod.rs:327:1 [INFO] [stdout] | [INFO] [stdout] 327 | pub enum NodeOrEdge { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ this is the found type `traitgraph::interface::NodeOrEdge` [INFO] [stdout] | [INFO] [stdout] ::: /opt/rustwide/cargo-home/registry/src/index.crates.io-1949cf8c6b5b557f/traitgraph-8.1.2/src/interface/mod.rs:327:1 [INFO] [stdout] | [INFO] [stdout] 327 | pub enum NodeOrEdge { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ this is the expected type `bigraph::traitgraph::interface::NodeOrEdge` [INFO] [stdout] | [INFO] [stdout] ::: src/macrotigs/macrotigs/default_macrotig_link_algorithm.rs:6:5 [INFO] [stdout] | [INFO] [stdout] 6 | use traitgraph_algo::traversal::univocal_traversal::is_edge_self_bivalent; [INFO] [stdout] | --------------- one version of crate `traitgraph` used here, as a dependency of crate `traitgraph_algo` [INFO] [stdout] | [INFO] [stdout] ::: src/hydrostructure/incremental_hydrostructure/mod.rs:9:5 [INFO] [stdout] | [INFO] [stdout] 9 | use traitgraph::implementation::subgraphs::incremental_subgraph::IncrementalSubgraph; [INFO] [stdout] | ---------- one version of crate `traitgraph` used here, as a direct dependency of the current crate [INFO] [stdout] = help: you can use `cargo tree` to explore your dependency tree [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0308]: mismatched types [INFO] [stdout] --> src/walks.rs:195:17 [INFO] [stdout] | [INFO] [stdout] 195 | NodeOrEdge::Edge(_) => {} [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ expected `NodeOrEdge<_, _>`, found `traitgraph::interface::NodeOrEdge<_, _>` [INFO] [stdout] | [INFO] [stdout] note: two different versions of crate `traitgraph` are being used; two types coming from two different versions of the same crate are different types even if they look the same [INFO] [stdout] --> /opt/rustwide/cargo-home/registry/src/index.crates.io-1949cf8c6b5b557f/traitgraph-5.0.0/src/interface/mod.rs:327:1 [INFO] [stdout] | [INFO] [stdout] 327 | pub enum NodeOrEdge { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ this is the found type `traitgraph::interface::NodeOrEdge` [INFO] [stdout] | [INFO] [stdout] ::: /opt/rustwide/cargo-home/registry/src/index.crates.io-1949cf8c6b5b557f/traitgraph-8.1.2/src/interface/mod.rs:327:1 [INFO] [stdout] | [INFO] [stdout] 327 | pub enum NodeOrEdge { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ this is the expected type `bigraph::traitgraph::interface::NodeOrEdge` [INFO] [stdout] | [INFO] [stdout] ::: src/macrotigs/macrotigs/default_macrotig_link_algorithm.rs:6:5 [INFO] [stdout] | [INFO] [stdout] 6 | use traitgraph_algo::traversal::univocal_traversal::is_edge_self_bivalent; [INFO] [stdout] | --------------- one version of crate `traitgraph` used here, as a dependency of crate `traitgraph_algo` [INFO] [stdout] | [INFO] [stdout] ::: src/hydrostructure/incremental_hydrostructure/mod.rs:9:5 [INFO] [stdout] | [INFO] [stdout] 9 | use traitgraph::implementation::subgraphs::incremental_subgraph::IncrementalSubgraph; [INFO] [stdout] | ---------- one version of crate `traitgraph` used here, as a direct dependency of the current crate [INFO] [stdout] = help: you can use `cargo tree` to explore your dependency tree [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0277]: the trait bound `Graph: bigraph::traitgraph::interface::GraphBase` is not satisfied [INFO] [stdout] --> src/walks.rs:163:13 [INFO] [stdout] | [INFO] [stdout] 163 | NodeOrEdge::Node(*self.first().unwrap()), [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ the trait `bigraph::traitgraph::interface::GraphBase` is not implemented for `Graph` [INFO] [stdout] | [INFO] [stdout] help: consider further restricting type parameter `Graph` with trait `GraphBase` [INFO] [stdout] | [INFO] [stdout] 7 | pub trait NodeOmnitigLikeExt + ?Sized>: [INFO] [stdout] | +++++++++++++++++++++++++++++++++++++++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0277]: the trait bound `Graph: bigraph::traitgraph::interface::GraphBase` is not satisfied [INFO] [stdout] --> src/walks.rs:297:29 [INFO] [stdout] | [INFO] [stdout] 297 | for node_or_edge in UnivocalIterator::new_backward_without_start( [INFO] [stdout] | ^^^^^^^^^^^^^^^^ the trait `bigraph::traitgraph::interface::GraphBase` is not implemented for `Graph` [INFO] [stdout] | [INFO] [stdout] note: required by a bound in `UnivocalIterator` [INFO] [stdout] --> /opt/rustwide/cargo-home/registry/src/index.crates.io-1949cf8c6b5b557f/traitgraph-algo-8.1.2/src/traversal/univocal_traversal.rs:11:40 [INFO] [stdout] | [INFO] [stdout] 11 | pub struct UnivocalIterator<'a, Graph: GraphBase, NeighborStrategy> { [INFO] [stdout] | ^^^^^^^^^ required by this bound in `UnivocalIterator` [INFO] [stdout] help: consider further restricting type parameter `Graph` with trait `GraphBase` [INFO] [stdout] | [INFO] [stdout] 205 | pub trait EdgeOmnitigLikeExt + ?Sized>: [INFO] [stdout] | +++++++++++++++++++++++++++++++++++++++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0277]: the trait bound `Graph: bigraph::traitgraph::interface::NavigableGraph` is not satisfied [INFO] [stdout] --> src/walks.rs:298:13 [INFO] [stdout] | [INFO] [stdout] 297 | for node_or_edge in UnivocalIterator::new_backward_without_start( [INFO] [stdout] | -------------------------------------------- required by a bound introduced by this call [INFO] [stdout] 298 | graph, [INFO] [stdout] | ^^^^^ the trait `bigraph::traitgraph::interface::NavigableGraph` is not implemented for `Graph` [INFO] [stdout] | [INFO] [stdout] note: required by a bound in `UnivocalIterator::<'a, Graph, BackwardNeighborStrategy>::new_backward_without_start` [INFO] [stdout] --> /opt/rustwide/cargo-home/registry/src/index.crates.io-1949cf8c6b5b557f/traitgraph-algo-8.1.2/src/traversal/univocal_traversal.rs:68:17 [INFO] [stdout] | [INFO] [stdout] 68 | impl<'a, Graph: NavigableGraph> UnivocalIterator<'a, Graph, BackwardNeighborStrategy> [INFO] [stdout] | ^^^^^^^^^^^^^^ required by this bound in `UnivocalIterator::<'a, Graph, BackwardNeighborStrategy>::new_backward_without_start` [INFO] [stdout] ... [INFO] [stdout] 81 | pub fn new_backward_without_start( [INFO] [stdout] | -------------------------- required by a bound in this associated function [INFO] [stdout] help: consider further restricting type parameter `Graph` with trait `NavigableGraph` [INFO] [stdout] | [INFO] [stdout] 205 | pub trait EdgeOmnitigLikeExt + ?Sized>: [INFO] [stdout] | ++++++++++++++++++++++++++++++++++++++++++++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0277]: the trait bound `Graph: bigraph::traitgraph::interface::GraphBase` is not satisfied [INFO] [stdout] --> src/walks.rs:297:29 [INFO] [stdout] | [INFO] [stdout] 297 | for node_or_edge in UnivocalIterator::new_backward_without_start( [INFO] [stdout] | _____________________________^ [INFO] [stdout] 298 | | graph, [INFO] [stdout] 299 | | NodeOrEdge::Edge(*self.first().unwrap()), [INFO] [stdout] 300 | | ) { [INFO] [stdout] | |_________^ the trait `bigraph::traitgraph::interface::GraphBase` is not implemented for `Graph` [INFO] [stdout] | [INFO] [stdout] help: consider further restricting type parameter `Graph` with trait `GraphBase` [INFO] [stdout] | [INFO] [stdout] 205 | pub trait EdgeOmnitigLikeExt + ?Sized>: [INFO] [stdout] | +++++++++++++++++++++++++++++++++++++++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0308]: mismatched types [INFO] [stdout] --> src/walks.rs:299:13 [INFO] [stdout] | [INFO] [stdout] 297 | for node_or_edge in UnivocalIterator::new_backward_without_start( [INFO] [stdout] | -------------------------------------------- arguments to this function are incorrect [INFO] [stdout] 298 | graph, [INFO] [stdout] 299 | NodeOrEdge::Edge(*self.first().unwrap()), [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ expected `NodeOrEdge<_, _>`, found `NodeOrEdge<_, ...>` [INFO] [stdout] | [INFO] [stdout] note: two different versions of crate `traitgraph` are being used; two types coming from two different versions of the same crate are different types even if they look the same [INFO] [stdout] --> /opt/rustwide/cargo-home/registry/src/index.crates.io-1949cf8c6b5b557f/traitgraph-5.0.0/src/interface/mod.rs:327:1 [INFO] [stdout] | [INFO] [stdout] 327 | pub enum NodeOrEdge { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ this is the found type `traitgraph::interface::NodeOrEdge` [INFO] [stdout] | [INFO] [stdout] ::: /opt/rustwide/cargo-home/registry/src/index.crates.io-1949cf8c6b5b557f/traitgraph-8.1.2/src/interface/mod.rs:327:1 [INFO] [stdout] | [INFO] [stdout] 327 | pub enum NodeOrEdge { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ this is the expected type `bigraph::traitgraph::interface::NodeOrEdge` [INFO] [stdout] | [INFO] [stdout] ::: src/macrotigs/macrotigs/default_macrotig_link_algorithm.rs:6:5 [INFO] [stdout] | [INFO] [stdout] 6 | use traitgraph_algo::traversal::univocal_traversal::is_edge_self_bivalent; [INFO] [stdout] | --------------- one version of crate `traitgraph` used here, as a dependency of crate `traitgraph_algo` [INFO] [stdout] | [INFO] [stdout] ::: src/hydrostructure/incremental_hydrostructure/mod.rs:9:5 [INFO] [stdout] | [INFO] [stdout] 9 | use traitgraph::implementation::subgraphs::incremental_subgraph::IncrementalSubgraph; [INFO] [stdout] | ---------- one version of crate `traitgraph` used here, as a direct dependency of the current crate [INFO] [stdout] = help: you can use `cargo tree` to explore your dependency tree [INFO] [stdout] note: associated function defined here [INFO] [stdout] --> /opt/rustwide/cargo-home/registry/src/index.crates.io-1949cf8c6b5b557f/traitgraph-algo-8.1.2/src/traversal/univocal_traversal.rs:81:12 [INFO] [stdout] | [INFO] [stdout] 81 | pub fn new_backward_without_start( [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] help: try wrapping the expression in a variant of `bigraph::traitgraph::interface::NodeOrEdge` [INFO] [stdout] | [INFO] [stdout] 299 | bigraph::traitgraph::interface::NodeOrEdge::Node(NodeOrEdge::Edge(*self.first().unwrap())), [INFO] [stdout] | +++++++++++++++++++++++++++++++++++++++++++++++++ + [INFO] [stdout] 299 | bigraph::traitgraph::interface::NodeOrEdge::Edge(NodeOrEdge::Edge(*self.first().unwrap())), [INFO] [stdout] | +++++++++++++++++++++++++++++++++++++++++++++++++ + [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0277]: the trait bound `Graph: bigraph::traitgraph::interface::NavigableGraph` is not satisfied [INFO] [stdout] --> src/walks.rs:297:29 [INFO] [stdout] | [INFO] [stdout] 297 | for node_or_edge in UnivocalIterator::new_backward_without_start( [INFO] [stdout] | _____________________________^ [INFO] [stdout] 298 | | graph, [INFO] [stdout] 299 | | NodeOrEdge::Edge(*self.first().unwrap()), [INFO] [stdout] 300 | | ) { [INFO] [stdout] | |_________^ the trait `bigraph::traitgraph::interface::NavigableGraph` is not implemented for `Graph` [INFO] [stdout] | [INFO] [stdout] note: required by a bound in `UnivocalIterator<'a, Graph, BackwardNeighborStrategy>` [INFO] [stdout] --> /opt/rustwide/cargo-home/registry/src/index.crates.io-1949cf8c6b5b557f/traitgraph-algo-8.1.2/src/traversal/univocal_traversal.rs:68:17 [INFO] [stdout] | [INFO] [stdout] 68 | impl<'a, Graph: NavigableGraph> UnivocalIterator<'a, Graph, BackwardNeighborStrategy> [INFO] [stdout] | ^^^^^^^^^^^^^^ required by this bound in `UnivocalIterator<'a, Graph, BackwardNeighborStrategy>` [INFO] [stdout] help: consider further restricting type parameter `Graph` with trait `NavigableGraph` [INFO] [stdout] | [INFO] [stdout] 205 | pub trait EdgeOmnitigLikeExt + ?Sized>: [INFO] [stdout] | ++++++++++++++++++++++++++++++++++++++++++++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0308]: mismatched types [INFO] [stdout] --> src/walks.rs:302:17 [INFO] [stdout] | [INFO] [stdout] 302 | NodeOrEdge::Node(_) => {} [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ expected `NodeOrEdge<_, _>`, found `traitgraph::interface::NodeOrEdge<_, _>` [INFO] [stdout] | [INFO] [stdout] note: two different versions of crate `traitgraph` are being used; two types coming from two different versions of the same crate are different types even if they look the same [INFO] [stdout] --> /opt/rustwide/cargo-home/registry/src/index.crates.io-1949cf8c6b5b557f/traitgraph-5.0.0/src/interface/mod.rs:327:1 [INFO] [stdout] | [INFO] [stdout] 327 | pub enum NodeOrEdge { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ this is the found type `traitgraph::interface::NodeOrEdge` [INFO] [stdout] | [INFO] [stdout] ::: /opt/rustwide/cargo-home/registry/src/index.crates.io-1949cf8c6b5b557f/traitgraph-8.1.2/src/interface/mod.rs:327:1 [INFO] [stdout] | [INFO] [stdout] 327 | pub enum NodeOrEdge { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ this is the expected type `bigraph::traitgraph::interface::NodeOrEdge` [INFO] [stdout] | [INFO] [stdout] ::: src/macrotigs/macrotigs/default_macrotig_link_algorithm.rs:6:5 [INFO] [stdout] | [INFO] [stdout] 6 | use traitgraph_algo::traversal::univocal_traversal::is_edge_self_bivalent; [INFO] [stdout] | --------------- one version of crate `traitgraph` used here, as a dependency of crate `traitgraph_algo` [INFO] [stdout] | [INFO] [stdout] ::: src/hydrostructure/incremental_hydrostructure/mod.rs:9:5 [INFO] [stdout] | [INFO] [stdout] 9 | use traitgraph::implementation::subgraphs::incremental_subgraph::IncrementalSubgraph; [INFO] [stdout] | ---------- one version of crate `traitgraph` used here, as a direct dependency of the current crate [INFO] [stdout] = help: you can use `cargo tree` to explore your dependency tree [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0308]: mismatched types [INFO] [stdout] --> src/walks.rs:303:17 [INFO] [stdout] | [INFO] [stdout] 303 | NodeOrEdge::Edge(edge) => { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ expected `NodeOrEdge<_, _>`, found `traitgraph::interface::NodeOrEdge<_, _>` [INFO] [stdout] | [INFO] [stdout] note: two different versions of crate `traitgraph` are being used; two types coming from two different versions of the same crate are different types even if they look the same [INFO] [stdout] --> /opt/rustwide/cargo-home/registry/src/index.crates.io-1949cf8c6b5b557f/traitgraph-5.0.0/src/interface/mod.rs:327:1 [INFO] [stdout] | [INFO] [stdout] 327 | pub enum NodeOrEdge { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ this is the found type `traitgraph::interface::NodeOrEdge` [INFO] [stdout] | [INFO] [stdout] ::: /opt/rustwide/cargo-home/registry/src/index.crates.io-1949cf8c6b5b557f/traitgraph-8.1.2/src/interface/mod.rs:327:1 [INFO] [stdout] | [INFO] [stdout] 327 | pub enum NodeOrEdge { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ this is the expected type `bigraph::traitgraph::interface::NodeOrEdge` [INFO] [stdout] | [INFO] [stdout] ::: src/macrotigs/macrotigs/default_macrotig_link_algorithm.rs:6:5 [INFO] [stdout] | [INFO] [stdout] 6 | use traitgraph_algo::traversal::univocal_traversal::is_edge_self_bivalent; [INFO] [stdout] | --------------- one version of crate `traitgraph` used here, as a dependency of crate `traitgraph_algo` [INFO] [stdout] | [INFO] [stdout] ::: src/hydrostructure/incremental_hydrostructure/mod.rs:9:5 [INFO] [stdout] | [INFO] [stdout] 9 | use traitgraph::implementation::subgraphs::incremental_subgraph::IncrementalSubgraph; [INFO] [stdout] | ---------- one version of crate `traitgraph` used here, as a direct dependency of the current crate [INFO] [stdout] = help: you can use `cargo tree` to explore your dependency tree [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0277]: the trait bound `Graph: bigraph::traitgraph::interface::GraphBase` is not satisfied [INFO] [stdout] --> src/walks.rs:317:29 [INFO] [stdout] | [INFO] [stdout] 317 | for node_or_edge in UnivocalIterator::new_forward_without_start( [INFO] [stdout] | ^^^^^^^^^^^^^^^^ the trait `bigraph::traitgraph::interface::GraphBase` is not implemented for `Graph` [INFO] [stdout] | [INFO] [stdout] note: required by a bound in `UnivocalIterator` [INFO] [stdout] --> /opt/rustwide/cargo-home/registry/src/index.crates.io-1949cf8c6b5b557f/traitgraph-algo-8.1.2/src/traversal/univocal_traversal.rs:11:40 [INFO] [stdout] | [INFO] [stdout] 11 | pub struct UnivocalIterator<'a, Graph: GraphBase, NeighborStrategy> { [INFO] [stdout] | ^^^^^^^^^ required by this bound in `UnivocalIterator` [INFO] [stdout] help: consider further restricting type parameter `Graph` with trait `GraphBase` [INFO] [stdout] | [INFO] [stdout] 205 | pub trait EdgeOmnitigLikeExt + ?Sized>: [INFO] [stdout] | +++++++++++++++++++++++++++++++++++++++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0277]: the trait bound `Graph: bigraph::traitgraph::interface::NavigableGraph` is not satisfied [INFO] [stdout] --> src/walks.rs:318:13 [INFO] [stdout] | [INFO] [stdout] 317 | for node_or_edge in UnivocalIterator::new_forward_without_start( [INFO] [stdout] | ------------------------------------------- required by a bound introduced by this call [INFO] [stdout] 318 | graph, [INFO] [stdout] | ^^^^^ the trait `bigraph::traitgraph::interface::NavigableGraph` is not implemented for `Graph` [INFO] [stdout] | [INFO] [stdout] note: required by a bound in `UnivocalIterator::<'a, Graph, ForwardNeighborStrategy>::new_forward_without_start` [INFO] [stdout] --> /opt/rustwide/cargo-home/registry/src/index.crates.io-1949cf8c6b5b557f/traitgraph-algo-8.1.2/src/traversal/univocal_traversal.rs:47:17 [INFO] [stdout] | [INFO] [stdout] 47 | impl<'a, Graph: NavigableGraph> UnivocalIterator<'a, Graph, ForwardNeighborStrategy> [INFO] [stdout] | ^^^^^^^^^^^^^^ required by this bound in `UnivocalIterator::<'a, Graph, ForwardNeighborStrategy>::new_forward_without_start` [INFO] [stdout] ... [INFO] [stdout] 60 | pub fn new_forward_without_start( [INFO] [stdout] | ------------------------- required by a bound in this associated function [INFO] [stdout] help: consider further restricting type parameter `Graph` with trait `NavigableGraph` [INFO] [stdout] | [INFO] [stdout] 205 | pub trait EdgeOmnitigLikeExt + ?Sized>: [INFO] [stdout] | ++++++++++++++++++++++++++++++++++++++++++++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0277]: the trait bound `Graph: bigraph::traitgraph::interface::GraphBase` is not satisfied [INFO] [stdout] --> src/walks.rs:317:29 [INFO] [stdout] | [INFO] [stdout] 317 | for node_or_edge in UnivocalIterator::new_forward_without_start( [INFO] [stdout] | _____________________________^ [INFO] [stdout] 318 | | graph, [INFO] [stdout] 319 | | NodeOrEdge::Edge(*self.last().unwrap()), [INFO] [stdout] 320 | | ) { [INFO] [stdout] | |_________^ the trait `bigraph::traitgraph::interface::GraphBase` is not implemented for `Graph` [INFO] [stdout] | [INFO] [stdout] help: consider further restricting type parameter `Graph` with trait `GraphBase` [INFO] [stdout] | [INFO] [stdout] 205 | pub trait EdgeOmnitigLikeExt + ?Sized>: [INFO] [stdout] | +++++++++++++++++++++++++++++++++++++++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0308]: mismatched types [INFO] [stdout] --> src/walks.rs:319:13 [INFO] [stdout] | [INFO] [stdout] 317 | for node_or_edge in UnivocalIterator::new_forward_without_start( [INFO] [stdout] | ------------------------------------------- arguments to this function are incorrect [INFO] [stdout] 318 | graph, [INFO] [stdout] 319 | NodeOrEdge::Edge(*self.last().unwrap()), [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ expected `NodeOrEdge<_, _>`, found `NodeOrEdge<_, ...>` [INFO] [stdout] | [INFO] [stdout] note: two different versions of crate `traitgraph` are being used; two types coming from two different versions of the same crate are different types even if they look the same [INFO] [stdout] --> /opt/rustwide/cargo-home/registry/src/index.crates.io-1949cf8c6b5b557f/traitgraph-5.0.0/src/interface/mod.rs:327:1 [INFO] [stdout] | [INFO] [stdout] 327 | pub enum NodeOrEdge { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ this is the found type `traitgraph::interface::NodeOrEdge` [INFO] [stdout] | [INFO] [stdout] ::: /opt/rustwide/cargo-home/registry/src/index.crates.io-1949cf8c6b5b557f/traitgraph-8.1.2/src/interface/mod.rs:327:1 [INFO] [stdout] | [INFO] [stdout] 327 | pub enum NodeOrEdge { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ this is the expected type `bigraph::traitgraph::interface::NodeOrEdge` [INFO] [stdout] | [INFO] [stdout] ::: src/macrotigs/macrotigs/default_macrotig_link_algorithm.rs:6:5 [INFO] [stdout] | [INFO] [stdout] 6 | use traitgraph_algo::traversal::univocal_traversal::is_edge_self_bivalent; [INFO] [stdout] | --------------- one version of crate `traitgraph` used here, as a dependency of crate `traitgraph_algo` [INFO] [stdout] | [INFO] [stdout] ::: src/hydrostructure/incremental_hydrostructure/mod.rs:9:5 [INFO] [stdout] | [INFO] [stdout] 9 | use traitgraph::implementation::subgraphs::incremental_subgraph::IncrementalSubgraph; [INFO] [stdout] | ---------- one version of crate `traitgraph` used here, as a direct dependency of the current crate [INFO] [stdout] = help: you can use `cargo tree` to explore your dependency tree [INFO] [stdout] note: associated function defined here [INFO] [stdout] --> /opt/rustwide/cargo-home/registry/src/index.crates.io-1949cf8c6b5b557f/traitgraph-algo-8.1.2/src/traversal/univocal_traversal.rs:60:12 [INFO] [stdout] | [INFO] [stdout] 60 | pub fn new_forward_without_start( [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] help: try wrapping the expression in a variant of `bigraph::traitgraph::interface::NodeOrEdge` [INFO] [stdout] | [INFO] [stdout] 319 | bigraph::traitgraph::interface::NodeOrEdge::Node(NodeOrEdge::Edge(*self.last().unwrap())), [INFO] [stdout] | +++++++++++++++++++++++++++++++++++++++++++++++++ + [INFO] [stdout] 319 | bigraph::traitgraph::interface::NodeOrEdge::Edge(NodeOrEdge::Edge(*self.last().unwrap())), [INFO] [stdout] | +++++++++++++++++++++++++++++++++++++++++++++++++ + [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0277]: the trait bound `Graph: bigraph::traitgraph::interface::NavigableGraph` is not satisfied [INFO] [stdout] --> src/walks.rs:317:29 [INFO] [stdout] | [INFO] [stdout] 317 | for node_or_edge in UnivocalIterator::new_forward_without_start( [INFO] [stdout] | _____________________________^ [INFO] [stdout] 318 | | graph, [INFO] [stdout] 319 | | NodeOrEdge::Edge(*self.last().unwrap()), [INFO] [stdout] 320 | | ) { [INFO] [stdout] | |_________^ the trait `bigraph::traitgraph::interface::NavigableGraph` is not implemented for `Graph` [INFO] [stdout] | [INFO] [stdout] note: required by a bound in `UnivocalIterator<'a, Graph, ForwardNeighborStrategy>` [INFO] [stdout] --> /opt/rustwide/cargo-home/registry/src/index.crates.io-1949cf8c6b5b557f/traitgraph-algo-8.1.2/src/traversal/univocal_traversal.rs:47:17 [INFO] [stdout] | [INFO] [stdout] 47 | impl<'a, Graph: NavigableGraph> UnivocalIterator<'a, Graph, ForwardNeighborStrategy> [INFO] [stdout] | ^^^^^^^^^^^^^^ required by this bound in `UnivocalIterator<'a, Graph, ForwardNeighborStrategy>` [INFO] [stdout] help: consider further restricting type parameter `Graph` with trait `NavigableGraph` [INFO] [stdout] | [INFO] [stdout] 205 | pub trait EdgeOmnitigLikeExt + ?Sized>: [INFO] [stdout] | ++++++++++++++++++++++++++++++++++++++++++++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0308]: mismatched types [INFO] [stdout] --> src/walks.rs:322:17 [INFO] [stdout] | [INFO] [stdout] 322 | NodeOrEdge::Node(_) => {} [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ expected `NodeOrEdge<_, _>`, found `traitgraph::interface::NodeOrEdge<_, _>` [INFO] [stdout] | [INFO] [stdout] note: two different versions of crate `traitgraph` are being used; two types coming from two different versions of the same crate are different types even if they look the same [INFO] [stdout] --> /opt/rustwide/cargo-home/registry/src/index.crates.io-1949cf8c6b5b557f/traitgraph-5.0.0/src/interface/mod.rs:327:1 [INFO] [stdout] | [INFO] [stdout] 327 | pub enum NodeOrEdge { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ this is the found type `traitgraph::interface::NodeOrEdge` [INFO] [stdout] | [INFO] [stdout] ::: /opt/rustwide/cargo-home/registry/src/index.crates.io-1949cf8c6b5b557f/traitgraph-8.1.2/src/interface/mod.rs:327:1 [INFO] [stdout] | [INFO] [stdout] 327 | pub enum NodeOrEdge { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ this is the expected type `bigraph::traitgraph::interface::NodeOrEdge` [INFO] [stdout] | [INFO] [stdout] ::: src/macrotigs/macrotigs/default_macrotig_link_algorithm.rs:6:5 [INFO] [stdout] | [INFO] [stdout] 6 | use traitgraph_algo::traversal::univocal_traversal::is_edge_self_bivalent; [INFO] [stdout] | --------------- one version of crate `traitgraph` used here, as a dependency of crate `traitgraph_algo` [INFO] [stdout] | [INFO] [stdout] ::: src/hydrostructure/incremental_hydrostructure/mod.rs:9:5 [INFO] [stdout] | [INFO] [stdout] 9 | use traitgraph::implementation::subgraphs::incremental_subgraph::IncrementalSubgraph; [INFO] [stdout] | ---------- one version of crate `traitgraph` used here, as a direct dependency of the current crate [INFO] [stdout] = help: you can use `cargo tree` to explore your dependency tree [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0308]: mismatched types [INFO] [stdout] --> src/walks.rs:323:17 [INFO] [stdout] | [INFO] [stdout] 323 | NodeOrEdge::Edge(edge) => { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ expected `NodeOrEdge<_, _>`, found `traitgraph::interface::NodeOrEdge<_, _>` [INFO] [stdout] | [INFO] [stdout] note: two different versions of crate `traitgraph` are being used; two types coming from two different versions of the same crate are different types even if they look the same [INFO] [stdout] --> /opt/rustwide/cargo-home/registry/src/index.crates.io-1949cf8c6b5b557f/traitgraph-5.0.0/src/interface/mod.rs:327:1 [INFO] [stdout] | [INFO] [stdout] 327 | pub enum NodeOrEdge { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ this is the found type `traitgraph::interface::NodeOrEdge` [INFO] [stdout] | [INFO] [stdout] ::: /opt/rustwide/cargo-home/registry/src/index.crates.io-1949cf8c6b5b557f/traitgraph-8.1.2/src/interface/mod.rs:327:1 [INFO] [stdout] | [INFO] [stdout] 327 | pub enum NodeOrEdge { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ this is the expected type `bigraph::traitgraph::interface::NodeOrEdge` [INFO] [stdout] | [INFO] [stdout] ::: src/macrotigs/macrotigs/default_macrotig_link_algorithm.rs:6:5 [INFO] [stdout] | [INFO] [stdout] 6 | use traitgraph_algo::traversal::univocal_traversal::is_edge_self_bivalent; [INFO] [stdout] | --------------- one version of crate `traitgraph` used here, as a dependency of crate `traitgraph_algo` [INFO] [stdout] | [INFO] [stdout] ::: src/hydrostructure/incremental_hydrostructure/mod.rs:9:5 [INFO] [stdout] | [INFO] [stdout] 9 | use traitgraph::implementation::subgraphs::incremental_subgraph::IncrementalSubgraph; [INFO] [stdout] | ---------- one version of crate `traitgraph` used here, as a direct dependency of the current crate [INFO] [stdout] = help: you can use `cargo tree` to explore your dependency tree [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0277]: the trait bound `Graph: bigraph::traitgraph::interface::GraphBase` is not satisfied [INFO] [stdout] --> src/walks.rs:299:13 [INFO] [stdout] | [INFO] [stdout] 299 | NodeOrEdge::Edge(*self.first().unwrap()), [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ the trait `bigraph::traitgraph::interface::GraphBase` is not implemented for `Graph` [INFO] [stdout] | [INFO] [stdout] help: consider further restricting type parameter `Graph` with trait `GraphBase` [INFO] [stdout] | [INFO] [stdout] 205 | pub trait EdgeOmnitigLikeExt + ?Sized>: [INFO] [stdout] | +++++++++++++++++++++++++++++++++++++++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0277]: the trait bound `Graph: bigraph::traitgraph::interface::GraphBase` is not satisfied [INFO] [stdout] --> src/walks.rs:356:29 [INFO] [stdout] | [INFO] [stdout] 356 | for node_or_edge in UnivocalIterator::new_backward_without_start( [INFO] [stdout] | ^^^^^^^^^^^^^^^^ the trait `bigraph::traitgraph::interface::GraphBase` is not implemented for `Graph` [INFO] [stdout] | [INFO] [stdout] note: required by a bound in `UnivocalIterator` [INFO] [stdout] --> /opt/rustwide/cargo-home/registry/src/index.crates.io-1949cf8c6b5b557f/traitgraph-algo-8.1.2/src/traversal/univocal_traversal.rs:11:40 [INFO] [stdout] | [INFO] [stdout] 11 | pub struct UnivocalIterator<'a, Graph: GraphBase, NeighborStrategy> { [INFO] [stdout] | ^^^^^^^^^ required by this bound in `UnivocalIterator` [INFO] [stdout] help: consider further restricting type parameter `Graph` with trait `GraphBase` [INFO] [stdout] | [INFO] [stdout] 205 | pub trait EdgeOmnitigLikeExt + ?Sized>: [INFO] [stdout] | +++++++++++++++++++++++++++++++++++++++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0277]: the trait bound `Graph: bigraph::traitgraph::interface::NavigableGraph` is not satisfied [INFO] [stdout] --> src/walks.rs:357:13 [INFO] [stdout] | [INFO] [stdout] 356 | for node_or_edge in UnivocalIterator::new_backward_without_start( [INFO] [stdout] | -------------------------------------------- required by a bound introduced by this call [INFO] [stdout] 357 | graph, [INFO] [stdout] | ^^^^^ the trait `bigraph::traitgraph::interface::NavigableGraph` is not implemented for `Graph` [INFO] [stdout] | [INFO] [stdout] note: required by a bound in `UnivocalIterator::<'a, Graph, BackwardNeighborStrategy>::new_backward_without_start` [INFO] [stdout] --> /opt/rustwide/cargo-home/registry/src/index.crates.io-1949cf8c6b5b557f/traitgraph-algo-8.1.2/src/traversal/univocal_traversal.rs:68:17 [INFO] [stdout] | [INFO] [stdout] 68 | impl<'a, Graph: NavigableGraph> UnivocalIterator<'a, Graph, BackwardNeighborStrategy> [INFO] [stdout] | ^^^^^^^^^^^^^^ required by this bound in `UnivocalIterator::<'a, Graph, BackwardNeighborStrategy>::new_backward_without_start` [INFO] [stdout] ... [INFO] [stdout] 81 | pub fn new_backward_without_start( [INFO] [stdout] | -------------------------- required by a bound in this associated function [INFO] [stdout] help: consider further restricting type parameter `Graph` with trait `NavigableGraph` [INFO] [stdout] | [INFO] [stdout] 205 | pub trait EdgeOmnitigLikeExt + ?Sized>: [INFO] [stdout] | ++++++++++++++++++++++++++++++++++++++++++++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0277]: the trait bound `Graph: bigraph::traitgraph::interface::GraphBase` is not satisfied [INFO] [stdout] --> src/walks.rs:356:29 [INFO] [stdout] | [INFO] [stdout] 356 | for node_or_edge in UnivocalIterator::new_backward_without_start( [INFO] [stdout] | _____________________________^ [INFO] [stdout] 357 | | graph, [INFO] [stdout] 358 | | NodeOrEdge::Edge(*self.first().unwrap()), [INFO] [stdout] 359 | | ) { [INFO] [stdout] | |_________^ the trait `bigraph::traitgraph::interface::GraphBase` is not implemented for `Graph` [INFO] [stdout] | [INFO] [stdout] help: consider further restricting type parameter `Graph` with trait `GraphBase` [INFO] [stdout] | [INFO] [stdout] 205 | pub trait EdgeOmnitigLikeExt + ?Sized>: [INFO] [stdout] | +++++++++++++++++++++++++++++++++++++++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0308]: mismatched types [INFO] [stdout] --> src/walks.rs:358:13 [INFO] [stdout] | [INFO] [stdout] 356 | for node_or_edge in UnivocalIterator::new_backward_without_start( [INFO] [stdout] | -------------------------------------------- arguments to this function are incorrect [INFO] [stdout] 357 | graph, [INFO] [stdout] 358 | NodeOrEdge::Edge(*self.first().unwrap()), [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ expected `NodeOrEdge<_, _>`, found `NodeOrEdge<_, ...>` [INFO] [stdout] | [INFO] [stdout] note: two different versions of crate `traitgraph` are being used; two types coming from two different versions of the same crate are different types even if they look the same [INFO] [stdout] --> /opt/rustwide/cargo-home/registry/src/index.crates.io-1949cf8c6b5b557f/traitgraph-5.0.0/src/interface/mod.rs:327:1 [INFO] [stdout] | [INFO] [stdout] 327 | pub enum NodeOrEdge { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ this is the found type `traitgraph::interface::NodeOrEdge` [INFO] [stdout] | [INFO] [stdout] ::: /opt/rustwide/cargo-home/registry/src/index.crates.io-1949cf8c6b5b557f/traitgraph-8.1.2/src/interface/mod.rs:327:1 [INFO] [stdout] | [INFO] [stdout] 327 | pub enum NodeOrEdge { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ this is the expected type `bigraph::traitgraph::interface::NodeOrEdge` [INFO] [stdout] | [INFO] [stdout] ::: src/macrotigs/macrotigs/default_macrotig_link_algorithm.rs:6:5 [INFO] [stdout] | [INFO] [stdout] 6 | use traitgraph_algo::traversal::univocal_traversal::is_edge_self_bivalent; [INFO] [stdout] | --------------- one version of crate `traitgraph` used here, as a dependency of crate `traitgraph_algo` [INFO] [stdout] | [INFO] [stdout] ::: src/hydrostructure/incremental_hydrostructure/mod.rs:9:5 [INFO] [stdout] | [INFO] [stdout] 9 | use traitgraph::implementation::subgraphs::incremental_subgraph::IncrementalSubgraph; [INFO] [stdout] | ---------- one version of crate `traitgraph` used here, as a direct dependency of the current crate [INFO] [stdout] = help: you can use `cargo tree` to explore your dependency tree [INFO] [stdout] note: associated function defined here [INFO] [stdout] --> /opt/rustwide/cargo-home/registry/src/index.crates.io-1949cf8c6b5b557f/traitgraph-algo-8.1.2/src/traversal/univocal_traversal.rs:81:12 [INFO] [stdout] | [INFO] [stdout] 81 | pub fn new_backward_without_start( [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] help: try wrapping the expression in a variant of `bigraph::traitgraph::interface::NodeOrEdge` [INFO] [stdout] | [INFO] [stdout] 358 | bigraph::traitgraph::interface::NodeOrEdge::Node(NodeOrEdge::Edge(*self.first().unwrap())), [INFO] [stdout] | +++++++++++++++++++++++++++++++++++++++++++++++++ + [INFO] [stdout] 358 | bigraph::traitgraph::interface::NodeOrEdge::Edge(NodeOrEdge::Edge(*self.first().unwrap())), [INFO] [stdout] | +++++++++++++++++++++++++++++++++++++++++++++++++ + [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0277]: the trait bound `Graph: bigraph::traitgraph::interface::NavigableGraph` is not satisfied [INFO] [stdout] --> src/walks.rs:356:29 [INFO] [stdout] | [INFO] [stdout] 356 | for node_or_edge in UnivocalIterator::new_backward_without_start( [INFO] [stdout] | _____________________________^ [INFO] [stdout] 357 | | graph, [INFO] [stdout] 358 | | NodeOrEdge::Edge(*self.first().unwrap()), [INFO] [stdout] 359 | | ) { [INFO] [stdout] | |_________^ the trait `bigraph::traitgraph::interface::NavigableGraph` is not implemented for `Graph` [INFO] [stdout] | [INFO] [stdout] note: required by a bound in `UnivocalIterator<'a, Graph, BackwardNeighborStrategy>` [INFO] [stdout] --> /opt/rustwide/cargo-home/registry/src/index.crates.io-1949cf8c6b5b557f/traitgraph-algo-8.1.2/src/traversal/univocal_traversal.rs:68:17 [INFO] [stdout] | [INFO] [stdout] 68 | impl<'a, Graph: NavigableGraph> UnivocalIterator<'a, Graph, BackwardNeighborStrategy> [INFO] [stdout] | ^^^^^^^^^^^^^^ required by this bound in `UnivocalIterator<'a, Graph, BackwardNeighborStrategy>` [INFO] [stdout] help: consider further restricting type parameter `Graph` with trait `NavigableGraph` [INFO] [stdout] | [INFO] [stdout] 205 | pub trait EdgeOmnitigLikeExt + ?Sized>: [INFO] [stdout] | ++++++++++++++++++++++++++++++++++++++++++++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0308]: mismatched types [INFO] [stdout] --> src/walks.rs:361:17 [INFO] [stdout] | [INFO] [stdout] 361 | NodeOrEdge::Node(_) => {} [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ expected `NodeOrEdge<_, _>`, found `traitgraph::interface::NodeOrEdge<_, _>` [INFO] [stdout] | [INFO] [stdout] note: two different versions of crate `traitgraph` are being used; two types coming from two different versions of the same crate are different types even if they look the same [INFO] [stdout] --> /opt/rustwide/cargo-home/registry/src/index.crates.io-1949cf8c6b5b557f/traitgraph-5.0.0/src/interface/mod.rs:327:1 [INFO] [stdout] | [INFO] [stdout] 327 | pub enum NodeOrEdge { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ this is the found type `traitgraph::interface::NodeOrEdge` [INFO] [stdout] | [INFO] [stdout] ::: /opt/rustwide/cargo-home/registry/src/index.crates.io-1949cf8c6b5b557f/traitgraph-8.1.2/src/interface/mod.rs:327:1 [INFO] [stdout] | [INFO] [stdout] 327 | pub enum NodeOrEdge { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ this is the expected type `bigraph::traitgraph::interface::NodeOrEdge` [INFO] [stdout] | [INFO] [stdout] ::: src/macrotigs/macrotigs/default_macrotig_link_algorithm.rs:6:5 [INFO] [stdout] | [INFO] [stdout] 6 | use traitgraph_algo::traversal::univocal_traversal::is_edge_self_bivalent; [INFO] [stdout] | --------------- one version of crate `traitgraph` used here, as a dependency of crate `traitgraph_algo` [INFO] [stdout] | [INFO] [stdout] ::: src/hydrostructure/incremental_hydrostructure/mod.rs:9:5 [INFO] [stdout] | [INFO] [stdout] 9 | use traitgraph::implementation::subgraphs::incremental_subgraph::IncrementalSubgraph; [INFO] [stdout] | ---------- one version of crate `traitgraph` used here, as a direct dependency of the current crate [INFO] [stdout] = help: you can use `cargo tree` to explore your dependency tree [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0308]: mismatched types [INFO] [stdout] --> src/walks.rs:362:17 [INFO] [stdout] | [INFO] [stdout] 362 | NodeOrEdge::Edge(edge) => { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ expected `NodeOrEdge<_, _>`, found `traitgraph::interface::NodeOrEdge<_, _>` [INFO] [stdout] | [INFO] [stdout] note: two different versions of crate `traitgraph` are being used; two types coming from two different versions of the same crate are different types even if they look the same [INFO] [stdout] --> /opt/rustwide/cargo-home/registry/src/index.crates.io-1949cf8c6b5b557f/traitgraph-5.0.0/src/interface/mod.rs:327:1 [INFO] [stdout] | [INFO] [stdout] 327 | pub enum NodeOrEdge { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ this is the found type `traitgraph::interface::NodeOrEdge` [INFO] [stdout] | [INFO] [stdout] ::: /opt/rustwide/cargo-home/registry/src/index.crates.io-1949cf8c6b5b557f/traitgraph-8.1.2/src/interface/mod.rs:327:1 [INFO] [stdout] | [INFO] [stdout] 327 | pub enum NodeOrEdge { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ this is the expected type `bigraph::traitgraph::interface::NodeOrEdge` [INFO] [stdout] | [INFO] [stdout] ::: src/macrotigs/macrotigs/default_macrotig_link_algorithm.rs:6:5 [INFO] [stdout] | [INFO] [stdout] 6 | use traitgraph_algo::traversal::univocal_traversal::is_edge_self_bivalent; [INFO] [stdout] | --------------- one version of crate `traitgraph` used here, as a dependency of crate `traitgraph_algo` [INFO] [stdout] | [INFO] [stdout] ::: src/hydrostructure/incremental_hydrostructure/mod.rs:9:5 [INFO] [stdout] | [INFO] [stdout] 9 | use traitgraph::implementation::subgraphs::incremental_subgraph::IncrementalSubgraph; [INFO] [stdout] | ---------- one version of crate `traitgraph` used here, as a direct dependency of the current crate [INFO] [stdout] = help: you can use `cargo tree` to explore your dependency tree [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0277]: the trait bound `Graph: bigraph::traitgraph::interface::GraphBase` is not satisfied [INFO] [stdout] --> src/walks.rs:376:29 [INFO] [stdout] | [INFO] [stdout] 376 | for node_or_edge in UnivocalIterator::new_forward_without_start( [INFO] [stdout] | ^^^^^^^^^^^^^^^^ the trait `bigraph::traitgraph::interface::GraphBase` is not implemented for `Graph` [INFO] [stdout] | [INFO] [stdout] note: required by a bound in `UnivocalIterator` [INFO] [stdout] --> /opt/rustwide/cargo-home/registry/src/index.crates.io-1949cf8c6b5b557f/traitgraph-algo-8.1.2/src/traversal/univocal_traversal.rs:11:40 [INFO] [stdout] | [INFO] [stdout] 11 | pub struct UnivocalIterator<'a, Graph: GraphBase, NeighborStrategy> { [INFO] [stdout] | ^^^^^^^^^ required by this bound in `UnivocalIterator` [INFO] [stdout] help: consider further restricting type parameter `Graph` with trait `GraphBase` [INFO] [stdout] | [INFO] [stdout] 205 | pub trait EdgeOmnitigLikeExt + ?Sized>: [INFO] [stdout] | +++++++++++++++++++++++++++++++++++++++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0277]: the trait bound `Graph: bigraph::traitgraph::interface::NavigableGraph` is not satisfied [INFO] [stdout] --> src/walks.rs:377:13 [INFO] [stdout] | [INFO] [stdout] 376 | for node_or_edge in UnivocalIterator::new_forward_without_start( [INFO] [stdout] | ------------------------------------------- required by a bound introduced by this call [INFO] [stdout] 377 | graph, [INFO] [stdout] | ^^^^^ the trait `bigraph::traitgraph::interface::NavigableGraph` is not implemented for `Graph` [INFO] [stdout] | [INFO] [stdout] note: required by a bound in `UnivocalIterator::<'a, Graph, ForwardNeighborStrategy>::new_forward_without_start` [INFO] [stdout] --> /opt/rustwide/cargo-home/registry/src/index.crates.io-1949cf8c6b5b557f/traitgraph-algo-8.1.2/src/traversal/univocal_traversal.rs:47:17 [INFO] [stdout] | [INFO] [stdout] 47 | impl<'a, Graph: NavigableGraph> UnivocalIterator<'a, Graph, ForwardNeighborStrategy> [INFO] [stdout] | ^^^^^^^^^^^^^^ required by this bound in `UnivocalIterator::<'a, Graph, ForwardNeighborStrategy>::new_forward_without_start` [INFO] [stdout] ... [INFO] [stdout] 60 | pub fn new_forward_without_start( [INFO] [stdout] | ------------------------- required by a bound in this associated function [INFO] [stdout] help: consider further restricting type parameter `Graph` with trait `NavigableGraph` [INFO] [stdout] | [INFO] [stdout] 205 | pub trait EdgeOmnitigLikeExt + ?Sized>: [INFO] [stdout] | ++++++++++++++++++++++++++++++++++++++++++++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0277]: the trait bound `Graph: bigraph::traitgraph::interface::GraphBase` is not satisfied [INFO] [stdout] --> src/walks.rs:376:29 [INFO] [stdout] | [INFO] [stdout] 376 | for node_or_edge in UnivocalIterator::new_forward_without_start( [INFO] [stdout] | _____________________________^ [INFO] [stdout] 377 | | graph, [INFO] [stdout] 378 | | NodeOrEdge::Edge(*self.last().unwrap()), [INFO] [stdout] 379 | | ) { [INFO] [stdout] | |_________^ the trait `bigraph::traitgraph::interface::GraphBase` is not implemented for `Graph` [INFO] [stdout] | [INFO] [stdout] help: consider further restricting type parameter `Graph` with trait `GraphBase` [INFO] [stdout] | [INFO] [stdout] 205 | pub trait EdgeOmnitigLikeExt + ?Sized>: [INFO] [stdout] | +++++++++++++++++++++++++++++++++++++++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0308]: mismatched types [INFO] [stdout] --> src/walks.rs:378:13 [INFO] [stdout] | [INFO] [stdout] 376 | for node_or_edge in UnivocalIterator::new_forward_without_start( [INFO] [stdout] | ------------------------------------------- arguments to this function are incorrect [INFO] [stdout] 377 | graph, [INFO] [stdout] 378 | NodeOrEdge::Edge(*self.last().unwrap()), [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ expected `NodeOrEdge<_, _>`, found `NodeOrEdge<_, ...>` [INFO] [stdout] | [INFO] [stdout] note: two different versions of crate `traitgraph` are being used; two types coming from two different versions of the same crate are different types even if they look the same [INFO] [stdout] --> /opt/rustwide/cargo-home/registry/src/index.crates.io-1949cf8c6b5b557f/traitgraph-5.0.0/src/interface/mod.rs:327:1 [INFO] [stdout] | [INFO] [stdout] 327 | pub enum NodeOrEdge { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ this is the found type `traitgraph::interface::NodeOrEdge` [INFO] [stdout] | [INFO] [stdout] ::: /opt/rustwide/cargo-home/registry/src/index.crates.io-1949cf8c6b5b557f/traitgraph-8.1.2/src/interface/mod.rs:327:1 [INFO] [stdout] | [INFO] [stdout] 327 | pub enum NodeOrEdge { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ this is the expected type `bigraph::traitgraph::interface::NodeOrEdge` [INFO] [stdout] | [INFO] [stdout] ::: src/macrotigs/macrotigs/default_macrotig_link_algorithm.rs:6:5 [INFO] [stdout] | [INFO] [stdout] 6 | use traitgraph_algo::traversal::univocal_traversal::is_edge_self_bivalent; [INFO] [stdout] | --------------- one version of crate `traitgraph` used here, as a dependency of crate `traitgraph_algo` [INFO] [stdout] | [INFO] [stdout] ::: src/hydrostructure/incremental_hydrostructure/mod.rs:9:5 [INFO] [stdout] | [INFO] [stdout] 9 | use traitgraph::implementation::subgraphs::incremental_subgraph::IncrementalSubgraph; [INFO] [stdout] | ---------- one version of crate `traitgraph` used here, as a direct dependency of the current crate [INFO] [stdout] = help: you can use `cargo tree` to explore your dependency tree [INFO] [stdout] note: associated function defined here [INFO] [stdout] --> /opt/rustwide/cargo-home/registry/src/index.crates.io-1949cf8c6b5b557f/traitgraph-algo-8.1.2/src/traversal/univocal_traversal.rs:60:12 [INFO] [stdout] | [INFO] [stdout] 60 | pub fn new_forward_without_start( [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] help: try wrapping the expression in a variant of `bigraph::traitgraph::interface::NodeOrEdge` [INFO] [stdout] | [INFO] [stdout] 378 | bigraph::traitgraph::interface::NodeOrEdge::Node(NodeOrEdge::Edge(*self.last().unwrap())), [INFO] [stdout] | +++++++++++++++++++++++++++++++++++++++++++++++++ + [INFO] [stdout] 378 | bigraph::traitgraph::interface::NodeOrEdge::Edge(NodeOrEdge::Edge(*self.last().unwrap())), [INFO] [stdout] | +++++++++++++++++++++++++++++++++++++++++++++++++ + [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0277]: the trait bound `Graph: bigraph::traitgraph::interface::NavigableGraph` is not satisfied [INFO] [stdout] --> src/walks.rs:376:29 [INFO] [stdout] | [INFO] [stdout] 376 | for node_or_edge in UnivocalIterator::new_forward_without_start( [INFO] [stdout] | _____________________________^ [INFO] [stdout] 377 | | graph, [INFO] [stdout] 378 | | NodeOrEdge::Edge(*self.last().unwrap()), [INFO] [stdout] 379 | | ) { [INFO] [stdout] | |_________^ the trait `bigraph::traitgraph::interface::NavigableGraph` is not implemented for `Graph` [INFO] [stdout] | [INFO] [stdout] note: required by a bound in `UnivocalIterator<'a, Graph, ForwardNeighborStrategy>` [INFO] [stdout] --> /opt/rustwide/cargo-home/registry/src/index.crates.io-1949cf8c6b5b557f/traitgraph-algo-8.1.2/src/traversal/univocal_traversal.rs:47:17 [INFO] [stdout] | [INFO] [stdout] 47 | impl<'a, Graph: NavigableGraph> UnivocalIterator<'a, Graph, ForwardNeighborStrategy> [INFO] [stdout] | ^^^^^^^^^^^^^^ required by this bound in `UnivocalIterator<'a, Graph, ForwardNeighborStrategy>` [INFO] [stdout] help: consider further restricting type parameter `Graph` with trait `NavigableGraph` [INFO] [stdout] | [INFO] [stdout] 205 | pub trait EdgeOmnitigLikeExt + ?Sized>: [INFO] [stdout] | ++++++++++++++++++++++++++++++++++++++++++++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0308]: mismatched types [INFO] [stdout] --> src/walks.rs:381:17 [INFO] [stdout] | [INFO] [stdout] 381 | NodeOrEdge::Node(_) => {} [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ expected `NodeOrEdge<_, _>`, found `traitgraph::interface::NodeOrEdge<_, _>` [INFO] [stdout] | [INFO] [stdout] note: two different versions of crate `traitgraph` are being used; two types coming from two different versions of the same crate are different types even if they look the same [INFO] [stdout] --> /opt/rustwide/cargo-home/registry/src/index.crates.io-1949cf8c6b5b557f/traitgraph-5.0.0/src/interface/mod.rs:327:1 [INFO] [stdout] | [INFO] [stdout] 327 | pub enum NodeOrEdge { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ this is the found type `traitgraph::interface::NodeOrEdge` [INFO] [stdout] | [INFO] [stdout] ::: /opt/rustwide/cargo-home/registry/src/index.crates.io-1949cf8c6b5b557f/traitgraph-8.1.2/src/interface/mod.rs:327:1 [INFO] [stdout] | [INFO] [stdout] 327 | pub enum NodeOrEdge { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ this is the expected type `bigraph::traitgraph::interface::NodeOrEdge` [INFO] [stdout] | [INFO] [stdout] ::: src/macrotigs/macrotigs/default_macrotig_link_algorithm.rs:6:5 [INFO] [stdout] | [INFO] [stdout] 6 | use traitgraph_algo::traversal::univocal_traversal::is_edge_self_bivalent; [INFO] [stdout] | --------------- one version of crate `traitgraph` used here, as a dependency of crate `traitgraph_algo` [INFO] [stdout] | [INFO] [stdout] ::: src/hydrostructure/incremental_hydrostructure/mod.rs:9:5 [INFO] [stdout] | [INFO] [stdout] 9 | use traitgraph::implementation::subgraphs::incremental_subgraph::IncrementalSubgraph; [INFO] [stdout] | ---------- one version of crate `traitgraph` used here, as a direct dependency of the current crate [INFO] [stdout] = help: you can use `cargo tree` to explore your dependency tree [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0308]: mismatched types [INFO] [stdout] --> src/walks.rs:382:17 [INFO] [stdout] | [INFO] [stdout] 382 | NodeOrEdge::Edge(edge) => { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ expected `NodeOrEdge<_, _>`, found `traitgraph::interface::NodeOrEdge<_, _>` [INFO] [stdout] | [INFO] [stdout] note: two different versions of crate `traitgraph` are being used; two types coming from two different versions of the same crate are different types even if they look the same [INFO] [stdout] --> /opt/rustwide/cargo-home/registry/src/index.crates.io-1949cf8c6b5b557f/traitgraph-5.0.0/src/interface/mod.rs:327:1 [INFO] [stdout] | [INFO] [stdout] 327 | pub enum NodeOrEdge { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ this is the found type `traitgraph::interface::NodeOrEdge` [INFO] [stdout] | [INFO] [stdout] ::: /opt/rustwide/cargo-home/registry/src/index.crates.io-1949cf8c6b5b557f/traitgraph-8.1.2/src/interface/mod.rs:327:1 [INFO] [stdout] | [INFO] [stdout] 327 | pub enum NodeOrEdge { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ this is the expected type `bigraph::traitgraph::interface::NodeOrEdge` [INFO] [stdout] | [INFO] [stdout] ::: src/macrotigs/macrotigs/default_macrotig_link_algorithm.rs:6:5 [INFO] [stdout] | [INFO] [stdout] 6 | use traitgraph_algo::traversal::univocal_traversal::is_edge_self_bivalent; [INFO] [stdout] | --------------- one version of crate `traitgraph` used here, as a dependency of crate `traitgraph_algo` [INFO] [stdout] | [INFO] [stdout] ::: src/hydrostructure/incremental_hydrostructure/mod.rs:9:5 [INFO] [stdout] | [INFO] [stdout] 9 | use traitgraph::implementation::subgraphs::incremental_subgraph::IncrementalSubgraph; [INFO] [stdout] | ---------- one version of crate `traitgraph` used here, as a direct dependency of the current crate [INFO] [stdout] = help: you can use `cargo tree` to explore your dependency tree [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0277]: the trait bound `Graph: bigraph::traitgraph::interface::GraphBase` is not satisfied [INFO] [stdout] --> src/walks.rs:358:13 [INFO] [stdout] | [INFO] [stdout] 358 | NodeOrEdge::Edge(*self.first().unwrap()), [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ the trait `bigraph::traitgraph::interface::GraphBase` is not implemented for `Graph` [INFO] [stdout] | [INFO] [stdout] help: consider further restricting type parameter `Graph` with trait `GraphBase` [INFO] [stdout] | [INFO] [stdout] 205 | pub trait EdgeOmnitigLikeExt + ?Sized>: [INFO] [stdout] | +++++++++++++++++++++++++++++++++++++++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] Some errors have detailed explanations: E0271, E0277, E0282, E0308, E0599. [INFO] [stdout] [INFO] [stdout] For more information about an error, try `rustc --explain E0271`. [INFO] [stdout] [INFO] [stderr] error: could not compile `omnitigs` (lib) due to 155 previous errors [INFO] running `Command { std: "docker" "inspect" "3cfe9ea6da5aa2bced1fb0cd333e57cc7a5e5d2ce9432555153d425e5a5663ee", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "3cfe9ea6da5aa2bced1fb0cd333e57cc7a5e5d2ce9432555153d425e5a5663ee", kill_on_drop: false }` [INFO] [stdout] 3cfe9ea6da5aa2bced1fb0cd333e57cc7a5e5d2ce9432555153d425e5a5663ee