collationdelta 0.1.0__py3-none-any.whl

collationdelta/__init__.py

@@ -0,0 +1,3 @@
+"""Portable evidence for changes in application string comparisons."""
+
+__version__ = "0.1.0"

collationdelta/__main__.py

@@ -0,0 +1,3 @@
+from .cli import main
+
+raise SystemExit(main())

collationdelta/adapters/node.mjs

@@ -0,0 +1,127 @@
+#!/usr/bin/env node
+// One batch, no npm dependencies. All comparisons call the actual Intl API.
+import fs from 'node:fs';
+
+const runtime = {
+  node: process.version,
+  icu: process.versions.icu ?? null,
+  cldr: process.versions.cldr ?? null,
+  unicode: process.versions.unicode ?? null,
+  platform: process.platform,
+  arch: process.arch,
+};
+const adapter = {
+  name: 'collationdelta-intl',
+  version: '0.1.0',
+  contract: 'intl.collator.v1',
+};
+
+function observe(request) {
+  if (request.protocol_version !== 1 || !Array.isArray(request.corpus?.entries)) {
+    throw new Error('invalid request/protocol version');
+  }
+  const profile = request.profile;
+  const base = { protocol_version: 1, runtime, adapter, effective: null, results: [] };
+  function unsupported(reason, effective = null) {
+    return { ...base, status: 'unsupported', reason, effective };
+  }
+  if (profile?.contract !== adapter.contract)
+    return unsupported('unsupported application comparator contract');
+  const allowed = {
+    sensitivity: ['base', 'accent', 'case', 'variant'],
+    caseFirst: ['upper', 'lower', 'false'],
+    usage: ['sort', 'search'],
+    numeric: 'boolean',
+    ignorePunctuation: 'boolean',
+    collation: 'string',
+  };
+  if (
+    !profile.options ||
+    typeof profile.options !== 'object' ||
+    Array.isArray(profile.options)
+  ) {
+    return unsupported('options must be an object');
+  }
+  for (const [key, value] of Object.entries(profile.options)) {
+    if (!(key in allowed)) return unsupported(`unsupported option: ${key}`);
+    const rule = allowed[key];
+    if (Array.isArray(rule) ? !rule.includes(value) : typeof value !== rule) {
+      return unsupported(`invalid option value: ${key}`);
+    }
+  }
+  let canonical, collator;
+  try {
+    canonical = Intl.getCanonicalLocales(profile.locale)[0];
+    if (
+      !canonical ||
+      !Intl.Collator.supportedLocalesOf([canonical], { localeMatcher: 'lookup' }).length
+    ) {
+      return unsupported('requested locale has no supported lookup match');
+    }
+    collator = new Intl.Collator(canonical, {
+      ...profile.options,
+      localeMatcher: 'lookup',
+    });
+  } catch (error) {
+    return unsupported(`Intl configuration rejected: ${error.message}`);
+  }
+  const effective = collator.resolvedOptions();
+  const locale = new Intl.Locale(canonical);
+  const expectedCollation = profile.options.collation ?? locale.collation;
+  if (expectedCollation && expectedCollation !== effective.collation) {
+    return unsupported(
+      `requested collation ${expectedCollation} did not resolve`,
+      effective,
+    );
+  }
+  // Unicode extensions are requests too. Unsupported kn/kf must not disappear.
+  const extensions = new Map();
+  const u = canonical.toLowerCase().split('-x-')[0].split('-u-')[1]?.split('-') ?? [];
+  for (let i = 0; i < u.length; i++) {
+    if (u[i].length === 1) break; // The next locale extension starts here.
+    if (u[i].length === 2) {
+      const key = u[i];
+      const parts = [];
+      while (i + 1 < u.length && u[i + 1].length > 2) parts.push(u[++i]);
+      extensions.set(key, parts.join('-') || 'true');
+    }
+  }
+  const expected = { ...profile.options };
+  if (!('numeric' in expected) && extensions.has('kn')) {
+    if (!['true', 'false'].includes(extensions.get('kn')))
+      return unsupported('unsupported kn extension', effective);
+    expected.numeric = extensions.get('kn') === 'true';
+  }
+  if (!('caseFirst' in expected) && extensions.has('kf'))
+    expected.caseFirst = extensions.get('kf');
+  for (const [key, value] of Object.entries(expected)) {
+    if (effective[key] !== value)
+      return unsupported(`requested ${key} did not resolve`, effective);
+  }
+  const results = [];
+  for (const left of request.corpus.entries) {
+    for (const right of request.corpus.entries) {
+      try {
+        const value = collator.compare(left.value, right.value);
+        if (!Number.isFinite(value)) throw new Error('non-finite comparator return');
+        results.push({ left: left.id, right: right.id, status: 'ok', value });
+      } catch (error) {
+        results.push({
+          left: left.id,
+          right: right.id,
+          status: 'error',
+          reason: error.message,
+        });
+      }
+    }
+  }
+  return { ...base, status: 'ok', effective, results };
+}
+
+try {
+  const request = JSON.parse(fs.readFileSync(0, 'utf8'));
+  process.stdout.write(JSON.stringify(observe(request)) + '\n');
+} catch (error) {
+  process.stderr.write(`adapter error: ${error.message}\n`);
+  process.exitCode = 1;
+}

collationdelta/cli.py

