Release 0.4.0 (#61)

Cargo.toml

@@ -1,6 +1,6 @@
 [package]
 name = "portgraph"
-version = "0.3.0"
+version = "0.4.0"
 license = "Apache-2.0"
 
 readme = "README.md"
@@ -21,7 +21,7 @@ path = "src/lib.rs"
 
 [dependencies]
 thiserror = "1.0.28"
-pyo3 = { version = "0.18.1", optional = true, features = [
+pyo3 = { version = "0.19", optional = true, features = [
     "multiple-pymethods",
 ] }
 bitvec = "1.0.1"
@@ -35,7 +35,7 @@ serde = ["dep:serde"]
 proptest = ["dep:proptest", "dep:rand"]
 
 [dev-dependencies]
-criterion = { version = "0.4.0", features = ["html_reports"] }
+criterion = { version = "0.5.1", features = ["html_reports"] }
 rmp-serde = "1.1.1"
 rstest = "0.17.0"
 

RELEASES.md

@@ -1,14 +1,34 @@
+## v0.4.0 (2023-06-06)
+
+### Added
+
+- `SecondaryMap::remove` method to drop stored ([#59][])
+- `PortGraph::link_offsets`  ([#58][])
+- Implemented `SecondaryMap` for `HashSet`s to efficiently store sparse flags for nodes and ports ([#62][])
+- Generalized the `Iterator` impl of `TopoSort` to any `SecondaryMap` ([#63][])
+
+### Changed
+
+- Changed the `PortGraph::set_num_ports` callback to give more information using a new `PortOperation` ([#57][])
+- Allows `PortGraph::link_ports` to connect ports in any order, as long as the directions are compatible ([#58][])
+
+  [#57]: https://github.com/CQCL/portgraph/issues/57
+  [#58]: https://github.com/CQCL/portgraph/issues/58
+  [#59]: https://github.com/CQCL/portgraph/issues/59
+  [#62]: https://github.com/CQCL/portgraph/issues/62
+  [#63]: https://github.com/CQCL/portgraph/issues/63
+
 ## v0.3.0 (2023-05-31)
 
 ### Breaking changes
 
-- Renamed `SecondaryMap` to `UnmanagedDenseMap` ([#52][])
+- Renamed `SecondaryMap` to `UnmanagedDenseMap` ([#51][])
 
 ### New features
 
-- Added a `SecondaryMap` generic trait, implemented by `UnmanagedDenseMap` and `BitVec` ([#52][])
+- Added a `SecondaryMap` generic trait, implemented by `UnmanagedDenseMap` and `BitVec` ([#51][])
 - Added a generic `Map : SecondaryMap` type parameter to the dominators and toposort algorithms,
-  allowing more efficient executions on partially explored graphs ([#52][])
+  allowing more efficient executions on partially explored graphs ([#51][])
 
 ### Fixes