gabion 0.1.0__py3-none-any.whl

gabion/synthesis/naming.py

@@ -0,0 +1,45 @@
+from __future__ import annotations
+
+import re
+from typing import Iterable
+
+from gabion.synthesis.model import NamingContext
+
+
+def _camelize(value: str) -> str:
+    parts = [p for p in re.split(r"[^a-zA-Z0-9]+", value) if p]
+    return "".join(p[:1].upper() + p[1:] for p in parts)
+
+
+def _normalize_identifier(value: str, fallback: str) -> str:
+    cleaned = re.sub(r"[^a-zA-Z0-9_]", "", value)
+    if not cleaned:
+        return fallback
+    if cleaned[0].isdigit():
+        return f"{fallback}{cleaned}"
+    return cleaned
+
+
+def suggest_name(fields: Iterable[str], context: NamingContext | None = None) -> str:
+    context = context or NamingContext()
+    field_list = [f for f in fields if f]
+    if not field_list:
+        base = context.fallback_prefix
+    else:
+        frequency = context.frequency
+        anchor = max(
+            sorted(field_list),
+            key=lambda name: (frequency.get(name, 0), len(name)),
+        )
+        base = _camelize(anchor) or context.fallback_prefix
+
+    base = f"{base}Bundle"
+    base = _normalize_identifier(base, context.fallback_prefix)
+
+    name = base
+    counter = 2
+    existing = set(context.existing_names)
+    while name in existing:
+        name = f"{base}{counter}"
+        counter += 1
+    return name

gabion/synthesis/protocols.py

@@ -0,0 +1,74 @@
+from __future__ import annotations
+
+from dataclasses import dataclass, field
+from typing import Dict, Iterable, List, Mapping, Set
+
+from gabion.synthesis.model import (
+    FieldSpec,
+    NamingContext,
+    ProtocolSpec,
+    SynthesisConfig,
+    SynthesisPlan,
+)
+from gabion.synthesis.naming import suggest_name
+
+
+@dataclass
+class Synthesizer:
+    config: SynthesisConfig = field(default_factory=SynthesisConfig)
+
+    def plan(
+        self,
+        bundle_tiers: Mapping[frozenset[str], int],
+        field_types: Mapping[str, str] | None = None,
+        naming_context: NamingContext | None = None,
+    ) -> SynthesisPlan:
+        field_types = field_types or {}
+        naming_context = naming_context or NamingContext()
+        protocols: List[ProtocolSpec] = []
+        warnings: List[str] = []
+
+        existing_names = set(naming_context.existing_names)
+        context = NamingContext(
+            existing_names=existing_names,
+            frequency=naming_context.frequency,
+            fallback_prefix=naming_context.fallback_prefix,
+        )
+
+        for bundle, tier in bundle_tiers.items():
+            bundle_set = set(bundle)
+            if not self._bundle_allowed(bundle_set, tier):
+                continue
+            name = suggest_name(bundle_set, context)
+            context.existing_names.add(name)
+            fields = self._build_fields(bundle_set, field_types)
+            protocols.append(
+                ProtocolSpec(
+                    name=name,
+                    fields=fields,
+                    bundle=bundle_set,
+                    tier=tier,
+                    rationale=f"Tier-{tier} bundle",
+                )
+            )
+
+        if not protocols:
+            warnings.append("No bundles qualified for synthesis.")
+
+        return SynthesisPlan(protocols=protocols, warnings=warnings, errors=[])
+
+    def _bundle_allowed(self, bundle: Set[str], tier: int) -> bool:
+        if not bundle:
+            return False
+        if len(bundle) < self.config.min_bundle_size and not self.config.allow_singletons:
+            return False
+        return tier <= self.config.max_tier
+
+    def _build_fields(
+        self, bundle: Iterable[str], field_types: Dict[str, str]
+    ) -> List[FieldSpec]:
+        fields: List[FieldSpec] = []
+        for name in sorted(bundle):
+            type_hint = field_types.get(name)
+            fields.append(FieldSpec(name=name, type_hint=type_hint, source_params={name}))
+        return fields

gabion/synthesis/schedule.py