@@ -0,0 +1,86 @@
+"""Command line entry point. Exit codes are part of the v0.1 public contract."""
+
+import argparse
+import json
+import sys
+from pathlib import Path
+
+from . import __version__
+from .evidence import capture, compare, coverage_text, human_report
+from .formats import DeltaError, dump, load, require
+
+
+class Parser(argparse.ArgumentParser):
+    def error(self, message):
+        raise DeltaError(message)
+
+
+def parser():
+    root = Parser(
+        description="Detect string ordering and equality changes before a runtime upgrade."
+    )
+    root.add_argument("--version", action="version", version=f"CollationDelta {__version__}")
+    commands = root.add_subparsers(dest="command", required=True, parser_class=Parser)
+    cap = commands.add_parser(
+        "capture", help="observe every ordered pair through an executable adapter"
+    )
+    cap.add_argument("--corpus", required=True, help="corpus JSON file, at most 256 records")
+    cap.add_argument("--profile", required=True, help="requested comparison profile JSON file")
+    cap.add_argument("--output", required=True, help="capture JSON destination")
+    cap.add_argument(
+        "--timeout",
+        type=float,
+        default=30.0,
+        help="whole-process deadline in seconds (default: 30)",
+    )
+    cap.add_argument("--stdout-limit", type=int, default=16 * 1024 * 1024, help="stdout byte limit")
+    cap.add_argument("--stderr-limit", type=int, default=1024 * 1024, help="stderr byte limit")
+    cap.add_argument(
+        "adapter", nargs=argparse.REMAINDER, help="adapter argv after --; executed without a shell"
+    )
+    diff = commands.add_parser("compare", help="compare two captures completely offline")
+    diff.add_argument("old")
+    diff.add_argument("new")
+    diff.add_argument("--format", choices=("human", "json"), default="human")
+    diff.add_argument("--json-output", help="also save the full versioned JSON report")
+    diff.add_argument("--limit", type=int, default=20, help="maximum findings in human output only")
+    commands.add_parser("node-adapter", help="print the bundled Intl.Collator adapter path")
+    return root
+
+
+def main(argv=None):
+    try:
+        args = parser().parse_args(argv)
+        if args.command == "node-adapter":
+            print(Path(__file__).parent / "adapters" / "node.mjs")
+            return 0
+        if args.command == "capture":
+            adapter = args.adapter[1:] if args.adapter[:1] == ["--"] else args.adapter
+            value = capture(
+                load(args.corpus),
+                load(args.profile),
+                adapter,
+                timeout=args.timeout,
+                stdout_limit=args.stdout_limit,
+                stderr_limit=args.stderr_limit,
+            )
+            dump(args.output, value)
+            print(
+                f"{'CAPTURED' if value['coverage']['complete'] else 'INCOMPLETE'} | {coverage_text(value['coverage'])}"
+            )
+            if value["observation"].get("reason"):
+                print(json.dumps(value["observation"]["reason"], ensure_ascii=True))
+            return 0 if value["coverage"]["complete"] else 2
+        require(args.limit >= 0, "human finding limit must be nonnegative")
+        report = compare(load(args.old), load(args.new))
+        if args.json_output:
+            dump(args.json_output, report)
+        if args.format == "json":
+            json.dump(report, sys.stdout, ensure_ascii=True, sort_keys=True, indent=2)
+            print()
+        else:
+            print(human_report(report, args.limit), end="")
+        return {"STABLE": 0, "DRIFT": 1, "INCOMPLETE": 2, "DRIFT_INCOMPLETE": 2}[report["status"]]
+    except (DeltaError, OSError, RecursionError) as exc:
+        print(f"ERROR: {str(exc)!a}", file=sys.stderr)
+        return 3

collationdelta/evidence.py

