vcsgraph 0.1.2__tar.gz → 0.3.3__tar.gz

{vcsgraph-0.1.2 → vcsgraph-0.3.3}/Cargo.lock

@@ -4,10 +4,11 @@ version = 4
 
 [[package]]
 name = "graph-py"
-version = "0.1.2"
+version = "0.3.3"
 dependencies = [
  "pyo3",
- "vcsgraph-graph",
+ "rustc-hash",
+ "vcs-graph",
 ]
 
 [[package]]
@@ -18,15 +19,15 @@ checksum = "2304e00983f87ffb38b55b444b5e3b60a884b5d30c0fca7d82fe33449bbe55ea"
 
 [[package]]
 name = "lazy_static"
-version = "1.5.0"
+version = "1.5.1"
 source = "registry+https://github.com/rust-lang/crates.io-index"
-checksum = "bbd2bcb4c963f2ddae06a2efc7e9f3591312473c50c6685e1f298068316e66fe"
+checksum = "20870f649af7073d53e38067b2a84312175d56ea15217e1b15bc83506ec50afb"
 
 [[package]]
 name = "libc"
-version = "0.2.183"
+version = "0.2.186"
 source = "registry+https://github.com/rust-lang/crates.io-index"
-checksum = "b5b646652bf6661599e1da8901b3b9522896f01e736bad5f723fe7a3a27f899d"
+checksum = "68ab91017fe16c622486840e4c83c9a37afeff978bd239b5293d61ece587de66"
 
 [[package]]
 name = "maplit"