@@ -0,0 +1,87 @@
+from __future__ import annotations
+
+from dataclasses import dataclass, field
+from typing import Dict, List, Set
+
+
+@dataclass(frozen=True)
+class ScheduleResult:
+    order: List[str] = field(default_factory=list)
+    cycles: List[Set[str]] = field(default_factory=list)
+
+
+def topological_schedule(graph: Dict[str, Set[str]]) -> ScheduleResult:
+    nodes: Set[str] = set(graph.keys())
+    for deps in graph.values():
+        nodes.update(deps)
+
+    incoming: Dict[str, Set[str]] = {node: set() for node in nodes}
+    outgoing: Dict[str, Set[str]] = {node: set() for node in nodes}
+
+    for node, deps in graph.items():
+        for dep in deps:
+            outgoing[dep].add(node)
+            incoming[node].add(dep)
+
+    ready = sorted(node for node, deps in incoming.items() if not deps)
+    order: List[str] = []
+
+    while ready:
+        node = ready.pop(0)
+        order.append(node)
+        for follower in sorted(outgoing[node]):
+            incoming[follower].discard(node)
+            if not incoming[follower]:
+                if follower not in ready and follower not in order:
+                    ready.append(follower)
+        ready.sort()
+
+    remaining = {node for node, deps in incoming.items() if deps}
+    cycles: List[Set[str]] = []
+    if remaining:
+        subgraph = {node: {dep for dep in graph.get(node, set()) if dep in remaining} for node in remaining}
+        cycles = _strongly_connected_components(subgraph)
+        cycles = [
+            comp
+            for comp in cycles
+            if len(comp) > 1 or any(node in subgraph.get(node, set()) for node in comp)
+        ]
+    return ScheduleResult(order=order, cycles=cycles)
+
+
+def _strongly_connected_components(graph: Dict[str, Set[str]]) -> List[Set[str]]:
+    index = 0
+    indices: Dict[str, int] = {}
+    lowlinks: Dict[str, int] = {}
+    stack: List[str] = []
+    on_stack: Set[str] = set()
+    components: List[Set[str]] = []
+
+    def visit(node: str) -> None:
+        nonlocal index
+        indices[node] = index
+        lowlinks[node] = index
+        index += 1
+        stack.append(node)
+        on_stack.add(node)
+        for neighbor in graph.get(node, set()):
+            if neighbor not in indices:
+                visit(neighbor)
+                lowlinks[node] = min(lowlinks[node], lowlinks[neighbor])
+            elif neighbor in on_stack:
+                lowlinks[node] = min(lowlinks[node], indices[neighbor])
+        if lowlinks[node] == indices[node]:
+            component: Set[str] = set()
+            while True:
+                popped = stack.pop()
+                on_stack.discard(popped)
+                component.add(popped)
+                if popped == node:
+                    break
+            components.append(component)
+
+    for node in graph:
+        if node not in indices:
+            visit(node)
+
+    return components

gabion-0.1.0.dist-info/METADATA