@@ -0,0 +1,231 @@
+"""Capture persistence and deterministic offline relation reports."""
+
+import datetime
+import itertools
+import json
+import os
+import platform
+
+from . import __version__
+from .formats import canonical, corpus, decode, digest, fields, profile, require
+from .observations import response
+from .transport import run
+
+
+def capture(entries_document, requested, argv, **limits):
+    corpus(entries_document)
+    profile(requested)
+    request = {"protocol_version": 1, "corpus": entries_document, "profile": requested}
+    out, err = run(argv, canonical(request), **limits)
+    observed, coverage, _ = response(decode(out, exact_results=True), entries_document["entries"])
+    payload = {
+        "format_version": 1,
+        "corpus": entries_document,
+        "requested": requested,
+        "observation": observed,
+        "coverage": coverage,
+        "run": {
+            "argv": list(argv),
+            "cwd": os.getcwd(),
+            "platform": platform.platform(),
+            "captured_at": datetime.datetime.now(datetime.UTC).isoformat(),
+            "tool_version": __version__,
+            "timeout_seconds": limits.get("timeout", 30.0),
+            "stdout_limit_bytes": limits.get("stdout_limit", 16 * 1024 * 1024),
+            "stderr_limit_bytes": limits.get("stderr_limit", 1024 * 1024),
+            "stderr": err.decode("utf-8", errors="replace"),
+        },
+    }
+    return dict(payload, digest=digest(payload))
+
+
+def validate_capture(value):
+    fields(
+        value, ("format_version", "corpus", "requested", "observation", "coverage", "run", "digest")
+    )
+    require(
+        type(value["format_version"]) is int and value["format_version"] == 1,
+        "unsupported capture format version",
+    )
+    require(
+        isinstance(value["digest"], str)
+        and value["digest"] == digest({k: v for k, v in value.items() if k != "digest"}),
+        "capture digest mismatch",
+    )
+    corpus(value["corpus"])
+    profile(value["requested"])
+    _, coverage, relations = response(
+        value["observation"], value["corpus"]["entries"], normalized=True
+    )
+    require(
+        canonical(coverage) == canonical(value["coverage"]),
+        "capture coverage does not match observations",
+    )
+    info = value["run"]
+    fields(
+        info,
+        (
+            "argv",
+            "cwd",
+            "platform",
+            "captured_at",
+            "tool_version",
+            "timeout_seconds",
+            "stdout_limit_bytes",
+            "stderr_limit_bytes",
+            "stderr",
+        ),
+    )
+    require(
+        isinstance(info["argv"], list)
+        and info["argv"]
+        and all(isinstance(arg, str) and arg for arg in info["argv"]),
+        "invalid capture argv",
+    )
+    for key in ("cwd", "platform", "captured_at", "tool_version", "stderr"):
+        require(isinstance(info[key], str), f"invalid run field: {key}")
+    for key in ("stdout_limit_bytes", "stderr_limit_bytes"):
+        require(type(info[key]) is int and info[key] > 0, f"invalid run limit: {key}")
+    require(
+        type(info["timeout_seconds"]) in (int, float)
+        and 0 < info["timeout_seconds"] < float("inf"),
+        "invalid run timeout",
+    )
+    return relations
+
+
+def compare(old, new):
+    old_rel, new_rel = validate_capture(old), validate_capture(new)
+    left = {entry["id"]: entry["value"] for entry in old["corpus"]["entries"]}
+    right = {entry["id"]: entry["value"] for entry in new["corpus"]["entries"]}
+    require(left == right, "incompatible corpora: IDs and exact scalar strings must match")
+    require(
+        canonical(old["requested"]) == canonical(new["requested"]),
+        "incompatible requested profiles",
+    )
+    sides = {
+        label: {
+            "capture_digest": side["digest"],
+            "effective": side["observation"]["effective"],
+            "runtime": side["observation"]["runtime"],
+            "adapter": side["observation"]["adapter"],
+            "status": side["observation"]["status"],
+            "reason": side["observation"].get("reason"),
+            "coverage": side["coverage"],
+        }
+        for label, side in (("old", old), ("new", new))
+    }
+    findings = []
+    records_by_id = {}
+
+    def record(entry_id):
+        if entry_id not in records_by_id:
+            value = left[entry_id]
+            records_by_id[entry_id] = {
+                "id": entry_id,
+                "value": value,
+                "escaped": json.dumps(value, ensure_ascii=True),
+                "code_points": [f"U+{ord(c):04X}" for c in value],
+            }
+        return records_by_id[entry_id]
+
+    def oriented_relation(relations, a, b):
+        if (a, b) in relations:
+            return relations[a, b]
+        reverse = relations.get((b, a))
+        return -reverse if reverse is not None else None
+
+    for a, b in itertools.combinations(sorted(left), 2):
+        # Each side can observe either direction of the same unordered pair.
+        # Normalize signs without counting the missing direction as completed.
+        before = oriented_relation(old_rel, a, b)
+        after = oriented_relation(new_rel, a, b)
+        if before is None or after is None:
+            continue
+        kind = None
+        if before != 0 and after == 0:
+            kind = "equality_merge"
+        elif before == 0 and after != 0:
+            kind = "equality_split"
+        elif before * after < 0:
+            kind = "order_reversal"
+        if kind:
+            records = [record(a), record(b)]
+            identity = {
+                "requested": old["requested"],
+                "records": records,
+                "kind": kind,
+                "old_relation": before,
+                "new_relation": after,
+            }
+            findings.append(
+                {
+                    "id": "cd1-" + digest(identity)[7:],
+                    "kind": kind,
+                    "records": records,
+                    "old_relation": before,
+                    "new_relation": after,
+                }
+            )
+    complete = old["coverage"]["complete"] and new["coverage"]["complete"]
+    status = (
+        ("DRIFT" if complete else "DRIFT_INCOMPLETE")
+        if findings
+        else ("STABLE" if complete else "INCOMPLETE")
+    )
+    return {
+        "report_version": 1,
+        "status": status,
+        "complete": complete,
+        "requested": old["requested"],
+        "sides": sides,
+        "finding_count": len(findings),
+        "findings": findings,
+    }
+
+
+def coverage_text(coverage):
+    return (
+        f"entries={coverage['entries']} comparisons={coverage['completed_comparisons']}/"
+        f"{coverage['expected_comparisons']} missing={coverage['missing_comparisons']} "
+        f"failed={coverage['failed_comparisons']} complete={str(coverage['complete']).lower()}"
+    )
+
+
+def human_report(report, limit=20):
+    lines = [
+        f"{report['status']} | findings={report['finding_count']} | complete={str(report['complete']).lower()}"
+    ]
+    for label, side in report["sides"].items():
+        lines.append(f"{label}: {coverage_text(side['coverage'])}")
+        if side["reason"]:
+            lines.append(f"  {side['status']}: {json.dumps(side['reason'], ensure_ascii=True)}")
+    lines.append("Equality means compare(a, b) == 0.")
+    for finding in report["findings"][:limit]:
+        lines.extend(["", f"{finding['id']} {finding['kind']}"])
+        for record in finding["records"]:
+            points = " ".join(record["code_points"]) or "(empty)"
+            lines.append(
+                f"  {json.dumps(record['id'], ensure_ascii=True)}: {record['escaped']} [{points}]"
+            )
+        lines.append(f"  relation: {finding['old_relation']:+d} -> {finding['new_relation']:+d}")
+        for label, side in report["sides"].items():
+            lines.append(
+                f"  {label} runtime={json.dumps(side['runtime'], ensure_ascii=True, sort_keys=True)}"
+            )
+            lines.append(
+                f"  {label} effective={json.dumps(side['effective'], ensure_ascii=True, sort_keys=True)}"
+            )
+    if len(report["findings"]) > limit:
+        lines.append(
+            f"\nShown {limit} of {report['finding_count']} findings; JSON contains all evidence."
+        )
+    if not report["findings"]:
+        for label, side in report["sides"].items():
+            lines.append(
+                f"{label} runtime={json.dumps(side['runtime'], ensure_ascii=True, sort_keys=True)}"
+            )
+            lines.append(
+                f"{label} effective={json.dumps(side['effective'], ensure_ascii=True, sort_keys=True)}"
+            )
+    return "\n".join(lines) + "\n"

collationdelta/formats.py