@@ -57,9 +58,9 @@ dependencies = [
 
 [[package]]
 name = "pyo3"
-version = "0.28.2"
+version = "0.30.1"
 source = "registry+https://github.com/rust-lang/crates.io-index"
-checksum = "cf85e27e86080aafd5a22eae58a162e133a589551542b3e5cee4beb27e54f8e1"
+checksum = "229ca13b8a15bb0d1487b81ab975bfcd97513416499a8312011b6036e42e0de4"
 dependencies = [
  "libc",
  "once_cell",
@@ -71,18 +72,18 @@ dependencies = [
 
 [[package]]
 name = "pyo3-build-config"
-version = "0.28.2"
+version = "0.30.1"
 source = "registry+https://github.com/rust-lang/crates.io-index"
-checksum = "8bf94ee265674bf76c09fa430b0e99c26e319c945d96ca0d5a8215f31bf81cf7"
+checksum = "70130e2b6dd1ee589a8788026a429561ca5c40fa7a2fa7914c2282eddae24700"
 dependencies = [
  "target-lexicon",
 ]
 
 [[package]]
 name = "pyo3-ffi"
-version = "0.28.2"
+version = "0.30.1"
 source = "registry+https://github.com/rust-lang/crates.io-index"
-checksum = "491aa5fc66d8059dd44a75f4580a2962c1862a1c2945359db36f6c2818b748dc"
+checksum = "5e7ff73c555c286d212d4ce7e5fbda845a973c4f61bd5f160f5f2c3c2a04d1c4"
 dependencies = [
  "libc",
  "pyo3-build-config",
@@ -90,9 +91,9 @@ dependencies = [
 
 [[package]]
 name = "pyo3-macros"
-version = "0.28.2"
+version = "0.30.1"
 source = "registry+https://github.com/rust-lang/crates.io-index"
-checksum = "f5d671734e9d7a43449f8480f8b38115df67bef8d21f76837fa75ee7aaa5e52e"
+checksum = "c46d2e5862c7bb8207e3b639f713dda3c499933444784154c11d013c5a691b60"
 dependencies = [
  "proc-macro2",
  "pyo3-macros-backend",
@@ -102,13 +103,12 @@ dependencies = [
 
 [[package]]
 name = "pyo3-macros-backend"
-version = "0.28.2"
+version = "0.30.1"
 source = "registry+https://github.com/rust-lang/crates.io-index"
-checksum = "22faaa1ce6c430a1f71658760497291065e6450d7b5dc2bcf254d49f66ee700a"
+checksum = "38b89f066f2ae72a2aef52d1537ca2fcd104440ebfadee06e97aa90738a25b9b"
 dependencies = [
  "heck",
  "proc-macro2",
- "pyo3-build-config",
  "quote",
  "syn",
 ]
@@ -122,11 +122,17 @@ dependencies = [
  "proc-macro2",
 ]
 
+[[package]]
+name = "rustc-hash"
+version = "2.1.3"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "6b1e7f9a428571be2dc5bc0505c13fb6bf936822b894ec87abf8a08a4e51742d"
+
 [[package]]
 name = "syn"
-version = "2.0.117"
+version = "3.0.9"
 source = "registry+https://github.com/rust-lang/crates.io-index"
-checksum = "e665b8803e7b1d2a727f4023456bbbbe74da67099c585258af0ad9c5013b9b99"
+checksum = "d78c8dee4c7bf0e14673097256fed6142ce9d3b85a408189d07482442145823b"
 dependencies = [
  "proc-macro2",
  "quote",
@@ -146,10 +152,11 @@ source = "registry+https://github.com/rust-lang/crates.io-index"
 checksum = "e6e4313cd5fcd3dad5cafa179702e2b244f760991f45397d14d4ebf38247da75"
 
 [[package]]
-name = "vcsgraph-graph"
-version = "3.4.0"
+name = "vcs-graph"
+version = "3.6.0"
 dependencies = [
  "lazy_static",
  "maplit",
  "pyo3",
+ "rustc-hash",
 ]

{vcsgraph-0.1.2 → vcsgraph-0.3.3}/Cargo.toml

@@ -3,9 +3,9 @@ members = ["crates/*"]
 resolver = "2"
 
 [workspace.package]
-version = "0.1.2"
+version = "0.3.3"
 edition = "2021"
 rust-version = "1.60"
 
 [workspace.dependencies]
-pyo3 = { version = "=0.28" }
+pyo3 = { version = ">=0.28, <0.31" }

{vcsgraph-0.1.2/vcsgraph.egg-info → vcsgraph-0.3.3}/PKG-INFO

@@ -1,13 +1,13 @@
 Metadata-Version: 2.4
 Name: vcsgraph
-Version: 0.1.2
+Version: 0.3.3
 Summary: Graph algorithms for version control systems
-Requires-Python: >=3.9
+Requires-Python: >=3.10
 Description-Content-Type: text/markdown
 License-File: COPYING.txt
 Provides-Extra: dev
-Requires-Dist: mypy==1.19.1; extra == "dev"
-Requires-Dist: ruff==0.15.6; extra == "dev"
+Requires-Dist: mypy==2.4.0; extra == "dev"
+Requires-Dist: ruff==0.17.1; extra == "dev"
 Dynamic: license-file
 
 # vcsgraph
@@ -66,10 +66,10 @@ from vcsgraph import topo_sort
 
 # Define a graph as a list of (node, parents) tuples
 graph = [
-    (b'rev1', []),
-    (b'rev2', [b'rev1']),
-    (b'rev3', [b'rev1']),
-    (b'rev4', [b'rev2', b'rev3']),
+    (b"rev1", []),
+    (b"rev2", [b"rev1"]),
+    (b"rev3", [b"rev1"]),
+    (b"rev4", [b"rev2", b"rev3"]),
 ]
 
 # Sort nodes topologically (parents before children)
@@ -83,17 +83,17 @@ from vcsgraph import Graph, DictParentsProvider
 
 # Create a parents provider from a dictionary
 ancestry = {
-    b'rev1': (b'null:',),
-    b'rev2a': (b'rev1',),
-    b'rev2b': (b'rev1',),
-    b'rev3': (b'rev2a',),
-    b'rev4': (b'rev3', b'rev2b'),
+    b"rev1": (b"null:",),
+    b"rev2a": (b"rev1",),
+    b"rev2b": (b"rev1",),
+    b"rev3": (b"rev2a",),
+    b"rev4": (b"rev3", b"rev2b"),
 }
 parents_provider = DictParentsProvider(ancestry)
 
 # Create a graph and find merge bases
 graph = Graph(parents_provider)
-merge_base = graph.find_merge_base(b'rev2a', b'rev2b')
+merge_base = graph.find_merge_base(b"rev2a", b"rev2b")
 ```
 
 ### Working with Known Graphs
@@ -103,14 +103,14 @@ from vcsgraph import KnownGraph
 
 # Create a known graph from parent relationships
 parent_map = {
-    b'rev1': (b'null:',),
-    b'rev2': (b'rev1',),
-    b'rev3': (b'rev2',),
+    b"rev1": (b"null:",),
+    b"rev2": (b"rev1",),
+    b"rev3": (b"rev2",),
 }
 kg = KnownGraph(parent_map)
 
 # Get heads (revisions with no children)
-heads = kg.heads([b'rev1', b'rev2', b'rev3'])
+heads = kg.heads([b"rev1", b"rev2", b"rev3"])
 ```
 
 ## Performance

{vcsgraph-0.1.2 → vcsgraph-0.3.3}/README.md

@@ -54,10 +54,10 @@ from vcsgraph import topo_sort
 
 # Define a graph as a list of (node, parents) tuples
 graph = [
-    (b'rev1', []),
-    (b'rev2', [b'rev1']),
-    (b'rev3', [b'rev1']),
-    (b'rev4', [b'rev2', b'rev3']),
+    (b"rev1", []),
+    (b"rev2", [b"rev1"]),
+    (b"rev3", [b"rev1"]),
+    (b"rev4", [b"rev2", b"rev3"]),
 ]
 
 # Sort nodes topologically (parents before children)
@@ -71,17 +71,17 @@ from vcsgraph import Graph, DictParentsProvider
 
 # Create a parents provider from a dictionary
 ancestry = {
-    b'rev1': (b'null:',),
-    b'rev2a': (b'rev1',),
-    b'rev2b': (b'rev1',),
-    b'rev3': (b'rev2a',),
-    b'rev4': (b'rev3', b'rev2b'),
+    b"rev1": (b"null:",),
+    b"rev2a": (b"rev1",),
+    b"rev2b": (b"rev1",),
+    b"rev3": (b"rev2a",),
+    b"rev4": (b"rev3", b"rev2b"),
 }
 parents_provider = DictParentsProvider(ancestry)
 
 # Create a graph and find merge bases
 graph = Graph(parents_provider)
-merge_base = graph.find_merge_base(b'rev2a', b'rev2b')
+merge_base = graph.find_merge_base(b"rev2a", b"rev2b")
 ```
 
 ### Working with Known Graphs
@@ -91,14 +91,14 @@ from vcsgraph import KnownGraph
 
 # Create a known graph from parent relationships
 parent_map = {
-    b'rev1': (b'null:',),
-    b'rev2': (b'rev1',),
-    b'rev3': (b'rev2',),
+    b"rev1": (b"null:",),
+    b"rev2": (b"rev1",),
+    b"rev3": (b"rev2",),
 }
 kg = KnownGraph(parent_map)
 
 # Get heads (revisions with no children)
-heads = kg.heads([b'rev1', b'rev2', b'rev3'])
+heads = kg.heads([b"rev1", b"rev2", b"rev3"])
 ```
 
 ## Performance

vcsgraph-0.3.3/crates/graph/Cargo.toml

@@ -0,0 +1,25 @@
+[package]
+name = "vcs-graph"
+version = "3.6.0"
+authors = [ "Martin Packman <gzlist@googlemail.com>", "Jelmer Vernooij <jelmer@jelmer.uk>"]
+edition = "2021"
+description = "Graph algorithms for version control systems: topological sort, merge-aware sort, parent maps, and ancestry queries."
+license = "GPL-2.0-or-later"
+homepage = "https://www.breezy-vcs.org/"
+repository = "https://github.com/breezy-team/vcsgraph"
+readme = "README.md"
+keywords = ["vcs", "graph", "toposort", "dag", "breezy"]
+categories = ["algorithms", "data-structures"]
+
+[lib]
+
+[dependencies]
+lazy_static = "1.4.0"
+pyo3 = { workspace = true, optional = true }
+rustc-hash = "2"
+
+[dev-dependencies]
+maplit = "1.0.2"
+
+[features]
+pyo3 = ["dep:pyo3"]