@@ -0,0 +1,250 @@
+Metadata-Version: 2.4
+Name: gabion
+Version: 0.1.0
+Summary: Architectural linter that stabilizes loose parameters into structural bundles.
+Project-URL: Repository, https://github.com/mikemol/gabion
+Project-URL: Issues, https://github.com/mikemol/gabion/issues
+Project-URL: Releases, https://github.com/mikemol/gabion/releases
+Author-email: Mike Mol <mikemol@gmail.com>
+License: Apache-2.0
+License-File: LICENSE
+Keywords: architecture,lint,linter,refactoring,static-analysis
+Classifier: Development Status :: 3 - Alpha
+Classifier: Intended Audience :: Developers
+Classifier: License :: OSI Approved :: Apache Software License
+Classifier: Programming Language :: Python :: 3 :: Only
+Classifier: Programming Language :: Python :: 3.11
+Classifier: Programming Language :: Python :: 3.12
+Classifier: Programming Language :: Python :: 3.13
+Classifier: Topic :: Software Development :: Quality Assurance
+Requires-Python: >=3.11
+Requires-Dist: libcst>=1.1
+Requires-Dist: pydantic>=2.5
+Requires-Dist: pygls>=1.3
+Requires-Dist: rich>=13.0
+Requires-Dist: typer>=0.9
+Description-Content-Type: text/markdown
+
+---
+doc_revision: 45
+reader_reintern: "Reader-only: re-intern if doc_revision changed since you last read this doc."
+doc_id: readme
+doc_role: readme
+doc_scope:
+  - repo
+  - overview
+  - tooling
+doc_authority: informative
+doc_requires:
+  - POLICY_SEED.md
+  - glossary.md
+  - AGENTS.md
+  - CONTRIBUTING.md
+doc_change_protocol: "POLICY_SEED.md §6"
+doc_erasure:
+  - formatting
+  - typos
+doc_owner: maintainer
+---
+
+# Gabion
+
+[![CI](https://github.com/mikemol/gabion/actions/workflows/ci.yml/badge.svg)](https://github.com/mikemol/gabion/actions/workflows/ci.yml)
+
+Gabion is an architectural linter that stabilizes loose parameters into
+structural bundles. It discovers recurring argument groups in a Python codebase
+and guides their reification into dataclass-based Protocols.
+
+This repo contains scaffolded infrastructure plus a prototype dataflow audit.
+Synthesis and refactoring exist as evolving prototypes and are intentionally
+conservative.
+
+## Why Gabion
+- **Find implicit structure:** detect “dataflow grammar” bundles that repeatedly
+  travel together across function boundaries.
+- **Refactor safely:** promote bundles into explicit dataclass Protocols.
+- **Govern meaning:** enforce semantics via a normative glossary.
+
+## Status
+- CLI uses the LSP server as its semantic core.
+- Dataflow grammar audit is implemented (prototype).
+- Type-flow, constant-flow, and unused-argument smells are implemented (prototype).
+- Refactor engine can rewrite signatures/call sites for targeted functions (prototype).
+- Governance layer is active.
+
+## Versioning (pre-1.0)
+Gabion is pre-1.0. Until a 1.0 release, minor version bumps (0.x) may include
+breaking changes; patch releases target fixes. Breaking changes will be called
+out in release notes.
+
+## Branching model
+- `stage` is the integration branch for routine pushes; CI runs on every push.
+- `main` is protected and receives changes via PRs from `stage`.
+- Merge commits are allowed; merges to `main` should be regular merges (no squash).
+- `stage` accumulates changes and may include merge commits from `main` as it stays in sync.
+
+## Convergence checklist
+Bottom-up convergence targets live in `docs/sppf_checklist.md`.
+
+## Governance addenda (optional)
+See `docs/doer_judge_witness.md` for optional role framing.
+
+## Non-goals (for now)
+- Docflow is a repo-local convenience feature, not a Gabion product feature.
+- Public-API compatibility shims for refactors are not yet implemented.
+- Multi-language support is out of scope (Python-first).
+
+## Quick start
+Install toolchain with `mise` (once):
+```
+mise install
+```
+
+Install from source (editable):
+```
+mise exec -- python -m pip install -e .
+```
+
+Install git hooks (optional):
+```
+scripts/install_hooks.sh
+```
+
+Commands below assume the package is installed (editable) or `PYTHONPATH=src`.
+
+Run the dataflow grammar audit (strict defaults):
+```
+mise exec -- python -m gabion check
+```
+`gabion check` enforces violations even without `--report` output.
+Use `--baseline path/to/baseline.txt` to ratchet existing violations and
+`--baseline-write` to generate/update the baseline file.
+
+Run the dataflow grammar audit (prototype):
+```
+mise exec -- python -m gabion dataflow-audit path/to/project
+```
+Repo defaults are driven by `gabion.toml` (see `[dataflow]`).
+By default, `in/` (inspiration) is excluded from enforcement there.
+Use `--synthesis-plan` to emit a JSON plan and `--synthesis-report` to append a
+summary section to the Markdown report. Use `--synthesis-protocols` to emit
+dataclass stubs (prototype) for review, or add
+`--synthesis-protocols-kind protocol` for typing.Protocol stubs.
+Use `--refactor-plan` to append a per-bundle refactoring schedule and
+`--refactor-plan-json` to emit the JSON plan.
+
+Generate protocol refactor edits (prototype):
+```
+mise exec -- python -m gabion refactor-protocol \
+  --protocol-name BundleProtocol \
+  --bundle a --bundle b \
+  --target-path path/to/module.py \
+  --target-function foo
+```
+
+Run audit + synthesis in one step (timestamped output under `artifacts/synthesis`):
+```
+mise exec -- python -m gabion synth path/to/project
+```
+
+Run the docflow audit (governance docs only):
+```
+mise exec -- python -m gabion docflow-audit
+```
+
+Note: docflow is a repo-local convenience feature. It is not a core Gabion
+capability and is not intended to generalize beyond this repository.
+
+Generate a synthesis plan from a JSON payload (prototype scaffolding):
+```
+mise exec -- python -m gabion synthesis-plan --input path/to/payload.json --output plan.json
+```
+Example payload:
+```json
+{
+  "bundles": [
+    { "bundle": ["ctx", "config"], "tier": 2 }
+  ],
+  "field_types": {
+    "ctx": "Context",
+    "config": "Config"
+  }
+}
+```
+Payload schema: `docs/synthesis_payload.md`.
+
+Capture an audit snapshot (reports + DOT graph under `artifacts/`):
+```
+scripts/audit_snapshot.sh
+```
+Snapshots now include a synthesis plan JSON and protocol stub file.
+Show the latest snapshot paths:
+```
+scripts/latest_snapshot.sh
+```
+
+## Editor integration
+The VS Code extension stub lives in `extensions/vscode` and launches the
+Gabion LSP server over stdio. It is a thin wrapper only.
+
+## Quick commands (make)
+```
+make bootstrap
+make check
+make check-ci
+make test
+make test-logs
+make clean-artifacts
+make docflow
+make dataflow
+make lsp-smoke
+make audit-snapshot
+make audit-latest
+```
+
+## CI
+GitHub-hosted CI runs `gabion check`, docflow audit, and pytest using `mise`
+as defined in `.github/workflows/ci.yml`.
+If `POLICY_GITHUB_TOKEN` is set, the posture check also runs on pushes.
+
+Allow-listed actions are defined in `docs/allowed_actions.txt`.
+
+Pull requests also get a dataflow-grammar report artifact (and a comment on
+same-repo PRs) via `.github/workflows/pr-dataflow-grammar.yml`.
+
+## GitHub Action (redistributable)
+A composite action wrapper lives at `.github/actions/gabion`.
+It installs Gabion via pip and runs `gabion check` (or another subcommand).
+See `.github/actions/gabion/README.md` for usage and pinning guidance.
+Example workflow (with pinned SHA placeholders):
+`docs/workflows/gabion_action_example.yml`.
+Pinning guide: `docs/pinning_actions.md`.
+
+## Architecture (planned shape)
+- **LSP-first:** the language server is the semantic core; the CLI is a thin
+  LSP client. Editor integrations remain thin wrappers over the same server.
+  The server is the single source of truth for diagnostics and code actions.
+- **Analysis:** import resolution, alias-aware identity tracking, fixed-point
+  bundle propagation, and tiering. Type-flow, constant-flow, and unused-argument
+  audits are part of the prototype coverage.
+- **Reports:** Mermaid/DOT graph outputs and a violations list from the audit.
+- **Synthesis:** Protocol generation, bundle-merge heuristics, and refactoring
+  assistance (callee-first/topological schedule).
+
+See `in/` for design notes and the prototype audit script.
+
+## Governance
+This repository is governed by two co-equal contracts:
+- `POLICY_SEED.md` (execution and CI safety)
+- `glossary.md` (semantic meanings and commutation obligations)
+
+LLM/agent behavior is governed by `AGENTS.md`.
+
+## Cross-references
+- `CONTRIBUTING.md` defines workflow guardrails and dataflow grammar rules.
+- `AGENTS.md` defines LLM/agent obligations.
+- `POLICY_SEED.md` defines execution and CI safety constraints.
+- `glossary.md` defines semantic meanings, axes, and commutation obligations.
+
+## License
+Apache-2.0. See `LICENSE`.

gabion-0.1.0.dist-info/RECORD

@@ -0,0 +1,26 @@
+gabion/__init__.py,sha256=IuUZho6f7uzs3D8wgAQM1OpCgmJ949PXd24oq-GEufE,77
+gabion/__main__.py,sha256=pZ3SvIhFpELK_ry4qcOI8tt_81PydhzJMS-AQUpfO4Q,129
+gabion/cli.py,sha256=ncGtAWwWYY2GZEkxvxVKtOcgAjCFHldzwIQBe5OPAak,20002
+gabion/config.py,sha256=4kg0x03fP2-A8LuXe3QikED6jZbDFfzr9IQaMge7Ua4,1235
+gabion/lsp_client.py,sha256=XA8uuxolRPhcbMHpjUVgrnFw3PMuMGzm5bBCakqDvPk,3277
+gabion/schema.py,sha256=QG1tYTFDqrafvWwrRjyfD44ufoh45vvynJwoMxiMT1w,1725
+gabion/server.py,sha256=n4bVYYwW-cjydfFJCpbgFUqJVMX-nyPj3OKJvbH5LaU,16083
+gabion/analysis/__init__.py,sha256=jq1C9ie-II8eWZtPH-yBijEApWOCFsszSXwhd1Msk0Q,793
+gabion/analysis/dataflow_audit.py,sha256=Nqdacgk6X2x3rdUlk2fKhn-J2bkk1mXHc2ga8X7Slio,111937
+gabion/analysis/engine.py,sha256=Ec0DL9eCc_4kedI9eiEZM9qDK79AWzbIio6iD9Yf47o,198
+gabion/analysis/model.py,sha256=d4f3Vb_3a-trbP5L0yHkmniK8mh43lVFgv40QsXYeZo,846
+gabion/analysis/visitors.py,sha256=8gjLMhP7I_aWgGhCqX7xb9KyVysgfeRTA-hCrPqainE,16460
+gabion/refactor/__init__.py,sha256=J1TlmgUgl86tSZnh7hZOL9M6pA2cf0cLTsyuOuA1qCc,225
+gabion/refactor/engine.py,sha256=1DyoZ8Riln2cA730OZDa4Jm4zT_y76m7merqFuJ60MQ,26860
+gabion/refactor/model.py,sha256=GVdVNUXT9kFpoTvgZ17X4vzSRe8OnqQf6Rji-mWiRL4,820
+gabion/synthesis/__init__.py,sha256=G76-Jp_OX9_UEJmuYi14XrJHlyMtU2k-gH77RMD8PLg,622
+gabion/synthesis/merge.py,sha256=2758qL2xGmB9lXC_jvqrxK6bTD8Vmrt1YTH_5_5jKg0,1193
+gabion/synthesis/model.py,sha256=cBHltcdLmCRneE2fgi3hA36A6UzU9E0YuTmKiCOk17I,968
+gabion/synthesis/naming.py,sha256=I7FXFkxoTXEog63CA8FjPNkcp0DzPn-WzncLLlABH4E,1262
+gabion/synthesis/protocols.py,sha256=OdxbVUsj_DmKSNlZeaFgRIu46_on2qV4ge3K8bquXGY,2470
+gabion/synthesis/schedule.py,sha256=_1SBktOR5X5hl1z91tVXht8ZPIrY8wXP3SaxWh3K9xI,2835
+gabion-0.1.0.dist-info/METADATA,sha256=_eQVSisUWWYIhF4ofE3PnwUfUO-OhlTkB4Y0LlF2n0Q,8479
+gabion-0.1.0.dist-info/WHEEL,sha256=WLgqFyCfm_KASv4WHyYy0P3pM_m7J5L9k2skdKLirC8,87
+gabion-0.1.0.dist-info/entry_points.txt,sha256=Deu--5uPUKZKcsVfXvAj8h_0T7K52PLieJttYCrlRG8,74
+gabion-0.1.0.dist-info/licenses/LICENSE,sha256=ZlxQIqhO3NX4-cv0ineYuyIeQJRuu43qq2p_J2OWvX4,10735
+gabion-0.1.0.dist-info/RECORD,,

gabion-0.1.0.dist-info/WHEEL

@@ -0,0 +1,4 @@
+Wheel-Version: 1.0
+Generator: hatchling 1.28.0
+Root-Is-Purelib: true
+Tag: py3-none-any

gabion-0.1.0.dist-info/entry_points.txt

@@ -0,0 +1,3 @@
+[console_scripts]
+gabion = gabion.cli:app
+gabion-ls = gabion.server:start

gabion-0.1.0.dist-info/licenses/LICENSE

@@ -0,0 +1,190 @@
+                                 Apache License
+                           Version 2.0, January 2004
+                        http://www.apache.org/licenses/
+
+   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+   1. Definitions.
+
+      "License" shall mean the terms and conditions for use, reproduction,
+      and distribution as defined by Sections 1 through 9 of this document.
+
+      "Licensor" shall mean the copyright owner or entity authorized by
+      the copyright owner that is granting the License.
+
+      "Legal Entity" shall mean the union of the acting entity and all
+      other entities that control, are controlled by, or are under common
+      control with that entity. For the purposes of this definition,
+      "control" means (i) the power, direct or indirect, to cause the
+      direction or management of such entity, whether by contract or
+      otherwise, or (ii) ownership of fifty percent (50%) or more of the
+      outstanding shares, or (iii) beneficial ownership of such entity.
+
+      "You" (or "Your") shall mean an individual or Legal Entity
+      exercising permissions granted by this License.
+
+      "Source" form shall mean the preferred form for making modifications,
+      including but not limited to software source code, documentation
+      source, and configuration files.
+
+      "Object" form shall mean any form resulting from mechanical
+      transformation or translation of a Source form, including but
+      not limited to compiled object code, generated documentation,
+      and conversions to other media types.
+
+      "Work" shall mean the work of authorship, whether in Source or
+      Object form, made available under the License, as indicated by a
+      copyright notice that is included in or attached to the work
+      (an example is provided in the Appendix below).
+
+      "Derivative Works" shall mean any work, whether in Source or Object
+      form, that is based on (or derived from) the Work and for which the
+      editorial revisions, annotations, elaborations, or other modifications
+      represent, as a whole, an original work of authorship. For the purposes
+      of this License, Derivative Works shall not include works that remain
+      separable from, or merely link (or bind by name) to the interfaces of,
+      the Work and Derivative Works thereof.
+
+      "Contribution" shall mean any work of authorship, including
+      the original version of the Work and any modifications or additions
+      to that Work or Derivative Works thereof, that is intentionally
+      submitted to Licensor for inclusion in the Work by the copyright owner
+      or by an individual or Legal Entity authorized to submit on behalf of
+      the copyright owner. For the purposes of this definition, "submitted"
+      means any form of electronic, verbal, or written communication sent
+      to the Licensor or its representatives, including but not limited to
+      communication on electronic mailing lists, source code control systems,
+      and issue tracking systems that are managed by, or on behalf of, the
+      Licensor for the purpose of discussing and improving the Work, but
+      excluding communication that is conspicuously marked or otherwise
+      designated in writing by the copyright owner as "Not a Contribution."
+
+      "Contributor" shall mean Licensor and any individual or Legal Entity
+      on behalf of whom a Contribution has been received by Licensor and
+      subsequently incorporated within the Work.
+
+   2. Grant of Copyright License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      copyright license to reproduce, prepare Derivative Works of,
+      publicly display, publicly perform, sublicense, and distribute the
+      Work and such Derivative Works in Source or Object form.
+
+   3. Grant of Patent License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      (except as stated in this section) patent license to make, have made,
+      use, offer to sell, sell, import, and otherwise transfer the Work,
+      where such license applies only to those patent claims licensable
+      by such Contributor that are necessarily infringed by their
+      Contribution(s) alone or by combination of their Contribution(s)
+      with the Work to which such Contribution(s) was submitted. If You
+      institute patent litigation against any entity (including a
+      cross-claim or counterclaim in a lawsuit) alleging that the Work
+      or a Contribution incorporated within the Work constitutes direct
+      or contributory patent infringement, then any patent licenses
+      granted to You under this License for that Work shall terminate
+      as of the date such litigation is filed.
+
+   4. Redistribution. You may reproduce and distribute copies of the
+      Work or Derivative Works thereof in any medium, with or without
+      modifications, and in Source or Object form, provided that You
+      meet the following conditions:
+
+      (a) You must give any other recipients of the Work or
+          Derivative Works a copy of this License; and
+
+      (b) You must cause any modified files to carry prominent notices
+          stating that You changed the files; and
+
+      (c) You must retain, in the Source form of any Derivative Works
+          that You distribute, all copyright, patent, trademark, and
+          attribution notices from the Source form of the Work,
+          excluding those notices that do not pertain to any part of
+          the Derivative Works; and
+
+      (d) If the Work includes a "NOTICE" text file as part of its
+          distribution, then any Derivative Works that You distribute must
+          include a readable copy of the attribution notices contained
+          within such NOTICE file, excluding those notices that do not
+          pertain to any part of the Derivative Works, in at least one
+          of the following places: within a NOTICE text file distributed
+          as part of the Derivative Works; within the Source form or
+          documentation, if provided along with the Derivative Works; or,
+          within a display generated by the Derivative Works, if and
+          wherever such third-party notices normally appear. The contents
+          of the NOTICE file are for informational purposes only and
+          do not modify the License. You may add Your own attribution
+          notices within Derivative Works that You distribute, alongside
+          or as an addendum to the NOTICE text from the Work, provided
+          that such additional attribution notices cannot be construed
+          as modifying the License.
+
+      You may add Your own copyright statement to Your modifications and
+      may provide additional or different license terms and conditions
+      for use, reproduction, or distribution of Your modifications, or
+      for any such Derivative Works as a whole, provided Your use,
+      reproduction, and distribution of the Work otherwise complies with
+      the conditions stated in this License.
+
+   5. Submission of Contributions. Unless You explicitly state otherwise,
+   any Contribution intentionally submitted for inclusion in the Work
+   by You to the Licensor shall be under the terms and conditions of
+   this License, without any additional terms or conditions.
+   Notwithstanding the above, nothing herein shall supersede or modify
+   the terms of any separate license agreement you may have executed
+   with Licensor regarding such Contributions.
+
+   6. Trademarks. This License does not grant permission to use the trade
+      names, trademarks, service marks, or product names of the Licensor,
+      except as required for reasonable and customary use in describing the
+      origin of the Work and reproducing the content of the NOTICE file.
+
+   7. Disclaimer of Warranty. Unless required by applicable law or
+      agreed to in writing, Licensor provides the Work (and each
+      Contributor provides its Contributions) on an "AS IS" BASIS,
+      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+      implied, including, without limitation, any warranties or conditions
+      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+      PARTICULAR PURPOSE. You are solely responsible for determining the
+      appropriateness of using or redistributing the Work and assume any
+      risks associated with Your exercise of permissions under this License.
+
+   8. Limitation of Liability. In no event and under no legal theory,
+      whether in tort (including negligence), contract, or otherwise,
+      unless required by applicable law (such as deliberate and grossly
+      negligent acts) or agreed to in writing, shall any Contributor be
+      liable to You for damages, including any direct, indirect, special,
+      incidental, or consequential damages of any character arising as a
+      result of this License or out of the use or inability to use the
+      Work (including but not limited to damages for loss of goodwill,
+      work stoppage, computer failure or malfunction, or any and all
+      other commercial damages or losses), even if such Contributor
+      has been advised of the possibility of such damages.
+
+   9. Accepting Warranty or Additional Liability. While redistributing
+      the Work or Derivative Works thereof, You may choose to offer,
+      and charge a fee for, acceptance of support, warranty, indemnity,
+      or other liability obligations and/or rights consistent with this
+      License. However, in accepting such obligations, You may act only
+      on Your own behalf and on Your sole responsibility, not on behalf
+      of any other Contributor, and only if You agree to indemnify,
+      defend, and hold each Contributor harmless for any liability
+      incurred by, or claims asserted against, such Contributor by reason
+      of your accepting any such warranty or additional liability.
+
+   END OF TERMS AND CONDITIONS
+
+   Copyright 2026 Mike Mol
+
+   Licensed under the Apache License, Version 2.0 (the "License");
+   you may not use this file except in compliance with the License.
+   You may obtain a copy of the License at
+
+       http://www.apache.org/licenses/LICENSE-2.0
+
+   Unless required by applicable law or agreed to in writing, software
+   distributed under the License is distributed on an "AS IS" BASIS,
+   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+   See the License for the specific language governing permissions and
+   limitations under the License.