@@ -0,0 +1,168 @@
+"""Strict JSON and finite Unicode inputs; no string transformations."""
+
+import hashlib
+import json
+import math
+import os
+import tempfile
+from decimal import Decimal, DecimalException
+from pathlib import Path
+
+MAX_ENTRIES = 256
+MAX_FILE_BYTES = 32 * 1024 * 1024
+
+
+class DeltaError(ValueError):
+    """Invalid input, inconsistent evidence, or adapter transport failure."""
+
+
+def require(condition, message):
+    if not condition:
+        raise DeltaError(message)
+
+
+def fields(value, required, optional=()):
+    require(isinstance(value, dict), "expected JSON object")
+    require(set(required) <= value.keys(), f"missing fields: {set(required) - value.keys()}")
+    require(value.keys() <= set(required) | set(optional), "unexpected object fields")
+
+
+def scalar_strings(value):
+    if isinstance(value, str):
+        require(
+            not any(0xD800 <= ord(c) <= 0xDFFF for c in value), "unpaired surrogate in JSON string"
+        )
+    elif isinstance(value, list):
+        for item in value:
+            scalar_strings(item)
+    elif isinstance(value, dict):
+        for key, item in value.items():
+            scalar_strings(key)
+            scalar_strings(item)
+
+
+def _object(pairs):
+    result = {}
+    for key, value in pairs:
+        require(key not in result, f"duplicate JSON key: {key!r}")
+        result[key] = value
+    return result
+
+
+def _constant(value):
+    raise DeltaError(f"non-finite JSON number: {value}")
+
+
+def _float(token):
+    number = float(token)
+    require(math.isfinite(number), "JSON number exceeds finite float range")
+    require(number != 0 or Decimal(token).is_zero(), "nonzero JSON number underflows to zero")
+    return number
+
+
+def _ordinary_numbers(value):
+    if isinstance(value, Decimal):
+        return _float(str(value))
+    if isinstance(value, list):
+        return [_ordinary_numbers(item) for item in value]
+    if isinstance(value, dict):
+        return {key: _ordinary_numbers(item) for key, item in value.items()}
+    return value
+
+
+def decode(data, *, exact_results=False):
+    try:
+        value = json.loads(
+            data.decode("utf-8", errors="strict"),
+            object_pairs_hook=_object,
+            parse_constant=_constant,
+            parse_float=Decimal if exact_results else _float,
+        )
+        if exact_results:
+            # Normalize comparator returns before conversion to binary floats.
+            # Metadata and configuration keep the ordinary JSON representation.
+            if isinstance(value, dict) and isinstance(value.get("results"), list):
+                for item in value["results"]:
+                    if isinstance(item, dict) and item.get("status") == "ok":
+                        number = item.get("value")
+                        if isinstance(number, Decimal):
+                            require(number.is_finite(), "comparator result must be finite")
+                            item["value"] = (number > 0) - (number < 0)
+            value = _ordinary_numbers(value)
+        scalar_strings(value)
+        # Reject overflow such as 1e999 as well as explicit NaN/Infinity.
+        canonical(value)
+        return value
+    except (UnicodeError, ValueError, RecursionError, DecimalException) as exc:
+        raise DeltaError(f"invalid UTF-8/Unicode JSON: {exc}") from exc
+
+
+def load(path):
+    with Path(path).open("rb") as stream:
+        data = stream.read(MAX_FILE_BYTES + 1)
+    require(len(data) <= MAX_FILE_BYTES, "JSON file exceeds 32 MiB limit")
+    return decode(data)
+
+
+def canonical(value):
+    return json.dumps(
+        value, ensure_ascii=True, sort_keys=True, separators=(",", ":"), allow_nan=False
+    ).encode("ascii")
+
+
+def digest(value):
+    return "sha256:" + hashlib.sha256(canonical(value)).hexdigest()
+
+
+def dump(path, value):
+    # ASCII escaping preserves scalar strings and keeps control characters inert.
+    destination = Path(path)
+    temporary = None
+    try:
+        with tempfile.NamedTemporaryFile(
+            mode="wb", dir=destination.parent, prefix=".collationdelta-", delete=False
+        ) as stream:
+            temporary = Path(stream.name)
+            size = 0
+            encoder = json.JSONEncoder(ensure_ascii=True, sort_keys=True, indent=2, allow_nan=False)
+            for chunk in encoder.iterencode(value):
+                data = chunk.encode("ascii")
+                size += len(data)
+                require(size + 1 <= MAX_FILE_BYTES, "output exceeds 32 MiB file limit")
+                stream.write(data)
+            stream.write(b"\n")
+            stream.flush()
+            os.fsync(stream.fileno())
+        os.replace(temporary, destination)
+    finally:
+        if temporary is not None:
+            temporary.unlink(missing_ok=True)
+
+
+def corpus(value):
+    fields(value, ("version", "entries"))
+    require(type(value["version"]) is int and value["version"] == 1, "unsupported corpus version")
+    entries = value["entries"]
+    require(
+        isinstance(entries, list) and 1 <= len(entries) <= MAX_ENTRIES,
+        f"corpus requires 1..{MAX_ENTRIES} entries",
+    )
+    ids = set()
+    for entry in entries:
+        fields(entry, ("id", "value"))
+        require(isinstance(entry["id"], str) and entry["id"], "entry ID must be a nonempty string")
+        require(isinstance(entry["value"], str), "entry value must be a string")
+        scalar_strings(entry)
+        require(entry["id"] not in ids, f"duplicate entry ID: {entry['id']!r}")
+        ids.add(entry["id"])
+    return value
+
+
+def profile(value):
+    fields(value, ("version", "contract", "locale", "options"))
+    require(type(value["version"]) is int and value["version"] == 1, "unsupported profile version")
+    for key in ("contract", "locale"):
+        require(isinstance(value[key], str) and value[key], f"{key} must be a nonempty string")
+    require(isinstance(value["options"], dict), "options must be an object")
+    scalar_strings(value)
+    return value

collationdelta/observations.py

