graphcoding 0.2.0__tar.gz → 0.3.0__tar.gz

{graphcoding-0.2.0/src/graphcoding.egg-info → graphcoding-0.3.0}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: graphcoding
-Version: 0.2.0
+Version: 0.3.0
 Summary: Draw the graph of the system you want — then code until the repo matches. Future files and scheduled deletions are graph data; a drift gate blocks commits until code and declared design converge.
 Author: Mosab Sayyed
 License: MIT

{graphcoding-0.2.0 → graphcoding-0.3.0}/pyproject.toml

@@ -4,7 +4,7 @@ build-backend = "setuptools.build_meta"
 
 [project]
 name = "graphcoding"
-version = "0.2.0"
+version = "0.3.0"
 description = "Draw the graph of the system you want — then code until the repo matches. Future files and scheduled deletions are graph data; a drift gate blocks commits until code and declared design converge."
 readme = "README.md"
 requires-python = ">=3.9"

{graphcoding-0.2.0 → graphcoding-0.3.0}/src/graphcoding/__init__.py

@@ -3,4 +3,4 @@
 Query before you touch code. Design in the graph. Sync as you go.
 Drift is caught by tooling, not memory.
 """
-__version__ = "0.2.0"
+__version__ = "0.3.0"

{graphcoding-0.2.0 → graphcoding-0.3.0}/src/graphcoding/cli.py

@@ -326,7 +326,8 @@ def build_parser() -> argparse.ArgumentParser:
     s.add_argument("name", help="repo-relative path, path::Symbol, or an external "
                                 "name like db:orders / api:stripe (see external_prefixes)")
     s.add_argument("--summary", "-s", help="one line: what it will do")
-    s.add_argument("--type", "-t", default="CodeFile", choices=NODE_TYPES)
+    s.add_argument("--type", "-t", default="CodeFile",
+                   help=f"free-form; common: {', '.join(NODE_TYPES)}")
     s.add_argument("--edge", "-e", action="append",
                    help="TYPE:target (repeatable), e.g. -e IMPORTS:src/db.py")
     s.add_argument("--existing", action="store_true",

{graphcoding-0.2.0 → graphcoding-0.3.0}/src/graphcoding/store.py

@@ -21,6 +21,7 @@ from __future__ import annotations
 
 import json
 import os
+import re
 from dataclasses import dataclass, field
 
 NODE_TYPES = [
@@ -52,20 +53,20 @@ DEFAULT_CONFIG = {
     ],
     "ignore_tests": True,
     "scan_symbols": False,
-    # nodes whose names start with these prefixes describe architecture that
-    # is not a repo file — drift never expects one on disk:
-    #   db:     database objects (db:orders, db:settings::llm_provider)
-    #   mcp:    MCP servers and their tools (mcp:router::get_blast_radius)
-    #   svc:    deployed services / processes (svc:api-gateway)
-    #   queue:  queues / topics (queue:invoice-events)
-    #   api:    third-party APIs (api:stripe::charges)
-    #   ext:    anything else outside the repo
-    "external_prefixes": ["db:", "mcp:", "svc:", "queue:", "api:", "ext:"],
 }
 
+# The classification is OPEN and binary: a node is either CODE (a repo-relative
+# file path — scanned, drift-gated) or ANOTHER SYSTEM (any "scheme:" name —
+# declared, never expected on disk). Invent whatever schemes fit your world:
+# db:orders, mcp:router::search, svc:gateway, erp:sap::orders, team:payments,
+# sensor:plant-7. The scheme is yours; the lifecycle and edges are the same.
+_SCHEME = re.compile(r"^[A-Za-z][A-Za-z0-9_.+-]*:(?!//)")
 
-def is_external(name: str, cfg: dict) -> bool:
-    return any(name.startswith(p) for p in cfg.get("external_prefixes", []))
+
+def is_external(name: str, cfg: dict | None = None) -> bool:
+    """True for 'scheme:...' names (non-file architecture). File paths never
+    carry a scheme; URLs (scheme://) are also treated as external."""
+    return bool(_SCHEME.match(name)) or "://" in name
 
 
 @dataclass

{graphcoding-0.2.0 → graphcoding-0.3.0/src/graphcoding.egg-info}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: graphcoding
-Version: 0.2.0
+Version: 0.3.0
 Summary: Draw the graph of the system you want — then code until the repo matches. Future files and scheduled deletions are graph data; a drift gate blocks commits until code and declared design converge.
 Author: Mosab Sayyed
 License: MIT

{graphcoding-0.2.0 → graphcoding-0.3.0}/tests/test_e2e.py

@@ -238,6 +238,13 @@ def test_external_nodes_db_mcp(repo, capsys):
     g = Graph.load(repo)
     assert "mcp:router::search" not in g.nodes  # externals retire immediately
     run(repo, "drift", expect_exit=0)
+    # the classification is OPEN — any invented scheme and type work
+    run(repo, "plan", "erp:sap::orders", "--existing", "-t", "ErpObject",
+        "-s", "SAP order master; synced nightly")
+    run(repo, "link", "src/app.py", "REFERENCES", "erp:sap::orders")
+    run(repo, "drift", expect_exit=0)
+    g = Graph.load(repo)
+    assert g.nodes["erp:sap::orders"].type == "ErpObject"
 
 
 def test_graph_file_is_sorted_and_stable(repo):