Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Update portgraph requirement from 0.7.1 to 0.8.0 #410

Merged
merged 1 commit into from
Aug 15, 2023

Conversation

dependabot[bot]
Copy link
Contributor

@dependabot dependabot bot commented on behalf of github Aug 14, 2023

Updates the requirements on portgraph to permit the latest version.

Changelog

Sourced from portgraph's changelog.

v0.8.0 (2023-08-08)

Added

  • view::FilteredGraph for filtering both nodes and links of a graph (#100[])
  • view::SubGraph for views into non-hierarchical subgraphs (#100[])

Changed

  • view::NodeFiltered is now a specialized version of view::FilteredGraph. Its constructor has been renamed to NodeFiltered::new_node_filtered. (#100[])

    #100: CQCL/portgraph#100

v0.7.2 (2023-07-31)

Added

  • algorithms::ConvexChecker to check convexity property of subgraphs of LinkViews (#97[])

Changed

v0.7.1 (2023-07-13)

Fixed

v0.7.0 (2023-06-28)

Added

  • LinkMut::insert_graph to insert a full graph into an existing graph (#80[])
  • PortMut::swap_nodes to swap node indices (#83[])
  • Hierarchy::swap_nodes to swap node indices (#87[])
  • Debug and Default implementation for multiple iterators (#81[])

Removed

... (truncated)

Commits

Dependabot will resolve any conflicts with this PR as long as you don't alter it yourself. You can also trigger a rebase manually by commenting @dependabot rebase.


Dependabot commands and options

You can trigger Dependabot actions by commenting on this PR:

  • @dependabot rebase will rebase this PR
  • @dependabot recreate will recreate this PR, overwriting any edits that have been made to it
  • @dependabot merge will merge this PR after your CI passes on it
  • @dependabot squash and merge will squash and merge this PR after your CI passes on it
  • @dependabot cancel merge will cancel a previously requested merge and block automerging
  • @dependabot reopen will reopen this PR if it is closed
  • @dependabot close will close this PR and stop Dependabot recreating it. You can achieve the same result by closing it manually
  • @dependabot show <dependency name> ignore conditions will show all of the ignore conditions of the specified dependency
  • @dependabot ignore this major version will close this PR and stop Dependabot creating any more for this major version (unless you reopen the PR or upgrade to it yourself)
  • @dependabot ignore this minor version will close this PR and stop Dependabot creating any more for this minor version (unless you reopen the PR or upgrade to it yourself)
  • @dependabot ignore this dependency will close this PR and stop Dependabot creating any more for this dependency (unless you reopen the PR or upgrade to it yourself)

Updates the requirements on [portgraph](https://github.com/CQCL/portgraph) to permit the latest version.
- [Changelog](https://github.com/CQCL/portgraph/blob/main/RELEASES.md)
- [Commits](CQCL/portgraph@v0.7.1...v0.8.0)

---
updated-dependencies:
- dependency-name: portgraph
  dependency-type: direct:production
...

Signed-off-by: dependabot[bot] <[email protected]>
@dependabot dependabot bot added dependencies Pull requests that update a dependency file rust Pull requests that update Rust code labels Aug 14, 2023
@aborgna-q aborgna-q added this pull request to the merge queue Aug 15, 2023
Merged via the queue into main with commit 4399ca1 Aug 15, 2023
6 checks passed
@aborgna-q aborgna-q deleted the dependabot/cargo/portgraph-0.8.0 branch August 15, 2023 09:02
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
dependencies Pull requests that update a dependency file rust Pull requests that update Rust code
Projects
None yet
Development

Successfully merging this pull request may close these issues.

1 participant