@@ -0,0 +1,154 @@
+"""Validate a finite total preorder, including partial-observation contradictions."""
+
+import math
+
+from .formats import fields, require
+
+
+def response(value, entries, *, normalized=False):
+    fields(
+        value,
+        ("protocol_version", "status", "effective", "runtime", "adapter", "results"),
+        ("reason",),
+    )
+    require(
+        type(value["protocol_version"]) is int and value["protocol_version"] == 1,
+        "unsupported adapter protocol version",
+    )
+    require(value["status"] in ("ok", "unsupported", "unresolved"), "invalid adapter status")
+    if "reason" in value:
+        require(
+            isinstance(value["reason"], str) and value["reason"], "reason must be a nonempty string"
+        )
+    if value["status"] != "ok":
+        require(
+            isinstance(value.get("reason"), str) and value["reason"],
+            "configuration failure requires reason",
+        )
+    require(
+        value["effective"] is None or isinstance(value["effective"], dict),
+        "invalid effective settings",
+    )
+    if value["status"] == "ok":
+        require(
+            isinstance(value["effective"], dict) and value["effective"],
+            "ok requires effective settings",
+        )
+    for key in ("runtime", "adapter"):
+        require(isinstance(value[key], dict) and value[key], f"{key} metadata required")
+    require(isinstance(value["results"], list), "results must be an array")
+    require(len(value["results"]) <= len(entries) ** 2, "too many results")
+    if value["status"] == "unsupported":
+        require(not value["results"], "unsupported configuration must not report comparisons")
+    ids = {e["id"] for e in entries}
+    seen, relations, results = set(), {}, []
+    failed = 0
+    for item in value["results"]:
+        fields(item, ("left", "right", "status"), ("value", "reason"))
+        require(
+            isinstance(item["left"], str) and isinstance(item["right"], str),
+            "pair IDs must be strings",
+        )
+        pair = item["left"], item["right"]
+        require(pair[0] in ids and pair[1] in ids, "unrequested pair in results")
+        require(pair not in seen, f"duplicate pair result: {pair!r}")
+        seen.add(pair)
+        status = item["status"]
+        require(status in ("ok", "error", "unresolved"), "invalid pair status")
+        result = dict(item)
+        if status == "ok":
+            require("value" in item and "reason" not in item, "ok requires value only")
+            number = item["value"]
+            require(type(number) in (int, float), "comparator result must be a finite number")
+            require(
+                type(number) is int or math.isfinite(number), "comparator result must be finite"
+            )
+            if normalized:
+                require(
+                    type(number) is int and number in (-1, 0, 1),
+                    "capture relation must be integer sign",
+                )
+            result["value"] = (number > 0) - (number < 0)
+            relations[pair] = result["value"]
+        else:
+            require(
+                "value" not in item and isinstance(item.get("reason"), str) and item["reason"],
+                "failed comparison requires reason and no value",
+            )
+            failed += 1
+        results.append(result)
+    require(
+        not relations or bool(value["effective"]), "observed comparisons require effective settings"
+    )
+    consistency(entries, relations)
+    complete = value["status"] == "ok" and len(relations) == len(entries) ** 2
+    coverage = {
+        "entries": len(entries),
+        "expected_comparisons": len(entries) ** 2,
+        "completed_comparisons": len(relations),
+        "failed_comparisons": failed,
+        "missing_comparisons": len(entries) ** 2 - len(seen),
+        "complete": complete,
+        "consistency": "verified" if complete else "consistent_partial",
+    }
+    clean = dict(value, results=sorted(results, key=lambda x: (x["left"], x["right"])))
+    return clean, coverage, relations
+
+
+def consistency(entries, relations):
+    # Equality components, followed by strict-order DAG. A cycle or an edge
+    # inside a component contradicts any extension to a total preorder.
+    values = {entry["id"]: entry["value"] for entry in entries}
+    parent = {i: i for i in values}
+    rank = {i: 0 for i in values}
+
+    def find(i):
+        while parent[i] != i:
+            parent[i] = parent[parent[i]]
+            i = parent[i]
+        return i
+
+    def union(a, b):
+        a, b = find(a), find(b)
+        if a == b:
+            return
+        if rank[a] < rank[b]:
+            a, b = b, a
+        parent[b] = a
+        if rank[a] == rank[b]:
+            rank[a] += 1
+
+    representatives = {}
+    for entry_id, value in values.items():
+        if value in representatives:
+            union(entry_id, representatives[value])
+        else:
+            representatives[value] = entry_id
+
+    for (a, b), sign in relations.items():
+        require(a != b or sign == 0, f"nonzero self comparison: {a!r}")
+        require(values[a] != values[b] or sign == 0, "nonzero comparison of identical strings")
+        reverse = relations.get((b, a))
+        require(reverse is None or reverse == -sign, f"inconsistent reverse comparison: {(a, b)!r}")
+        if sign == 0:
+            union(a, b)
+    graph = {find(i): set() for i in values}
+    for (a, b), sign in relations.items():
+        if sign:
+            a, b = find(a), find(b)
+            require(a != b, "strict relation contradicts equality transitivity")
+            graph[a if sign < 0 else b].add(b if sign < 0 else a)
+    indegree = {i: 0 for i in graph}
+    for neighbors in graph.values():
+        for node in neighbors:
+            indegree[node] += 1
+    ready = [i for i in graph if indegree[i] == 0]
+    visited = 0
+    while ready:
+        node = ready.pop()
+        visited += 1
+        for neighbor in graph[node]:
+            indegree[neighbor] -= 1
+            if indegree[neighbor] == 0:
+                ready.append(neighbor)
+    require(visited == len(graph), "strict-order cycle contradicts transitivity")

collationdelta/transport.py

@@ -0,0 +1,92 @@
+"""One bounded batch process, with concurrent stdin/stdout/stderr I/O on POSIX."""
+
+import os
+import selectors
+import signal
+import subprocess
+import time
+
+from .formats import DeltaError, require
+
+
+def run(argv, request, *, timeout=30.0, stdout_limit=16 * 1024 * 1024, stderr_limit=1024 * 1024):
+    require(os.name == "posix", "adapter execution currently requires Linux or macOS")
+    require(
+        argv and all(isinstance(arg, str) and arg for arg in argv),
+        "adapter argv is empty or invalid",
+    )
+    require(timeout > 0 and timeout < float("inf"), "timeout must be positive and finite")
+    require(stdout_limit > 0 and stderr_limit > 0, "output limits must be positive")
+    try:
+        proc = subprocess.Popen(
+            argv,
+            stdin=subprocess.PIPE,
+            stdout=subprocess.PIPE,
+            stderr=subprocess.PIPE,
+            shell=False,
+            start_new_session=True,
+        )
+    except (OSError, ValueError) as exc:
+        raise DeltaError(f"adapter launch failed: {exc}") from exc
+    output = {"stdout": bytearray(), "stderr": bytearray()}
+    limits = {"stdout": stdout_limit, "stderr": stderr_limit}
+    deadline = time.monotonic() + timeout
+    offset = 0
+    try:
+        with selectors.DefaultSelector() as selector:
+            for stream, label in (
+                (proc.stdin, "stdin"),
+                (proc.stdout, "stdout"),
+                (proc.stderr, "stderr"),
+            ):
+                os.set_blocking(stream.fileno(), False)
+                selector.register(
+                    stream,
+                    selectors.EVENT_WRITE if label == "stdin" else selectors.EVENT_READ,
+                    label,
+                )
+            while selector.get_map():
+                remaining = deadline - time.monotonic()
+                if remaining <= 0:
+                    raise DeltaError(f"adapter timeout after {timeout:g}s")
+                for key, _ in selector.select(min(remaining, 0.1)):
+                    stream, label = key.fileobj, key.data
+                    if label == "stdin":
+                        try:
+                            offset += os.write(stream.fileno(), request[offset : offset + 65536])
+                        except BrokenPipeError:
+                            offset = len(request)
+                        if offset == len(request):
+                            selector.unregister(stream)
+                            stream.close()
+                    else:
+                        chunk = os.read(stream.fileno(), 65536)
+                        if not chunk:
+                            selector.unregister(stream)
+                            stream.close()
+                        else:
+                            if len(output[label]) + len(chunk) > limits[label]:
+                                raise DeltaError(
+                                    f"adapter {label} exceeds {limits[label]} byte limit"
+                                )
+                            output[label].extend(chunk)
+            remaining = deadline - time.monotonic()
+            if remaining <= 0:
+                raise DeltaError(f"adapter timeout after {timeout:g}s")
+            try:
+                code = proc.wait(timeout=remaining)
+            except subprocess.TimeoutExpired as exc:
+                raise DeltaError(f"adapter timeout after {timeout:g}s") from exc
+            if code != 0:
+                diagnostic = bytes(output["stderr"]).decode("utf-8", errors="replace")
+                raise DeltaError(f"adapter exited {code}; stderr={diagnostic!r}")
+            return bytes(output["stdout"]), bytes(output["stderr"])
+    finally:
+        # Also close descendant-held pipes and stop descendants on timeout/limits.
+        try:
+            os.killpg(proc.pid, signal.SIGKILL)
+        except ProcessLookupError:
+            pass
+        proc.wait()
+        for stream in (proc.stdin, proc.stdout, proc.stderr):
+            stream.close()

collationdelta-0.1.0.dist-info/METADATA

@@ -0,0 +1,181 @@
+Metadata-Version: 2.4
+Name: collationdelta
+Version: 0.1.0
+Summary: Detect string ordering and equality changes before a runtime upgrade.
+License-Expression: Apache-2.0
+Project-URL: Homepage, https://github.com/0then0/collationdelta
+Project-URL: Repository, https://github.com/0then0/collationdelta
+Project-URL: Documentation, https://github.com/0then0/collationdelta/blob/main/README.md
+Project-URL: Issues, https://github.com/0then0/collationdelta/issues
+Project-URL: Changelog, https://github.com/0then0/collationdelta/blob/main/CHANGELOG.md
+Keywords: collation,unicode,cli,runtime-upgrade,drift-detection
+Classifier: Development Status :: 3 - Alpha
+Classifier: Environment :: Console
+Classifier: Intended Audience :: Developers
+Classifier: Operating System :: POSIX :: Linux
+Classifier: Operating System :: MacOS :: MacOS X
+Classifier: Programming Language :: Python :: 3 :: Only
+Classifier: Programming Language :: Python :: 3.12
+Classifier: Programming Language :: Python :: 3.13
+Classifier: Programming Language :: Python :: 3.14
+Classifier: Topic :: Software Development :: Testing
+Requires-Python: >=3.12
+Description-Content-Type: text/markdown
+License-File: LICENSE
+Dynamic: license-file
+
+<p align="center"><img src="https://raw.githubusercontent.com/0then0/collationdelta/main/docs/icon.svg" width="88" height="88" alt="CollationDelta: two string relations joined by a delta" /></p>
+
+# CollationDelta
+
+**Detect string ordering and equality changes before a runtime upgrade.**
+
+[![PyPI](https://img.shields.io/pypi/v/collationdelta)](https://pypi.org/project/collationdelta/)
+![Python requirement](https://img.shields.io/badge/requires-Python%203.12%2B-blue)
+![Runtime dependencies](https://img.shields.io/badge/core-runtime%20dependencies%200-green)
+![License](https://img.shields.io/badge/license-Apache%202.0-blue)
+
+CollationDelta records the actual comparison results for your finite string corpus through an executable adapter. Capture a baseline in the old environment, capture the same corpus and requested profile in the new environment, then compare the two files offline. The old runtime is no longer needed.
+
+It reports equality merges, equality splits, and order reversals as individual pair witnesses. **Equality means `compare(a, b) == 0`**, not matching bytes, Unicode identity, or SQL equality. A runtime version change alone is not drift; a changed relation is drift even when version labels stay the same.
+
+## Install and try
+
+Python 3.12 or newer is required. Node is needed only to capture through the included `Intl.Collator` adapter. There are no Python runtime dependencies and no npm dependencies.
+
+For a published release, install from PyPI:
+
+```sh
+pip install collationdelta==0.1.0
+collationdelta --help
+```
+
+To try the source checkout, including the example input files:
+
+```sh
+git clone https://github.com/0then0/collationdelta.git
+cd collationdelta
+```
+
+Then run:
+
+```sh
+uv sync --locked --python 3.12
+uv run collationdelta --help
+uv run collationdelta capture \
+  --corpus examples/corpus.json --profile examples/profile.json \
+  --output /tmp/baseline.json -- node "$(uv run collationdelta node-adapter)"
+uv run collationdelta capture \
+  --corpus examples/corpus.json --profile examples/profile.json \
+  --output /tmp/current.json -- node "$(uv run collationdelta node-adapter)"
+uv run collationdelta compare /tmp/baseline.json /tmp/current.json \
+  --json-output /tmp/report.json
+```
+
+The same-runtime control returns `STABLE`. Use the old environment for the first command and the upgraded environment for the second to check an upgrade. The shell substitution above locates the installed adapter; CollationDelta itself runs the supplied argv without shell interpolation.
+
+To build and install locally:
+
+```sh
+uv build
+uv venv /tmp/collationdelta-install --python 3.12
+uv pip install --python /tmp/collationdelta-install/bin/python dist/collationdelta-0.1.0-py3-none-any.whl
+/tmp/collationdelta-install/bin/collationdelta --help
+```
+
+The Node adapter ships inside the wheel; `collationdelta node-adapter` prints its location after installation.
+
+## Inputs and guarantees
+
+Corpus JSON:
+
+```json
+{
+  "version": 1,
+  "entries": [
+    { "id": "rupee", "value": "₨" },
+    { "id": "letters", "value": "Rs" },
+    { "id": "zero", "value": "0" }
+  ]
+}
+```
+
+Profile JSON:
+
+```json
+{
+  "version": 1,
+  "contract": "intl.collator.v1",
+  "locale": "en",
+  "options": { "sensitivity": "base" }
+}
+```
+
+IDs are unique, nonempty, stable strings. Duplicate values under different IDs are allowed. Values are preserved exactly: no trimming, case folding, normalization, control-character removal, or deduplication. Empty strings, embedded U+0000, newlines, combining marks, and supplementary characters are supported. Invalid UTF-8 and unpaired surrogates are rejected. JSON-escaped valid surrogate pairs decode to their scalar character.
+
+The corpus must have **1–256 entries**. Each capture requests all `n²` ordered comparisons, including the diagonal, in a single process. A complete capture of 256 entries contains 65,536 comparisons. No sampling is used. JSON input/output files are limited to 32 MiB; long strings may reach transport or file limits before the entry limit.
+
+The requested profile is distinct from adapter-reported effective settings and runtime/provider metadata. The Node adapter reports `process.version`, ICU, CLDR and Unicode versions when available, and `resolvedOptions()`. A custom adapter's version claim is evidence supplied by that adapter, not independent verification of its environment.
+
+Supported Node options are `sensitivity`, `numeric`, `caseFirst`, `ignorePunctuation`, `usage`, and `collation`. The adapter delegates every comparison to `Intl.Collator`. It allows locale canonicalization and lookup negotiation, such as `EN-us` or a supported language with an unavailable region. Unsupported locales and silently ignored explicit collations are reported as unsupported. Explicit options and the recognized `co`, `kn`, `kf` locale extensions must resolve; explicit options take precedence over extensions. Other locale extensions do not define this adapter's comparison contract. See [the protocol guide](https://github.com/0then0/collationdelta/blob/main/docs/protocol.md) for the exact option values and custom adapters.
+
+## Results and exit codes
+
+Human reports begin with status and coverage: entries, expected/completed comparisons, missing/failed comparisons, and completeness. Each finding contains both IDs, safely escaped original values, Unicode code points, old/new relation signs, runtime metadata, and effective settings. Reciprocal comparisons validate the observation; findings appear once per unordered pair. A pair is a direct witness, not a claim of global minimization.
+
+`compare --format json` emits a versioned, deterministic full report. `--json-output FILE` also saves it alongside human output. `--limit N` affects only the number of findings shown in human output; total counts and JSON evidence remain complete. The full JSON report contains shared old/new runtime and effective metadata in `sides`, referenced by every finding's old/new relations.
+
+- **0:** `STABLE` for complete, valid, compatible captures; `CAPTURED` for a successful complete capture; informational commands.
+- **1:** `DRIFT`, with complete observations and one or more findings.
+- **2:** `INCOMPLETE` or `DRIFT_INCOMPLETE`. Capture also returns 2 for unsupported/unresolved configuration or missing/failed comparisons and saves the valid partial evidence.
+- **3:** `ERROR`: invalid input, incompatible captures, inconsistent relations, digest failure, launch/crash/timeout/output limit failure, or malformed protocol. No new capture is written on a transport/protocol error.
+
+Incomplete comparison preserves findings for a pair observed successfully in either direction on each side, even when diagonal or reciprocal observations are missing. Each side is independently oriented by stable IDs; the inferred reverse sign does not increase completed coverage. Unknown results are never equality. A successful process with missing pair responses produces explicit incomplete coverage; duplicate or unrequested pair responses are protocol errors. A crash with partial stdout is a transport error because a single-batch response cannot be trusted as a finished protocol document.
+
+## Real runtime upgrade evidence
+
+The [reproducible case study](https://github.com/0then0/collationdelta/blob/main/docs/case-study.md) compares the official Node **18.20.8 / ICU 74.2 / CLDR 44.1** and **24.21.0 / ICU 78.3 / CLDR 48.0** binaries with the same `en` / `sensitivity: base` profile. Saved captures and reports are in [evidence/node-upgrade](https://github.com/0then0/collationdelta/tree/main/evidence/node-upgrade). They show an equality merge for `₨` / `Rs` and an order reversal for `₨` / `0`, a same-runtime control, repeated observations, and offline analysis.
+
+The two-element sorted snapshot `["₨", "Rs"]` stays the same while equality changes. The included **demonstration application example** sorts and removes adjacent collation-equal strings; its result changes from two records to one. This is a demonstration, not an external production incident. The experiment upgrades the entire Node runtime and does not isolate the effect of ICU alone.
+
+## Evidence and consistency
+
+Captures embed corpus, requested profile, effective settings, normalized signs, explicit failures, coverage, runtime/adapter metadata, invocation argv, working directory, platform, UTC timestamp, limits, diagnostics, and a SHA-256 content digest. The digest detects accidental or uncoordinated content alteration; anyone able to edit a capture can recompute it. It is not a signature or proof of runtime authenticity. Environment variables, application configuration files, and executable contents are not bundled; preserve them separately when needed for reproduction. Captures may contain sensitive corpus values and command arguments.
+
+On load, CollationDelta validates the schema, digest, observations, and recomputed coverage. Corpus ID/value mappings must match exactly, although record order may differ. Requested profiles must match exactly, including locale spelling; canonicalization is an adapter operation during capture. Effective settings may differ and are exposed for interpretation rather than silently requiring agreement.
+
+The consistency check treats identical string values under different IDs as equal and rejects nonzero comparisons between them, nonzero self comparisons, inconsistent reciprocal results, contradictions in equality components, and cycles of strict order. Union-find constructs equality components, then topological traversal checks the graph of strict relations. Time is `O(n² α(n))` and memory `O(n²)` for a full corpus; `α(n)` is the near-constant inverse Ackermann cost of union-find. For partial observations this checks whether known relations can extend to a total preorder; it cannot verify unknown relations. Contradictory observations are errors, never equivalence classes or stability claims.
+
+## Related work and boundaries
+
+[Unicode Conformance](https://github.com/unicode-org/conformance) provides data-driven testing against Unicode/CLDR specifications across implementations. CollationDelta shares the idea of executable comparison observations, but its reference is your saved application baseline rather than specification conformance.
+
+[glibc-unicode-sorting](https://github.com/ardentperf/glibc-unicode-sorting) studies sorting changes across OS/ICU versions through PostgreSQL, including sorted-output checksums over large datasets. CollationDelta uses a bounded user corpus and explicit equality/order pair witnesses. The distinction is the combination of **your corpus, your actual application comparator, a portable baseline, and separate equality drift detection**. It does not imply that other tools cannot compare pairs or accept custom data.
+
+[ICU 76 release notes](https://unicode-org.github.io/icu/download/76.html) document root-collation changes, including currency-symbol ordering; [the ICU Collation API guide](https://unicode-org.github.io/icu/userguide/collation/api.html) describes direct string comparisons and warns that keys from different collators are not comparable. CollationDelta compares observed relation signs, never persisted sort-key bytes, and adds no bytewise tiebreaker. The release notes provide context for the case, not proof of its isolated cause.
+
+Stability on a finite corpus says nothing about all Unicode strings. Drift means a change relative to the selected baseline, not an error in the new implementation. Node comparison evidence does not establish SQL `UNIQUE`, `GROUP BY`, or any database collation's behavior. This tool checks neither physical database index correctness nor provider/database rebuild requirements.
+
+v0.1 is a local capture/compare CLI. It does not implement UCA, offer a universal conformance suite, fuzz all Unicode, scan production databases, manage runtimes/Docker, migrate databases, run `REINDEX`, accept new baselines automatically, or recommend remediation without application evidence. It has one reference Node adapter and one custom-adapter example; no web UI, daemon, SaaS, or plugin registry.
+
+## Development and validation
+
+```sh
+uv sync --locked --python 3.12
+uv run --locked ruff check .
+uv run --locked ruff format --check .
+uv run --locked pytest
+uv build
+```
+
+Tests cover drift types, Unicode preservation, finite-order consistency, strict protocol/transport failures, partial evidence, corruption, deterministic reports, offline comparison, and the actual Node adapter. Unit tests use synthetic fixtures only for controlled core and failure cases; the historical upgrade uses official binaries. Unit tests never download historical runtimes.
+
+Ruff checks Python errors, imports, Python 3.12 modernization, and common bug patterns with a 100-column formatting target. To apply formatting, run `uv run --locked ruff format .`. The formatter controls wrapping; long strings and comments are exempt from the linter's line-length check.
+
+The CLI's POSIX process transport targets Linux and macOS. CI is configured for both with Python 3.12–3.14 and Node 24.21.0, including clean-wheel installation. Local verification results and unverified platform claims are recorded in the [validation report](https://github.com/0then0/collationdelta/blob/main/docs/validation.md). Windows adapter execution is unsupported in v0.1.
+
+The existing [Apache-2.0 license](https://github.com/0then0/collationdelta/blob/main/LICENSE) applies to this project. Node downloads remain separate, external artifacts with their own licensing.
+
+## Releases
+
+Release notes are in the [changelog](https://github.com/0then0/collationdelta/blob/main/CHANGELOG.md). Maintainers can follow the [release guide](https://github.com/0then0/collationdelta/blob/main/docs/releasing.md) to publish a version through PyPI Trusted Publishing.

collationdelta-0.1.0.dist-info/RECORD

@@ -0,0 +1,14 @@
+collationdelta/__init__.py,sha256=KtvEE669twu53fhDe8woZfE9dZtPPcOKWCiq5Ho3N2w,94
+collationdelta/__main__.py,sha256=k1ocEWawweo1qCJWNFAAvyxz3tcY13dzvCenHszij30,48
+collationdelta/cli.py,sha256=Mhk6E1PVvJoapez6O4yvkqu-xCnDDPzXmhNByst-PBo,3745
+collationdelta/evidence.py,sha256=sL2KUxiQoWACdAjVR2UX2DWKuPjZUUigP-HZUblc3nY,8618
+collationdelta/formats.py,sha256=kR7NN8fs_in6JAHTJoSWyRzlN4SCrxqRrFK8zSO2lGU,5892
+collationdelta/observations.py,sha256=Fo0YnJ5zJLdu7bhtkZ173se6AQSu5Q_wUXgz1-LIYa4,6092
+collationdelta/transport.py,sha256=ksFR4mVN8056bdStRcCj8GVyiNRRd3dOVATUk6PhX0E,3956
+collationdelta/adapters/node.mjs,sha256=vmwXi99626yGjTDvJMTvRRa57WWkGi9KkzWlhKoSUfU,4511
+collationdelta-0.1.0.dist-info/licenses/LICENSE,sha256=xx0jnfkXJvxRnG63LTGOxlggYnIysveWIZ6H3PNdCrQ,11357
+collationdelta-0.1.0.dist-info/METADATA,sha256=FRymiPN3ThbWR1Sf-aMoNz9JDDF598XJmnUhIjYoy0g,14994
+collationdelta-0.1.0.dist-info/WHEEL,sha256=YVMoNqKzERt-wjUZwJ33xBGAwnFl-4cqbYkTtWa4itE,91
+collationdelta-0.1.0.dist-info/entry_points.txt,sha256=9m4gb09NKOV2Yd2_IYn5YQFd17WNQLgYtOA-Ymar-uU,59
+collationdelta-0.1.0.dist-info/top_level.txt,sha256=MA4uT07GsPNQmWeCKvF48E1GldsTh7_Q8K88ngA3IRA,15
+collationdelta-0.1.0.dist-info/RECORD,,

collationdelta-0.1.0.dist-info/WHEEL

@@ -0,0 +1,5 @@
+Wheel-Version: 1.0
+Generator: setuptools (84.0.0)
+Root-Is-Purelib: true
+Tag: py3-none-any
+

collationdelta-0.1.0.dist-info/entry_points.txt

@@ -0,0 +1,2 @@
+[console_scripts]
+collationdelta = collationdelta.cli:main

collationdelta-0.1.0.dist-info/licenses/LICENSE

@@ -0,0 +1,201 @@
+                                 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
+
+   APPENDIX: How to apply the Apache License to your work.
+
+      To apply the Apache License to your work, attach the following
+      boilerplate notice, with the fields enclosed by brackets "[]"
+      replaced with your own identifying information. (Don't include
+      the brackets!)  The text should be enclosed in the appropriate
+      comment syntax for the file format. We also recommend that a
+      file or class name and description of purpose be included on the
+      same "printed page" as the copyright notice for easier
+      identification within third-party archives.
+
+   Copyright [yyyy] [name of copyright owner]
+
+   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.

collationdelta-0.1.0.dist-info/top_level.txt

@@ -0,0 +1 @@
+collationdelta