Find code by asking what it does. A CLI for coding agents that uses Jev to discover relevant files and source context.
TypeScript ai-sdkclaude-codeclicode-searchcodexcoding-agentscontext-retrievaldeveloper-toolsjevsemantic-searchtypescriptvercel-ai-gateway
Replace Pyodide with packaged Tree-sitter for Python parsing (#27)
ARae10a9ee8ee5
diff --git a/.github/workflows/publish.yml b/.github/workflows/publish.ymlindex 7b44229..b5ddc77 100644--- a/.github/workflows/publish.yml+++ b/.github/workflows/publish.yml@@ -75,10 +75,17 @@ jobs:RELEASE_INTEGRITY: ${{ needs.release.outputs.integrity }}steps:- uses: actions/checkout@d23441a48e516b6c34aea4fa41551a30e30af803 # v6+ - uses: oven-sh/setup-bun@0c5077e51419868618aeaa5fe8019c62421857d6 # v2+ with:+ bun-version: 1.3.14- uses: actions/setup-node@820762786026740c76f36085b0efc47a31fe5020 # v7with:node-version: 22registry-url: https://registry.npmjs.org+ - name: Prepare canonical parser assets for archive validation+ run: |+ bun install --frozen-lockfile --ignore-scripts+ bun scripts/parser-assets.mjs- name: Retrieve the exact public registry versionrun: |mkdir -p "$RUNNER_TEMP/jevgrep-registry"diff --git a/.gitignore b/.gitignoreindex 832a165..127eaca 100644--- a/.gitignore+++ b/.gitignore@@ -18,3 +18,6 @@ __pycache__/# Deprecated personal-repository evaluation tooling stays local./packages/evals/++# Copied from pinned grammar packages by the CLI build.+/packages/core/assets/tree-sitter/diff --git a/apps/cli/package.json b/apps/cli/package.jsonindex d9d01e2..0e8e8a3 100644--- a/apps/cli/package.json+++ b/apps/cli/package.json@@ -29,8 +29,8 @@"test": "bun test test"},"dependencies": {- "pyodide": "0.25.1",- "typescript": "5.9.3"+ "typescript": "5.9.3",+ "web-tree-sitter": "0.27.0"},"devDependencies": {"@clack/prompts": "1.8.1",diff --git a/apps/cli/test/package.test.ts b/apps/cli/test/package.test.tsindex 49066e5..d361770 100644--- a/apps/cli/test/package.test.ts+++ b/apps/cli/test/package.test.ts@@ -36,9 +36,8 @@ testInDocker(const packed = JSON.parse(stdout)[0];const filenames = packed.files.map((file: { path: string }) => file.path);expect(filenames).toContain("dist/bin/index.js");- expect(filenames).toContain("dist/bin/python-worker.mjs");- for (const helper of ["inspect", "preview", "neighborhood"])- expect(filenames).toContain(`dist/assets/python/${helper}.py`);+ expect(filenames).toContain("dist/bin/parser-worker.mjs");+ expect(filenames).toContain("dist/assets/tree-sitter/tree-sitter-python.wasm");expect(filenames).toContain("dist/THIRD_PARTY_NOTICES.txt");expect(filenames).toContain("dist/skills/jevgrep/SKILL.md");expect(filenames.some((path: string) => /^(evals|src|node_modules|test)\//.test(path))).toBe(diff --git a/bun.lock b/bun.lockindex cb8288f..b200cb9 100644--- a/bun.lock+++ b/bun.lock@@ -13,13 +13,13 @@},"apps/cli": {"name": "@dzhng/jevgrep",- "version": "0.4.3",+ "version": "0.6.0","bin": {"jg": "./dist/bin/index.js",},"dependencies": {- "pyodide": "0.25.1","typescript": "5.9.3",+ "web-tree-sitter": "0.27.0",},"devDependencies": {"@clack/prompts": "1.8.1",@@ -36,12 +36,13 @@"@ai-sdk/typesafe-ai": "3.0.8","ai": "7.0.107","ignore": "7.0.5",- "pyodide": "0.25.1","typescript": "5.9.3",+ "web-tree-sitter": "0.27.0",},"devDependencies": {"@repo/typescript-config": "workspace:*","@types/node": "22",+ "tree-sitter-python": "0.25.0",},},"packages/typescript-config": {@@ -172,8 +173,6 @@"ai": ["[email protected]", "", { "dependencies": { "@ai-sdk/gateway": "4.0.87", "@ai-sdk/provider": "4.0.17", "@ai-sdk/provider-utils": "5.0.45" }, "peerDependencies": { "zod": "^3.25.76 || ^4.1.8" } }, "sha512-PVYQ3W9kR8oYiGQxbg4aFIlhQzKskZm8UV+4E0zB2uKOzFr8ju3bXQncOOZtLsOgJY8vdpgyu3cXtomsfcdQYg=="],- "base-64": ["[email protected]", "", {}, "sha512-kwDPIFCGx0NZHog36dj+tHiwP4QMzsZ3AgMViUBKI0+V5n4U0ufTCUMhnQ04diaRI8EX/QcPfql7zlhZ7j4zgg=="],-"bun-types": ["[email protected]", "", { "dependencies": { "@types/node": "*" } }, "sha512-4N0ig0fEomHt5R0KCFWjovxow98rIoRwKolrYdCcknNwMekCXRnWEUvgu5soYV8QXtVsrUD8B95MBOZGPvr6KQ=="],"eventsource-parser": ["[email protected]", "", {}, "sha512-EKN1vKAMcZ8MlYMpaNuxN6R9yakzH6uajHcHVTqWJzvu5pWw9DyhbP35HH8MVBQ+dZjAfDxk+A8NiR9KWaXiyQ=="],@@ -188,16 +187,20 @@"json-schema": ["[email protected]", "", {}, "sha512-es94M3nTIfsEPisRafak+HDLfHXnKBhV3vU5eqPcS3flIWqcxJWgXHXiey3YrpaNsanY5ei1VoYEbOzijuq9BA=="],+ "node-addon-api": ["[email protected]", "", {}, "sha512-VijLXbi3UACN69I0JVXJsX4tjACjNoQDgv2gTF6sx2wWEi8tkSg2eX8p5gSIFi8z2+DL3oHmY6OyKce38SDolg=="],++ "node-gyp-build": ["[email protected]", "", { "bin": { "node-gyp-build": "bin.js", "node-gyp-build-optional": "optional.js", "node-gyp-build-test": "build-test.js" } }, "sha512-LA4ZjwlnUblHVgq0oBF3Jl/6h/Nvs5fzBLwdEF4nuxnFdsfajde4WfxtJr3CaiH+F6ewcIB/q4jQ4UzPyid+CQ=="],+"oxfmt": ["[email protected]", "", { "dependencies": { "tinypool": "2.1.0" }, "optionalDependencies": { "@oxfmt/binding-android-arm-eabi": "0.57.0", "@oxfmt/binding-android-arm64": "0.57.0", "@oxfmt/binding-darwin-arm64": "0.57.0", "@oxfmt/binding-darwin-x64": "0.57.0", "@oxfmt/binding-freebsd-x64": "0.57.0", "@oxfmt/binding-linux-arm-gnueabihf": "0.57.0", "@oxfmt/binding-linux-arm-musleabihf": "0.57.0", "@oxfmt/binding-linux-arm64-gnu": "0.57.0", "@oxfmt/binding-linux-arm64-musl": "0.57.0", "@oxfmt/binding-linux-ppc64-gnu": "0.57.0", "@oxfmt/binding-linux-riscv64-gnu": "0.57.0", "@oxfmt/binding-linux-riscv64-musl": "0.57.0", "@oxfmt/binding-linux-s390x-gnu": "0.57.0", "@oxfmt/binding-linux-x64-gnu": "0.57.0", "@oxfmt/binding-linux-x64-musl": "0.57.0", "@oxfmt/binding-openharmony-arm64": "0.57.0", "@oxfmt/binding-win32-arm64-msvc": "0.57.0", "@oxfmt/binding-win32-ia32-msvc": "0.57.0", "@oxfmt/binding-win32-x64-msvc": "0.57.0" }, "peerDependencies": { "svelte": "^5.0.0", "vite-plus": "*" }, "optionalPeers": ["svelte", "vite-plus"], "bin": { "oxfmt": "bin/oxfmt" } }, "sha512-ZB7Bi+rGDSqmVIo9jwcLyFgjxXvQhDdU+jx+ZrVy6VRiVXK2+CHc4hO3J4dUQjHe7V0ymHB+MDuv5z+NhK07HA=="],"oxlint": ["[email protected]", "", { "optionalDependencies": { "@oxlint/binding-android-arm-eabi": "1.72.0", "@oxlint/binding-android-arm64": "1.72.0", "@oxlint/binding-darwin-arm64": "1.72.0", "@oxlint/binding-darwin-x64": "1.72.0", "@oxlint/binding-freebsd-x64": "1.72.0", "@oxlint/binding-linux-arm-gnueabihf": "1.72.0", "@oxlint/binding-linux-arm-musleabihf": "1.72.0", "@oxlint/binding-linux-arm64-gnu": "1.72.0", "@oxlint/binding-linux-arm64-musl": "1.72.0", "@oxlint/binding-linux-ppc64-gnu": "1.72.0", "@oxlint/binding-linux-riscv64-gnu": "1.72.0", "@oxlint/binding-linux-riscv64-musl": "1.72.0", "@oxlint/binding-linux-s390x-gnu": "1.72.0", "@oxlint/binding-linux-x64-gnu": "1.72.0", "@oxlint/binding-linux-x64-musl": "1.72.0", "@oxlint/binding-openharmony-arm64": "1.72.0", "@oxlint/binding-win32-arm64-msvc": "1.72.0", "@oxlint/binding-win32-ia32-msvc": "1.72.0", "@oxlint/binding-win32-x64-msvc": "1.72.0" }, "peerDependencies": { "oxlint-tsgolint": ">=0.22.1", "vite-plus": "*" }, "optionalPeers": ["oxlint-tsgolint", "vite-plus"], "bin": { "oxlint": "bin/oxlint" } }, "sha512-1rhdZIP/EvoI91ABIwNU5Q8+bWf8mjrS5UzIOZld4d4bXxJvtlUhlQvaoTogIGin/qdErMOrwaIJvCSIAKTLhA=="],- "pyodide": ["[email protected]", "", { "dependencies": { "base-64": "^1.0.0", "ws": "^8.5.0" } }, "sha512-y0nJ/fLA3bxD2iZRzvVTbP2O+wp4Ewm2wThfV4HF0BytQ6hsoqTJFLNY4usLOcCVBrK8TTWqFqrmsVPzHe4rsw=="],-"sisteransi": ["[email protected]", "", {}, "sha512-bLGGlR1QxBcynn2d5YmDX4MGjlZvy2MRBDRNHLJ8VI6l6+9FUiyTFNJ0IveOSP0bcXgVDPRcfGqA0pjaqUpfVg=="],"tinypool": ["[email protected]", "", {}, "sha512-Pugqs6M0m7Lv1I7FtxN4aoyToKg1C4tu+/381vH35y8oENM/Ai7f7C4StcoK4/+BSw9ebcS8jRiVrORFKCALLw=="],+ "tree-sitter-python": ["[email protected]", "", { "dependencies": { "node-addon-api": "^8.5.0", "node-gyp-build": "^4.8.4" }, "peerDependencies": { "tree-sitter": "^0.25.0" }, "optionalPeers": ["tree-sitter"] }, "sha512-eCmJx6zQa35GxaCtQD+wXHOhYqBxEL+bp71W/s3fcDMu06MrtzkVXR437dRrCrbrDbyLuUDJpAgycs7ncngLXw=="],+"turbo": ["[email protected]", "", { "optionalDependencies": { "@turbo/darwin-64": "2.10.3", "@turbo/darwin-arm64": "2.10.3", "@turbo/linux-64": "2.10.3", "@turbo/linux-arm64": "2.10.3", "@turbo/windows-64": "2.10.3", "@turbo/windows-arm64": "2.10.3" }, "bin": { "turbo": "bin/turbo" } }, "sha512-uZIqzfgtWbyqu1Tqwdd0giRnPGgL0ejbcdF8eZLJhtTTVSrOgArZGzYeXTD6XNcc7ANgdhqex11Y9bHBeyiQLQ=="],"typescript": ["[email protected]", "", { "bin": { "tsc": "bin/tsc", "tsserver": "bin/tsserver" } }, "sha512-jl1vZzPDinLr9eUt3J/t7V6FgNEw9QjvBPdysz9KfQDD41fQrC2Y4vKQdiaUpFT4bXlb1RHhLpp8wtm6M5TgSw=="],@@ -206,7 +209,7 @@"undici-types": ["[email protected]", "", {}, "sha512-iwDZqg0QAGrg9Rav5H4n0M64c3mkR59cJ6wQp+7C4nI0gsmExaedaYLNO44eT4AtBBwjbTiGPMlt2Md0T9H9JQ=="],- "ws": ["[email protected]", "", { "peerDependencies": { "bufferutil": "^4.0.1", "utf-8-validate": ">=5.0.2" }, "optionalPeers": ["bufferutil", "utf-8-validate"] }, "sha512-201TZ/kPWxoPr/OKWjquZR1SWKXcvxdH+e1xrx89b3YbmzLMFCLfnaG1HFIgWzJOEWZ7MvpK++odZufgYR50Rw=="],+ "web-tree-sitter": ["[email protected]", "", {}, "sha512-XK08gj6RwTMQatAG7uVRP8MunqotL/XC19vHgkSPKmELgbGPBj4ECvB8haHOUnyj6ls2B8t42UTro14zxGgAHg=="],"zod": ["[email protected]", "", {}, "sha512-v5l/aFXZQeai4awLbOpSoHecE9UiMrnfx75tEXLjNonXVARxQ5mOeipTjROUchszUNCqnE+hqAMujRsRHsut2Q=="],diff --git a/docs/architecture.md b/docs/architecture.mdindex 2751e82..c9f37bf 100644--- a/docs/architecture.md+++ b/docs/architecture.md@@ -30,6 +30,24 @@ requiring complete files in the initial output. Parsing supports Python andTypeScript/JavaScript; other or invalid text falls back to bounded source chunks.Source ranges always refer to the same immutable snapshot used for classification.+## Parsing++Python uses a [packaged Tree-sitter WASM grammar](../packages/core/assets/README.md)+in a cancellable worker. This avoids a Python installation requirement and the+startup cost of embedding an interpreter. TypeScript/JavaScript use the TypeScript+compiler parser; other eligible text remains searchable through bounded chunks.++The syntax tree supplies declarations and source coordinates. Python query+previews, structural neighbours and inherited-method reading leads are retrieval+policy on top of that tree, not a proof of runtime dispatch. Preserve original+source bytes; never reconstruct returned code from the tree.++Tree-sitter recognizes syntax rather than validating CPython semantics. Trees+with syntax errors use text fallback. Bare-CR Python also uses text fallback+because retrieval coordinates count LF lines. Repository source is never executed.+See [parser contracts](../test/parser/README.md) and+[measurement evidence](../specs/tree-sitter/RESULTS.md).+## Output and agent workflowStdout begins with status and a compact file summary, then verbatim source blocks,diff --git a/package.json b/package.jsonindex 0ff6cff..a2d7ce0 100644--- a/package.json+++ b/package.json@@ -14,7 +14,7 @@},"type": "module","scripts": {- "dev": "bun apps/cli/src/index.ts",+ "dev": "bun scripts/parser-assets.mjs && bun apps/cli/src/index.ts","build": "turbo build","check-types": "turbo check-types","lint": "turbo lint",diff --git a/packages/core/assets/README.md b/packages/core/assets/README.mdindex 9edcd09..26f8b08 100644--- a/packages/core/assets/README.md+++ b/packages/core/assets/README.md@@ -1,11 +1,10 @@-# Packaged Python helpers+# Parser assets-The Python helpers in `python/` inspect source as data. The standalone-worker executes them with the pinned Pyodide CPython runtime, supplied by the-normal npm dependency. The installed package includes the worker and helpers;-Pyodide includes its interpreter WASM and standard library. Parsing requires no-Python executable or runtime download.+The build copies the Python grammar WASM from its exact-version official+Tree-sitter package into `tree-sitter/`. The generated asset and its license+notice ship in the CLI archive; searches never download a grammar. The external+`web-tree-sitter` runtime supplies its own WASM and license.-Helpers resolve relative to the worker module, independently of the working-directory. Runtime source provenance and component licenses are retained in the-package's `THIRD_PARTY_NOTICES.txt`; their source copies live in `scripts/licenses/`.+[Asset preparation](../../../scripts/parser-assets.mjs) owns the copy and license+provenance. It also prepares the canonical grammar used by release validation;+a clean validation checkout must install the locked development dependencies first.diff --git a/packages/core/package.json b/packages/core/package.jsonindex 03890b7..77ee435 100644--- a/packages/core/package.json+++ b/packages/core/package.json@@ -16,11 +16,12 @@"@ai-sdk/typesafe-ai": "3.0.8","ai": "7.0.107","ignore": "7.0.5",- "pyodide": "0.25.1",- "typescript": "5.9.3"+ "typescript": "5.9.3",+ "web-tree-sitter": "0.27.0"},"devDependencies": {"@repo/typescript-config": "workspace:*",- "@types/node": "22"+ "@types/node": "22",+ "tree-sitter-python": "0.25.0"}}diff --git a/packages/core/src/call-context.ts b/packages/core/src/call-context.tsindex 75161d1..976612d 100644--- a/packages/core/src/call-context.ts+++ b/packages/core/src/call-context.ts@@ -1,4 +1,4 @@-import { runPython } from "./python";+import { runParser } from "./parser";import type { Snapshot } from "./filesystem";import type { FileEvidence, Range } from "./types";type Call = Range & {@@ -22,7 +22,7 @@ export async function localCallContext(return;const selected = file.selected.filter((r) => r.sourceByteStart === undefined);if (!selected.length) return;- const calls = await runPython<Call[]>(+ const calls = await runParser<Call[]>("calls",JSON.stringify({ source: snapshot.source, ranges: selected }),signal,diff --git a/packages/core/src/evaluator.ts b/packages/core/src/evaluator.tsindex cd947b3..27c19f6 100644--- a/packages/core/src/evaluator.ts+++ b/packages/core/src/evaluator.ts@@ -126,7 +126,7 @@ export function createEvaluator(options: {endpoint: endpoint.baseURL,protocol: "typesafe-ai-3.0.8",policyVersion: options.policyVersion ?? "1",- parserVersion: "cpython-3.11.3-pyodide-0.25.1-ts-5.9.3",+ parserVersion: "tree-sitter-0.27.0-python-0.25.0-ts-5.9.3",promptVersion: "unit-locators-1",},};diff --git a/packages/core/src/parser-helpers.mjs b/packages/core/src/parser-helpers.mjsnew file mode 100644index 0000000..9c2415b--- /dev/null+++ b/packages/core/src/parser-helpers.mjs@@ -0,0 +1,431 @@+import { Parser, Language, Query } from "web-tree-sitter";+import { fileURLToPath } from "node:url";+import { preview } from "./parser-preview.mjs";+let initialized;+let language;+async function parse(source, action) {+ // Retrieval coordinates count LF lines; normalizing bare CR would mislabel original bytes.+ if (/\r(?!\n)/.test(source)) return null;+ await (initialized ??= Parser.init());+ language ??= await Language.load(+ fileURLToPath(new URL("../assets/tree-sitter/tree-sitter-python.wasm", import.meta.url)),+ );+ const parser = new Parser();+ let tree;+ try {+ parser.setLanguage(language);+ tree = parser.parse(source);+ if (!tree || tree.rootNode.hasError) return null;+ if (!validPython(tree.rootNode)) return null;+ return action(tree.rootNode);+ } finally {+ tree?.delete();+ parser.delete();+ }+}+const field = (n, name) => n.childForFieldName(name);+function unparenthesized(node) {+ while (node?.type === "parenthesized_expression")+ node = node.namedChildren.find((child) => child.type !== "comment");+ return node;+}+const definition = (n) => (n.type === "decorated_definition" ? field(n, "definition") : n);+const isDefinition = (n) =>+ ["function_definition", "class_definition"].includes(definition(n)?.type);+const body = (n) => field(n, "body")?.namedChildren.filter((n) => n.type !== "comment") ?? [];+const name = (n) => field(n, "name")?.text.normalize("NFKC") ?? "";+function* walk(root) {+ const stack = [root];+ while (stack.length) {+ const n = stack.pop();+ yield n;+ for (const c of n.namedChildren.toReversed()) stack.push(c);+ }+}+// Tree-sitter deliberately recognizes some Python 2 syntax. Reject those forms, but+// accept modern Python syntax: this is structural recognition, not ast.compile validation.+let syntaxChecks;+function validPython(root) {+ // Let the native query engine skip nodes that cannot affect this compatibility policy.+ syntaxChecks ??= new Query(+ language,+ `[+ (exec_statement) (print_statement) (except_clause) (raise_statement) (for_in_clause)+ (concatenated_string) (function_definition) (class_definition) (integer)+ (comparison_operator) (string_start) (string) (parameters) (lambda_parameters) (delete_statement)+ ] @check`,+ );+ for (const { node: n } of syntaxChecks.captures(root)) {+ if (+ n.type === "exec_statement" ||+ (n.type === "print_statement" && n.namedChildren[0]?.type !== "chevron")+ )+ return false;+ if (n.type === "except_clause" && n.childrenForFieldName("value").length > 1) return false;+ if (n.type === "raise_statement" && n.namedChildren[0]?.type === "expression_list")+ return false;+ if (n.type === "for_in_clause" && n.childrenForFieldName("right").length > 1) return false;+ if (+ n.type === "concatenated_string" &&+ new Set(+ n.namedChildren.filter((c) => c.type === "string").map((c) => /^[ru]*b/i.test(c.text)),+ ).size > 1+ )+ return false;+ if (["function_definition", "class_definition"].includes(n.type) && !body(n).length)+ return false;+ if (n.type === "integer" && (/L$/i.test(n.text) || /^0[0-9_]*[1-9][0-9_]*$/.test(n.text)))+ return false;+ if (n.type === "comparison_operator" && n.children.some((c) => c.text === "<>")) return false;+ if (n.type === "string_start" && /^(?:ur|ru)/i.test(n.text)) return false;+ if (n.type === "string" && n.text.startsWith("`")) return false;+ if (+ ["parameters", "lambda_parameters"].includes(n.type) &&+ n.namedChildren.some(+ (c) => c.type === "tuple_pattern" || field(c, "name")?.type === "tuple_pattern",+ )+ )+ return false;+ if (+ n.type === "delete_statement" &&+ n.namedChildren.some(+ (c) =>+ !["identifier", "attribute", "subscript", "expression_list", "tuple", "list"].includes(+ unparenthesized(c).type,+ ),+ )+ )+ return false;+ }+ return true;+}+// Python AST ends exclude trailing comments. Tree-sitter includes them in blocks.+function endLine(n) {+ let last = n;+ while (last.children.length) {+ const child = last.children.filter((c) => c.type !== "comment").at(-1);+ if (!child) break;+ last = child;+ }+ return last.endPosition.row + 1;+}+function startLine(n) {+ if (n.type === "decorated_definition") {+ const decorator = n.namedChildren.find((c) => c.type === "decorator");+ const expression = unparenthesized(decorator?.namedChildren[0]);+ return (expression ?? decorator ?? n).startPosition.row + 1;+ }+ return n.startPosition.row + 1;+}+const range = (n) => ({ startLine: startLine(n), endLine: endLine(n) });+function inspectPython(root) {+ const units = [];+ function visit(nodes, prefix = "", headers = []) {+ for (const wrapped of nodes) {+ if (!isDefinition(wrapped)) continue;+ const n = definition(wrapped),+ named = prefix + name(n),+ r = range(wrapped);+ const children = body(n).filter(isDefinition);+ if (n.type === "class_definition" && children.length) {+ const first = startLine(children[0]);+ const own =+ first > r.startLine+ ? [...headers, { startLine: r.startLine, endLine: first - 1 }]+ : headers;+ let cursor = r.startLine;+ for (const child of children) {+ const start = startLine(child);+ if (cursor < start)+ units.push({+ name: named + ".context",+ startLine: cursor,+ endLine: start - 1,+ ownerHeaders: own,+ });+ visit([child], named + ".", own);+ cursor = endLine(child) + 1;+ }+ if (cursor <= r.endLine)+ units.push({+ name: named + ".context",+ startLine: cursor,+ endLine: r.endLine,+ ownerHeaders: own,+ });+ } else units.push({ name: named, ...r, ownerHeaders: headers });+ }+ }+ visit(root.namedChildren);+ return units;+}+function neighborhood(root, ranges) {+ const extra = [];+ for (const wrapped of walk(root)) {+ if (wrapped.type === "function_definition" && wrapped.parent?.type === "decorated_definition")+ continue;+ const n = definition(wrapped);+ if (n?.type !== "function_definition") continue;+ const block = wrapped.parent,+ owner = block?.parent;+ if (owner?.type !== "class_definition") continue;+ const r = range(wrapped);+ if (!ranges.some((s) => s.startLine <= r.endLine && s.endLine >= r.startLine)) continue;+ const siblings = body(owner).filter(isDefinition);+ const ownerWrapper = owner.parent?.type === "decorated_definition" ? owner.parent : owner;+ const start = startLine(ownerWrapper),+ end = Math.min(...siblings.map((s) => startLine(s) - 1), start + 39);+ if (start <= end) extra.push({ startLine: start, endLine: end });+ const index = siblings.findIndex((s) => s.id === wrapped.id);+ for (const sibling of siblings.slice(Math.max(0, index - 1), index + 2)) {+ const rr = range(sibling);+ if (sibling.id !== wrapped.id && rr.endLine - rr.startLine + 1 <= 40) extra.push(rr);+ }+ }+ return extra;+}+function previewMatches(root, tokens) {+ const matches = [];+ for (const n of walk(root)) {+ if (!["class_definition", "function_definition"].includes(n.type) || !tokens.has(name(n)))+ continue;+ const wrapped = n.parent?.type === "decorated_definition" ? n.parent : n;+ const statements = body(n),+ first = statements[0];+ if (!first) continue;+ let implementation = first,+ expr = unparenthesized(+ first.type === "expression_statement" ? first.namedChildren[0] : undefined,+ );+ const stringNodes =+ expr?.type === "concatenated_string"+ ? expr.namedChildren.filter((c) => c.type === "string")+ : [expr];+ if (+ stringNodes.length &&+ stringNodes.every((s) => s?.type === "string" && !/^[rub]*[fb]/i.test(s.text)) &&+ statements.length > 1+ )+ implementation = statements[1];+ let owner = n.parent;+ while (owner && owner.type !== "class_definition") owner = owner.parent;+ const context = owner+ ? {+ startLine: startLine(+ owner.parent?.type === "decorated_definition" ? owner.parent : owner,+ ),+ endLine: body(owner)[0].startPosition.row,+ }+ : null;+ matches.push({+ start: startLine(wrapped),+ end: endLine(n),+ context,+ header_end: first.startPosition.row,+ header_line: n.startPosition.row + 1,+ header_column_end:+ first.startPosition.row === n.startPosition.row ? first.startPosition.column : 0,+ body_start: implementation.startPosition.row + 1,+ body_column:+ implementation !== first && implementation.startPosition.row === first.startPosition.row+ ? implementation.startPosition.column+ : 0,+ });+ }+ return matches.sort((a, b) => a.start - b.start || a.end - b.end);+}+function assignsSelf(target) {+ if (!target) return false;+ if (target.type === "identifier") return target.text.normalize("NFKC") === "self";+ if (["attribute", "subscript"].includes(target.type)) return false;+ return target.namedChildren.some(assignsSelf);+}+function uniqueDefinitions(nodes) {+ const map = new Map(),+ duplicates = new Set();+ for (const node of nodes) {+ const key = name(definition(node));+ if (map.has(key)) duplicates.add(key);+ map.set(key, node);+ }+ for (const key of duplicates) map.delete(key);+ return map;+}+function calls(root, source, ranges) {+ const definitions = root.namedChildren+ .map(definition)+ .filter((n) => n?.type === "class_definition");+ const classes = uniqueDefinitions(definitions);+ const methods = new Map(),+ bases = new Map();+ for (const [key, n] of classes) {+ const defs = body(n).filter((c) => definition(c)?.type === "function_definition");+ methods.set(key, uniqueDefinitions(defs));+ // Only bare identifiers can resolve to local classes. Other bases remain explicitly unknown.+ bases.set(+ key,+ (field(n, "superclasses")?.namedChildren ?? [])+ .filter((c) => c.type !== "keyword_argument" && c.type !== "comment")+ .map((c) => unparenthesized(c).text.normalize("NFKC")),+ );+ }+ const memo = new Map();+ function mro(key, seen = new Set()) {+ if (seen.has(key)) throw new Error("cyclic inheritance");+ if (memo.has(key)) return [...memo.get(key)];+ const parents = bases.get(key) ?? [],+ next = new Set([...seen, key]);+ const sequences = [...parents.map((p) => mro(p, next)), [...parents]],+ result = [key];+ while (sequences.some((s) => s.length)) {+ const active = sequences.filter((s) => s.length),+ head = active.map((s) => s[0]).find((h) => !active.some((s) => s.slice(1).includes(h)));+ if (head === undefined) throw new Error("inconsistent inheritance");+ result.push(head);+ for (const s of active) if (s[0] === head) s.shift();+ }+ memo.set(key, result);+ return [...result];+ }+ function bodyNodes(n) {+ const result = [],+ stack = [n];+ while (stack.length) {+ const node = stack.pop();+ result.push(node);+ for (const c of node.namedChildren.toReversed())+ if (+ !["function_definition", "class_definition", "lambda", "decorated_definition"].includes(+ c.type,+ )+ )+ stack.push(c);+ }+ return result;+ }+ const result = [],+ seen = new Set(),+ lines = source.split("\n");+ for (const [owner, defs] of methods)+ for (const [method, wrapped] of defs) {+ const fn = definition(wrapped),+ params = field(fn, "parameters")?.namedChildren.filter((n) => n.type !== "comment") ?? [];+ const first = params[0],+ parameter =+ first?.type === "identifier"+ ? first+ : (field(first ?? fn, "name") ??+ first?.namedChildren.find((n) => n.type === "identifier"));+ if (+ wrapped.type === "decorated_definition" ||+ parameter?.text.normalize("NFKC") !== "self" ||+ first?.text.startsWith("*")+ )+ continue;+ const nodes = bodyNodes(fn);+ // Conservatively suppress leads whenever this scope writes self, including destructuring.+ if (+ nodes.some(+ (n) =>+ (n.type === "case_pattern" &&+ [...walk(n)].some(+ (c) => c.type === "identifier" && c.text.normalize("NFKC") === "self",+ )) ||+ (n.type === "import_statement" &&+ n.namedChildren.some(+ (c) =>+ c.type === "dotted_name" && c.text.split(".")[0].normalize("NFKC") === "self",+ )) ||+ (n.type === "import_from_statement" &&+ n+ .childrenForFieldName("name")+ .some((c) => c.type === "dotted_name" && c.text.normalize("NFKC") === "self")),+ ) ||+ nodes.some(+ (n) =>+ [+ "assignment",+ "augmented_assignment",+ "named_expression",+ "for_statement",+ "for_in_clause",+ "as_pattern",+ "aliased_import",+ ].includes(n.type) &&+ assignsSelf(field(n, "alias") ?? field(n, "left") ?? field(n, "name")),+ )+ )+ continue;+ for (const n of nodes) {+ if (n.type !== "call") continue;+ const func = unparenthesized(field(n, "function"));+ if (+ func?.type !== "attribute" ||+ unparenthesized(field(func, "object"))?.text.normalize("NFKC") !== "self"+ )+ continue;+ if (+ !ranges.some(+ (r) => r.startLine <= n.startPosition.row + 1 && r.endLine >= n.startPosition.row + 1,+ )+ )+ continue;+ const unknown = [];+ let order;+ try {+ order = mro(owner);+ } catch {+ return [];+ }+ for (const ancestor of order) {+ if (!classes.has(ancestor)) {+ unknown.push(ancestor);+ continue;+ }+ const target = methods+ .get(ancestor)+ .get(field(func, "attribute")?.text.normalize("NFKC"));+ if (!target) continue;+ if (ancestor === owner) break;+ const rr = range(target);+ if (ranges.some((r) => r.startLine <= rr.startLine && r.endLine >= rr.endLine)) break;+ const identity = JSON.stringify([owner, method, ancestor, name(definition(target))]);+ if (seen.has(identity)) break;+ seen.add(identity);+ while (rr.startLine > 1 && lines[rr.startLine - 2].trimStart().startsWith("#"))+ rr.startLine--;+ const cls = classes.get(ancestor);+ result.push({+ caller: owner + "." + method,+ name: ancestor + "." + name(definition(target)),+ ...rr,+ unknownEarlierBases: unknown,+ ownerHeader: {+ startLine: cls.startPosition.row + 1,+ endLine: body(cls)[0].startPosition.row,+ },+ });+ break;+ }+ }+ }+ return result;+}+export async function execute(helper, input) {+ if (helper === "inspect") return parse(input, inspectPython);+ const data = JSON.parse(input);+ if (helper === "neighborhood")+ return parse(data.source, (root) => neighborhood(root, data.ranges));+ if (helper === "calls")+ return parse(data.source, (root) => calls(root, data.source, data.ranges));+ if (helper === "preview") {+ const tokens = new Set(+ data.query.normalize("NFKC").match(/[_\p{ID_Start}][_\p{ID_Continue}]*/gu) ?? [],+ );+ let matches = [];+ if (/\.pyi?$/.test(data.path) && Buffer.byteLength(data.text) > data.budget)+ matches = await parse(data.text, (root) => previewMatches(root, tokens));+ return preview(data, matches);+ }+ throw new Error("Unknown parser operation");+}diff --git a/packages/core/src/parser-preview.mjs b/packages/core/src/parser-preview.mjsnew file mode 100644index 0000000..4ac8828--- /dev/null+++ b/packages/core/src/parser-preview.mjs@@ -0,0 +1,214 @@+// Rendering only; all offsets refer to the original UTF-8 source, never normalized text.+export function preview({ text, budget }, matches) {+ if (!Number.isSafeInteger(budget) || budget < 256)+ throw new Error("Preview allowance must be at least 256 bytes");+ const lines = text.split("\n"),+ sourceBytes = Buffer.byteLength(text),+ offsets = [];+ let offset = 0;+ for (const line of lines) {+ offsets.push(offset);+ offset += Buffer.byteLength(line) + 1;+ }+ if (sourceBytes <= budget)+ return {+ text,+ spans: [+ {+ startLine: 1,+ endLine: lines.length,+ text,+ basis: "complete source",+ sourceByteStart: 0,+ sourceByteEnd: sourceBytes,+ },+ ],+ truncated: false,+ sourceBytes,+ previewBytes: sourceBytes,+ method: "complete source",+ matchedDeclarations: 0,+ unrepresentedMatches: 0,+ };+ const spans = [],+ parts = [],+ seen = new Set();+ let used = 0;+ function clip(raw, limit, fromEnd = false) {+ let start = fromEnd ? Math.max(0, raw.length - limit) : 0,+ end = fromEnd ? raw.length : Math.min(raw.length, limit);+ while (start < end && (raw[start] & 0xc0) === 0x80) start++;+ while (end < raw.length && end > start && (raw[end] & 0xc0) === 0x80) end--;+ return raw.subarray(start, end).toString("utf8");+ }+ function add(start, end, allowance, basis, fromEnd = false) {+ if (start > end) return false;+ start = Math.max(1, start);+ end = Math.min(end, lines.length);+ allowance = Math.min(allowance, budget - used);+ const header = `--- source lines ${start}-${end}; ${basis}; may be clipped ---\n`;+ const remaining = Math.floor(allowance - Buffer.byteLength(header) - 1);+ if (remaining <= 0) return false;+ let selected = [],+ size = 0,+ partial = false;+ const candidates = lines.slice(start - 1, end);+ if (fromEnd) candidates.reverse();+ for (let line of candidates) {+ const cost = Buffer.byteLength(line) + (selected.length ? 1 : 0);+ if (size + cost > remaining) {+ if (!selected.length) {+ line = clip(Buffer.from(line), remaining, fromEnd);+ if (line) {+ selected = [line];+ partial = true;+ }+ }+ break;+ }+ selected.push(line);+ size += cost;+ }+ if (!selected.length) return false;+ if (fromEnd) {+ selected.reverse();+ start = end - selected.length + 1;+ }+ const actualEnd = start + selected.length - 1,+ body = selected.join("\n"),+ identity = JSON.stringify([start, actualEnd, body]);+ if (seen.has(identity)) return true;+ const label = `--- source lines ${start}-${actualEnd}; ${basis}${partial ? "; partial line" : ""} ---\n`,+ rendered = label + body + "\n";+ if (Buffer.byteLength(rendered) > allowance) return false;+ const byteStart =+ offsets[start - 1] ++ (partial && fromEnd ? Buffer.byteLength(lines[start - 1]) - Buffer.byteLength(body) : 0);+ seen.add(identity);+ spans.push({+ sourceByteStart: byteStart,+ sourceByteEnd: byteStart + Buffer.byteLength(body),+ startLine: start,+ endLine: actualEnd,+ text: body,+ basis,+ partialLine: partial,+ });+ parts.push(rendered);+ used += Buffer.byteLength(rendered);+ return true;+ }+ function inline(line, startColumn, endColumn, allowance, basis) {+ const raw = Buffer.from(lines[line - 1]);+ const start = Buffer.byteLength(lines[line - 1].slice(0, startColumn)),+ end = Math.min(raw.length, Buffer.byteLength(lines[line - 1].slice(0, endColumn)));+ allowance = Math.min(allowance, budget - used);+ const longest = `--- source line ${line}, bytes ${start}-${end}; ${basis}; partial line ---\n`,+ room = Math.floor(allowance - Buffer.byteLength(longest) - 1);+ if (room <= 0) return false;+ const body = clip(raw.subarray(start, end), room);+ if (!body) return false;+ const actualEnd = start + Buffer.byteLength(body),+ label = `--- source line ${line}, bytes ${start}-${actualEnd}; ${basis}; partial line ---\n`,+ rendered = label + body + "\n";+ const identity = JSON.stringify([line, start, actualEnd, body]);+ if (seen.has(identity)) return true;+ seen.add(identity);+ parts.push(rendered);+ used += Buffer.byteLength(rendered);+ spans.push({+ sourceByteStart: offsets[line - 1] + start,+ sourceByteEnd: offsets[line - 1] + actualEnd,+ startLine: line,+ endLine: line,+ columnStartByte: start,+ columnEndByte: actualEnd,+ text: body,+ basis,+ partialLine: true,+ });+ return true;+ }+ add(1, lines.length, Math.floor(budget / 4), "opening context");+ let unrepresented = 0;+ if (matches?.length) {+ const perMatch = Math.max(1, Math.floor(Math.floor((budget - used) * 0.75) / matches.length));+ for (const m of matches) {+ let contextCost = 0;+ if (m.context) {+ const before = used;+ add(+ m.context.startLine,+ m.context.endLine,+ Math.min(Math.floor(perMatch / 3), 512),+ "enclosing class context",+ );+ contextCost = used - before;+ }+ const before = used;+ add(+ m.start,+ m.header_end,+ Math.min(Math.floor((perMatch - contextCost) / 3), 512),+ "query-named declaration header",+ );+ if (m.header_column_end)+ inline(+ m.header_line,+ 0,+ m.header_column_end,+ Math.min(Math.floor((perMatch - contextCost) / 3), 512),+ "query-named declaration header",+ );+ const remaining = perMatch - contextCost - (used - before);+ let represented;+ if (m.body_column) {+ const before = used;+ represented = inline(+ m.body_start,+ m.body_column,+ lines[m.body_start - 1].length,+ remaining,+ "query-named implementation",+ );+ if (m.end > m.body_start)+ add(+ m.body_start + 1,+ m.end,+ remaining - (used - before),+ "query-named implementation continuation",+ );+ } else represented = add(m.body_start, m.end, remaining, "query-named implementation");+ if (!represented) unrepresented++;+ }+ }+ const positions = [+ ...new Set([+ Math.floor(lines.length / 3) + 1,+ Math.floor((2 * lines.length) / 3) + 1,+ Math.max(1, lines.length - 31),+ ]),+ ].sort((a, b) => a - b);+ positions.forEach((start, i) =>+ add(+ start,+ Math.min(start + 31, lines.length),+ Math.floor((budget - used) / (positions.length - i)),+ "distributed context",+ i === positions.length - 1,+ ),+ );+ return {+ text: parts.join(""),+ spans,+ truncated: true,+ sourceBytes,+ previewBytes: used,+ method: "query-assisted source windows",+ matchedDeclarations: matches?.length ?? 0,+ unrepresentedMatches: unrepresented,+ parseUnavailable: matches === null,+ scope:+ "Sampled content only; missing terms or unseen ranges do not establish irrelevance. No additional source files read.",+ };+}diff --git a/packages/core/src/parser-worker.mjs b/packages/core/src/parser-worker.mjsnew file mode 100644index 0000000..1339360--- /dev/null+++ b/packages/core/src/parser-worker.mjs@@ -0,0 +1,13 @@+import { execute } from "./parser-helpers.mjs";+// A serial queue also covers asynchronous grammar initialization.+let queue = Promise.resolve();+process.on("message", ({ id, helper, input }) => {+ queue = queue.then(async () => {+ try {+ process.send?.({ id, result: await execute(helper, input) });+ } catch (error) {+ process.send?.({ id, error: String(error) });+ }+ });+});+process.on("disconnect", () => process.exit(0));diff --git a/packages/core/src/python.ts b/packages/core/src/parser.tssimilarity index 69%rename from packages/core/src/python.tsrename to packages/core/src/parser.tsindex 53f16d5..5f1165b 100644--- a/packages/core/src/python.ts+++ b/packages/core/src/parser.ts@@ -18,8 +18,8 @@ function stop(owner: Runtime, error: Error, cancellation = false) {for (const request of owner.pending.values()) {request.cleanup();if (cancellation && !request.signal?.aborted) {- // Helpers have no side effects; unrelated requests can survive a cancelled interpreter.- runPython(request.helper, request.input, request.signal).then(+ // Helpers have no side effects; unrelated requests can survive a cancelled worker.+ runParser(request.helper, request.input, request.signal).then(request.resolve,request.reject,);@@ -30,7 +30,7 @@ function stop(owner: Runtime, error: Error, cancellation = false) {}function start(): Runtime {const owner: Runtime = {- worker: fork(new URL("./python-worker.mjs", import.meta.url), [], {+ worker: fork(new URL("./parser-worker.mjs", import.meta.url), [], {execPath: process.versions.bun ? "node" : process.execPath,execArgv: [],stdio: ["ignore", "ignore", "ignore", "ipc"],@@ -38,32 +38,29 @@ function start(): Runtime {pending: new Map(),};// Runtime loader diagnostics must not bypass the CLI output contract.- owner.worker.on(- "message",- (message: { id: number; result?: unknown; sourceError?: string; error?: string }) => {- const request = owner.pending.get(message.id);- if (!request) return;- owner.pending.delete(message.id);- request.cleanup();- if (message.error) request.reject(new Error(`Python helper failed: ${message.error}`));- else request.resolve(message.sourceError ? null : message.result);- if (!owner.pending.size) {- owner.worker.unref();- owner.worker.channel?.unref?.();- }- },- );+ owner.worker.on("message", (message: { id: number; result?: unknown; error?: string }) => {+ const request = owner.pending.get(message.id);+ if (!request) return;+ owner.pending.delete(message.id);+ request.cleanup();+ if (message.error) request.reject(new Error(`Parser helper failed: ${message.error}`));+ else request.resolve(message.result);+ if (!owner.pending.size) {+ owner.worker.unref();+ owner.worker.channel?.unref?.();+ }+ });owner.worker.on("error", (error) => stop(owner, error));owner.worker.on("exit", (code) => {- if (runtime === owner) stop(owner, new Error(`Python worker exited (${code})`));+ if (runtime === owner) stop(owner, new Error(`Parser worker exited (${code})`));});owner.worker.unref();owner.worker.channel?.unref?.();return owner;}-/** One serialized interpreter; idle workers never keep a CLI alive. Cancellation discards its state. */-export function runPython<T>(+/** One serialized parser worker; idle workers never keep a CLI alive. Cancellation discards its state. */+export function runParser<T>(helper: Helper,input: string,signal?: AbortSignal,@@ -77,7 +74,7 @@ export function runPython<T>(owner,signal?.reason instanceof Error? signal.reason- : new DOMException("Python parsing cancelled", "AbortError"),+ : new DOMException("Parser parsing cancelled", "AbortError"),true,);owner.pending.set(id, {diff --git a/packages/core/src/python-worker.mjs b/packages/core/src/python-worker.mjsdeleted file mode 100644index 2103421..0000000--- a/packages/core/src/python-worker.mjs+++ /dev/null@@ -1,50 +0,0 @@-import { readFile } from "node:fs/promises";-import { fileURLToPath } from "node:url";-import { loadPyodide } from "pyodide";--const indexURL = new URL(".", import.meta.resolve("pyodide/package.json"));-// Only these trusted bundled programs execute; repository content is stdin data.-const runtime = await loadPyodide({- indexURL: fileURLToPath(indexURL),- stdout: () => {},- stderr: () => {},-});-const sources = Object.fromEntries(- await Promise.all(- ["inspect", "preview", "neighborhood", "calls"].map(async (name) => [- name,- await readFile(new URL(`../assets/python/${name}.py`, import.meta.url), "utf8"),- ]),- ),-);-runtime.globals.set("helper_sources_json", JSON.stringify(sources));-runtime.runPython(`import io, json, sys, contextlib-helper_programs = {name: compile(source, name, 'exec') for name, source in json.loads(helper_sources_json).items()}-def run_helper(name, request):- previous = sys.stdin- output = io.StringIO()- try:- sys.stdin = io.StringIO(request)- with contextlib.redirect_stdout(output):- exec(helper_programs[name], {'__name__': '__main__'})- return json.dumps({'result': json.loads(output.getvalue())})- except Exception as error:- return json.dumps({'sourceError': type(error).__name__})- finally:- sys.stdin = previous-`);-process.on("message", ({ id, helper, input }) => {- try {- runtime.globals.set("helper_name", helper);- runtime.globals.set("helper_input", input);- process.send({- id,- ...JSON.parse(runtime.runPython("run_helper(helper_name, helper_input)")),- });- } catch (error) {- process.send({ id, error: String(error) });- }-});--// The parent may exit with an idle interpreter; do not leave an orphan process.-process.on("disconnect", () => process.exit(0));diff --git a/packages/core/src/source.ts b/packages/core/src/source.tsindex d68b329..8e50dce 100644--- a/packages/core/src/source.ts+++ b/packages/core/src/source.ts@@ -1,5 +1,5 @@import ts from "typescript";-import { runPython } from "./python.ts";+import { runParser } from "./parser.ts";export type Range = { startLine: number; endLine: number };import type { Snapshot } from "./filesystem";@@ -106,7 +106,7 @@ export async function inspect(let syntaxFallback = false;if (/\.pyi?$/.test(path)) {// A missing/incompatible packaged parser is a setup failure, never syntax fallback.- const parsed = await runPython<Array<Range & { name: string; ownerHeaders: Range[] }>>(+ const parsed = await runParser<Array<Range & { name: string; ownerHeaders: Range[] }>>("inspect",source,options.signal,@@ -189,8 +189,7 @@ export async function inspect(mode,comments,units: units.flatMap((unit) => {- // Frozen helpers report CPython line coordinates, while the caller slices on LF.- // Keep those coordinates even for CR-only source or an empty LF slice.+ // Parser ranges and returned byte spans must remain tied to the original snapshot.const start = Math.min(text.bytes.length,text.offsets[unit.range.startLine - 1] ?? text.bytes.length,@@ -226,7 +225,7 @@ export async function pythonNeighborhood(): Promise<Range[]> {if (!/\.pyi?$/.test(snapshot.path) || Buffer.byteLength(snapshot.source) > 1_000_000) return [];return (- (await runPython<Range[]>(+ (await runParser<Range[]>("neighborhood",JSON.stringify({ source: snapshot.source, ranges: selected }),signal,@@ -255,7 +254,7 @@ export type SourcePreview = {parseUnavailable?: boolean;scope?: string;};-/** The bundled preview helper handles Python declarations and generic text windows. */+/** The preview worker handles Python declarations and generic text windows. */export async function pythonPreview(snapshot: Snapshot,query: string,@@ -264,7 +263,7 @@ export async function pythonPreview(): Promise<SourcePreview | null> {if (!Number.isSafeInteger(budget) || budget < 256)throw new Error("Preview allowance must be at least 256 bytes");- const result = await runPython<SourcePreview>(+ const result = await runParser<SourcePreview>("preview",JSON.stringify({ text: snapshot.source, path: snapshot.path, query, budget }),signal,diff --git a/scripts/RELEASING.md b/scripts/RELEASING.mdindex 9f85600..46751fb 100644--- a/scripts/RELEASING.md+++ b/scripts/RELEASING.md@@ -30,9 +30,12 @@ asset checks. [The build](build-cli.ts) copies the authored MIT license and[collects third-party notices](package-notices.mjs) from emitted bundle inputs.[Retained license sources](licenses/README.md) document upstream distribution gaps.The archive excludes test fixtures, evaluation evidence, node_modules directories, source maps,-and unbundled development source. Authored Python helpers and the Node worker+and unbundled development source. The parser worker, extraction code, and packaged Python grammarare required runtime assets and are included. Direct runtime parser dependenciesinstall from exact npm pins; transitive dependencies resolve during npm installation.+The registry-verification checkout installs locked development dependencies and+runs [asset preparation](parser-assets.mjs) before comparing canonical grammar+bytes and license notices with the downloaded archive.On an Apple Silicon Mac, run `node scripts/test-native.mjs` after the normal`bun install --frozen-lockfile` setup. This builds and packs the candidate, installsdiff --git a/scripts/build-cli.ts b/scripts/build-cli.tsindex 4ced079..9c19970 100644--- a/scripts/build-cli.ts+++ b/scripts/build-cli.ts@@ -1,12 +1,14 @@-import { chmod, cp, mkdir, readFile, rm, writeFile } from "node:fs/promises";+import { chmod, cp, mkdir, rm, writeFile } from "node:fs/promises";import { dirname, join } from "node:path";import { fileURLToPath } from "node:url";-import { bundledNotices, pythonRuntimeNotices } from "./package-notices.mjs";+import { grammarAssets } from "./parser-assets.mjs";++import { bundledNotices } from "./package-notices.mjs";const root = fileURLToPath(new URL("../", import.meta.url));const out = join(root, "apps/cli/dist");-const metadata = JSON.parse(await readFile(join(root, "apps/cli/package.json"), "utf8"));+const grammarNotices = await grammarAssets(root, true);await rm(out, { recursive: true, force: true });await mkdir(join(out, "bin"), { recursive: true });const build = await Bun.build({@@ -15,16 +17,16 @@ const build = await Bun.build({target: "node",format: "esm",metafile: true,- external: ["pyodide", "typescript"],+ external: ["web-tree-sitter", "typescript"],});if (!build.success) throw new AggregateError(build.logs, "CLI build failed");await chmod(join(out, "bin/index.js"), 0o755);await writeFile(join(out, "THIRD_PARTY_NOTICES.txt"),- (await bundledNotices(build.metafile!, process.cwd())) +- (await pythonRuntimeNotices(metadata.dependencies.pyodide)),+ (await bundledNotices(build.metafile!, process.cwd())) + grammarNotices,);-await cp(join(root, "packages/core/src/python-worker.mjs"), join(out, "bin/python-worker.mjs"));+for (const name of ["parser-worker", "parser-helpers", "parser-preview"])+ await cp(join(root, `packages/core/src/${name}.mjs`), join(out, `bin/${name}.mjs`));await cp(join(root, "LICENSE"), join(out, "LICENSE"));await cp(join(root, "packages/core/assets"), join(out, "assets"), { recursive: true });const skill = join(out, "skills/jevgrep/SKILL.md");diff --git a/scripts/licenses/README.md b/scripts/licenses/README.mdindex 8d01e4f..c6388fe 100644--- a/scripts/licenses/README.md+++ b/scripts/licenses/README.md@@ -11,22 +11,8 @@ The notice generator retains package copyright notices and includes these termswhen emitted dependencies use Apache-2.0. Builds read these retained sources;there is no build-time or runtime license download.-## External Python runtime+## Parser grammars-Pyodide's npm package omits license files and labels itself Apache-2.0, while its-[tagged upstream license](https://github.com/pyodide/pyodide/blob/0.25.1/LICENSE)-is MPL-2.0. The notice generator preserves both records and the actual component-texts; it does not relabel the whole distribution Apache-only. Corresponding-source links are included for the unmodified runtime and its build/CPython patches.--The pinned [build configuration](https://github.com/pyodide/pyodide/blob/0.25.1/Makefile.envs)-identifies CPython 3.11.3 and Emscripten 3.1.46; the-[CPython makefile](https://github.com/pyodide/pyodide/blob/0.25.1/cpython/Makefile)-pins libffi and hiwire. Retained license files come from those exact source-versions. CPython's license documentation preserves its bundled-component-notices; Emscripten's license and system-library notices preserve the runtime-terms. The source URLs are maintained with the notice generator. The separately-installed `base-64` and `ws` packages already carry their own licenses.--Changing the runtime version requires checking these source versions and notices-again. No license text is downloaded during build or execution.+The build copies license notices directly from the pinned official Tree-sitter+Python grammar package. Its WASM file is shipped unmodified. The external+web-tree-sitter and TypeScript packages retain their installed license files.diff --git a/scripts/licenses/bzip2-1.0.6.LICENSE b/scripts/licenses/bzip2-1.0.6.LICENSEdeleted file mode 100644index cc61417..0000000--- a/scripts/licenses/bzip2-1.0.6.LICENSE+++ /dev/null@@ -1,42 +0,0 @@------------------------------------------------------------------------------This program, "bzip2", the associated library "libbzip2", and all-documentation, are copyright (C) 1996-2010 Julian R Seward. All-rights reserved.--Redistribution and use in source and binary forms, with or without-modification, are permitted provided that the following conditions-are met:--1. Redistributions of source code must retain the above copyright- notice, this list of conditions and the following disclaimer.--2. The origin of this software must not be misrepresented; you must- not claim that you wrote the original software. If you use this- software in a product, an acknowledgment in the product- documentation would be appreciated but is not required.--3. Altered source versions must be plainly marked as such, and must- not be misrepresented as being the original software.--4. The name of the author may not be used to endorse or promote- products derived from this software without specific prior written- permission.--THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS-OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED-WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE-ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY-DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL-DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE-GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS-INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,-WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING-NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS-SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.--Julian Seward, [email protected]-bzip2/libbzip2 version 1.0.6 of 6 September 2010----------------------------------------------------------------------------diff --git a/scripts/licenses/cpython-3.11.3-license.rst b/scripts/licenses/cpython-3.11.3-license.rstdeleted file mode 100644index 37a3d4f..0000000--- a/scripts/licenses/cpython-3.11.3-license.rst+++ /dev/null@@ -1,1014 +0,0 @@-.. highlight:: none--.. _history-and-license:--*******************-History and License-*******************---History of the software-=======================--Python was created in the early 1990s by Guido van Rossum at Stichting-Mathematisch Centrum (CWI, see https://www.cwi.nl/) in the Netherlands as a-successor of a language called ABC. Guido remains Python's principal author,-although it includes many contributions from others.--In 1995, Guido continued his work on Python at the Corporation for National-Research Initiatives (CNRI, see https://www.cnri.reston.va.us/) in Reston,-Virginia where he released several versions of the software.--In May 2000, Guido and the Python core development team moved to BeOpen.com to-form the BeOpen PythonLabs team. In October of the same year, the PythonLabs-team moved to Digital Creations (now Zope Corporation; see-https://www.zope.org/). In 2001, the Python Software Foundation (PSF, see-https://www.python.org/psf/) was formed, a non-profit organization created-specifically to own Python-related Intellectual Property. Zope Corporation is a-sponsoring member of the PSF.--All Python releases are Open Source (see https://opensource.org/ for the Open-Source Definition). Historically, most, but not all, Python releases have also-been GPL-compatible; the table below summarizes the various releases.--+----------------+--------------+------------+------------+-----------------+-| Release | Derived from | Year | Owner | GPL compatible? |-+================+==============+============+============+=================+-| 0.9.0 thru 1.2 | n/a | 1991-1995 | CWI | yes |-+----------------+--------------+------------+------------+-----------------+-| 1.3 thru 1.5.2 | 1.2 | 1995-1999 | CNRI | yes |-+----------------+--------------+------------+------------+-----------------+-| 1.6 | 1.5.2 | 2000 | CNRI | no |-+----------------+--------------+------------+------------+-----------------+-| 2.0 | 1.6 | 2000 | BeOpen.com | no |-+----------------+--------------+------------+------------+-----------------+-| 1.6.1 | 1.6 | 2001 | CNRI | no |-+----------------+--------------+------------+------------+-----------------+-| 2.1 | 2.0+1.6.1 | 2001 | PSF | no |-+----------------+--------------+------------+------------+-----------------+-| 2.0.1 | 2.0+1.6.1 | 2001 | PSF | yes |-+----------------+--------------+------------+------------+-----------------+-| 2.1.1 | 2.1+2.0.1 | 2001 | PSF | yes |-+----------------+--------------+------------+------------+-----------------+-| 2.1.2 | 2.1.1 | 2002 | PSF | yes |-+----------------+--------------+------------+------------+-----------------+-| 2.1.3 | 2.1.2 | 2002 | PSF | yes |-+----------------+--------------+------------+------------+-----------------+-| 2.2 and above | 2.1.1 | 2001-now | PSF | yes |-+----------------+--------------+------------+------------+-----------------+--.. note::-- GPL-compatible doesn't mean that we're distributing Python under the GPL. All- Python licenses, unlike the GPL, let you distribute a modified version without- making your changes open source. The GPL-compatible licenses make it possible to- combine Python with other software that is released under the GPL; the others- don't.--Thanks to the many outside volunteers who have worked under Guido's direction to-make these releases possible.---Terms and conditions for accessing or otherwise using Python-============================================================--Python software and documentation are licensed under the-:ref:`PSF License Agreement <PSF-license>`.--Starting with Python 3.8.6, examples, recipes, and other code in-the documentation are dual licensed under the PSF License Agreement-and the :ref:`Zero-Clause BSD license <BSD0>`.--Some software incorporated into Python is under different licenses.-The licenses are listed with code falling under that license.-See :ref:`OtherLicenses` for an incomplete list of these licenses.---.. _PSF-license:--PSF LICENSE AGREEMENT FOR PYTHON |release|---------------------------------------------.. parsed-literal::-- 1. This LICENSE AGREEMENT is between the Python Software Foundation ("PSF"), and- the Individual or Organization ("Licensee") accessing and otherwise using Python- |release| software in source or binary form and its associated documentation.-- 2. Subject to the terms and conditions of this License Agreement, PSF hereby- grants Licensee a nonexclusive, royalty-free, world-wide license to reproduce,- analyze, test, perform and/or display publicly, prepare derivative works,- distribute, and otherwise use Python |release| alone or in any derivative- version, provided, however, that PSF's License Agreement and PSF's notice of- copyright, i.e., "Copyright © 2001-2023 Python Software Foundation; All Rights- Reserved" are retained in Python |release| alone or in any derivative version- prepared by Licensee.-- 3. In the event Licensee prepares a derivative work that is based on or- incorporates Python |release| or any part thereof, and wants to make the- derivative work available to others as provided herein, then Licensee hereby- agrees to include in any such work a brief summary of the changes made to Python- |release|.-- 4. PSF is making Python |release| available to Licensee on an "AS IS" basis.- PSF MAKES NO REPRESENTATIONS OR WARRANTIES, EXPRESS OR IMPLIED. BY WAY OF- EXAMPLE, BUT NOT LIMITATION, PSF MAKES NO AND DISCLAIMS ANY REPRESENTATION OR- WARRANTY OF MERCHANTABILITY OR FITNESS FOR ANY PARTICULAR PURPOSE OR THAT THE- USE OF PYTHON |release| WILL NOT INFRINGE ANY THIRD PARTY RIGHTS.-- 5. PSF SHALL NOT BE LIABLE TO LICENSEE OR ANY OTHER USERS OF PYTHON |release|- FOR ANY INCIDENTAL, SPECIAL, OR CONSEQUENTIAL DAMAGES OR LOSS AS A RESULT OF- MODIFYING, DISTRIBUTING, OR OTHERWISE USING PYTHON |release|, OR ANY DERIVATIVE- THEREOF, EVEN IF ADVISED OF THE POSSIBILITY THEREOF.-- 6. This License Agreement will automatically terminate upon a material breach of- its terms and conditions.-- 7. Nothing in this License Agreement shall be deemed to create any relationship- of agency, partnership, or joint venture between PSF and Licensee. This License- Agreement does not grant permission to use PSF trademarks or trade name in a- trademark sense to endorse or promote products or services of Licensee, or any- third party.-- 8. By copying, installing or otherwise using Python |release|, Licensee agrees- to be bound by the terms and conditions of this License Agreement.---BEOPEN.COM LICENSE AGREEMENT FOR PYTHON 2.0----------------------------------------------BEOPEN PYTHON OPEN SOURCE LICENSE AGREEMENT VERSION 1--.. parsed-literal::-- 1. This LICENSE AGREEMENT is between BeOpen.com ("BeOpen"), having an office at- 160 Saratoga Avenue, Santa Clara, CA 95051, and the Individual or Organization- ("Licensee") accessing and otherwise using this software in source or binary- form and its associated documentation ("the Software").-- 2. Subject to the terms and conditions of this BeOpen Python License Agreement,- BeOpen hereby grants Licensee a non-exclusive, royalty-free, world-wide license- to reproduce, analyze, test, perform and/or display publicly, prepare derivative- works, distribute, and otherwise use the Software alone or in any derivative- version, provided, however, that the BeOpen Python License is retained in the- Software, alone or in any derivative version prepared by Licensee.-- 3. BeOpen is making the Software available to Licensee on an "AS IS" basis.- BEOPEN MAKES NO REPRESENTATIONS OR WARRANTIES, EXPRESS OR IMPLIED. BY WAY OF- EXAMPLE, BUT NOT LIMITATION, BEOPEN MAKES NO AND DISCLAIMS ANY REPRESENTATION OR- WARRANTY OF MERCHANTABILITY OR FITNESS FOR ANY PARTICULAR PURPOSE OR THAT THE- USE OF THE SOFTWARE WILL NOT INFRINGE ANY THIRD PARTY RIGHTS.-- 4. BEOPEN SHALL NOT BE LIABLE TO LICENSEE OR ANY OTHER USERS OF THE SOFTWARE FOR- ANY INCIDENTAL, SPECIAL, OR CONSEQUENTIAL DAMAGES OR LOSS AS A RESULT OF USING,- MODIFYING OR DISTRIBUTING THE SOFTWARE, OR ANY DERIVATIVE THEREOF, EVEN IF- ADVISED OF THE POSSIBILITY THEREOF.-- 5. This License Agreement will automatically terminate upon a material breach of- its terms and conditions.-- 6. This License Agreement shall be governed by and interpreted in all respects- by the law of the State of California, excluding conflict of law provisions.- Nothing in this License Agreement shall be deemed to create any relationship of- agency, partnership, or joint venture between BeOpen and Licensee. This License- Agreement does not grant permission to use BeOpen trademarks or trade names in a- trademark sense to endorse or promote products or services of Licensee, or any- third party. As an exception, the "BeOpen Python" logos available at- http://www.pythonlabs.com/logos.html may be used according to the permissions- granted on that web page.-- 7. By copying, installing or otherwise using the software, Licensee agrees to be- bound by the terms and conditions of this License Agreement.---CNRI LICENSE AGREEMENT FOR PYTHON 1.6.1------------------------------------------.. parsed-literal::-- 1. This LICENSE AGREEMENT is between the Corporation for National Research- Initiatives, having an office at 1895 Preston White Drive, Reston, VA 20191- ("CNRI"), and the Individual or Organization ("Licensee") accessing and- otherwise using Python 1.6.1 software in source or binary form and its- associated documentation.-- 2. Subject to the terms and conditions of this License Agreement, CNRI hereby- grants Licensee a nonexclusive, royalty-free, world-wide license to reproduce,- analyze, test, perform and/or display publicly, prepare derivative works,- distribute, and otherwise use Python 1.6.1 alone or in any derivative version,- provided, however, that CNRI's License Agreement and CNRI's notice of copyright,- i.e., "Copyright © 1995-2001 Corporation for National Research Initiatives; All- Rights Reserved" are retained in Python 1.6.1 alone or in any derivative version- prepared by Licensee. Alternately, in lieu of CNRI's License Agreement,- Licensee may substitute the following text (omitting the quotes): "Python 1.6.1- is made available subject to the terms and conditions in CNRI's License- Agreement. This Agreement together with Python 1.6.1 may be located on the- internet using the following unique, persistent identifier (known as a handle):- 1895.22/1013. This Agreement may also be obtained from a proxy server on the- internet using the following URL: http://hdl.handle.net/1895.22/1013."-- 3. In the event Licensee prepares a derivative work that is based on or- incorporates Python 1.6.1 or any part thereof, and wants to make the derivative- work available to others as provided herein, then Licensee hereby agrees to- include in any such work a brief summary of the changes made to Python 1.6.1.-- 4. CNRI is making Python 1.6.1 available to Licensee on an "AS IS" basis. CNRI- MAKES NO REPRESENTATIONS OR WARRANTIES, EXPRESS OR IMPLIED. BY WAY OF EXAMPLE,- BUT NOT LIMITATION, CNRI MAKES NO AND DISCLAIMS ANY REPRESENTATION OR WARRANTY- OF MERCHANTABILITY OR FITNESS FOR ANY PARTICULAR PURPOSE OR THAT THE USE OF- PYTHON 1.6.1 WILL NOT INFRINGE ANY THIRD PARTY RIGHTS.-- 5. CNRI SHALL NOT BE LIABLE TO LICENSEE OR ANY OTHER USERS OF PYTHON 1.6.1 FOR- ANY INCIDENTAL, SPECIAL, OR CONSEQUENTIAL DAMAGES OR LOSS AS A RESULT OF- MODIFYING, DISTRIBUTING, OR OTHERWISE USING PYTHON 1.6.1, OR ANY DERIVATIVE- THEREOF, EVEN IF ADVISED OF THE POSSIBILITY THEREOF.-- 6. This License Agreement will automatically terminate upon a material breach of- its terms and conditions.-- 7. This License Agreement shall be governed by the federal intellectual property- law of the United States, including without limitation the federal copyright- law, and, to the extent such U.S. federal law does not apply, by the law of the- Commonwealth of Virginia, excluding Virginia's conflict of law provisions.- Notwithstanding the foregoing, with regard to derivative works based on Python- 1.6.1 that incorporate non-separable material that was previously distributed- under the GNU General Public License (GPL), the law of the Commonwealth of- Virginia shall govern this License Agreement only as to issues arising under or- with respect to Paragraphs 4, 5, and 7 of this License Agreement. Nothing in- this License Agreement shall be deemed to create any relationship of agency,- partnership, or joint venture between CNRI and Licensee. This License Agreement- does not grant permission to use CNRI trademarks or trade name in a trademark- sense to endorse or promote products or services of Licensee, or any third- party.-- 8. By clicking on the "ACCEPT" button where indicated, or by copying, installing- or otherwise using Python 1.6.1, Licensee agrees to be bound by the terms and- conditions of this License Agreement.---CWI LICENSE AGREEMENT FOR PYTHON 0.9.0 THROUGH 1.2-----------------------------------------------------.. parsed-literal::-- Copyright © 1991 - 1995, Stichting Mathematisch Centrum Amsterdam, The- Netherlands. All rights reserved.-- Permission to use, copy, modify, and distribute this software and its- documentation for any purpose and without fee is hereby granted, provided that- the above copyright notice appear in all copies and that both that copyright- notice and this permission notice appear in supporting documentation, and that- the name of Stichting Mathematisch Centrum or CWI not be used in advertising or- publicity pertaining to distribution of the software without specific, written- prior permission.-- STICHTING MATHEMATISCH CENTRUM DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS- SOFTWARE, INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS, IN NO- EVENT SHALL STICHTING MATHEMATISCH CENTRUM BE LIABLE FOR ANY SPECIAL, INDIRECT- OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE,- DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS- ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS- SOFTWARE.---.. _BSD0:--ZERO-CLAUSE BSD LICENSE FOR CODE IN THE PYTHON |release| DOCUMENTATION-------------------------------------------------------------------------.. parsed-literal::-- Permission to use, copy, modify, and/or distribute this software for any- purpose with or without fee is hereby granted.-- THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES WITH- REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY- AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT,- INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM- LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR- OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR- PERFORMANCE OF THIS SOFTWARE.---.. _OtherLicenses:--Licenses and Acknowledgements for Incorporated Software-=======================================================--This section is an incomplete, but growing list of licenses and acknowledgements-for third-party software incorporated in the Python distribution.---Mersenne Twister-------------------The :mod:`_random` module includes code based on a download from-http://www.math.sci.hiroshima-u.ac.jp/~m-mat/MT/MT2002/emt19937ar.html. The following are-the verbatim comments from the original code::-- A C-program for MT19937, with initialization improved 2002/1/26.- Coded by Takuji Nishimura and Makoto Matsumoto.-- Before using, initialize the state by using init_genrand(seed)- or init_by_array(init_key, key_length).-- Copyright (C) 1997 - 2002, Makoto Matsumoto and Takuji Nishimura,- All rights reserved.-- Redistribution and use in source and binary forms, with or without- modification, are permitted provided that the following conditions- are met:-- 1. Redistributions of source code must retain the above copyright- notice, this list of conditions and the following disclaimer.-- 2. Redistributions in binary form must reproduce the above copyright- notice, this list of conditions and the following disclaimer in the- documentation and/or other materials provided with the distribution.-- 3. The names of its contributors may not be used to endorse or promote- products derived from this software without specific prior written- permission.-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR- CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,- EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,- PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.--- Any feedback is very welcome.- http://www.math.sci.hiroshima-u.ac.jp/~m-mat/MT/emt.html- email: m-mat @ math.sci.hiroshima-u.ac.jp (remove space)---Sockets----------The :mod:`socket` module uses the functions, :func:`getaddrinfo`, and-:func:`getnameinfo`, which are coded in separate source files from the WIDE-Project, https://www.wide.ad.jp/. ::-- Copyright (C) 1995, 1996, 1997, and 1998 WIDE Project.- All rights reserved.-- Redistribution and use in source and binary forms, with or without- modification, are permitted provided that the following conditions- are met:- 1. Redistributions of source code must retain the above copyright- notice, this list of conditions and the following disclaimer.- 2. Redistributions in binary form must reproduce the above copyright- notice, this list of conditions and the following disclaimer in the- documentation and/or other materials provided with the distribution.- 3. Neither the name of the project nor the names of its contributors- may be used to endorse or promote products derived from this software- without specific prior written permission.-- THIS SOFTWARE IS PROVIDED BY THE PROJECT AND CONTRIBUTORS ``AS IS'' AND- ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE- IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE- ARE DISCLAIMED. IN NO EVENT SHALL THE PROJECT OR CONTRIBUTORS BE LIABLE- FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL- DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS- OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)- HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT- LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY- OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF- SUCH DAMAGE.---Asynchronous socket services-------------------------------The :mod:`asynchat` and :mod:`asyncore` modules contain the following notice::-- Copyright 1996 by Sam Rushing-- All Rights Reserved-- Permission to use, copy, modify, and distribute this software and- its documentation for any purpose and without fee is hereby- granted, provided that the above copyright notice appear in all- copies and that both that copyright notice and this permission- notice appear in supporting documentation, and that the name of Sam- Rushing not be used in advertising or publicity pertaining to- distribution of the software without specific, written prior- permission.-- SAM RUSHING DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE,- INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS, IN- NO EVENT SHALL SAM RUSHING BE LIABLE FOR ANY SPECIAL, INDIRECT OR- CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS- OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT,- NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF OR IN- CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.---Cookie management--------------------The :mod:`http.cookies` module contains the following notice::-- Copyright 2000 by Timothy O'Malley <[email protected]>-- All Rights Reserved-- Permission to use, copy, modify, and distribute this software- and its documentation for any purpose and without fee is hereby- granted, provided that the above copyright notice appear in all- copies and that both that copyright notice and this permission- notice appear in supporting documentation, and that the name of- Timothy O'Malley not be used in advertising or publicity- pertaining to distribution of the software without specific, written- prior permission.-- Timothy O'Malley DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS- SOFTWARE, INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY- AND FITNESS, IN NO EVENT SHALL Timothy O'Malley BE LIABLE FOR- ANY SPECIAL, INDIRECT OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES- WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS,- WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS- ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR- PERFORMANCE OF THIS SOFTWARE.---Execution tracing--------------------The :mod:`trace` module contains the following notice::-- portions copyright 2001, Autonomous Zones Industries, Inc., all rights...- err... reserved and offered to the public under the terms of the- Python 2.2 license.- Author: Zooko O'Whielacronx- http://zooko.com/- mailto:[email protected]-- Copyright 2000, Mojam Media, Inc., all rights reserved.- Author: Skip Montanaro-- Copyright 1999, Bioreason, Inc., all rights reserved.- Author: Andrew Dalke-- Copyright 1995-1997, Automatrix, Inc., all rights reserved.- Author: Skip Montanaro-- Copyright 1991-1995, Stichting Mathematisch Centrum, all rights reserved.--- Permission to use, copy, modify, and distribute this Python software and- its associated documentation for any purpose without fee is hereby- granted, provided that the above copyright notice appears in all copies,- and that both that copyright notice and this permission notice appear in- supporting documentation, and that the name of neither Automatrix,- Bioreason or Mojam Media be used in advertising or publicity pertaining to- distribution of the software without specific, written prior permission.---UUencode and UUdecode functions----------------------------------The :mod:`uu` module contains the following notice::-- Copyright 1994 by Lance Ellinghouse- Cathedral City, California Republic, United States of America.- All Rights Reserved- Permission to use, copy, modify, and distribute this software and its- documentation for any purpose and without fee is hereby granted,- provided that the above copyright notice appear in all copies and that- both that copyright notice and this permission notice appear in- supporting documentation, and that the name of Lance Ellinghouse- not be used in advertising or publicity pertaining to distribution- of the software without specific, written prior permission.- LANCE ELLINGHOUSE DISCLAIMS ALL WARRANTIES WITH REGARD TO- THIS SOFTWARE, INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND- FITNESS, IN NO EVENT SHALL LANCE ELLINGHOUSE CENTRUM BE LIABLE- FOR ANY SPECIAL, INDIRECT OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES- WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN- ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT- OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.-- Modified by Jack Jansen, CWI, July 1995:- - Use binascii module to do the actual line-by-line conversion- between ascii and binary. This results in a 1000-fold speedup. The C- version is still 5 times faster, though.- - Arguments more compliant with Python standard---XML Remote Procedure Calls-----------------------------The :mod:`xmlrpc.client` module contains the following notice::-- The XML-RPC client interface is-- Copyright (c) 1999-2002 by Secret Labs AB- Copyright (c) 1999-2002 by Fredrik Lundh-- By obtaining, using, and/or copying this software and/or its- associated documentation, you agree that you have read, understood,- and will comply with the following terms and conditions:-- Permission to use, copy, modify, and distribute this software and- its associated documentation for any purpose and without fee is- hereby granted, provided that the above copyright notice appears in- all copies, and that both that copyright notice and this permission- notice appear in supporting documentation, and that the name of- Secret Labs AB or the author not be used in advertising or publicity- pertaining to distribution of the software without specific, written- prior permission.-- SECRET LABS AB AND THE AUTHOR DISCLAIMS ALL WARRANTIES WITH REGARD- TO THIS SOFTWARE, INCLUDING ALL IMPLIED WARRANTIES OF MERCHANT-- ABILITY AND FITNESS. IN NO EVENT SHALL SECRET LABS AB OR THE AUTHOR- BE LIABLE FOR ANY SPECIAL, INDIRECT OR CONSEQUENTIAL DAMAGES OR ANY- DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS,- WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS- ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE- OF THIS SOFTWARE.---test_epoll-------------The :mod:`test_epoll` module contains the following notice::-- Copyright (c) 2001-2006 Twisted Matrix Laboratories.-- Permission is hereby granted, free of charge, to any person obtaining- a copy of this software and associated documentation files (the- "Software"), to deal in the Software without restriction, including- without limitation the rights to use, copy, modify, merge, publish,- distribute, sublicense, and/or sell copies of the Software, and to- permit persons to whom the Software is furnished to do so, subject to- the following conditions:-- The above copyright notice and this permission notice shall be- included in all copies or substantial portions of the Software.-- THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,- EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF- MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND- NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE- LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION- OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION- WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.--Select kqueue----------------The :mod:`select` module contains the following notice for the kqueue-interface::-- Copyright (c) 2000 Doug White, 2006 James Knight, 2007 Christian Heimes- All rights reserved.-- Redistribution and use in source and binary forms, with or without- modification, are permitted provided that the following conditions- are met:- 1. Redistributions of source code must retain the above copyright- notice, this list of conditions and the following disclaimer.- 2. Redistributions in binary form must reproduce the above copyright- notice, this list of conditions and the following disclaimer in the- documentation and/or other materials provided with the distribution.-- THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND- ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE- IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE- ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE- FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL- DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS- OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)- HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT- LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY- OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF- SUCH DAMAGE.---SipHash24------------The file :file:`Python/pyhash.c` contains Marek Majkowski' implementation of-Dan Bernstein's SipHash24 algorithm. It contains the following note::-- <MIT License>- Copyright (c) 2013 Marek Majkowski <[email protected]>-- Permission is hereby granted, free of charge, to any person obtaining a copy- of this software and associated documentation files (the "Software"), to deal- in the Software without restriction, including without limitation the rights- to use, copy, modify, merge, publish, distribute, sublicense, and/or sell- copies of the Software, and to permit persons to whom the Software is- furnished to do so, subject to the following conditions:-- The above copyright notice and this permission notice shall be included in- all copies or substantial portions of the Software.- </MIT License>-- Original location:- https://github.com/majek/csiphash/-- Solution inspired by code from:- Samuel Neves (supercop/crypto_auth/siphash24/little)- djb (supercop/crypto_auth/siphash24/little2)- Jean-Philippe Aumasson (https://131002.net/siphash/siphash24.c)---strtod and dtoa------------------The file :file:`Python/dtoa.c`, which supplies C functions dtoa and-strtod for conversion of C doubles to and from strings, is derived-from the file of the same name by David M. Gay, currently available-from https://web.archive.org/web/20220517033456/http://www.netlib.org/fp/dtoa.c.-The original file, as retrieved on March 16, 2009, contains the following-copyright and licensing notice::-- /****************************************************************- *- * The author of this software is David M. Gay.- *- * Copyright (c) 1991, 2000, 2001 by Lucent Technologies.- *- * Permission to use, copy, modify, and distribute this software for any- * purpose without fee is hereby granted, provided that this entire notice- * is included in all copies of any software which is or includes a copy- * or modification of this software and in all copies of the supporting- * documentation for such software.- *- * THIS SOFTWARE IS BEING PROVIDED "AS IS", WITHOUT ANY EXPRESS OR IMPLIED- * WARRANTY. IN PARTICULAR, NEITHER THE AUTHOR NOR LUCENT MAKES ANY- * REPRESENTATION OR WARRANTY OF ANY KIND CONCERNING THE MERCHANTABILITY- * OF THIS SOFTWARE OR ITS FITNESS FOR ANY PARTICULAR PURPOSE.- *- ***************************************************************/---OpenSSL----------The modules :mod:`hashlib`, :mod:`posix`, :mod:`ssl`, :mod:`crypt` use-the OpenSSL library for added performance if made available by the-operating system. Additionally, the Windows and macOS installers for-Python may include a copy of the OpenSSL libraries, so we include a copy-of the OpenSSL license here::--- LICENSE ISSUES- ==============-- The OpenSSL toolkit stays under a dual license, i.e. both the conditions of- the OpenSSL License and the original SSLeay license apply to the toolkit.- See below for the actual license texts. Actually both licenses are BSD-style- Open Source licenses. In case of any license issues related to OpenSSL- please contact [email protected].-- OpenSSL License- ----------------- /* ====================================================================- * Copyright (c) 1998-2008 The OpenSSL Project. All rights reserved.- *- * Redistribution and use in source and binary forms, with or without- * modification, are permitted provided that the following conditions- * are met:- *- * 1. Redistributions of source code must retain the above copyright- * notice, this list of conditions and the following disclaimer.- *- * 2. Redistributions in binary form must reproduce the above copyright- * notice, this list of conditions and the following disclaimer in- * the documentation and/or other materials provided with the- * distribution.- *- * 3. All advertising materials mentioning features or use of this- * software must display the following acknowledgment:- * "This product includes software developed by the OpenSSL Project- * for use in the OpenSSL Toolkit. (http://www.openssl.org/)"- *- * 4. The names "OpenSSL Toolkit" and "OpenSSL Project" must not be used to- * endorse or promote products derived from this software without- * prior written permission. For written permission, please contact- * [email protected].- *- * 5. Products derived from this software may not be called "OpenSSL"- * nor may "OpenSSL" appear in their names without prior written- * permission of the OpenSSL Project.- *- * 6. Redistributions of any form whatsoever must retain the following- * acknowledgment:- * "This product includes software developed by the OpenSSL Project- * for use in the OpenSSL Toolkit (http://www.openssl.org/)"- *- * THIS SOFTWARE IS PROVIDED BY THE OpenSSL PROJECT ``AS IS'' AND ANY- * EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR- * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE OpenSSL PROJECT OR- * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,- * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT- * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;- * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)- * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,- * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED- * OF THE POSSIBILITY OF SUCH DAMAGE.- * ====================================================================- *- * This product includes cryptographic software written by Eric Young- * ([email protected]). This product includes software written by Tim- * Hudson ([email protected]).- *- */-- Original SSLeay License- ------------------------- /* Copyright (C) 1995-1998 Eric Young ([email protected])- * All rights reserved.- *- * This package is an SSL implementation written- * by Eric Young ([email protected]).- * The implementation was written so as to conform with Netscapes SSL.- *- * This library is free for commercial and non-commercial use as long as- * the following conditions are aheared to. The following conditions- * apply to all code found in this distribution, be it the RC4, RSA,- * lhash, DES, etc., code; not just the SSL code. The SSL documentation- * included with this distribution is covered by the same copyright terms- * except that the holder is Tim Hudson ([email protected]).- *- * Copyright remains Eric Young's, and as such any Copyright notices in- * the code are not to be removed.- * If this package is used in a product, Eric Young should be given attribution- * as the author of the parts of the library used.- * This can be in the form of a textual message at program startup or- * in documentation (online or textual) provided with the package.- *- * Redistribution and use in source and binary forms, with or without- * modification, are permitted provided that the following conditions- * are met:- * 1. Redistributions of source code must retain the copyright- * notice, this list of conditions and the following disclaimer.- * 2. Redistributions in binary form must reproduce the above copyright- * notice, this list of conditions and the following disclaimer in the- * documentation and/or other materials provided with the distribution.- * 3. All advertising materials mentioning features or use of this software- * must display the following acknowledgement:- * "This product includes cryptographic software written by- * Eric Young ([email protected])"- * The word 'cryptographic' can be left out if the rouines from the library- * being used are not cryptographic related :-).- * 4. If you include any Windows specific code (or a derivative thereof) from- * the apps directory (application code) you must include an acknowledgement:- * "This product includes software written by Tim Hudson ([email protected])"- *- * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND- * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE- * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE- * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL- * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS- * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)- * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT- * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY- * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF- * SUCH DAMAGE.- *- * The licence and distribution terms for any publically available version or- * derivative of this code cannot be changed. i.e. this code cannot simply be- * copied and put under another distribution licence- * [including the GNU Public Licence.]- */---expat--------The :mod:`pyexpat` extension is built using an included copy of the expat-sources unless the build is configured ``--with-system-expat``::-- Copyright (c) 1998, 1999, 2000 Thai Open Source Software Center Ltd- and Clark Cooper-- Permission is hereby granted, free of charge, to any person obtaining- a copy of this software and associated documentation files (the- "Software"), to deal in the Software without restriction, including- without limitation the rights to use, copy, modify, merge, publish,- distribute, sublicense, and/or sell copies of the Software, and to- permit persons to whom the Software is furnished to do so, subject to- the following conditions:-- The above copyright notice and this permission notice shall be included- in all copies or substantial portions of the Software.-- THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,- EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF- MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.- IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY- CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,- TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE- SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.---libffi---------The :mod:`_ctypes` extension is built using an included copy of the libffi-sources unless the build is configured ``--with-system-libffi``::-- Copyright (c) 1996-2008 Red Hat, Inc and others.-- Permission is hereby granted, free of charge, to any person obtaining- a copy of this software and associated documentation files (the- ``Software''), to deal in the Software without restriction, including- without limitation the rights to use, copy, modify, merge, publish,- distribute, sublicense, and/or sell copies of the Software, and to- permit persons to whom the Software is furnished to do so, subject to- the following conditions:-- The above copyright notice and this permission notice shall be included- in all copies or substantial portions of the Software.-- THE SOFTWARE IS PROVIDED ``AS IS'', WITHOUT WARRANTY OF ANY KIND,- EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF- MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND- NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT- HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,- WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,- OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER- DEALINGS IN THE SOFTWARE.---zlib-------The :mod:`zlib` extension is built using an included copy of the zlib-sources if the zlib version found on the system is too old to be-used for the build::-- Copyright (C) 1995-2011 Jean-loup Gailly and Mark Adler-- This software is provided 'as-is', without any express or implied- warranty. In no event will the authors be held liable for any damages- arising from the use of this software.-- Permission is granted to anyone to use this software for any purpose,- including commercial applications, and to alter it and redistribute it- freely, subject to the following restrictions:-- 1. The origin of this software must not be misrepresented; you must not- claim that you wrote the original software. If you use this software- in a product, an acknowledgment in the product documentation would be- appreciated but is not required.-- 2. Altered source versions must be plainly marked as such, and must not be- misrepresented as being the original software.-- 3. This notice may not be removed or altered from any source distribution.-- Jean-loup Gailly Mark Adler---cfuhash----------The implementation of the hash table used by the :mod:`tracemalloc` is based-on the cfuhash project::-- Copyright (c) 2005 Don Owens- All rights reserved.-- This code is released under the BSD license:-- Redistribution and use in source and binary forms, with or without- modification, are permitted provided that the following conditions- are met:-- * Redistributions of source code must retain the above copyright- notice, this list of conditions and the following disclaimer.-- * Redistributions in binary form must reproduce the above- copyright notice, this list of conditions and the following- disclaimer in the documentation and/or other materials provided- with the distribution.-- * Neither the name of the author nor the names of its- contributors may be used to endorse or promote products derived- from this software without specific prior written permission.-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS- FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE- COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,- INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES- (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR- SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)- HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,- STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)- ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED- OF THE POSSIBILITY OF SUCH DAMAGE.---libmpdec-----------The :mod:`_decimal` module is built using an included copy of the libmpdec-library unless the build is configured ``--with-system-libmpdec``::-- Copyright (c) 2008-2020 Stefan Krah. All rights reserved.-- Redistribution and use in source and binary forms, with or without- modification, are permitted provided that the following conditions- are met:-- 1. Redistributions of source code must retain the above copyright- notice, this list of conditions and the following disclaimer.-- 2. Redistributions in binary form must reproduce the above copyright- notice, this list of conditions and the following disclaimer in the- documentation and/or other materials provided with the distribution.-- THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS "AS IS" AND- ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE- IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE- ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE- FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL- DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS- OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)- HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT- LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY- OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF- SUCH DAMAGE.---W3C C14N test suite----------------------The C14N 2.0 test suite in the :mod:`test` package-(``Lib/test/xmltestdata/c14n-20/``) was retrieved from the W3C website at-https://www.w3.org/TR/xml-c14n2-testcases/ and is distributed under the-3-clause BSD license::-- Copyright (c) 2013 W3C(R) (MIT, ERCIM, Keio, Beihang),- All Rights Reserved.-- Redistribution and use in source and binary forms, with or without- modification, are permitted provided that the following conditions- are met:-- * Redistributions of works must retain the original copyright notice,- this list of conditions and the following disclaimer.- * Redistributions in binary form must reproduce the original copyright- notice, this list of conditions and the following disclaimer in the- documentation and/or other materials provided with the distribution.- * Neither the name of the W3C nor the names of its contributors may be- used to endorse or promote products derived from this work without- specific prior written permission.-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT- OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT- LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,- DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY- THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT- (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE- OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.---Audioop----------The audioop module uses the code base in g771.c file of the SoX project::-- Programming the AdLib/Sound Blaster- FM Music Chips- Version 2.0 (24 Feb 1992)- Copyright (c) 1991, 1992 by Jeffrey S. Lee- Warranty and Copyright Policy- This document is provided on an "as-is" basis, and its author makes- no warranty or representation, express or implied, with respect to- its quality performance or fitness for a particular purpose. In no- event will the author of this document be liable for direct, indirect,- special, incidental, or consequential damages arising out of the use- or inability to use the information contained within. Use of this- document is at your own risk.- This file may be used and copied freely so long as the applicable- copyright notices are retained, and no modifications are made to the- text of the document. No money shall be charged for its distribution- beyond reasonable shipping, handling and duplication costs, nor shall- proprietary changes be made to this document so that it cannot be- distributed freely. This document may not be included in published- material or commercial packages without the written consent of its- author.diff --git a/scripts/licenses/cpython-3.11.3.LICENSE b/scripts/licenses/cpython-3.11.3.LICENSEdeleted file mode 100644index f26bcf4..0000000--- a/scripts/licenses/cpython-3.11.3.LICENSE+++ /dev/null@@ -1,279 +0,0 @@-A. HISTORY OF THE SOFTWARE-==========================--Python was created in the early 1990s by Guido van Rossum at Stichting-Mathematisch Centrum (CWI, see https://www.cwi.nl) in the Netherlands-as a successor of a language called ABC. Guido remains Python's-principal author, although it includes many contributions from others.--In 1995, Guido continued his work on Python at the Corporation for-National Research Initiatives (CNRI, see https://www.cnri.reston.va.us)-in Reston, Virginia where he released several versions of the-software.--In May 2000, Guido and the Python core development team moved to-BeOpen.com to form the BeOpen PythonLabs team. In October of the same-year, the PythonLabs team moved to Digital Creations, which became-Zope Corporation. In 2001, the Python Software Foundation (PSF, see-https://www.python.org/psf/) was formed, a non-profit organization-created specifically to own Python-related Intellectual Property.-Zope Corporation was a sponsoring member of the PSF.--All Python releases are Open Source (see https://opensource.org for-the Open Source Definition). Historically, most, but not all, Python-releases have also been GPL-compatible; the table below summarizes-the various releases.-- Release Derived Year Owner GPL-- from compatible? (1)-- 0.9.0 thru 1.2 1991-1995 CWI yes- 1.3 thru 1.5.2 1.2 1995-1999 CNRI yes- 1.6 1.5.2 2000 CNRI no- 2.0 1.6 2000 BeOpen.com no- 1.6.1 1.6 2001 CNRI yes (2)- 2.1 2.0+1.6.1 2001 PSF no- 2.0.1 2.0+1.6.1 2001 PSF yes- 2.1.1 2.1+2.0.1 2001 PSF yes- 2.1.2 2.1.1 2002 PSF yes- 2.1.3 2.1.2 2002 PSF yes- 2.2 and above 2.1.1 2001-now PSF yes--Footnotes:--(1) GPL-compatible doesn't mean that we're distributing Python under- the GPL. All Python licenses, unlike the GPL, let you distribute- a modified version without making your changes open source. The- GPL-compatible licenses make it possible to combine Python with- other software that is released under the GPL; the others don't.--(2) According to Richard Stallman, 1.6.1 is not GPL-compatible,- because its license has a choice of law clause. According to- CNRI, however, Stallman's lawyer has told CNRI's lawyer that 1.6.1- is "not incompatible" with the GPL.--Thanks to the many outside volunteers who have worked under Guido's-direction to make these releases possible.---B. TERMS AND CONDITIONS FOR ACCESSING OR OTHERWISE USING PYTHON-===============================================================--Python software and documentation are licensed under the-Python Software Foundation License Version 2.--Starting with Python 3.8.6, examples, recipes, and other code in-the documentation are dual licensed under the PSF License Version 2-and the Zero-Clause BSD license.--Some software incorporated into Python is under different licenses.-The licenses are listed with code falling under that license.---PYTHON SOFTWARE FOUNDATION LICENSE VERSION 2-----------------------------------------------1. This LICENSE AGREEMENT is between the Python Software Foundation-("PSF"), and the Individual or Organization ("Licensee") accessing and-otherwise using this software ("Python") in source or binary form and-its associated documentation.--2. Subject to the terms and conditions of this License Agreement, PSF hereby-grants Licensee a nonexclusive, royalty-free, world-wide license to reproduce,-analyze, test, perform and/or display publicly, prepare derivative works,-distribute, and otherwise use Python alone or in any derivative version,-provided, however, that PSF's License Agreement and PSF's notice of copyright,-i.e., "Copyright (c) 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010,-2011, 2012, 2013, 2014, 2015, 2016, 2017, 2018, 2019, 2020, 2021, 2022, 2023 Python Software Foundation;-All Rights Reserved" are retained in Python alone or in any derivative version-prepared by Licensee.--3. In the event Licensee prepares a derivative work that is based on-or incorporates Python or any part thereof, and wants to make-the derivative work available to others as provided herein, then-Licensee hereby agrees to include in any such work a brief summary of-the changes made to Python.--4. PSF is making Python available to Licensee on an "AS IS"-basis. PSF MAKES NO REPRESENTATIONS OR WARRANTIES, EXPRESS OR-IMPLIED. BY WAY OF EXAMPLE, BUT NOT LIMITATION, PSF MAKES NO AND-DISCLAIMS ANY REPRESENTATION OR WARRANTY OF MERCHANTABILITY OR FITNESS-FOR ANY PARTICULAR PURPOSE OR THAT THE USE OF PYTHON WILL NOT-INFRINGE ANY THIRD PARTY RIGHTS.--5. PSF SHALL NOT BE LIABLE TO LICENSEE OR ANY OTHER USERS OF PYTHON-FOR ANY INCIDENTAL, SPECIAL, OR CONSEQUENTIAL DAMAGES OR LOSS AS-A RESULT OF MODIFYING, DISTRIBUTING, OR OTHERWISE USING PYTHON,-OR ANY DERIVATIVE THEREOF, EVEN IF ADVISED OF THE POSSIBILITY THEREOF.--6. This License Agreement will automatically terminate upon a material-breach of its terms and conditions.--7. Nothing in this License Agreement shall be deemed to create any-relationship of agency, partnership, or joint venture between PSF and-Licensee. This License Agreement does not grant permission to use PSF-trademarks or trade name in a trademark sense to endorse or promote-products or services of Licensee, or any third party.--8. By copying, installing or otherwise using Python, Licensee-agrees to be bound by the terms and conditions of this License-Agreement.---BEOPEN.COM LICENSE AGREEMENT FOR PYTHON 2.0----------------------------------------------BEOPEN PYTHON OPEN SOURCE LICENSE AGREEMENT VERSION 1--1. This LICENSE AGREEMENT is between BeOpen.com ("BeOpen"), having an-office at 160 Saratoga Avenue, Santa Clara, CA 95051, and the-Individual or Organization ("Licensee") accessing and otherwise using-this software in source or binary form and its associated-documentation ("the Software").--2. Subject to the terms and conditions of this BeOpen Python License-Agreement, BeOpen hereby grants Licensee a non-exclusive,-royalty-free, world-wide license to reproduce, analyze, test, perform-and/or display publicly, prepare derivative works, distribute, and-otherwise use the Software alone or in any derivative version,-provided, however, that the BeOpen Python License is retained in the-Software, alone or in any derivative version prepared by Licensee.--3. BeOpen is making the Software available to Licensee on an "AS IS"-basis. BEOPEN MAKES NO REPRESENTATIONS OR WARRANTIES, EXPRESS OR-IMPLIED. BY WAY OF EXAMPLE, BUT NOT LIMITATION, BEOPEN MAKES NO AND-DISCLAIMS ANY REPRESENTATION OR WARRANTY OF MERCHANTABILITY OR FITNESS-FOR ANY PARTICULAR PURPOSE OR THAT THE USE OF THE SOFTWARE WILL NOT-INFRINGE ANY THIRD PARTY RIGHTS.--4. BEOPEN SHALL NOT BE LIABLE TO LICENSEE OR ANY OTHER USERS OF THE-SOFTWARE FOR ANY INCIDENTAL, SPECIAL, OR CONSEQUENTIAL DAMAGES OR LOSS-AS A RESULT OF USING, MODIFYING OR DISTRIBUTING THE SOFTWARE, OR ANY-DERIVATIVE THEREOF, EVEN IF ADVISED OF THE POSSIBILITY THEREOF.--5. This License Agreement will automatically terminate upon a material-breach of its terms and conditions.--6. This License Agreement shall be governed by and interpreted in all-respects by the law of the State of California, excluding conflict of-law provisions. Nothing in this License Agreement shall be deemed to-create any relationship of agency, partnership, or joint venture-between BeOpen and Licensee. This License Agreement does not grant-permission to use BeOpen trademarks or trade names in a trademark-sense to endorse or promote products or services of Licensee, or any-third party. As an exception, the "BeOpen Python" logos available at-http://www.pythonlabs.com/logos.html may be used according to the-permissions granted on that web page.--7. By copying, installing or otherwise using the software, Licensee-agrees to be bound by the terms and conditions of this License-Agreement.---CNRI LICENSE AGREEMENT FOR PYTHON 1.6.1------------------------------------------1. This LICENSE AGREEMENT is between the Corporation for National-Research Initiatives, having an office at 1895 Preston White Drive,-Reston, VA 20191 ("CNRI"), and the Individual or Organization-("Licensee") accessing and otherwise using Python 1.6.1 software in-source or binary form and its associated documentation.--2. Subject to the terms and conditions of this License Agreement, CNRI-hereby grants Licensee a nonexclusive, royalty-free, world-wide-license to reproduce, analyze, test, perform and/or display publicly,-prepare derivative works, distribute, and otherwise use Python 1.6.1-alone or in any derivative version, provided, however, that CNRI's-License Agreement and CNRI's notice of copyright, i.e., "Copyright (c)-1995-2001 Corporation for National Research Initiatives; All Rights-Reserved" are retained in Python 1.6.1 alone or in any derivative-version prepared by Licensee. Alternately, in lieu of CNRI's License-Agreement, Licensee may substitute the following text (omitting the-quotes): "Python 1.6.1 is made available subject to the terms and-conditions in CNRI's License Agreement. This Agreement together with-Python 1.6.1 may be located on the internet using the following-unique, persistent identifier (known as a handle): 1895.22/1013. This-Agreement may also be obtained from a proxy server on the internet-using the following URL: http://hdl.handle.net/1895.22/1013".--3. In the event Licensee prepares a derivative work that is based on-or incorporates Python 1.6.1 or any part thereof, and wants to make-the derivative work available to others as provided herein, then-Licensee hereby agrees to include in any such work a brief summary of-the changes made to Python 1.6.1.--4. CNRI is making Python 1.6.1 available to Licensee on an "AS IS"-basis. CNRI MAKES NO REPRESENTATIONS OR WARRANTIES, EXPRESS OR-IMPLIED. BY WAY OF EXAMPLE, BUT NOT LIMITATION, CNRI MAKES NO AND-DISCLAIMS ANY REPRESENTATION OR WARRANTY OF MERCHANTABILITY OR FITNESS-FOR ANY PARTICULAR PURPOSE OR THAT THE USE OF PYTHON 1.6.1 WILL NOT-INFRINGE ANY THIRD PARTY RIGHTS.--5. CNRI SHALL NOT BE LIABLE TO LICENSEE OR ANY OTHER USERS OF PYTHON-1.6.1 FOR ANY INCIDENTAL, SPECIAL, OR CONSEQUENTIAL DAMAGES OR LOSS AS-A RESULT OF MODIFYING, DISTRIBUTING, OR OTHERWISE USING PYTHON 1.6.1,-OR ANY DERIVATIVE THEREOF, EVEN IF ADVISED OF THE POSSIBILITY THEREOF.--6. This License Agreement will automatically terminate upon a material-breach of its terms and conditions.--7. This License Agreement shall be governed by the federal-intellectual property law of the United States, including without-limitation the federal copyright law, and, to the extent such-U.S. federal law does not apply, by the law of the Commonwealth of-Virginia, excluding Virginia's conflict of law provisions.-Notwithstanding the foregoing, with regard to derivative works based-on Python 1.6.1 that incorporate non-separable material that was-previously distributed under the GNU General Public License (GPL), the-law of the Commonwealth of Virginia shall govern this License-Agreement only as to issues arising under or with respect to-Paragraphs 4, 5, and 7 of this License Agreement. Nothing in this-License Agreement shall be deemed to create any relationship of-agency, partnership, or joint venture between CNRI and Licensee. This-License Agreement does not grant permission to use CNRI trademarks or-trade name in a trademark sense to endorse or promote products or-services of Licensee, or any third party.--8. By clicking on the "ACCEPT" button where indicated, or by copying,-installing or otherwise using Python 1.6.1, Licensee agrees to be-bound by the terms and conditions of this License Agreement.-- ACCEPT---CWI LICENSE AGREEMENT FOR PYTHON 0.9.0 THROUGH 1.2-----------------------------------------------------Copyright (c) 1991 - 1995, Stichting Mathematisch Centrum Amsterdam,-The Netherlands. All rights reserved.--Permission to use, copy, modify, and distribute this software and its-documentation for any purpose and without fee is hereby granted,-provided that the above copyright notice appear in all copies and that-both that copyright notice and this permission notice appear in-supporting documentation, and that the name of Stichting Mathematisch-Centrum or CWI not be used in advertising or publicity pertaining to-distribution of the software without specific, written prior-permission.--STICHTING MATHEMATISCH CENTRUM DISCLAIMS ALL WARRANTIES WITH REGARD TO-THIS SOFTWARE, INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND-FITNESS, IN NO EVENT SHALL STICHTING MATHEMATISCH CENTRUM BE LIABLE-FOR ANY SPECIAL, INDIRECT OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES-WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN-ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT-OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.--ZERO-CLAUSE BSD LICENSE FOR CODE IN THE PYTHON DOCUMENTATION-------------------------------------------------------------------------Permission to use, copy, modify, and/or distribute this software for any-purpose with or without fee is hereby granted.--THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES WITH-REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY-AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT,-INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM-LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR-OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR-PERFORMANCE OF THIS SOFTWARE.diff --git a/scripts/licenses/emscripten-3.1.46-compiler-rt.LICENSE b/scripts/licenses/emscripten-3.1.46-compiler-rt.LICENSEdeleted file mode 100644index 5a79a1b..0000000--- a/scripts/licenses/emscripten-3.1.46-compiler-rt.LICENSE+++ /dev/null@@ -1,311 +0,0 @@-==============================================================================-The LLVM Project is under the Apache License v2.0 with LLVM Exceptions:-==============================================================================-- 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.------- LLVM Exceptions to the Apache 2.0 License ------As an exception, if, as a result of your compiling your source code, portions-of this Software are embedded into an Object form of such source code, you-may redistribute such embedded portions in such Object form without complying-with the conditions of Sections 4(a), 4(b) and 4(d) of the License.--In addition, if you combine or link compiled forms of this Software with-software that is licensed under the GPLv2 ("Combined Software") and if a-court of competent jurisdiction determines that the patent provision (Section-3), the indemnity provision (Section 9) or other Section of the License-conflicts with the conditions of the GPLv2, you may retroactively and-prospectively choose to deem waived or otherwise exclude such Section(s) of-the License, but only in their entirety and only with respect to the Combined-Software.--==============================================================================-Software from third parties included in the LLVM Project:-==============================================================================-The LLVM Project contains third party software which is under different license-terms. All such code will be identified clearly using at least one of two-mechanisms:-1) It will be in a separate directory tree with its own `LICENSE.txt` or- `LICENSE` file at the top containing the specific license and restrictions- which apply to that software, or-2) It will contain specific license and restriction terms at the top of every- file.--==============================================================================-Legacy LLVM License (https://llvm.org/docs/DeveloperPolicy.html#legacy):-==============================================================================--The compiler_rt library is dual licensed under both the University of Illinois-"BSD-Like" license and the MIT license. As a user of this code you may choose-to use it under either license. As a contributor, you agree to allow your code-to be used under both.--Full text of the relevant licenses is included below.--==============================================================================--University of Illinois/NCSA-Open Source License--Copyright (c) 2009-2019 by the contributors listed in CREDITS.TXT--All rights reserved.--Developed by:-- LLVM Team-- University of Illinois at Urbana-Champaign-- http://llvm.org--Permission is hereby granted, free of charge, to any person obtaining a copy of-this software and associated documentation files (the "Software"), to deal with-the Software without restriction, including without limitation the rights to-use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies-of the Software, and to permit persons to whom the Software is furnished to do-so, subject to the following conditions:-- * Redistributions of source code must retain the above copyright notice,- this list of conditions and the following disclaimers.-- * Redistributions in binary form must reproduce the above copyright notice,- this list of conditions and the following disclaimers in the- documentation and/or other materials provided with the distribution.-- * Neither the names of the LLVM Team, University of Illinois at- Urbana-Champaign, nor the names of its contributors may be used to- endorse or promote products derived from this Software without specific- prior written permission.--THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR-IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS-FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE-CONTRIBUTORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER-LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,-OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS WITH THE-SOFTWARE.--==============================================================================--Copyright (c) 2009-2015 by the contributors listed in CREDITS.TXT--Permission is hereby granted, free of charge, to any person obtaining a copy-of this software and associated documentation files (the "Software"), to deal-in the Software without restriction, including without limitation the rights-to use, copy, modify, merge, publish, distribute, sublicense, and/or sell-copies of the Software, and to permit persons to whom the Software is-furnished to do so, subject to the following conditions:--The above copyright notice and this permission notice shall be included in-all copies or substantial portions of the Software.--THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR-IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,-FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE-AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER-LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,-OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN-THE SOFTWARE.diff --git a/scripts/licenses/emscripten-3.1.46-libcxx.LICENSE b/scripts/licenses/emscripten-3.1.46-libcxx.LICENSEdeleted file mode 100644index e159d28..0000000--- a/scripts/licenses/emscripten-3.1.46-libcxx.LICENSE+++ /dev/null@@ -1,311 +0,0 @@-==============================================================================-The LLVM Project is under the Apache License v2.0 with LLVM Exceptions:-==============================================================================-- 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.------- LLVM Exceptions to the Apache 2.0 License ------As an exception, if, as a result of your compiling your source code, portions-of this Software are embedded into an Object form of such source code, you-may redistribute such embedded portions in such Object form without complying-with the conditions of Sections 4(a), 4(b) and 4(d) of the License.--In addition, if you combine or link compiled forms of this Software with-software that is licensed under the GPLv2 ("Combined Software") and if a-court of competent jurisdiction determines that the patent provision (Section-3), the indemnity provision (Section 9) or other Section of the License-conflicts with the conditions of the GPLv2, you may retroactively and-prospectively choose to deem waived or otherwise exclude such Section(s) of-the License, but only in their entirety and only with respect to the Combined-Software.--==============================================================================-Software from third parties included in the LLVM Project:-==============================================================================-The LLVM Project contains third party software which is under different license-terms. All such code will be identified clearly using at least one of two-mechanisms:-1) It will be in a separate directory tree with its own `LICENSE.txt` or- `LICENSE` file at the top containing the specific license and restrictions- which apply to that software, or-2) It will contain specific license and restriction terms at the top of every- file.--==============================================================================-Legacy LLVM License (https://llvm.org/docs/DeveloperPolicy.html#legacy):-==============================================================================--The libc++ library is dual licensed under both the University of Illinois-"BSD-Like" license and the MIT license. As a user of this code you may choose-to use it under either license. As a contributor, you agree to allow your code-to be used under both.--Full text of the relevant licenses is included below.--==============================================================================--University of Illinois/NCSA-Open Source License--Copyright (c) 2009-2019 by the contributors listed in CREDITS.TXT--All rights reserved.--Developed by:-- LLVM Team-- University of Illinois at Urbana-Champaign-- http://llvm.org--Permission is hereby granted, free of charge, to any person obtaining a copy of-this software and associated documentation files (the "Software"), to deal with-the Software without restriction, including without limitation the rights to-use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies-of the Software, and to permit persons to whom the Software is furnished to do-so, subject to the following conditions:-- * Redistributions of source code must retain the above copyright notice,- this list of conditions and the following disclaimers.-- * Redistributions in binary form must reproduce the above copyright notice,- this list of conditions and the following disclaimers in the- documentation and/or other materials provided with the distribution.-- * Neither the names of the LLVM Team, University of Illinois at- Urbana-Champaign, nor the names of its contributors may be used to- endorse or promote products derived from this Software without specific- prior written permission.--THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR-IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS-FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE-CONTRIBUTORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER-LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,-OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS WITH THE-SOFTWARE.--==============================================================================--Copyright (c) 2009-2014 by the contributors listed in CREDITS.TXT--Permission is hereby granted, free of charge, to any person obtaining a copy-of this software and associated documentation files (the "Software"), to deal-in the Software without restriction, including without limitation the rights-to use, copy, modify, merge, publish, distribute, sublicense, and/or sell-copies of the Software, and to permit persons to whom the Software is-furnished to do so, subject to the following conditions:--The above copyright notice and this permission notice shall be included in-all copies or substantial portions of the Software.--THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR-IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,-FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE-AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER-LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,-OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN-THE SOFTWARE.diff --git a/scripts/licenses/emscripten-3.1.46-libcxxabi.LICENSE b/scripts/licenses/emscripten-3.1.46-libcxxabi.LICENSEdeleted file mode 100644index b75c044..0000000--- a/scripts/licenses/emscripten-3.1.46-libcxxabi.LICENSE+++ /dev/null@@ -1,311 +0,0 @@-==============================================================================-The LLVM Project is under the Apache License v2.0 with LLVM Exceptions:-==============================================================================-- 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.------- LLVM Exceptions to the Apache 2.0 License ------As an exception, if, as a result of your compiling your source code, portions-of this Software are embedded into an Object form of such source code, you-may redistribute such embedded portions in such Object form without complying-with the conditions of Sections 4(a), 4(b) and 4(d) of the License.--In addition, if you combine or link compiled forms of this Software with-software that is licensed under the GPLv2 ("Combined Software") and if a-court of competent jurisdiction determines that the patent provision (Section-3), the indemnity provision (Section 9) or other Section of the License-conflicts with the conditions of the GPLv2, you may retroactively and-prospectively choose to deem waived or otherwise exclude such Section(s) of-the License, but only in their entirety and only with respect to the Combined-Software.--==============================================================================-Software from third parties included in the LLVM Project:-==============================================================================-The LLVM Project contains third party software which is under different license-terms. All such code will be identified clearly using at least one of two-mechanisms:-1) It will be in a separate directory tree with its own `LICENSE.txt` or- `LICENSE` file at the top containing the specific license and restrictions- which apply to that software, or-2) It will contain specific license and restriction terms at the top of every- file.--==============================================================================-Legacy LLVM License (https://llvm.org/docs/DeveloperPolicy.html#legacy):-==============================================================================--The libc++abi library is dual licensed under both the University of Illinois-"BSD-Like" license and the MIT license. As a user of this code you may choose-to use it under either license. As a contributor, you agree to allow your code-to be used under both.--Full text of the relevant licenses is included below.--==============================================================================--University of Illinois/NCSA-Open Source License--Copyright (c) 2009-2019 by the contributors listed in CREDITS.TXT--All rights reserved.--Developed by:-- LLVM Team-- University of Illinois at Urbana-Champaign-- http://llvm.org--Permission is hereby granted, free of charge, to any person obtaining a copy of-this software and associated documentation files (the "Software"), to deal with-the Software without restriction, including without limitation the rights to-use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies-of the Software, and to permit persons to whom the Software is furnished to do-so, subject to the following conditions:-- * Redistributions of source code must retain the above copyright notice,- this list of conditions and the following disclaimers.-- * Redistributions in binary form must reproduce the above copyright notice,- this list of conditions and the following disclaimers in the- documentation and/or other materials provided with the distribution.-- * Neither the names of the LLVM Team, University of Illinois at- Urbana-Champaign, nor the names of its contributors may be used to- endorse or promote products derived from this Software without specific- prior written permission.--THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR-IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS-FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE-CONTRIBUTORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER-LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,-OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS WITH THE-SOFTWARE.--==============================================================================--Copyright (c) 2009-2014 by the contributors listed in CREDITS.TXT--Permission is hereby granted, free of charge, to any person obtaining a copy-of this software and associated documentation files (the "Software"), to deal-in the Software without restriction, including without limitation the rights-to use, copy, modify, merge, publish, distribute, sublicense, and/or sell-copies of the Software, and to permit persons to whom the Software is-furnished to do so, subject to the following conditions:--The above copyright notice and this permission notice shall be included in-all copies or substantial portions of the Software.--THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR-IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,-FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE-AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER-LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,-OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN-THE SOFTWARE.diff --git a/scripts/licenses/emscripten-3.1.46-libunwind.LICENSE b/scripts/licenses/emscripten-3.1.46-libunwind.LICENSEdeleted file mode 100644index 1e31206..0000000--- a/scripts/licenses/emscripten-3.1.46-libunwind.LICENSE+++ /dev/null@@ -1,311 +0,0 @@-==============================================================================-The LLVM Project is under the Apache License v2.0 with LLVM Exceptions:-==============================================================================-- 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.------- LLVM Exceptions to the Apache 2.0 License ------As an exception, if, as a result of your compiling your source code, portions-of this Software are embedded into an Object form of such source code, you-may redistribute such embedded portions in such Object form without complying-with the conditions of Sections 4(a), 4(b) and 4(d) of the License.--In addition, if you combine or link compiled forms of this Software with-software that is licensed under the GPLv2 ("Combined Software") and if a-court of competent jurisdiction determines that the patent provision (Section-3), the indemnity provision (Section 9) or other Section of the License-conflicts with the conditions of the GPLv2, you may retroactively and-prospectively choose to deem waived or otherwise exclude such Section(s) of-the License, but only in their entirety and only with respect to the Combined-Software.--==============================================================================-Software from third parties included in the LLVM Project:-==============================================================================-The LLVM Project contains third party software which is under different license-terms. All such code will be identified clearly using at least one of two-mechanisms:-1) It will be in a separate directory tree with its own `LICENSE.txt` or- `LICENSE` file at the top containing the specific license and restrictions- which apply to that software, or-2) It will contain specific license and restriction terms at the top of every- file.--==============================================================================-Legacy LLVM License (https://llvm.org/docs/DeveloperPolicy.html#legacy):-==============================================================================--The libunwind library is dual licensed under both the University of Illinois-"BSD-Like" license and the MIT license. As a user of this code you may choose-to use it under either license. As a contributor, you agree to allow your code-to be used under both.--Full text of the relevant licenses is included below.--==============================================================================--University of Illinois/NCSA-Open Source License--Copyright (c) 2009-2019 by the contributors listed in CREDITS.TXT--All rights reserved.--Developed by:-- LLVM Team-- University of Illinois at Urbana-Champaign-- http://llvm.org--Permission is hereby granted, free of charge, to any person obtaining a copy of-this software and associated documentation files (the "Software"), to deal with-the Software without restriction, including without limitation the rights to-use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies-of the Software, and to permit persons to whom the Software is furnished to do-so, subject to the following conditions:-- * Redistributions of source code must retain the above copyright notice,- this list of conditions and the following disclaimers.-- * Redistributions in binary form must reproduce the above copyright notice,- this list of conditions and the following disclaimers in the- documentation and/or other materials provided with the distribution.-- * Neither the names of the LLVM Team, University of Illinois at- Urbana-Champaign, nor the names of its contributors may be used to- endorse or promote products derived from this Software without specific- prior written permission.--THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR-IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS-FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE-CONTRIBUTORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER-LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,-OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS WITH THE-SOFTWARE.--==============================================================================--Copyright (c) 2009-2014 by the contributors listed in CREDITS.TXT--Permission is hereby granted, free of charge, to any person obtaining a copy-of this software and associated documentation files (the "Software"), to deal-in the Software without restriction, including without limitation the rights-to use, copy, modify, merge, publish, distribute, sublicense, and/or sell-copies of the Software, and to permit persons to whom the Software is-furnished to do so, subject to the following conditions:--The above copyright notice and this permission notice shall be included in-all copies or substantial portions of the Software.--THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR-IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,-FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE-AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER-LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,-OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN-THE SOFTWARE.diff --git a/scripts/licenses/emscripten-3.1.46-musl.LICENSE b/scripts/licenses/emscripten-3.1.46-musl.LICENSEdeleted file mode 100644index c1628e9..0000000--- a/scripts/licenses/emscripten-3.1.46-musl.LICENSE+++ /dev/null@@ -1,193 +0,0 @@-musl as a whole is licensed under the following standard MIT license:-------------------------------------------------------------------------Copyright © 2005-2020 Rich Felker, et al.--Permission is hereby granted, free of charge, to any person obtaining-a copy of this software and associated documentation files (the-"Software"), to deal in the Software without restriction, including-without limitation the rights to use, copy, modify, merge, publish,-distribute, sublicense, and/or sell copies of the Software, and to-permit persons to whom the Software is furnished to do so, subject to-the following conditions:--The above copyright notice and this permission notice shall be-included in all copies or substantial portions of the Software.--THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,-EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF-MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.-IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY-CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,-TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE-SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.-------------------------------------------------------------------------Authors/contributors include:--A. Wilcox-Ada Worcester-Alex Dowad-Alex Suykov-Alexander Monakov-Andre McCurdy-Andrew Kelley-Anthony G. Basile-Aric Belsito-Arvid Picciani-Bartosz Brachaczek-Benjamin Peterson-Bobby Bingham-Boris Brezillon-Brent Cook-Chris Spiegel-Clément Vasseur-Daniel Micay-Daniel Sabogal-Daurnimator-David Carlier-David Edelsohn-Denys Vlasenko-Dmitry Ivanov-Dmitry V. Levin-Drew DeVault-Emil Renner Berthing-Fangrui Song-Felix Fietkau-Felix Janda-Gianluca Anzolin-Hauke Mehrtens-He X-Hiltjo Posthuma-Isaac Dunham-Jaydeep Patil-Jens Gustedt-Jeremy Huntwork-Jo-Philipp Wich-Joakim Sindholt-John Spencer-Julien Ramseier-Justin Cormack-Kaarle Ritvanen-Khem Raj-Kylie McClain-Leah Neukirchen-Luca Barbato-Luka Perkov-M Farkas-Dyck (Strake)-Mahesh Bodapati-Markus Wichmann-Masanori Ogino-Michael Clark-Michael Forney-Mikhail Kremnyov-Natanael Copa-Nicholas J. Kain-orc-Pascal Cuoq-Patrick Oppenlander-Petr Hosek-Petr Skocik-Pierre Carrier-Reini Urban-Rich Felker-Richard Pennington-Ryan Fairfax-Samuel Holland-Segev Finer-Shiz-sin-Solar Designer-Stefan Kristiansson-Stefan O'Rear-Szabolcs Nagy-Timo Teräs-Trutz Behn-Valentin Ochs-Will Dietz-William Haddon-William Pitcock--Portions of this software are derived from third-party works licensed-under terms compatible with the above MIT license:--The TRE regular expression implementation (src/regex/reg* and-src/regex/tre*) is Copyright © 2001-2008 Ville Laurikari and licensed-under a 2-clause BSD license (license text in the source files). The-included version has been heavily modified by Rich Felker in 2012, in-the interests of size, simplicity, and namespace cleanliness.--Much of the math library code (src/math/* and src/complex/*) is-Copyright © 1993,2004 Sun Microsystems or-Copyright © 2003-2011 David Schultz or-Copyright © 2003-2009 Steven G. Kargl or-Copyright © 2003-2009 Bruce D. Evans or-Copyright © 2008 Stephen L. Moshier or-Copyright © 2017-2018 Arm Limited-and labelled as such in comments in the individual source files. All-have been licensed under extremely permissive terms.--The ARM memcpy code (src/string/arm/memcpy.S) is Copyright © 2008-The Android Open Source Project and is licensed under a two-clause BSD-license. It was taken from Bionic libc, used on Android.--The AArch64 memcpy and memset code (src/string/aarch64/*) are-Copyright © 1999-2019, Arm Limited.--The implementation of DES for crypt (src/crypt/crypt_des.c) is-Copyright © 1994 David Burren. It is licensed under a BSD license.--The implementation of blowfish crypt (src/crypt/crypt_blowfish.c) was-originally written by Solar Designer and placed into the public-domain. The code also comes with a fallback permissive license for use-in jurisdictions that may not recognize the public domain.--The smoothsort implementation (src/stdlib/qsort.c) is Copyright © 2011-Valentin Ochs and is licensed under an MIT-style license.--The x86_64 port was written by Nicholas J. Kain and is licensed under-the standard MIT terms.--The mips and microblaze ports were originally written by Richard-Pennington for use in the ellcc project. The original code was adapted-by Rich Felker for build system and code conventions during upstream-integration. It is licensed under the standard MIT terms.--The mips64 port was contributed by Imagination Technologies and is-licensed under the standard MIT terms.--The powerpc port was also originally written by Richard Pennington,-and later supplemented and integrated by John Spencer. It is licensed-under the standard MIT terms.--All other files which have no copyright comments are original works-produced specifically for use as part of this library, written either-by Rich Felker, the main author of the library, or by one or more-contibutors listed above. Details on authorship of individual files-can be found in the git version control history of the project. The-omission of copyright and license comments in each file is in the-interest of source tree size.--In addition, permission is hereby granted for all public header files-(include/* and arch/*/bits/*) and crt files intended to be linked into-applications (crt/*, ldso/dlstart.c, and arch/*/crt_arch.h) to omit-the copyright notice and permission notice otherwise required by the-license, and to use these files without any requirement of-attribution. These files include substantial contributions from:--Bobby Bingham-John Spencer-Nicholas J. Kain-Rich Felker-Richard Pennington-Stefan Kristiansson-Szabolcs Nagy--all of whom have explicitly granted such permission.--This file previously contained text expressing a belief that most of-the files covered by the above exception were sufficiently trivial not-to be subject to copyright, resulting in confusion over whether it-negated the permissions granted in the license. In the spirit of-permissive licensing, and of not having licensing issues being an-obstacle to adoption, that text has been removed.diff --git a/scripts/licenses/emscripten-3.1.46.LICENSE b/scripts/licenses/emscripten-3.1.46.LICENSEdeleted file mode 100644index 70cabe3..0000000--- a/scripts/licenses/emscripten-3.1.46.LICENSE+++ /dev/null@@ -1,102 +0,0 @@-Emscripten is available under 2 licenses, the MIT license and the-University of Illinois/NCSA Open Source License.--Both are permissive open source licenses, with little if any-practical difference between them.--The reason for offering both is that (1) the MIT license is-well-known, while (2) the University of Illinois/NCSA Open Source-License allows Emscripten's code to be integrated upstream into-LLVM, which uses that license, should the opportunity arise.--The full text of both licenses follows.--==============================================================================--Copyright (c) 2010-2014 Emscripten authors, see AUTHORS file.--Permission is hereby granted, free of charge, to any person obtaining a copy-of this software and associated documentation files (the "Software"), to deal-in the Software without restriction, including without limitation the rights-to use, copy, modify, merge, publish, distribute, sublicense, and/or sell-copies of the Software, and to permit persons to whom the Software is-furnished to do so, subject to the following conditions:--The above copyright notice and this permission notice shall be included in-all copies or substantial portions of the Software.--THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR-IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,-FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE-AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER-LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,-OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN-THE SOFTWARE.--==============================================================================--Copyright (c) 2010-2014 Emscripten authors, see AUTHORS file.-All rights reserved.--Permission is hereby granted, free of charge, to any person obtaining a-copy of this software and associated documentation files (the-"Software"), to deal with the Software without restriction, including-without limitation the rights to use, copy, modify, merge, publish,-distribute, sublicense, and/or sell copies of the Software, and to-permit persons to whom the Software is furnished to do so, subject to-the following conditions:-- Redistributions of source code must retain the above copyright- notice, this list of conditions and the following disclaimers.-- Redistributions in binary form must reproduce the above- copyright notice, this list of conditions and the following disclaimers- in the documentation and/or other materials provided with the- distribution.-- Neither the names of Mozilla,- nor the names of its contributors may be used to endorse- or promote products derived from this Software without specific prior- written permission.--THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS-OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF-MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.-IN NO EVENT SHALL THE CONTRIBUTORS OR COPYRIGHT HOLDERS BE LIABLE FOR-ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,-TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE-SOFTWARE OR THE USE OR OTHER DEALINGS WITH THE SOFTWARE.--==============================================================================--This program uses portions of Node.js source code located in src/library_path.js,-in accordance with the terms of the MIT license. Node's license follows:-- """- Copyright Joyent, Inc. and other Node contributors. All rights reserved.- Permission is hereby granted, free of charge, to any person obtaining a copy- of this software and associated documentation files (the "Software"), to- deal in the Software without restriction, including without limitation the- rights to use, copy, modify, merge, publish, distribute, sublicense, and/or- sell copies of the Software, and to permit persons to whom the Software is- furnished to do so, subject to the following conditions:-- The above copyright notice and this permission notice shall be included in- all copies or substantial portions of the Software.-- THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR- IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,- FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE- AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER- LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING- FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS- IN THE SOFTWARE.- """--The musl libc project is bundled in this repo, and it has the MIT license, see-system/lib/libc/musl/COPYRIGHT--The third_party/ subdirectory contains code with other licenses. None of it is-used by default, but certain options use it (e.g., the optional closure compiler-flag will run closure compiler from third_party/).-diff --git a/scripts/licenses/hiwire-49f3450.LICENSE b/scripts/licenses/hiwire-49f3450.LICENSEdeleted file mode 100644index a612ad9..0000000--- a/scripts/licenses/hiwire-49f3450.LICENSE+++ /dev/null@@ -1,373 +0,0 @@-Mozilla Public License Version 2.0-==================================--1. Definitions-----------------1.1. "Contributor"- means each individual or legal entity that creates, contributes to- the creation of, or owns Covered Software.--1.2. "Contributor Version"- means the combination of the Contributions of others (if any) used- by a Contributor and that particular Contributor's Contribution.--1.3. "Contribution"- means Covered Software of a particular Contributor.--1.4. "Covered Software"- means Source Code Form to which the initial Contributor has attached- the notice in Exhibit A, the Executable Form of such Source Code- Form, and Modifications of such Source Code Form, in each case- including portions thereof.--1.5. "Incompatible With Secondary Licenses"- means-- (a) that the initial Contributor has attached the notice described- in Exhibit B to the Covered Software; or-- (b) that the Covered Software was made available under the terms of- version 1.1 or earlier of the License, but not also under the- terms of a Secondary License.--1.6. "Executable Form"- means any form of the work other than Source Code Form.--1.7. "Larger Work"- means a work that combines Covered Software with other material, in- a separate file or files, that is not Covered Software.--1.8. "License"- means this document.--1.9. "Licensable"- means having the right to grant, to the maximum extent possible,- whether at the time of the initial grant or subsequently, any and- all of the rights conveyed by this License.--1.10. "Modifications"- means any of the following:-- (a) any file in Source Code Form that results from an addition to,- deletion from, or modification of the contents of Covered- Software; or-- (b) any new file in Source Code Form that contains any Covered- Software.--1.11. "Patent Claims" of a Contributor- means any patent claim(s), including without limitation, method,- process, and apparatus claims, in any patent Licensable by such- Contributor that would be infringed, but for the grant of the- License, by the making, using, selling, offering for sale, having- made, import, or transfer of either its Contributions or its- Contributor Version.--1.12. "Secondary License"- means either the GNU General Public License, Version 2.0, the GNU- Lesser General Public License, Version 2.1, the GNU Affero General- Public License, Version 3.0, or any later versions of those- licenses.--1.13. "Source Code Form"- means the form of the work preferred for making modifications.--1.14. "You" (or "Your")- means an individual or a legal entity exercising rights under this- License. For legal entities, "You" includes any entity that- controls, is controlled by, or is under common control with You. For- purposes of this definition, "control" means (a) the power, direct- or indirect, to cause the direction or management of such entity,- whether by contract or otherwise, or (b) ownership of more than- fifty percent (50%) of the outstanding shares or beneficial- ownership of such entity.--2. License Grants and Conditions-----------------------------------2.1. Grants--Each Contributor hereby grants You a world-wide, royalty-free,-non-exclusive license:--(a) under intellectual property rights (other than patent or trademark)- Licensable by such Contributor to use, reproduce, make available,- modify, display, perform, distribute, and otherwise exploit its- Contributions, either on an unmodified basis, with Modifications, or- as part of a Larger Work; and--(b) under Patent Claims of such Contributor to make, use, sell, offer- for sale, have made, import, and otherwise transfer either its- Contributions or its Contributor Version.--2.2. Effective Date--The licenses granted in Section 2.1 with respect to any Contribution-become effective for each Contribution on the date the Contributor first-distributes such Contribution.--2.3. Limitations on Grant Scope--The licenses granted in this Section 2 are the only rights granted under-this License. No additional rights or licenses will be implied from the-distribution or licensing of Covered Software under this License.-Notwithstanding Section 2.1(b) above, no patent license is granted by a-Contributor:--(a) for any code that a Contributor has removed from Covered Software;- or--(b) for infringements caused by: (i) Your and any other third party's- modifications of Covered Software, or (ii) the combination of its- Contributions with other software (except as part of its Contributor- Version); or--(c) under Patent Claims infringed by Covered Software in the absence of- its Contributions.--This License does not grant any rights in the trademarks, service marks,-or logos of any Contributor (except as may be necessary to comply with-the notice requirements in Section 3.4).--2.4. Subsequent Licenses--No Contributor makes additional grants as a result of Your choice to-distribute the Covered Software under a subsequent version of this-License (see Section 10.2) or under the terms of a Secondary License (if-permitted under the terms of Section 3.3).--2.5. Representation--Each Contributor represents that the Contributor believes its-Contributions are its original creation(s) or it has sufficient rights-to grant the rights to its Contributions conveyed by this License.--2.6. Fair Use--This License is not intended to limit any rights You have under-applicable copyright doctrines of fair use, fair dealing, or other-equivalents.--2.7. Conditions--Sections 3.1, 3.2, 3.3, and 3.4 are conditions of the licenses granted-in Section 2.1.--3. Responsibilities----------------------3.1. Distribution of Source Form--All distribution of Covered Software in Source Code Form, including any-Modifications that You create or to which You contribute, must be under-the terms of this License. You must inform recipients that the Source-Code Form of the Covered Software is governed by the terms of this-License, and how they can obtain a copy of this License. You may not-attempt to alter or restrict the recipients' rights in the Source Code-Form.--3.2. Distribution of Executable Form--If You distribute Covered Software in Executable Form then:--(a) such Covered Software must also be made available in Source Code- Form, as described in Section 3.1, and You must inform recipients of- the Executable Form how they can obtain a copy of such Source Code- Form by reasonable means in a timely manner, at a charge no more- than the cost of distribution to the recipient; and--(b) You may distribute such Executable Form under the terms of this- License, or sublicense it under different terms, provided that the- license for the Executable Form does not attempt to limit or alter- the recipients' rights in the Source Code Form under this License.--3.3. Distribution of a Larger Work--You may create and distribute a Larger Work under terms of Your choice,-provided that You also comply with the requirements of this License for-the Covered Software. If the Larger Work is a combination of Covered-Software with a work governed by one or more Secondary Licenses, and the-Covered Software is not Incompatible With Secondary Licenses, this-License permits You to additionally distribute such Covered Software-under the terms of such Secondary License(s), so that the recipient of-the Larger Work may, at their option, further distribute the Covered-Software under the terms of either this License or such Secondary-License(s).--3.4. Notices--You may not remove or alter the substance of any license notices-(including copyright notices, patent notices, disclaimers of warranty,-or limitations of liability) contained within the Source Code Form of-the Covered Software, except that You may alter any license notices to-the extent required to remedy known factual inaccuracies.--3.5. Application of Additional Terms--You may choose to offer, and to charge a fee for, warranty, support,-indemnity or liability obligations to one or more recipients of Covered-Software. However, You may do so only on Your own behalf, and not on-behalf of any Contributor. You must make it absolutely clear that any-such warranty, support, indemnity, or liability obligation is offered by-You alone, and You hereby agree to indemnify every Contributor for any-liability incurred by such Contributor as a result of warranty, support,-indemnity or liability terms You offer. You may include additional-disclaimers of warranty and limitations of liability specific to any-jurisdiction.--4. Inability to Comply Due to Statute or Regulation------------------------------------------------------If it is impossible for You to comply with any of the terms of this-License with respect to some or all of the Covered Software due to-statute, judicial order, or regulation then You must: (a) comply with-the terms of this License to the maximum extent possible; and (b)-describe the limitations and the code they affect. Such description must-be placed in a text file included with all distributions of the Covered-Software under this License. Except to the extent prohibited by statute-or regulation, such description must be sufficiently detailed for a-recipient of ordinary skill to be able to understand it.--5. Termination-----------------5.1. The rights granted under this License will terminate automatically-if You fail to comply with any of its terms. However, if You become-compliant, then the rights granted under this License from a particular-Contributor are reinstated (a) provisionally, unless and until such-Contributor explicitly and finally terminates Your grants, and (b) on an-ongoing basis, if such Contributor fails to notify You of the-non-compliance by some reasonable means prior to 60 days after You have-come back into compliance. Moreover, Your grants from a particular-Contributor are reinstated on an ongoing basis if such Contributor-notifies You of the non-compliance by some reasonable means, this is the-first time You have received notice of non-compliance with this License-from such Contributor, and You become compliant prior to 30 days after-Your receipt of the notice.--5.2. If You initiate litigation against any entity by asserting a patent-infringement claim (excluding declaratory judgment actions,-counter-claims, and cross-claims) alleging that a Contributor Version-directly or indirectly infringes any patent, then the rights granted to-You by any and all Contributors for the Covered Software under Section-2.1 of this License shall terminate.--5.3. In the event of termination under Sections 5.1 or 5.2 above, all-end user license agreements (excluding distributors and resellers) which-have been validly granted by You or Your distributors under this License-prior to termination shall survive termination.--************************************************************************-* *-* 6. Disclaimer of Warranty *-* ------------------------- *-* *-* Covered Software is provided under this License on an "as is" *-* basis, without warranty of any kind, either expressed, implied, or *-* statutory, including, without limitation, warranties that the *-* Covered Software is free of defects, merchantable, fit for a *-* particular purpose or non-infringing. The entire risk as to the *-* quality and performance of the Covered Software is with You. *-* Should any Covered Software prove defective in any respect, You *-* (not any Contributor) assume the cost of any necessary servicing, *-* repair, or correction. This disclaimer of warranty constitutes an *-* essential part of this License. No use of any Covered Software is *-* authorized under this License except under this disclaimer. *-* *-************************************************************************--************************************************************************-* *-* 7. Limitation of Liability *-* -------------------------- *-* *-* Under no circumstances and under no legal theory, whether tort *-* (including negligence), contract, or otherwise, shall any *-* Contributor, or anyone who distributes Covered Software as *-* permitted above, be liable to You for any direct, indirect, *-* special, incidental, or consequential damages of any character *-* including, without limitation, damages for lost profits, loss of *-* goodwill, work stoppage, computer failure or malfunction, or any *-* and all other commercial damages or losses, even if such party *-* shall have been informed of the possibility of such damages. This *-* limitation of liability shall not apply to liability for death or *-* personal injury resulting from such party's negligence to the *-* extent applicable law prohibits such limitation. Some *-* jurisdictions do not allow the exclusion or limitation of *-* incidental or consequential damages, so this exclusion and *-* limitation may not apply to You. *-* *-************************************************************************--8. Litigation----------------Any litigation relating to this License may be brought only in the-courts of a jurisdiction where the defendant maintains its principal-place of business and such litigation shall be governed by laws of that-jurisdiction, without reference to its conflict-of-law provisions.-Nothing in this Section shall prevent a party's ability to bring-cross-claims or counter-claims.--9. Miscellaneous-------------------This License represents the complete agreement concerning the subject-matter hereof. If any provision of this License is held to be-unenforceable, such provision shall be reformed only to the extent-necessary to make it enforceable. Any law or regulation which provides-that the language of a contract shall be construed against the drafter-shall not be used to construe this License against a Contributor.--10. Versions of the License------------------------------10.1. New Versions--Mozilla Foundation is the license steward. Except as provided in Section-10.3, no one other than the license steward has the right to modify or-publish new versions of this License. Each version will be given a-distinguishing version number.--10.2. Effect of New Versions--You may distribute the Covered Software under the terms of the version-of the License under which You originally received the Covered Software,-or under the terms of any subsequent version published by the license-steward.--10.3. Modified Versions--If you create software not governed by this License, and you want to-create a new license for such software, you may create and use a-modified version of this License if you rename the license and remove-any references to the name of the license steward (except to note that-such modified license differs from this License).--10.4. Distributing Source Code Form that is Incompatible With Secondary-Licenses--If You choose to distribute Source Code Form that is Incompatible With-Secondary Licenses under the terms of this version of the License, the-notice described in Exhibit B of this License must be attached.--Exhibit A - Source Code Form License Notice---------------------------------------------- This Source Code Form is subject to the terms of the Mozilla Public- License, v. 2.0. If a copy of the MPL was not distributed with this- file, You can obtain one at http://mozilla.org/MPL/2.0/.--If it is not possible or desirable to put the notice in a particular-file, then You may include the notice in a location (such as a LICENSE-file in a relevant directory) where a recipient would be likely to look-for such a notice.--You may add additional accurate notices of copyright ownership.--Exhibit B - "Incompatible With Secondary Licenses" Notice------------------------------------------------------------ This Source Code Form is "Incompatible With Secondary Licenses", as- defined by the Mozilla Public License, v. 2.0.diff --git a/scripts/licenses/libffi-f08493d.LICENSE b/scripts/licenses/libffi-f08493d.LICENSEdeleted file mode 100644index 75d1bce..0000000--- a/scripts/licenses/libffi-f08493d.LICENSE+++ /dev/null@@ -1,21 +0,0 @@-libffi - Copyright (c) 1996-2022 Anthony Green, Red Hat, Inc and others.-See source files for details.--Permission is hereby granted, free of charge, to any person obtaining-a copy of this software and associated documentation files (the-``Software''), to deal in the Software without restriction, including-without limitation the rights to use, copy, modify, merge, publish,-distribute, sublicense, and/or sell copies of the Software, and to-permit persons to whom the Software is furnished to do so, subject to-the following conditions:--The above copyright notice and this permission notice shall be-included in all copies or substantial portions of the Software.--THE SOFTWARE IS PROVIDED ``AS IS'', WITHOUT WARRANTY OF ANY KIND,-EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF-MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.-IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY-CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,-TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE-SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.diff --git a/scripts/licenses/pyodide-0.25.1.LICENSE b/scripts/licenses/pyodide-0.25.1.LICENSEdeleted file mode 100644index a612ad9..0000000--- a/scripts/licenses/pyodide-0.25.1.LICENSE+++ /dev/null@@ -1,373 +0,0 @@-Mozilla Public License Version 2.0-==================================--1. Definitions-----------------1.1. "Contributor"- means each individual or legal entity that creates, contributes to- the creation of, or owns Covered Software.--1.2. "Contributor Version"- means the combination of the Contributions of others (if any) used- by a Contributor and that particular Contributor's Contribution.--1.3. "Contribution"- means Covered Software of a particular Contributor.--1.4. "Covered Software"- means Source Code Form to which the initial Contributor has attached- the notice in Exhibit A, the Executable Form of such Source Code- Form, and Modifications of such Source Code Form, in each case- including portions thereof.--1.5. "Incompatible With Secondary Licenses"- means-- (a) that the initial Contributor has attached the notice described- in Exhibit B to the Covered Software; or-- (b) that the Covered Software was made available under the terms of- version 1.1 or earlier of the License, but not also under the- terms of a Secondary License.--1.6. "Executable Form"- means any form of the work other than Source Code Form.--1.7. "Larger Work"- means a work that combines Covered Software with other material, in- a separate file or files, that is not Covered Software.--1.8. "License"- means this document.--1.9. "Licensable"- means having the right to grant, to the maximum extent possible,- whether at the time of the initial grant or subsequently, any and- all of the rights conveyed by this License.--1.10. "Modifications"- means any of the following:-- (a) any file in Source Code Form that results from an addition to,- deletion from, or modification of the contents of Covered- Software; or-- (b) any new file in Source Code Form that contains any Covered- Software.--1.11. "Patent Claims" of a Contributor- means any patent claim(s), including without limitation, method,- process, and apparatus claims, in any patent Licensable by such- Contributor that would be infringed, but for the grant of the- License, by the making, using, selling, offering for sale, having- made, import, or transfer of either its Contributions or its- Contributor Version.--1.12. "Secondary License"- means either the GNU General Public License, Version 2.0, the GNU- Lesser General Public License, Version 2.1, the GNU Affero General- Public License, Version 3.0, or any later versions of those- licenses.--1.13. "Source Code Form"- means the form of the work preferred for making modifications.--1.14. "You" (or "Your")- means an individual or a legal entity exercising rights under this- License. For legal entities, "You" includes any entity that- controls, is controlled by, or is under common control with You. For- purposes of this definition, "control" means (a) the power, direct- or indirect, to cause the direction or management of such entity,- whether by contract or otherwise, or (b) ownership of more than- fifty percent (50%) of the outstanding shares or beneficial- ownership of such entity.--2. License Grants and Conditions-----------------------------------2.1. Grants--Each Contributor hereby grants You a world-wide, royalty-free,-non-exclusive license:--(a) under intellectual property rights (other than patent or trademark)- Licensable by such Contributor to use, reproduce, make available,- modify, display, perform, distribute, and otherwise exploit its- Contributions, either on an unmodified basis, with Modifications, or- as part of a Larger Work; and--(b) under Patent Claims of such Contributor to make, use, sell, offer- for sale, have made, import, and otherwise transfer either its- Contributions or its Contributor Version.--2.2. Effective Date--The licenses granted in Section 2.1 with respect to any Contribution-become effective for each Contribution on the date the Contributor first-distributes such Contribution.--2.3. Limitations on Grant Scope--The licenses granted in this Section 2 are the only rights granted under-this License. No additional rights or licenses will be implied from the-distribution or licensing of Covered Software under this License.-Notwithstanding Section 2.1(b) above, no patent license is granted by a-Contributor:--(a) for any code that a Contributor has removed from Covered Software;- or--(b) for infringements caused by: (i) Your and any other third party's- modifications of Covered Software, or (ii) the combination of its- Contributions with other software (except as part of its Contributor- Version); or--(c) under Patent Claims infringed by Covered Software in the absence of- its Contributions.--This License does not grant any rights in the trademarks, service marks,-or logos of any Contributor (except as may be necessary to comply with-the notice requirements in Section 3.4).--2.4. Subsequent Licenses--No Contributor makes additional grants as a result of Your choice to-distribute the Covered Software under a subsequent version of this-License (see Section 10.2) or under the terms of a Secondary License (if-permitted under the terms of Section 3.3).--2.5. Representation--Each Contributor represents that the Contributor believes its-Contributions are its original creation(s) or it has sufficient rights-to grant the rights to its Contributions conveyed by this License.--2.6. Fair Use--This License is not intended to limit any rights You have under-applicable copyright doctrines of fair use, fair dealing, or other-equivalents.--2.7. Conditions--Sections 3.1, 3.2, 3.3, and 3.4 are conditions of the licenses granted-in Section 2.1.--3. Responsibilities----------------------3.1. Distribution of Source Form--All distribution of Covered Software in Source Code Form, including any-Modifications that You create or to which You contribute, must be under-the terms of this License. You must inform recipients that the Source-Code Form of the Covered Software is governed by the terms of this-License, and how they can obtain a copy of this License. You may not-attempt to alter or restrict the recipients' rights in the Source Code-Form.--3.2. Distribution of Executable Form--If You distribute Covered Software in Executable Form then:--(a) such Covered Software must also be made available in Source Code- Form, as described in Section 3.1, and You must inform recipients of- the Executable Form how they can obtain a copy of such Source Code- Form by reasonable means in a timely manner, at a charge no more- than the cost of distribution to the recipient; and--(b) You may distribute such Executable Form under the terms of this- License, or sublicense it under different terms, provided that the- license for the Executable Form does not attempt to limit or alter- the recipients' rights in the Source Code Form under this License.--3.3. Distribution of a Larger Work--You may create and distribute a Larger Work under terms of Your choice,-provided that You also comply with the requirements of this License for-the Covered Software. If the Larger Work is a combination of Covered-Software with a work governed by one or more Secondary Licenses, and the-Covered Software is not Incompatible With Secondary Licenses, this-License permits You to additionally distribute such Covered Software-under the terms of such Secondary License(s), so that the recipient of-the Larger Work may, at their option, further distribute the Covered-Software under the terms of either this License or such Secondary-License(s).--3.4. Notices--You may not remove or alter the substance of any license notices-(including copyright notices, patent notices, disclaimers of warranty,-or limitations of liability) contained within the Source Code Form of-the Covered Software, except that You may alter any license notices to-the extent required to remedy known factual inaccuracies.--3.5. Application of Additional Terms--You may choose to offer, and to charge a fee for, warranty, support,-indemnity or liability obligations to one or more recipients of Covered-Software. However, You may do so only on Your own behalf, and not on-behalf of any Contributor. You must make it absolutely clear that any-such warranty, support, indemnity, or liability obligation is offered by-You alone, and You hereby agree to indemnify every Contributor for any-liability incurred by such Contributor as a result of warranty, support,-indemnity or liability terms You offer. You may include additional-disclaimers of warranty and limitations of liability specific to any-jurisdiction.--4. Inability to Comply Due to Statute or Regulation------------------------------------------------------If it is impossible for You to comply with any of the terms of this-License with respect to some or all of the Covered Software due to-statute, judicial order, or regulation then You must: (a) comply with-the terms of this License to the maximum extent possible; and (b)-describe the limitations and the code they affect. Such description must-be placed in a text file included with all distributions of the Covered-Software under this License. Except to the extent prohibited by statute-or regulation, such description must be sufficiently detailed for a-recipient of ordinary skill to be able to understand it.--5. Termination-----------------5.1. The rights granted under this License will terminate automatically-if You fail to comply with any of its terms. However, if You become-compliant, then the rights granted under this License from a particular-Contributor are reinstated (a) provisionally, unless and until such-Contributor explicitly and finally terminates Your grants, and (b) on an-ongoing basis, if such Contributor fails to notify You of the-non-compliance by some reasonable means prior to 60 days after You have-come back into compliance. Moreover, Your grants from a particular-Contributor are reinstated on an ongoing basis if such Contributor-notifies You of the non-compliance by some reasonable means, this is the-first time You have received notice of non-compliance with this License-from such Contributor, and You become compliant prior to 30 days after-Your receipt of the notice.--5.2. If You initiate litigation against any entity by asserting a patent-infringement claim (excluding declaratory judgment actions,-counter-claims, and cross-claims) alleging that a Contributor Version-directly or indirectly infringes any patent, then the rights granted to-You by any and all Contributors for the Covered Software under Section-2.1 of this License shall terminate.--5.3. In the event of termination under Sections 5.1 or 5.2 above, all-end user license agreements (excluding distributors and resellers) which-have been validly granted by You or Your distributors under this License-prior to termination shall survive termination.--************************************************************************-* *-* 6. Disclaimer of Warranty *-* ------------------------- *-* *-* Covered Software is provided under this License on an "as is" *-* basis, without warranty of any kind, either expressed, implied, or *-* statutory, including, without limitation, warranties that the *-* Covered Software is free of defects, merchantable, fit for a *-* particular purpose or non-infringing. The entire risk as to the *-* quality and performance of the Covered Software is with You. *-* Should any Covered Software prove defective in any respect, You *-* (not any Contributor) assume the cost of any necessary servicing, *-* repair, or correction. This disclaimer of warranty constitutes an *-* essential part of this License. No use of any Covered Software is *-* authorized under this License except under this disclaimer. *-* *-************************************************************************--************************************************************************-* *-* 7. Limitation of Liability *-* -------------------------- *-* *-* Under no circumstances and under no legal theory, whether tort *-* (including negligence), contract, or otherwise, shall any *-* Contributor, or anyone who distributes Covered Software as *-* permitted above, be liable to You for any direct, indirect, *-* special, incidental, or consequential damages of any character *-* including, without limitation, damages for lost profits, loss of *-* goodwill, work stoppage, computer failure or malfunction, or any *-* and all other commercial damages or losses, even if such party *-* shall have been informed of the possibility of such damages. This *-* limitation of liability shall not apply to liability for death or *-* personal injury resulting from such party's negligence to the *-* extent applicable law prohibits such limitation. Some *-* jurisdictions do not allow the exclusion or limitation of *-* incidental or consequential damages, so this exclusion and *-* limitation may not apply to You. *-* *-************************************************************************--8. Litigation----------------Any litigation relating to this License may be brought only in the-courts of a jurisdiction where the defendant maintains its principal-place of business and such litigation shall be governed by laws of that-jurisdiction, without reference to its conflict-of-law provisions.-Nothing in this Section shall prevent a party's ability to bring-cross-claims or counter-claims.--9. Miscellaneous-------------------This License represents the complete agreement concerning the subject-matter hereof. If any provision of this License is held to be-unenforceable, such provision shall be reformed only to the extent-necessary to make it enforceable. Any law or regulation which provides-that the language of a contract shall be construed against the drafter-shall not be used to construe this License against a Contributor.--10. Versions of the License------------------------------10.1. New Versions--Mozilla Foundation is the license steward. Except as provided in Section-10.3, no one other than the license steward has the right to modify or-publish new versions of this License. Each version will be given a-distinguishing version number.--10.2. Effect of New Versions--You may distribute the Covered Software under the terms of the version-of the License under which You originally received the Covered Software,-or under the terms of any subsequent version published by the license-steward.--10.3. Modified Versions--If you create software not governed by this License, and you want to-create a new license for such software, you may create and use a-modified version of this License if you rename the license and remove-any references to the name of the license steward (except to note that-such modified license differs from this License).--10.4. Distributing Source Code Form that is Incompatible With Secondary-Licenses--If You choose to distribute Source Code Form that is Incompatible With-Secondary Licenses under the terms of this version of the License, the-notice described in Exhibit B of this License must be attached.--Exhibit A - Source Code Form License Notice---------------------------------------------- This Source Code Form is subject to the terms of the Mozilla Public- License, v. 2.0. If a copy of the MPL was not distributed with this- file, You can obtain one at http://mozilla.org/MPL/2.0/.--If it is not possible or desirable to put the notice in a particular-file, then You may include the notice in a location (such as a LICENSE-file in a relevant directory) where a recipient would be likely to look-for such a notice.--You may add additional accurate notices of copyright ownership.--Exhibit B - "Incompatible With Secondary Licenses" Notice------------------------------------------------------------ This Source Code Form is "Incompatible With Secondary Licenses", as- defined by the Mozilla Public License, v. 2.0.diff --git a/scripts/licenses/zlib-1.2.13.LICENSE b/scripts/licenses/zlib-1.2.13.LICENSEdeleted file mode 100644index ab8ee6f..0000000--- a/scripts/licenses/zlib-1.2.13.LICENSE+++ /dev/null@@ -1,22 +0,0 @@-Copyright notice:-- (C) 1995-2022 Jean-loup Gailly and Mark Adler-- This software is provided 'as-is', without any express or implied- warranty. In no event will the authors be held liable for any damages- arising from the use of this software.-- Permission is granted to anyone to use this software for any purpose,- including commercial applications, and to alter it and redistribute it- freely, subject to the following restrictions:-- 1. The origin of this software must not be misrepresented; you must not- claim that you wrote the original software. If you use this software- in a product, an acknowledgment in the product documentation would be- appreciated but is not required.- 2. Altered source versions must be plainly marked as such, and must not be- misrepresented as being the original software.- 3. This notice may not be removed or altered from any source distribution.-- Jean-loup Gailly Mark Adlerdiff --git a/scripts/package-notices.mjs b/scripts/package-notices.mjsindex 529d6c8..027b3ba 100644--- a/scripts/package-notices.mjs+++ b/scripts/package-notices.mjs@@ -71,60 +71,3 @@ export async function bundledNotices(metafile, root) {.map(([, text]) => text).join("\n")}`;}--/** The external runtime's npm archive omits its upstream/component license files. */-export async function pythonRuntimeNotices(version) {- if (version !== "0.25.1")- throw new Error("Review Python runtime notices before upgrading Pyodide");- const sources = [- ["zlib 1.2.13", "zlib-1.2.13.LICENSE", "https://github.com/madler/zlib/tree/v1.2.13"],- ["bzip2 1.0.6", "bzip2-1.0.6.LICENSE", "https://github.com/emscripten-ports/bzip2/tree/1.0.6"],- ["Pyodide 0.25.1", "pyodide-0.25.1.LICENSE", "https://github.com/pyodide/pyodide/tree/0.25.1"],- ["CPython 3.11.3", "cpython-3.11.3.LICENSE", "https://github.com/python/cpython/tree/v3.11.3"],- [- "CPython bundled component notices",- "cpython-3.11.3-license.rst",- "https://github.com/python/cpython/blob/v3.11.3/Doc/license.rst",- ],- [- "Emscripten 3.1.46",- "emscripten-3.1.46.LICENSE",- "https://github.com/emscripten-core/emscripten/tree/3.1.46",- ],- ...["musl", "compiler-rt", "libcxx", "libcxxabi", "libunwind"].map((name) => [- `Emscripten ${name}`,- `emscripten-3.1.46-${name}.LICENSE`,- `https://github.com/emscripten-core/emscripten/tree/3.1.46/system/lib`,- ]),- [- "libffi f08493d",- "libffi-f08493d.LICENSE",- "https://github.com/libffi/libffi/tree/f08493d249d2067c8b3207ba46693dd858f95db3",- ],- [- "hiwire 49f3450",- "hiwire-49f3450.LICENSE",- "https://github.com/hoodmane/hiwire/tree/49f3450e34f3f50d4b8296e782dc321bb2e3264e",- ],- [- "Pyodide npm metadata: Apache-2.0 terms",- "Apache-2.0.txt",- "https://github.com/pyodide/pyodide/blob/0.25.1/src/js/package.json",- ],- ];- return (- "\nExternal Python runtime notices\n\n" +- "Pyodide is installed unmodified as an npm dependency. Its package metadata declares Apache-2.0; " +- "the tagged upstream source is MPL-2.0. This metadata label does not replace the component licenses below. " +- "Corresponding source (including Pyodide's CPython patches and build configuration) is available at the linked versions. " +- "The external base-64 and ws dependencies retain their own installed LICENSE files.\n\n" +- (- await Promise.all(- sources.map(- async ([name, file, source]) =>- `=== ${name} ===\nSource: ${source}\n${await readFile(new URL(`./licenses/${file}`, import.meta.url), "utf8")}\n`,- ),- )- ).join("\n")- );-}diff --git a/scripts/parser-assets.mjs b/scripts/parser-assets.mjsnew file mode 100644index 0000000..4a4a62a--- /dev/null+++ b/scripts/parser-assets.mjs@@ -0,0 +1,23 @@+import { createRequire } from "node:module";+import { readFile, mkdir, cp } from "node:fs/promises";+import { dirname, join, resolve } from "node:path";+import { fileURLToPath } from "node:url";+export async function grammarAssets(+ root = fileURLToPath(new URL("../", import.meta.url)),+ copy = false,+) {+ const require = createRequire(join(root, "packages/core/package.json"));+ const core = JSON.parse(await readFile(join(root, "packages/core/package.json"), "utf8"));+ const destination = join(root, "packages/core/assets/tree-sitter");+ if (copy) await mkdir(destination, { recursive: true });+ const name = "tree-sitter-python",+ directory = dirname(require.resolve(`${name}/package.json`));+ const metadata = JSON.parse(await readFile(join(directory, "package.json"), "utf8"));+ if (metadata.version !== core.devDependencies[name])+ throw new Error(`Grammar version differs from manifest: ${name}`);+ if (copy) await cp(join(directory, `${name}.wasm`), join(destination, `${name}.wasm`));+ return `\nBundled Tree-sitter grammar notices\n\n=== ${name}@${metadata.version} (${metadata.license}) ===\nSource: https://github.com/tree-sitter/${name}\n${await readFile(join(directory, "LICENSE"), "utf8")}\n`;+}++if (process.argv[1] && resolve(process.argv[1]) === fileURLToPath(import.meta.url))+ await grammarAssets(undefined, true);diff --git a/scripts/validate-release.mjs b/scripts/validate-release.mjsindex 6d0f3a6..c1bccd4 100644--- a/scripts/validate-release.mjs+++ b/scripts/validate-release.mjs@@ -4,7 +4,7 @@ import { readFile, stat } from "node:fs/promises";import { resolve } from "node:path";import { fileURLToPath } from "node:url";import { promisify } from "node:util";-import { pythonRuntimeNotices } from "./package-notices.mjs";+import { grammarAssets } from "./parser-assets.mjs";const execute = promisify(execFile);export const repository = fileURLToPath(new URL("../", import.meta.url));@@ -30,7 +30,7 @@ export function releaseIdentity(metadata, tag) {for (const [name, version] of Object.entries(metadata.dependencies ?? {}))if (!/^\d+\.\d+\.\d+(?:-[\w.-]+)?$/.test(version))throw new Error(`Runtime dependency ${name} must use an exact registry version`);- for (const name of ["typescript", "pyodide"])+ for (const name of ["typescript", "web-tree-sitter"])if (!metadata.dependencies?.[name])throw new Error(`Missing runtime parser dependency ${name}`);return { name: metadata.name, version, distTag: match[4] ? "next" : "latest" };@@ -48,7 +48,7 @@ export async function validateRelease(tarball, tag, root = repository) {if (new Set(files).size !== files.length) throw new Error("Duplicate archive entries");for (const path of files)if (- !/^package\/(?:package\.json|README(?:\.md)?|LICENSE|dist\/(?:bin\/(?:index\.js|python-worker\.mjs)|assets\/(?:python\/(?:inspect|preview|neighborhood|calls)\.py|README\.md)|skills\/jevgrep\/SKILL\.md|LICENSE|THIRD_PARTY_NOTICES\.txt))$/.test(+ !/^package\/(?:package\.json|README(?:\.md)?|LICENSE|dist\/(?:bin\/(?:index\.js|parser-(?:worker|helpers|preview)\.mjs)|assets\/(?:tree-sitter\/tree-sitter-python\.wasm|README\.md)|skills\/jevgrep\/SKILL\.md|LICENSE|THIRD_PARTY_NOTICES\.txt))$/.test(path,))@@ -76,11 +76,14 @@ export async function validateRelease(tarball, tag, root = repository) {for (const [packed, original] of [["dist/LICENSE", "LICENSE"],["dist/skills/jevgrep/SKILL.md", "skills/jevgrep/SKILL.md"],- ["dist/bin/python-worker.mjs", "packages/core/src/python-worker.mjs"],- ...["inspect", "preview", "neighborhood", "calls"].map((name) => [- `dist/assets/python/${name}.py`,- `packages/core/assets/python/${name}.py`,+ ...["parser-worker", "parser-helpers", "parser-preview"].map((name) => [+ `dist/bin/${name}.mjs`,+ `packages/core/src/${name}.mjs`,]),+ [+ "dist/assets/tree-sitter/tree-sitter-python.wasm",+ "packages/core/assets/tree-sitter/tree-sitter-python.wasm",+ ],])if (!(await extract(packed)).equals(await readFile(resolve(root, original))))throw new Error(`Packaged ${packed} differs from its canonical source`);@@ -88,7 +91,7 @@ export async function validateRelease(tarball, tag, root = repository) {if (!notices.startsWith("Third-party notices for bundled JavaScript dependencies\n") ||!notices.includes("=== ") ||- !notices.endsWith(await pythonRuntimeNotices(metadata.dependencies.pyodide))+ !notices.endsWith(await grammarAssets(root)))throw new Error("Missing bundled dependency license notices");const integrity = `sha512-${createHash("sha512")diff --git a/specs/tree-sitter/RESULTS.md b/specs/tree-sitter/RESULTS.mdnew file mode 100644index 0000000..247aae4--- /dev/null+++ b/specs/tree-sitter/RESULTS.md@@ -0,0 +1,63 @@+# Tree-sitter replacement results++Performance Improvement++Fixed baseline: upstream `2dc1d3c`. Five fresh processes per arm/workload,+interleaved before/after in Docker (Linux/amd64, Node 22, two CPUs, 2 GiB,+network disabled). Each process measures the first production `inspect()` call+and ten subsequent calls on new snapshots. No provider calls were made.++Cold time includes importing the source module and starting the parser worker;+it excludes container/Node process launch. Warm time is the median of ten calls,+then the median across five processes. These are local inspection measurements,+not end-to-end search latency. Output SHA-256 hashes match between arms for every+fixture. The source files contain Unicode comments and function bodies.++| Language | Declarations | Cold before → after (ms) | Cold reduction | Warm before → after (ms) | Warm change |+|---|---:|---:|---:|---:|---:|+| python | 100 | 2809.2 → 541.3 | 80.7% | 7.98 → 6.94 | -13.0% |+| python | 1,500 | 2403.2 → 740.6 | 69.2% | 89.55 → 81.93 | -8.5% |+| typescript | 100 | 463.6 → 470.8 | -1.6% | 7.42 → 7.56 | +1.9% |+| typescript | 1,500 | 637.8 → 652.5 | -2.3% | 32.10 → 36.73 | +14.4% |++Negative warm change means faster. TypeScript is unchanged and is included as a+noise/control workload; its fluctuations are not attributed to Tree-sitter.+The supported performance claim is lower cold Python inspection latency.+Earlier cohorts included warm regressions, and the unchanged TypeScript control+also fluctuates. Treat warm differences as noisy, not a general speedup.++| Python declarations | Worker RSS before → after (MiB) |+|---|---:|+| 100 | 150.0 → 71.0 |+| 1,500 | 176.9 → 101.8 |++Worker RSS is a Linux `/proc` snapshot after the repeated inspections, not peak+whole-search memory. Parent peak RSS is retained in the raw data separately.++## Reproduction and evidence++Create a separate clean checkout at `2dc1d3c`, then from this branch run:++```sh+python3 test/parser/run-tree-sitter-bench.py /path/to/baseline > specs/tree-sitter/assets/confirmation.jsonl+python3 specs/tree-sitter/summarize.py+```++The runner builds both actual source images and records image identities and+candidate source hashes. Both use exactly the same benchmark script. It rejects+output mismatches and unsupported benchmark language labels.++[Final raw data](assets/confirmation.jsonl),+[initial cohort](assets/development.jsonl), and+[query-development confirmation](assets/query-confirmation.jsonl), and+[pre-review confirmation](assets/pre-review-confirmation.jsonl) retain all+recorded trials. The initial implementation improved startup but regressed warm+inspection; syntax-node filtering was revised before final confirmation.+See [review disposition](REVIEW.md) and [validation](VALIDATION.md).++These measurements precede the final Python-only scope and call-context fixes.+[Final validation](VALIDATION.md) records the integrated candidate separately.++Limits of this cohort: synthetic inspection fixtures; no paid/live-provider evaluation, macOS,+ARM, full repository search-latency benchmark, or integration with the separate+unsubmitted calibration/parsed-reuse branches. This cohort is historical evidence rather than a timing guarantee for the final merge.diff --git a/specs/tree-sitter/REVIEW.md b/specs/tree-sitter/REVIEW.mdnew file mode 100644index 0000000..4e3df4e--- /dev/null+++ b/specs/tree-sitter/REVIEW.md@@ -0,0 +1,24 @@+# Review decisions++Tree-sitter replaces the embedded Python interpreter while retaining the+Python retrieval contract. New language support is outside this change;+Go and Rust continue through the existing text fallback.++The worker owns initialization and cancellation, syntax analysis owns source+ranges and reading leads, and preview rendering owns byte budgets. No parser+cache or parallel worker pool is introduced.++The closeout review found two call-context regressions: concrete syntax retains+parentheses that CPython's AST removes, and a multiline call must be associated+with the range containing its opening line. Both now have regression tests that+failed before the fix. Parenthesis handling is shared across the syntax consumers. Comments are+excluded from expression children, base classes, and concatenated-string checks;+regressions cover commented receivers, byte strings, and docstrings. Valid+parenthesized deletion targets use the same expression handling.++Registry verification must prepare canonical grammar assets from locked packages+before validating the downloaded archive. The release workflow owns that setup.++The test-only CPython helpers remain differential oracles, not runtime dependencies.+[Parser contracts](../../test/parser/README.md) document the deliberate compatibility+limits; [validation](VALIDATION.md) records the final checks.diff --git a/specs/tree-sitter/VALIDATION.md b/specs/tree-sitter/VALIDATION.mdnew file mode 100644index 0000000..8ddba49--- /dev/null+++ b/specs/tree-sitter/VALIDATION.md@@ -0,0 +1,43 @@+# Verification++The release gate is `bun run verify`: source tests, provider-protocol tests,+parser differential tests, evaluation-harness tests, and installed Node-only+journeys run alongside type and lint checks. Provider requests use local fixtures.+No paid-provider or coding-agent task-quality claim follows from these checks.++`node scripts/test-native.mjs` exercises a fresh npm installation on Apple Silicon+with only Node on its runtime PATH. It complements Linux Docker verification;+neither environment silently supplies a Python executable or native compiler.++Archive validation must also run from a clean checkout after locked dependency+installation and grammar preparation, matching the registry-verification job.+Without preparation, canonical grammar comparison must fail; with preparation,+the archive identity, bytes, notices, and integrity must match.++The frozen Python helpers are differential oracles. Real-source comparisons must+distinguish retrieval regressions from documented syntax-version and class-header+boundaries in the [parser contracts](../../test/parser/README.md). Golden fixtures+cover each corrected regression and must fail when its fix is removed.++## Recorded closeout — 2026-09-29++Integrated with main `6e9bc588`. `bun run verify` passed: 204 source checks+(119 Bun, 18 provider protocol, 33 parser, four release, 30 evaluation-harness)+and 40 installed-package journeys. Typechecks passed; lint reported only the+existing filesystem control-regex warning. Native smoke passed all ten journeys+on darwin/arm64 with Node 24.14.0; Docker uses Node 22.++The native-installed archive and canonical archive validation shared SHA-256+`3309d67d7ae8d5a9ca824eaf7d1d5a0c2193df6422998d18cd8f34d61c2cff38`.+Clean-checkout grammar preparation was verified with a failing missing-asset+control and a successful canonical-byte, notice, and integrity comparison.++A 155-module Python 3.14 standard-library probe compared all four helpers+(620 comparisons). Differences were the documented decorator header and+Python 3.14 unparenthesized exception tuples: the prior embedded Python 3.11+runtime also rejects that newer syntax. Neighbourhood comparisons disregard+ordering, as their consumer does. Go/Rust text fallback matched main on small+and split Unicode fixtures. These probes do not establish task-quality gains.++Independent review findings were reproduced, fixed, and covered by tests that+failed without the fixes. The [review decisions](REVIEW.md) explain their scope.diff --git a/specs/tree-sitter/assets/confirmation.jsonl b/specs/tree-sitter/assets/confirmation.jsonlnew file mode 100644index 0000000..91849b3--- /dev/null+++ b/specs/tree-sitter/assets/confirmation.jsonl@@ -0,0 +1,41 @@+{"metadata": {"baseline": "2dc1d3c9c9fec236913d97d7288ee6d24ba17baa", "images": {"before": "sha256:b85bb6033599b5b771b24c368f79517b711a4442fc5fac40a69a0631e1a957fe", "after": "sha256:cca2a8e492f02e7e9358571606c8534d9209a0bc89fef3b4b7f8c0ffbd9796e6"}, "sourceSHA256": {"packages/core/src/cache.ts": "3cdf1a535a3a22c9dc2ca7a33f1a86d4d86dbe955ad6fd2b2dc90efc5d9bdda8", "packages/core/src/call-context.ts": "5572493c80fd0dee7c294d2348bfbb0006f70af8b8cf1417eea07d1076094684", "packages/core/src/evaluator.ts": "4ce63bd2095789c05398c4b7d4de4fa89276d5bc9e8f7a6250418e8852ae5f87", "packages/core/src/filesystem.ts": "6856834de140db4941d73a01c154da213a90352b43e9e9b13902ade58401b948", "packages/core/src/index.ts": "138347e588eeede4477b7e40c3cdfc8583e39ce783a4846419606adc6109a04f", "packages/core/src/parser-helpers.mjs": "034eeac78d98c37b59b2f8663756f8327fac601133a20905556026a29081529d", "packages/core/src/parser-preview.mjs": "165f08fe1fecc877db045d0624a2f4a150541ca26c27150aa213f25674761e73", "packages/core/src/parser-worker.mjs": "95ec7ad277693afc91273e37304dad7cd7d6a62c284cbc124bd2458f23b8478a", "packages/core/src/parser.ts": "22dec6279ca06612fe4a41b0f52c3ae278205b54f1f93756fd966987b7412dd3", "packages/core/src/providers.ts": "609399bb43c52d2fe4353a437e379703eba2741e3a423035f39dc9c731fb23fe", "packages/core/src/repository-context.ts": "3466b6b8ff977c32537c98b170552f998efa5e4c8a66fa6743f1e9493fffae5e", "packages/core/src/requests.ts": "a73e689843b5f9caac04b8e3dca04d3fb22efb5d3967f111c9da05f6cde7defa", "packages/core/src/retrieve.ts": "6e35d76b1ae9379172edb476c6034c5596b00ef054203dbfda974269d605482e", "packages/core/src/selection.ts": "1d700c18ba76c7c980e845fe3db0f1caee411c008d56ee88efab77ae36f6abd3", "packages/core/src/source.ts": "3d7b820dac964a903c3d6a7e7205e4353b51b301d5b78dab4139276364be112f", "packages/core/src/test-body-selection.ts": "3b6d7667ac4191075fc9cf0ebf04a02bad20cff790786bf6291881378e0b44c9", "packages/core/src/types.ts": "d3dd0e56ced81b66182739d900dc9ba9b47b0d62d476bda26ff48ae2da61c8ba"}, "node": "22 (image)", "cpus": 2, "memory": "2g"}}+{"arm": "before", "trial": 0, "language": "python", "count": 100, "sourceBytes": 7079, "importMs": 541.735887, "firstInspectMs": 2309.332879, "coldTotalMs": 2851.068766, "warmMs": [7.771933999999874, 13.037162999999964, 10.704901999999947, 11.132995999999821, 4.767253999999866, 8.464948000000277, 8.443373999999949, 10.526699999999892, 10.695165999999972, 7.323385000000144], "outputHash": "d60eb4dcc07256979253ba72b530788056b0a1b609a8e8958f1b69d9ba4354c7", "parentMaxRSSKiB": 136048, "workerRSSKiB": 146340}+{"arm": "after", "trial": 0, "language": "python", "count": 100, "sourceBytes": 7079, "importMs": 561.305419, "firstInspectMs": 183.49066500000004, "coldTotalMs": 744.7960840000001, "warmMs": [41.46662300000003, 10.46959000000004, 10.346587999999997, 8.851466999999957, 10.170904999999948, 8.91199000000006, 9.223190000000045, 7.978648000000021, 24.89012200000002, 7.4806930000000875], "outputHash": "d60eb4dcc07256979253ba72b530788056b0a1b609a8e8958f1b69d9ba4354c7", "parentMaxRSSKiB": 135936, "workerRSSKiB": 68924}+{"arm": "before", "trial": 1, "language": "python", "count": 100, "sourceBytes": 7079, "importMs": 536.2303899999999, "firstInspectMs": 2336.127883, "coldTotalMs": 2872.358273, "warmMs": [11.974529000000075, 10.16115899999977, 7.93429900000001, 12.100294999999733, 7.774854000000232, 9.055961999999909, 11.886265000000094, 10.964723999999933, 8.469968999999764, 7.437065999999959], "outputHash": "d60eb4dcc07256979253ba72b530788056b0a1b609a8e8958f1b69d9ba4354c7", "parentMaxRSSKiB": 136020, "workerRSSKiB": 153744}+{"arm": "after", "trial": 1, "language": "python", "count": 100, "sourceBytes": 7079, "importMs": 609.399313, "firstInspectMs": 148.03672700000004, "coldTotalMs": 757.43604, "warmMs": [26.322653999999943, 10.058628999999996, 11.32145300000002, 40.73634700000002, 10.08961499999998, 10.100942999999916, 10.61582199999998, 9.608179999999948, 7.940784000000008, 8.63272100000006], "outputHash": "d60eb4dcc07256979253ba72b530788056b0a1b609a8e8958f1b69d9ba4354c7", "parentMaxRSSKiB": 133268, "workerRSSKiB": 78124}+{"arm": "before", "trial": 2, "language": "python", "count": 100, "sourceBytes": 7079, "importMs": 537.2473540000001, "firstInspectMs": 2271.9724770000003, "coldTotalMs": 2809.219831, "warmMs": [9.074313000000075, 9.489493000000039, 8.221624999999676, 12.63352500000019, 7.700284999999894, 7.595740000000205, 6.144358999999895, 9.966014000000087, 7.607633999999962, 7.386709999999766], "outputHash": "d60eb4dcc07256979253ba72b530788056b0a1b609a8e8958f1b69d9ba4354c7", "parentMaxRSSKiB": 133332, "workerRSSKiB": 152188}+{"arm": "after", "trial": 2, "language": "python", "count": 100, "sourceBytes": 7079, "importMs": 445.523183, "firstInspectMs": 95.80813400000005, "coldTotalMs": 541.331317, "warmMs": [56.53608699999995, 6.737080999999989, 7.350305999999932, 6.638515999999981, 7.8042239999999765, 5.250564000000054, 7.362329000000045, 6.465353999999934, 5.225233000000003, 5.797478999999953], "outputHash": "d60eb4dcc07256979253ba72b530788056b0a1b609a8e8958f1b69d9ba4354c7", "parentMaxRSSKiB": 134900, "workerRSSKiB": 69492}+{"arm": "before", "trial": 3, "language": "python", "count": 100, "sourceBytes": 7079, "importMs": 600.261341, "firstInspectMs": 2028.037989, "coldTotalMs": 2628.29933, "warmMs": [7.697696000000178, 9.969406999999592, 8.086252999999942, 12.815160000000105, 8.185005000000274, 5.605204999999842, 7.868388999999752, 14.326649999999972, 7.701954999999998, 7.568713000000116], "outputHash": "d60eb4dcc07256979253ba72b530788056b0a1b609a8e8958f1b69d9ba4354c7", "parentMaxRSSKiB": 135352, "workerRSSKiB": 154068}+{"arm": "after", "trial": 3, "language": "python", "count": 100, "sourceBytes": 7079, "importMs": 427.415618, "firstInspectMs": 96.13362000000001, "coldTotalMs": 523.549238, "warmMs": [14.457730999999967, 6.803173000000015, 6.91932799999995, 7.183129000000008, 5.430343000000107, 5.092776000000072, 41.29861200000005, 5.487931000000003, 5.376915999999937, 5.129868999999985], "outputHash": "d60eb4dcc07256979253ba72b530788056b0a1b609a8e8958f1b69d9ba4354c7", "parentMaxRSSKiB": 134016, "workerRSSKiB": 72860}+{"arm": "before", "trial": 4, "language": "python", "count": 100, "sourceBytes": 7079, "importMs": 454.305341, "firstInspectMs": 1696.889885, "coldTotalMs": 2151.1952260000003, "warmMs": [7.214327000000139, 9.712664000000132, 10.469027000000096, 10.081881000000067, 7.71806400000014, 6.999339999999847, 5.195193999999901, 6.968323999999939, 4.936670999999933, 4.814764000000196], "outputHash": "d60eb4dcc07256979253ba72b530788056b0a1b609a8e8958f1b69d9ba4354c7", "parentMaxRSSKiB": 134252, "workerRSSKiB": 153584}+{"arm": "after", "trial": 4, "language": "python", "count": 100, "sourceBytes": 7079, "importMs": 427.535425, "firstInspectMs": 89.32107500000001, "coldTotalMs": 516.8565, "warmMs": [37.87699799999996, 9.222302999999897, 6.857347000000004, 7.2858099999999695, 7.023392999999942, 7.109586000000036, 5.545015000000035, 5.2428409999999985, 5.974026000000094, 5.205877999999984], "outputHash": "d60eb4dcc07256979253ba72b530788056b0a1b609a8e8958f1b69d9ba4354c7", "parentMaxRSSKiB": 135616, "workerRSSKiB": 72700}+{"arm": "before", "trial": 0, "language": "python", "count": 1500, "sourceBytes": 110279, "importMs": 434.499376, "firstInspectMs": 1797.742443, "coldTotalMs": 2232.241819, "warmMs": [124.91131799999994, 69.86353000000008, 66.63270300000022, 108.08618799999977, 65.54460999999992, 122.29859899999974, 68.63927899999999, 79.45778199999995, 122.58939899999996, 88.52102000000014], "outputHash": "c044306aed312c9472b0205d1915ed3865055822a03ac36a0f1a5c492c98589b", "parentMaxRSSKiB": 148736, "workerRSSKiB": 187968}+{"arm": "after", "trial": 0, "language": "python", "count": 1500, "sourceBytes": 110279, "importMs": 438.064814, "firstInspectMs": 241.238182, "coldTotalMs": 679.302996, "warmMs": [119.873921, 87.90874500000007, 70.46267599999999, 62.53229800000008, 63.83277999999996, 98.1655209999999, 82.03042400000004, 66.72332299999994, 100.82361199999991, 81.43462900000009], "outputHash": "c044306aed312c9472b0205d1915ed3865055822a03ac36a0f1a5c492c98589b", "parentMaxRSSKiB": 148480, "workerRSSKiB": 104284}+{"arm": "before", "trial": 1, "language": "python", "count": 1500, "sourceBytes": 110279, "importMs": 555.0403490000001, "firstInspectMs": 2484.1736579999997, "coldTotalMs": 3039.214007, "warmMs": [144.05575499999986, 97.39944999999989, 113.98392699999977, 146.26585399999976, 78.71342500000037, 162.68702299999995, 100.51494899999989, 103.19739100000015, 122.89247999999952, 101.40000599999985], "outputHash": "c044306aed312c9472b0205d1915ed3865055822a03ac36a0f1a5c492c98589b", "parentMaxRSSKiB": 148760, "workerRSSKiB": 176524}+{"arm": "after", "trial": 1, "language": "python", "count": 1500, "sourceBytes": 110279, "importMs": 476.029499, "firstInspectMs": 277.640435, "coldTotalMs": 753.669934, "warmMs": [95.88559199999997, 110.95327300000008, 101.81844499999988, 101.60971399999994, 107.03734199999985, 87.7460860000001, 86.6583290000001, 101.70619699999997, 100.68330500000002, 98.25375899999995], "outputHash": "c044306aed312c9472b0205d1915ed3865055822a03ac36a0f1a5c492c98589b", "parentMaxRSSKiB": 151888, "workerRSSKiB": 99152}+{"arm": "before", "trial": 2, "language": "python", "count": 1500, "sourceBytes": 110279, "importMs": 431.262332, "firstInspectMs": 1842.7801100000001, "coldTotalMs": 2274.0424420000004, "warmMs": [112.95002199999999, 65.53374299999996, 104.89401300000009, 154.60737400000016, 100.87569500000018, 157.4653919999996, 98.06102499999997, 60.02043700000013, 116.39700300000004, 69.40543699999989], "outputHash": "c044306aed312c9472b0205d1915ed3865055822a03ac36a0f1a5c492c98589b", "parentMaxRSSKiB": 151904, "workerRSSKiB": 191760}+{"arm": "after", "trial": 2, "language": "python", "count": 1500, "sourceBytes": 110279, "importMs": 475.963565, "firstInspectMs": 264.6740729999999, "coldTotalMs": 740.6376379999999, "warmMs": [90.047143, 83.583216, 68.36199800000009, 65.72170799999992, 64.6456189999999, 62.37502500000005, 64.37409900000011, 64.93609399999991, 65.06348900000012, 62.23886700000003], "outputHash": "c044306aed312c9472b0205d1915ed3865055822a03ac36a0f1a5c492c98589b", "parentMaxRSSKiB": 149408, "workerRSSKiB": 107844}+{"arm": "before", "trial": 3, "language": "python", "count": 1500, "sourceBytes": 110279, "importMs": 442.56160700000004, "firstInspectMs": 1960.6266749999998, "coldTotalMs": 2403.1882819999996, "warmMs": [102.33988099999988, 64.98160999999982, 82.96292600000015, 120.38214700000026, 60.56713600000012, 111.69409200000018, 69.96754500000043, 62.627504000000044, 97.70629699999972, 65.35463499999969], "outputHash": "c044306aed312c9472b0205d1915ed3865055822a03ac36a0f1a5c492c98589b", "parentMaxRSSKiB": 149272, "workerRSSKiB": 171916}+{"arm": "after", "trial": 3, "language": "python", "count": 1500, "sourceBytes": 110279, "importMs": 524.137032, "firstInspectMs": 311.157566, "coldTotalMs": 835.294598, "warmMs": [118.09741200000008, 110.66816799999992, 65.66709999999989, 69.13180499999999, 98.163137, 82.15735500000005, 81.71155700000008, 85.38565500000004, 75.14527499999986, 73.02680700000019], "outputHash": "c044306aed312c9472b0205d1915ed3865055822a03ac36a0f1a5c492c98589b", "parentMaxRSSKiB": 148868, "workerRSSKiB": 102536}+{"arm": "before", "trial": 4, "language": "python", "count": 1500, "sourceBytes": 110279, "importMs": 577.852036, "firstInspectMs": 2441.159651, "coldTotalMs": 3019.011687, "warmMs": [122.95717800000011, 74.40170100000023, 76.45833099999982, 159.42799999999988, 100.26967999999988, 117.50766199999998, 65.1438549999998, 78.83648700000003, 106.18632699999989, 66.38996099999986], "outputHash": "c044306aed312c9472b0205d1915ed3865055822a03ac36a0f1a5c492c98589b", "parentMaxRSSKiB": 149340, "workerRSSKiB": 181164}+{"arm": "after", "trial": 4, "language": "python", "count": 1500, "sourceBytes": 110279, "importMs": 426.339714, "firstInspectMs": 246.77912299999997, "coldTotalMs": 673.118837, "warmMs": [93.254816, 110.0385829999999, 104.41859699999998, 101.07652100000007, 102.45451800000001, 98.83502799999997, 99.77101100000004, 100.52450599999997, 99.76996499999996, 98.71494699999994], "outputHash": "c044306aed312c9472b0205d1915ed3865055822a03ac36a0f1a5c492c98589b", "parentMaxRSSKiB": 148756, "workerRSSKiB": 105996}+{"arm": "before", "trial": 0, "language": "typescript", "count": 100, "sourceBytes": 8979, "importMs": 441.915918, "firstInspectMs": 24.21170900000004, "coldTotalMs": 466.127627, "warmMs": [14.379061999999976, 12.385100999999963, 9.360066999999958, 8.250054999999975, 6.596735000000081, 5.299074000000019, 5.636180000000081, 5.88717100000008, 15.493170000000077, 6.405607000000032], "outputHash": "f95f65599da0d758fa702b41aab26262ed270e156330686e91bd4b344cb3f329", "parentMaxRSSKiB": 139644, "workerRSSKiB": null}+{"arm": "after", "trial": 0, "language": "typescript", "count": 100, "sourceBytes": 8979, "importMs": 440.772079, "firstInspectMs": 24.60957300000001, "coldTotalMs": 465.38165200000003, "warmMs": [12.30007599999999, 8.713719999999967, 8.127646000000027, 7.374809999999911, 7.637442000000078, 5.567433000000051, 7.5367330000000265, 6.302308000000039, 5.172598000000107, 7.593160000000012], "outputHash": "f95f65599da0d758fa702b41aab26262ed270e156330686e91bd4b344cb3f329", "parentMaxRSSKiB": 139388, "workerRSSKiB": null}+{"arm": "before", "trial": 1, "language": "typescript", "count": 100, "sourceBytes": 8979, "importMs": 420.459186, "firstInspectMs": 27.576002000000017, "coldTotalMs": 448.035188, "warmMs": [16.30616100000003, 10.554136000000028, 8.917950000000019, 7.3913709999999355, 6.688580999999999, 6.580932999999959, 6.679179999999974, 6.507051999999931, 5.335872999999992, 7.5145840000000135], "outputHash": "f95f65599da0d758fa702b41aab26262ed270e156330686e91bd4b344cb3f329", "parentMaxRSSKiB": 138832, "workerRSSKiB": null}+{"arm": "after", "trial": 1, "language": "typescript", "count": 100, "sourceBytes": 8979, "importMs": 451.346835, "firstInspectMs": 24.474380999999994, "coldTotalMs": 475.821216, "warmMs": [13.162840999999958, 10.13726500000007, 8.749068999999963, 9.370672000000013, 6.6976660000000265, 5.446717000000035, 6.140076000000022, 11.033437000000049, 5.139129000000025, 8.648213000000055], "outputHash": "f95f65599da0d758fa702b41aab26262ed270e156330686e91bd4b344cb3f329", "parentMaxRSSKiB": 139264, "workerRSSKiB": null}+{"arm": "before", "trial": 2, "language": "typescript", "count": 100, "sourceBytes": 8979, "importMs": 474.79155099999997, "firstInspectMs": 23.166491000000008, "coldTotalMs": 497.958042, "warmMs": [16.962128000000007, 10.407879999999977, 8.501396999999997, 9.146209999999996, 6.380386999999928, 5.465433999999959, 9.088243000000034, 16.33620099999996, 5.362435000000005, 7.839017000000013], "outputHash": "f95f65599da0d758fa702b41aab26262ed270e156330686e91bd4b344cb3f329", "parentMaxRSSKiB": 139208, "workerRSSKiB": null}+{"arm": "after", "trial": 2, "language": "typescript", "count": 100, "sourceBytes": 8979, "importMs": 430.096348, "firstInspectMs": 24.516008, "coldTotalMs": 454.612356, "warmMs": [13.25251000000003, 10.332987000000003, 8.72436700000003, 9.177881999999954, 6.406908999999928, 5.400794000000019, 6.178762000000006, 6.721340000000055, 5.22643400000004, 7.449211999999989], "outputHash": "f95f65599da0d758fa702b41aab26262ed270e156330686e91bd4b344cb3f329", "parentMaxRSSKiB": 138884, "workerRSSKiB": null}+{"arm": "before", "trial": 3, "language": "typescript", "count": 100, "sourceBytes": 8979, "importMs": 415.740984, "firstInspectMs": 25.28757200000001, "coldTotalMs": 441.028556, "warmMs": [12.774932999999976, 9.91844900000001, 8.49300199999999, 7.300116000000003, 6.556880000000035, 5.834626000000071, 7.766868999999929, 6.113801999999964, 24.964345999999978, 9.794525000000021], "outputHash": "f95f65599da0d758fa702b41aab26262ed270e156330686e91bd4b344cb3f329", "parentMaxRSSKiB": 139928, "workerRSSKiB": null}+{"arm": "after", "trial": 3, "language": "typescript", "count": 100, "sourceBytes": 8979, "importMs": 445.643403, "firstInspectMs": 25.18651, "coldTotalMs": 470.829913, "warmMs": [15.478928999999994, 13.205462000000011, 10.194331000000034, 10.674979000000008, 8.604948000000036, 8.425470000000018, 8.884387999999944, 8.331780999999978, 8.187875000000076, 8.375436000000036], "outputHash": "f95f65599da0d758fa702b41aab26262ed270e156330686e91bd4b344cb3f329", "parentMaxRSSKiB": 139852, "workerRSSKiB": null}+{"arm": "before", "trial": 4, "language": "typescript", "count": 100, "sourceBytes": 8979, "importMs": 439.599835, "firstInspectMs": 24.02831500000002, "coldTotalMs": 463.62815, "warmMs": [12.739448000000039, 10.885822000000019, 7.034811999999988, 7.966315000000009, 6.412772000000018, 6.078972000000022, 6.69068500000003, 6.534760000000006, 5.379343999999946, 7.512250999999992], "outputHash": "f95f65599da0d758fa702b41aab26262ed270e156330686e91bd4b344cb3f329", "parentMaxRSSKiB": 137928, "workerRSSKiB": null}+{"arm": "after", "trial": 4, "language": "typescript", "count": 100, "sourceBytes": 8979, "importMs": 446.957654, "firstInspectMs": 26.20523800000001, "coldTotalMs": 473.162892, "warmMs": [16.049314000000038, 10.264032999999927, 7.645506999999952, 8.34021800000005, 7.670182000000068, 5.84190000000001, 6.663258000000042, 6.506140999999957, 6.170557000000031, 5.666289000000006], "outputHash": "f95f65599da0d758fa702b41aab26262ed270e156330686e91bd4b344cb3f329", "parentMaxRSSKiB": 138800, "workerRSSKiB": null}+{"arm": "before", "trial": 0, "language": "typescript", "count": 1500, "sourceBytes": 138779, "importMs": 469.44835, "firstInspectMs": 168.30451700000003, "coldTotalMs": 637.752867, "warmMs": [107.215959, 47.94658700000002, 60.738312000000064, 21.748788999999988, 24.01250799999991, 26.330556, 21.83386699999994, 23.799938999999995, 23.31138899999985, 30.405277999999953], "outputHash": "9f622b94732b835cff58c3ba2f849aa3304270fa1bb4b11e9a5e41cb1e141e80", "parentMaxRSSKiB": 182784, "workerRSSKiB": null}+{"arm": "after", "trial": 0, "language": "typescript", "count": 1500, "sourceBytes": 138779, "importMs": 444.902691, "firstInspectMs": 179.75112899999993, "coldTotalMs": 624.65382, "warmMs": [105.21987999999999, 85.38607100000002, 31.998380999999995, 30.742222999999967, 34.31167199999993, 36.931331, 34.325485999999955, 48.73585800000001, 48.15307400000006, 36.531236000000035], "outputHash": "9f622b94732b835cff58c3ba2f849aa3304270fa1bb4b11e9a5e41cb1e141e80", "parentMaxRSSKiB": 180220, "workerRSSKiB": null}+{"arm": "before", "trial": 1, "language": "typescript", "count": 1500, "sourceBytes": 138779, "importMs": 597.295974, "firstInspectMs": 190.67651, "coldTotalMs": 787.972484, "warmMs": [107.87269299999991, 77.62487600000009, 35.20896900000014, 22.837244000000055, 29.3918799999999, 33.13247300000012, 45.16185599999994, 31.061561999999867, 23.397178999999824, 23.002168999999867], "outputHash": "9f622b94732b835cff58c3ba2f849aa3304270fa1bb4b11e9a5e41cb1e141e80", "parentMaxRSSKiB": 180376, "workerRSSKiB": null}+{"arm": "after", "trial": 1, "language": "typescript", "count": 1500, "sourceBytes": 138779, "importMs": 582.876831, "firstInspectMs": 177.90086199999996, "coldTotalMs": 760.777693, "warmMs": [111.78710799999999, 80.24555599999997, 66.18696499999987, 31.77638900000011, 38.091240999999854, 38.468832999999904, 21.817197999999962, 21.918537000000015, 34.65738600000009, 24.853935999999976], "outputHash": "9f622b94732b835cff58c3ba2f849aa3304270fa1bb4b11e9a5e41cb1e141e80", "parentMaxRSSKiB": 180828, "workerRSSKiB": null}+{"arm": "before", "trial": 2, "language": "typescript", "count": 1500, "sourceBytes": 138779, "importMs": 459.25446300000004, "firstInspectMs": 185.42485099999993, "coldTotalMs": 644.679314, "warmMs": [109.69081299999993, 63.22346500000003, 61.11840899999993, 36.547055, 37.45199200000002, 27.26708599999995, 21.167251999999962, 21.177048000000013, 24.4663129999999, 35.33589600000005], "outputHash": "9f622b94732b835cff58c3ba2f849aa3304270fa1bb4b11e9a5e41cb1e141e80", "parentMaxRSSKiB": 183400, "workerRSSKiB": null}+{"arm": "after", "trial": 2, "language": "typescript", "count": 1500, "sourceBytes": 138779, "importMs": 475.535851, "firstInspectMs": 177.00452300000006, "coldTotalMs": 652.540374, "warmMs": [122.55791699999997, 76.05981300000008, 32.184934, 24.601315, 42.88155400000005, 39.83457299999998, 33.665624999999864, 34.16163499999993, 32.98643700000002, 43.11764100000005], "outputHash": "9f622b94732b835cff58c3ba2f849aa3304270fa1bb4b11e9a5e41cb1e141e80", "parentMaxRSSKiB": 179228, "workerRSSKiB": null}+{"arm": "before", "trial": 3, "language": "typescript", "count": 1500, "sourceBytes": 138779, "importMs": 455.624038, "firstInspectMs": 153.95709899999997, "coldTotalMs": 609.581137, "warmMs": [107.84683900000005, 79.78408100000001, 67.15459500000009, 27.56494299999997, 24.763521999999966, 22.455645000000004, 23.20229900000004, 32.18130600000006, 29.338837000000012, 20.948354999999992], "outputHash": "9f622b94732b835cff58c3ba2f849aa3304270fa1bb4b11e9a5e41cb1e141e80", "parentMaxRSSKiB": 181316, "workerRSSKiB": null}+{"arm": "after", "trial": 3, "language": "typescript", "count": 1500, "sourceBytes": 138779, "importMs": 544.441996, "firstInspectMs": 194.46024999999997, "coldTotalMs": 738.902246, "warmMs": [123.42405000000008, 88.610185, 60.07100700000001, 36.5100809999999, 37.642761000000064, 33.97735499999999, 33.43577000000005, 33.59219699999994, 45.50162799999998, 35.699342000000115], "outputHash": "9f622b94732b835cff58c3ba2f849aa3304270fa1bb4b11e9a5e41cb1e141e80", "parentMaxRSSKiB": 182304, "workerRSSKiB": null}+{"arm": "before", "trial": 4, "language": "typescript", "count": 1500, "sourceBytes": 138779, "importMs": 431.73859600000003, "firstInspectMs": 158.905217, "coldTotalMs": 590.643813, "warmMs": [98.82643999999993, 82.325737, 33.413095, 49.59274199999993, 38.02993700000002, 33.38309499999991, 23.83345799999995, 32.15675800000008, 28.13674900000001, 20.36371299999996], "outputHash": "9f622b94732b835cff58c3ba2f849aa3304270fa1bb4b11e9a5e41cb1e141e80", "parentMaxRSSKiB": 180716, "workerRSSKiB": null}+{"arm": "after", "trial": 4, "language": "typescript", "count": 1500, "sourceBytes": 138779, "importMs": 453.34324300000003, "firstInspectMs": 148.41044700000003, "coldTotalMs": 601.75369, "warmMs": [95.1338639999999, 84.44913199999996, 71.18316200000004, 27.232951999999955, 23.761663, 23.71517700000004, 23.71172200000001, 34.521502000000055, 22.552181999999902, 22.509742999999844], "outputHash": "9f622b94732b835cff58c3ba2f849aa3304270fa1bb4b11e9a5e41cb1e141e80", "parentMaxRSSKiB": 181704, "workerRSSKiB": null}diff --git a/specs/tree-sitter/assets/development.jsonl b/specs/tree-sitter/assets/development.jsonlnew file mode 100644index 0000000..d469c80--- /dev/null+++ b/specs/tree-sitter/assets/development.jsonl@@ -0,0 +1,40 @@+{"arm": "before", "trial": 0, "language": "python", "count": 100, "sourceBytes": 7079, "importMs": 453.246885, "firstInspectMs": 2022.4418640000001, "coldTotalMs": 2475.6887490000004, "warmMs": [7.554709000000003, 8.93259100000023, 7.040169999999762, 10.445554999999786, 8.494204999999965, 7.899488000000019, 8.291185999999925, 10.452230999999756, 7.789802000000236, 7.493085000000065], "outputHash": "d60eb4dcc07256979253ba72b530788056b0a1b609a8e8958f1b69d9ba4354c7", "parentMaxRSSKiB": 144280, "workerRSSKiB": 163716}+{"arm": "after", "trial": 0, "language": "python", "count": 100, "sourceBytes": 7079, "importMs": 460.658632, "firstInspectMs": 105.41763499999996, "coldTotalMs": 566.0762669999999, "warmMs": [31.16870700000004, 9.518907000000013, 12.159895000000006, 8.47622899999999, 6.774248999999941, 6.990150999999969, 6.972921000000042, 6.244784999999979, 6.6065099999999575, 8.917532999999935], "outputHash": "d60eb4dcc07256979253ba72b530788056b0a1b609a8e8958f1b69d9ba4354c7", "parentMaxRSSKiB": 133680, "workerRSSKiB": 72376}+{"arm": "before", "trial": 1, "language": "python", "count": 100, "sourceBytes": 7079, "importMs": 422.105116, "firstInspectMs": 1735.2974250000002, "coldTotalMs": 2157.402541, "warmMs": [7.113663000000088, 10.490888999999697, 5.7553680000000895, 14.567180000000008, 5.177157000000079, 5.6451029999998354, 5.927519999999731, 30.20911500000011, 5.013314999999693, 5.221754000000146], "outputHash": "d60eb4dcc07256979253ba72b530788056b0a1b609a8e8958f1b69d9ba4354c7", "parentMaxRSSKiB": 142528, "workerRSSKiB": 149884}+{"arm": "after", "trial": 1, "language": "python", "count": 100, "sourceBytes": 7079, "importMs": 430.683866, "firstInspectMs": 85.92762599999998, "coldTotalMs": 516.611492, "warmMs": [14.37212599999998, 13.67610400000001, 12.417496000000028, 7.993520999999987, 6.040816999999947, 6.154074999999921, 7.026029999999992, 24.138203999999973, 6.785629000000085, 6.806991999999923], "outputHash": "d60eb4dcc07256979253ba72b530788056b0a1b609a8e8958f1b69d9ba4354c7", "parentMaxRSSKiB": 135340, "workerRSSKiB": 75328}+{"arm": "before", "trial": 2, "language": "python", "count": 100, "sourceBytes": 7079, "importMs": 487.44750600000003, "firstInspectMs": 1739.237517, "coldTotalMs": 2226.685023, "warmMs": [6.695619999999963, 7.473359999999957, 6.969356999999945, 30.60443699999996, 4.749450999999681, 4.867958999999701, 4.807538999999906, 6.320795000000089, 4.568481999999676, 4.654550000000199], "outputHash": "d60eb4dcc07256979253ba72b530788056b0a1b609a8e8958f1b69d9ba4354c7", "parentMaxRSSKiB": 144428, "workerRSSKiB": 152600}+{"arm": "after", "trial": 2, "language": "python", "count": 100, "sourceBytes": 7079, "importMs": 449.54263499999996, "firstInspectMs": 89.33965200000006, "coldTotalMs": 538.882287, "warmMs": [14.265570000000025, 44.679018999999926, 11.448421999999937, 8.323934000000008, 7.329789000000005, 7.352345000000014, 10.27382399999999, 10.357676000000083, 9.93471999999997, 9.59950200000003], "outputHash": "d60eb4dcc07256979253ba72b530788056b0a1b609a8e8958f1b69d9ba4354c7", "parentMaxRSSKiB": 132976, "workerRSSKiB": 73056}+{"arm": "before", "trial": 3, "language": "python", "count": 100, "sourceBytes": 7079, "importMs": 454.54002599999995, "firstInspectMs": 1721.378539, "coldTotalMs": 2175.918565, "warmMs": [6.8493240000002515, 10.011917000000267, 5.937175000000025, 15.244248999999854, 9.072845999999572, 7.786338999999771, 6.097580999999991, 6.268721000000369, 5.0530109999999695, 4.446171000000049], "outputHash": "d60eb4dcc07256979253ba72b530788056b0a1b609a8e8958f1b69d9ba4354c7", "parentMaxRSSKiB": 145744, "workerRSSKiB": 150868}+{"arm": "after", "trial": 3, "language": "python", "count": 100, "sourceBytes": 7079, "importMs": 521.625092, "firstInspectMs": 141.397518, "coldTotalMs": 663.02261, "warmMs": [27.889139, 23.16186700000003, 16.97821900000008, 21.54008799999997, 15.787098000000015, 15.019654999999943, 19.219914000000017, 9.58193899999992, 10.574008999999933, 7.983301999999981], "outputHash": "d60eb4dcc07256979253ba72b530788056b0a1b609a8e8958f1b69d9ba4354c7", "parentMaxRSSKiB": 133816, "workerRSSKiB": 71312}+{"arm": "before", "trial": 4, "language": "python", "count": 100, "sourceBytes": 7079, "importMs": 436.883619, "firstInspectMs": 1815.5676449999999, "coldTotalMs": 2252.451264, "warmMs": [7.9254719999999, 10.202927000000273, 8.790064999999686, 17.124930999999833, 8.297680000000128, 10.251408999999967, 9.198738999999932, 10.342971000000034, 7.912913000000117, 8.176135000000158], "outputHash": "d60eb4dcc07256979253ba72b530788056b0a1b609a8e8958f1b69d9ba4354c7", "parentMaxRSSKiB": 145492, "workerRSSKiB": 155152}+{"arm": "after", "trial": 4, "language": "python", "count": 100, "sourceBytes": 7079, "importMs": 528.655038, "firstInspectMs": 93.34763799999996, "coldTotalMs": 622.002676, "warmMs": [13.701855000000023, 8.509506999999985, 49.33241599999997, 8.422366000000011, 6.138621000000057, 6.300702999999999, 7.14326600000004, 6.459272000000055, 7.453710999999998, 7.078259000000003], "outputHash": "d60eb4dcc07256979253ba72b530788056b0a1b609a8e8958f1b69d9ba4354c7", "parentMaxRSSKiB": 131004, "workerRSSKiB": 68908}+{"arm": "before", "trial": 0, "language": "python", "count": 1500, "sourceBytes": 110279, "importMs": 415.250936, "firstInspectMs": 2387.821861, "coldTotalMs": 2803.072797, "warmMs": [166.27668499999982, 110.76861300000019, 97.09769700000015, 193.70176200000014, 101.64157299999988, 180.12653600000021, 99.34295500000007, 91.71810000000005, 113.886031, 61.483426999999665], "outputHash": "c044306aed312c9472b0205d1915ed3865055822a03ac36a0f1a5c492c98589b", "parentMaxRSSKiB": 149228, "workerRSSKiB": 174612}+{"arm": "after", "trial": 0, "language": "python", "count": 1500, "sourceBytes": 110279, "importMs": 424.81989, "firstInspectMs": 241.57662100000005, "coldTotalMs": 666.396511, "warmMs": [85.79783199999997, 128.34479199999998, 70.32347700000003, 70.30622899999992, 69.85254200000008, 67.76440400000001, 76.73993399999995, 72.29523000000017, 74.58962599999995, 78.03571199999988], "outputHash": "c044306aed312c9472b0205d1915ed3865055822a03ac36a0f1a5c492c98589b", "parentMaxRSSKiB": 149628, "workerRSSKiB": 107144}+{"arm": "before", "trial": 1, "language": "python", "count": 1500, "sourceBytes": 110279, "importMs": 430.90703, "firstInspectMs": 1824.003264, "coldTotalMs": 2254.910294, "warmMs": [91.3786240000004, 87.49161499999991, 98.69056599999976, 128.55817899999965, 68.67789200000016, 128.72562599999992, 86.56824000000006, 89.20348299999978, 108.67395100000022, 94.28254799999968], "outputHash": "c044306aed312c9472b0205d1915ed3865055822a03ac36a0f1a5c492c98589b", "parentMaxRSSKiB": 152060, "workerRSSKiB": 178416}+{"arm": "after", "trial": 1, "language": "python", "count": 1500, "sourceBytes": 110279, "importMs": 426.641138, "firstInspectMs": 248.202945, "coldTotalMs": 674.844083, "warmMs": [116.09608300000002, 87.04950099999996, 77.43607399999996, 85.43350199999998, 105.37695899999994, 135.59185700000012, 139.58161399999995, 131.467709, 76.15113399999996, 120.75949199999991], "outputHash": "c044306aed312c9472b0205d1915ed3865055822a03ac36a0f1a5c492c98589b", "parentMaxRSSKiB": 151940, "workerRSSKiB": 109036}+{"arm": "before", "trial": 2, "language": "python", "count": 1500, "sourceBytes": 110279, "importMs": 419.362673, "firstInspectMs": 1704.976654, "coldTotalMs": 2124.339327, "warmMs": [96.45858100000032, 61.6872470000003, 68.41294999999991, 109.79617699999972, 67.67076700000007, 95.49186699999973, 56.15962200000013, 56.55035999999973, 86.80798800000002, 64.21802800000023], "outputHash": "c044306aed312c9472b0205d1915ed3865055822a03ac36a0f1a5c492c98589b", "parentMaxRSSKiB": 152168, "workerRSSKiB": 175092}+{"arm": "after", "trial": 2, "language": "python", "count": 1500, "sourceBytes": 110279, "importMs": 447.700474, "firstInspectMs": 270.59053100000006, "coldTotalMs": 718.291005, "warmMs": [137.968161, 100.064074, 123.36159800000007, 91.05332500000009, 87.69247699999983, 74.8214730000002, 73.03609200000005, 69.14801499999999, 70.398416, 71.30708900000013], "outputHash": "c044306aed312c9472b0205d1915ed3865055822a03ac36a0f1a5c492c98589b", "parentMaxRSSKiB": 149196, "workerRSSKiB": 102660}+{"arm": "before", "trial": 3, "language": "python", "count": 1500, "sourceBytes": 110279, "importMs": 444.568462, "firstInspectMs": 1771.272735, "coldTotalMs": 2215.8411969999997, "warmMs": [108.95193199999994, 78.65677199999982, 69.29266600000028, 103.31475499999988, 64.15912799999978, 98.37669899999992, 58.82632400000011, 59.1199630000001, 87.0116509999998, 64.73993500000006], "outputHash": "c044306aed312c9472b0205d1915ed3865055822a03ac36a0f1a5c492c98589b", "parentMaxRSSKiB": 148972, "workerRSSKiB": 180764}+{"arm": "after", "trial": 3, "language": "python", "count": 1500, "sourceBytes": 110279, "importMs": 409.433367, "firstInspectMs": 233.00965000000002, "coldTotalMs": 642.443017, "warmMs": [88.35022700000002, 85.583035, 72.01199299999996, 72.73415499999999, 91.49550399999998, 70.06655999999998, 71.84817999999996, 70.19676500000014, 69.19151399999987, 77.57556], "outputHash": "c044306aed312c9472b0205d1915ed3865055822a03ac36a0f1a5c492c98589b", "parentMaxRSSKiB": 151176, "workerRSSKiB": 108304}+{"arm": "before", "trial": 4, "language": "python", "count": 1500, "sourceBytes": 110279, "importMs": 411.446024, "firstInspectMs": 1633.9439489999997, "coldTotalMs": 2045.3899729999998, "warmMs": [90.01866500000006, 62.84215399999994, 56.50704700000006, 99.78500499999973, 55.31303800000023, 94.16077099999984, 58.542875000000095, 63.95947699999988, 84.6533260000001, 58.05466800000022], "outputHash": "c044306aed312c9472b0205d1915ed3865055822a03ac36a0f1a5c492c98589b", "parentMaxRSSKiB": 148680, "workerRSSKiB": 176576}+{"arm": "after", "trial": 4, "language": "python", "count": 1500, "sourceBytes": 110279, "importMs": 381.430046, "firstInspectMs": 206.72578100000004, "coldTotalMs": 588.155827, "warmMs": [105.29966300000001, 81.69253400000002, 70.48109099999999, 89.48090200000001, 87.68221800000003, 107.13808700000004, 120.57208600000013, 104.50073799999996, 115.88333000000011, 100.3531989999999], "outputHash": "c044306aed312c9472b0205d1915ed3865055822a03ac36a0f1a5c492c98589b", "parentMaxRSSKiB": 152040, "workerRSSKiB": 104692}+{"arm": "before", "trial": 0, "language": "typescript", "count": 100, "sourceBytes": 8979, "importMs": 409.171737, "firstInspectMs": 20.63733099999996, "coldTotalMs": 429.80906799999997, "warmMs": [11.10973100000001, 7.978233000000046, 6.328113999999971, 6.5726040000000125, 5.627330000000029, 5.365533000000028, 5.381546000000014, 5.086628999999959, 4.8965480000000525, 5.222250999999915], "outputHash": "f95f65599da0d758fa702b41aab26262ed270e156330686e91bd4b344cb3f329", "parentMaxRSSKiB": 139588, "workerRSSKiB": null}+{"arm": "after", "trial": 0, "language": "typescript", "count": 100, "sourceBytes": 8979, "importMs": 402.392045, "firstInspectMs": 22.62088700000004, "coldTotalMs": 425.01293200000003, "warmMs": [12.567931999999985, 8.24440199999998, 6.420248000000015, 6.872828000000027, 6.412493999999981, 4.827145999999971, 5.496350000000007, 5.240263000000027, 5.043615000000045, 5.468518000000017], "outputHash": "f95f65599da0d758fa702b41aab26262ed270e156330686e91bd4b344cb3f329", "parentMaxRSSKiB": 139784, "workerRSSKiB": null}+{"arm": "before", "trial": 1, "language": "typescript", "count": 100, "sourceBytes": 8979, "importMs": 426.38303299999995, "firstInspectMs": 22.821582000000035, "coldTotalMs": 449.204615, "warmMs": [12.22389899999996, 9.856251999999984, 6.972251000000028, 6.844506999999908, 6.868551000000025, 5.3617269999999735, 5.892166999999972, 6.163195000000087, 5.1124790000000075, 7.096409999999992], "outputHash": "f95f65599da0d758fa702b41aab26262ed270e156330686e91bd4b344cb3f329", "parentMaxRSSKiB": 139620, "workerRSSKiB": null}+{"arm": "after", "trial": 1, "language": "typescript", "count": 100, "sourceBytes": 8979, "importMs": 388.539316, "firstInspectMs": 20.810050999999987, "coldTotalMs": 409.349367, "warmMs": [11.525676000000033, 8.693234000000018, 9.383351000000005, 6.964474999999993, 5.726825000000019, 5.293477999999993, 6.0544570000000135, 5.19148100000001, 10.198139999999967, 5.511674000000028], "outputHash": "f95f65599da0d758fa702b41aab26262ed270e156330686e91bd4b344cb3f329", "parentMaxRSSKiB": 139424, "workerRSSKiB": null}+{"arm": "before", "trial": 2, "language": "typescript", "count": 100, "sourceBytes": 8979, "importMs": 405.805028, "firstInspectMs": 25.22872000000001, "coldTotalMs": 431.033748, "warmMs": [15.239142000000015, 9.358047999999997, 7.714786000000004, 8.687959999999975, 5.785766999999964, 5.027069999999981, 5.920686000000046, 5.609456000000023, 4.771300999999994, 7.3137140000000045], "outputHash": "f95f65599da0d758fa702b41aab26262ed270e156330686e91bd4b344cb3f329", "parentMaxRSSKiB": 139664, "workerRSSKiB": null}+{"arm": "after", "trial": 2, "language": "typescript", "count": 100, "sourceBytes": 8979, "importMs": 393.60877999999997, "firstInspectMs": 24.93631099999999, "coldTotalMs": 418.54509099999996, "warmMs": [16.49524500000001, 10.793630000000007, 8.714566999999988, 10.601223000000005, 7.400584999999978, 6.158604999999966, 7.846892000000025, 7.839215999999965, 6.596727999999985, 7.743477999999982], "outputHash": "f95f65599da0d758fa702b41aab26262ed270e156330686e91bd4b344cb3f329", "parentMaxRSSKiB": 139436, "workerRSSKiB": null}+{"arm": "before", "trial": 3, "language": "typescript", "count": 100, "sourceBytes": 8979, "importMs": 395.37976399999997, "firstInspectMs": 21.441437000000008, "coldTotalMs": 416.821201, "warmMs": [11.07368200000002, 10.173418999999967, 8.37440399999997, 8.877215999999976, 6.157242999999994, 4.921349999999961, 6.219087999999999, 5.501081999999997, 4.681629999999984, 7.343274999999949], "outputHash": "f95f65599da0d758fa702b41aab26262ed270e156330686e91bd4b344cb3f329", "parentMaxRSSKiB": 139600, "workerRSSKiB": null}+{"arm": "after", "trial": 3, "language": "typescript", "count": 100, "sourceBytes": 8979, "importMs": 396.000078, "firstInspectMs": 21.958414000000005, "coldTotalMs": 417.958492, "warmMs": [12.13918000000001, 9.784187000000031, 7.885791999999981, 7.639640999999983, 6.891168999999991, 6.587204999999983, 6.438469999999995, 6.47880600000002, 5.368441999999959, 7.415954000000056], "outputHash": "f95f65599da0d758fa702b41aab26262ed270e156330686e91bd4b344cb3f329", "parentMaxRSSKiB": 140144, "workerRSSKiB": null}+{"arm": "before", "trial": 4, "language": "typescript", "count": 100, "sourceBytes": 8979, "importMs": 414.938734, "firstInspectMs": 24.53040699999997, "coldTotalMs": 439.469141, "warmMs": [11.808717000000001, 9.167335000000037, 7.451348999999993, 11.955511000000001, 9.494264999999984, 7.918318999999997, 6.391338000000019, 6.597424000000046, 5.058942999999999, 7.561600999999996], "outputHash": "f95f65599da0d758fa702b41aab26262ed270e156330686e91bd4b344cb3f329", "parentMaxRSSKiB": 139148, "workerRSSKiB": null}+{"arm": "after", "trial": 4, "language": "typescript", "count": 100, "sourceBytes": 8979, "importMs": 522.9867830000001, "firstInspectMs": 23.587924999999927, "coldTotalMs": 546.574708, "warmMs": [13.901986999999963, 8.086656999999946, 6.919371000000069, 6.8583830000000034, 7.219927999999982, 5.937127999999916, 6.379744000000073, 6.158831000000077, 5.40495199999998, 22.655939999999987], "outputHash": "f95f65599da0d758fa702b41aab26262ed270e156330686e91bd4b344cb3f329", "parentMaxRSSKiB": 135476, "workerRSSKiB": null}+{"arm": "before", "trial": 0, "language": "typescript", "count": 1500, "sourceBytes": 138779, "importMs": 530.40611, "firstInspectMs": 168.972934, "coldTotalMs": 699.379044, "warmMs": [114.17976699999997, 80.178495, 64.45003399999996, 26.752717999999845, 28.188879000000043, 24.48183700000004, 21.263114000000087, 20.683320000000094, 26.078553000000056, 30.84954199999993], "outputHash": "9f622b94732b835cff58c3ba2f849aa3304270fa1bb4b11e9a5e41cb1e141e80", "parentMaxRSSKiB": 181108, "workerRSSKiB": null}+{"arm": "after", "trial": 0, "language": "typescript", "count": 1500, "sourceBytes": 138779, "importMs": 562.3945679999999, "firstInspectMs": 168.13489500000003, "coldTotalMs": 730.529463, "warmMs": [116.60795299999995, 86.07254599999999, 72.70133299999998, 30.219031000000086, 29.422330999999986, 31.79112000000009, 34.41468499999996, 22.78792999999996, 25.342572999999902, 22.428964000000178], "outputHash": "9f622b94732b835cff58c3ba2f849aa3304270fa1bb4b11e9a5e41cb1e141e80", "parentMaxRSSKiB": 185972, "workerRSSKiB": null}+{"arm": "before", "trial": 1, "language": "typescript", "count": 1500, "sourceBytes": 138779, "importMs": 494.00241200000005, "firstInspectMs": 142.33905199999992, "coldTotalMs": 636.341464, "warmMs": [125.1237759999999, 124.1472030000001, 34.37309600000003, 28.936644, 36.64593400000001, 33.20755899999995, 25.290485999999873, 36.305767999999944, 36.84423600000014, 29.355866000000105], "outputHash": "9f622b94732b835cff58c3ba2f849aa3304270fa1bb4b11e9a5e41cb1e141e80", "parentMaxRSSKiB": 182900, "workerRSSKiB": null}+{"arm": "after", "trial": 1, "language": "typescript", "count": 1500, "sourceBytes": 138779, "importMs": 519.2764569999999, "firstInspectMs": 166.24218700000006, "coldTotalMs": 685.518644, "warmMs": [112.16461500000003, 106.18140700000004, 72.291831, 41.585975000000076, 39.393463999999994, 30.950661999999966, 29.895177000000103, 21.592425999999932, 34.24949399999991, 39.75282100000004], "outputHash": "9f622b94732b835cff58c3ba2f849aa3304270fa1bb4b11e9a5e41cb1e141e80", "parentMaxRSSKiB": 179992, "workerRSSKiB": null}+{"arm": "before", "trial": 2, "language": "typescript", "count": 1500, "sourceBytes": 138779, "importMs": 623.526233, "firstInspectMs": 200.840687, "coldTotalMs": 824.36692, "warmMs": [116.19859000000008, 80.61759999999992, 39.02957399999991, 37.58587899999998, 29.742199000000028, 19.23903499999983, 22.71005500000001, 27.073495000000094, 38.11812299999997, 40.940996999999925], "outputHash": "9f622b94732b835cff58c3ba2f849aa3304270fa1bb4b11e9a5e41cb1e141e80", "parentMaxRSSKiB": 182684, "workerRSSKiB": null}+{"arm": "after", "trial": 2, "language": "typescript", "count": 1500, "sourceBytes": 138779, "importMs": 450.42145, "firstInspectMs": 153.83119899999997, "coldTotalMs": 604.252649, "warmMs": [95.77104099999997, 90.97307999999998, 28.60821599999997, 23.624363000000017, 34.49552799999992, 21.78089799999998, 24.20600300000001, 23.79245400000002, 34.9188640000001, 24.12517600000001], "outputHash": "9f622b94732b835cff58c3ba2f849aa3304270fa1bb4b11e9a5e41cb1e141e80", "parentMaxRSSKiB": 183064, "workerRSSKiB": null}+{"arm": "before", "trial": 3, "language": "typescript", "count": 1500, "sourceBytes": 138779, "importMs": 448.145396, "firstInspectMs": 165.21663600000005, "coldTotalMs": 613.362032, "warmMs": [114.76859999999999, 99.830825, 54.948312999999985, 36.17337199999997, 36.258407000000034, 23.285503000000062, 24.312719000000016, 41.222027000000026, 34.152549000000135, 28.408329000000094], "outputHash": "9f622b94732b835cff58c3ba2f849aa3304270fa1bb4b11e9a5e41cb1e141e80", "parentMaxRSSKiB": 181968, "workerRSSKiB": null}+{"arm": "after", "trial": 3, "language": "typescript", "count": 1500, "sourceBytes": 138779, "importMs": 427.784726, "firstInspectMs": 136.41772500000008, "coldTotalMs": 564.2024510000001, "warmMs": [112.629909, 84.80118200000004, 70.93805600000007, 39.442859, 38.71423399999992, 37.604287, 39.29825800000003, 42.519796999999926, 38.27981599999998, 34.6477460000001], "outputHash": "9f622b94732b835cff58c3ba2f849aa3304270fa1bb4b11e9a5e41cb1e141e80", "parentMaxRSSKiB": 182340, "workerRSSKiB": null}+{"arm": "before", "trial": 4, "language": "typescript", "count": 1500, "sourceBytes": 138779, "importMs": 630.075934, "firstInspectMs": 141.844021, "coldTotalMs": 771.919955, "warmMs": [105.24343699999997, 82.43184600000006, 34.80075999999997, 40.64881700000001, 21.831837999999834, 27.42954899999995, 27.079656000000114, 23.00164000000018, 31.07020599999987, 22.42371900000012], "outputHash": "9f622b94732b835cff58c3ba2f849aa3304270fa1bb4b11e9a5e41cb1e141e80", "parentMaxRSSKiB": 182372, "workerRSSKiB": null}+{"arm": "after", "trial": 4, "language": "typescript", "count": 1500, "sourceBytes": 138779, "importMs": 454.72777599999995, "firstInspectMs": 153.23512000000005, "coldTotalMs": 607.962896, "warmMs": [142.89887899999997, 62.31739300000004, 65.00661400000001, 21.51714199999992, 24.525481000000013, 33.52922899999999, 21.046099000000027, 21.247793999999885, 33.33149599999979, 20.87400700000012], "outputHash": "9f622b94732b835cff58c3ba2f849aa3304270fa1bb4b11e9a5e41cb1e141e80", "parentMaxRSSKiB": 180128, "workerRSSKiB": null}diff --git a/specs/tree-sitter/assets/pre-review-confirmation.jsonl b/specs/tree-sitter/assets/pre-review-confirmation.jsonlnew file mode 100644index 0000000..0b69898--- /dev/null+++ b/specs/tree-sitter/assets/pre-review-confirmation.jsonl@@ -0,0 +1,41 @@+{"metadata": {"baseline": "2dc1d3c9c9fec236913d97d7288ee6d24ba17baa", "images": {"before": "sha256:b85bb6033599b5b771b24c368f79517b711a4442fc5fac40a69a0631e1a957fe", "after": "sha256:205b4c25a72cb218a05ad42fe16417b7c099605d5db7a8f7a249fd233191195f"}, "sourceSHA256": {"packages/core/src/cache.ts": "3cdf1a535a3a22c9dc2ca7a33f1a86d4d86dbe955ad6fd2b2dc90efc5d9bdda8", "packages/core/src/call-context.ts": "5572493c80fd0dee7c294d2348bfbb0006f70af8b8cf1417eea07d1076094684", "packages/core/src/evaluator.ts": "4ce63bd2095789c05398c4b7d4de4fa89276d5bc9e8f7a6250418e8852ae5f87", "packages/core/src/filesystem.ts": "6856834de140db4941d73a01c154da213a90352b43e9e9b13902ade58401b948", "packages/core/src/index.ts": "138347e588eeede4477b7e40c3cdfc8583e39ce783a4846419606adc6109a04f", "packages/core/src/parser-helpers.mjs": "b732ec3708678beb989b7fd741f0bfb608d86e996e0e28bad23b25285909f88b", "packages/core/src/parser-preview.mjs": "165f08fe1fecc877db045d0624a2f4a150541ca26c27150aa213f25674761e73", "packages/core/src/parser-worker.mjs": "95ec7ad277693afc91273e37304dad7cd7d6a62c284cbc124bd2458f23b8478a", "packages/core/src/parser.ts": "22dec6279ca06612fe4a41b0f52c3ae278205b54f1f93756fd966987b7412dd3", "packages/core/src/providers.ts": "609399bb43c52d2fe4353a437e379703eba2741e3a423035f39dc9c731fb23fe", "packages/core/src/repository-context.ts": "3466b6b8ff977c32537c98b170552f998efa5e4c8a66fa6743f1e9493fffae5e", "packages/core/src/requests.ts": "a73e689843b5f9caac04b8e3dca04d3fb22efb5d3967f111c9da05f6cde7defa", "packages/core/src/retrieve.ts": "6e35d76b1ae9379172edb476c6034c5596b00ef054203dbfda974269d605482e", "packages/core/src/selection.ts": "1d700c18ba76c7c980e845fe3db0f1caee411c008d56ee88efab77ae36f6abd3", "packages/core/src/source.ts": "3d7b820dac964a903c3d6a7e7205e4353b51b301d5b78dab4139276364be112f", "packages/core/src/test-body-selection.ts": "3b6d7667ac4191075fc9cf0ebf04a02bad20cff790786bf6291881378e0b44c9", "packages/core/src/types.ts": "d3dd0e56ced81b66182739d900dc9ba9b47b0d62d476bda26ff48ae2da61c8ba"}, "node": "22 (image)", "cpus": 2, "memory": "2g"}}+{"arm": "before", "trial": 0, "language": "python", "count": 100, "sourceBytes": 7079, "importMs": 462.147655, "firstInspectMs": 1853.9676450000002, "coldTotalMs": 2316.1153000000004, "warmMs": [6.691675999999916, 6.1335149999999885, 5.839324000000033, 7.862619999999879, 6.377745000000232, 4.904703000000154, 5.280252000000019, 6.99322200000006, 5.119576000000052, 4.971537999999782], "outputHash": "d60eb4dcc07256979253ba72b530788056b0a1b609a8e8958f1b69d9ba4354c7", "parentMaxRSSKiB": 136728, "workerRSSKiB": 164264}+{"arm": "after", "trial": 0, "language": "python", "count": 100, "sourceBytes": 7079, "importMs": 442.453417, "firstInspectMs": 97.78177600000004, "coldTotalMs": 540.235193, "warmMs": [65.73043900000005, 8.17504299999996, 7.637310999999954, 6.299998000000073, 6.111453999999981, 5.670145000000048, 5.764586000000008, 5.723509999999919, 4.965485000000058, 5.794310999999993], "outputHash": "d60eb4dcc07256979253ba72b530788056b0a1b609a8e8958f1b69d9ba4354c7", "parentMaxRSSKiB": 136868, "workerRSSKiB": 69116}+{"arm": "before", "trial": 1, "language": "python", "count": 100, "sourceBytes": 7079, "importMs": 444.664718, "firstInspectMs": 1767.823619, "coldTotalMs": 2212.4883370000002, "warmMs": [9.081005999999888, 10.690897999999834, 8.077949999999873, 10.90133300000025, 7.743562000000111, 8.072732999999971, 8.047022000000197, 10.58627800000022, 7.515431000000262, 7.5960299999997005], "outputHash": "d60eb4dcc07256979253ba72b530788056b0a1b609a8e8958f1b69d9ba4354c7", "parentMaxRSSKiB": 136504, "workerRSSKiB": 161340}+{"arm": "after", "trial": 1, "language": "python", "count": 100, "sourceBytes": 7079, "importMs": 452.796291, "firstInspectMs": 99.843977, "coldTotalMs": 552.640268, "warmMs": [63.88274799999999, 6.6015370000000075, 7.2312709999999925, 8.39722299999994, 8.59481500000004, 8.40029800000002, 8.855061999999975, 8.231923000000052, 8.185425999999893, 7.632844999999975], "outputHash": "d60eb4dcc07256979253ba72b530788056b0a1b609a8e8958f1b69d9ba4354c7", "parentMaxRSSKiB": 135568, "workerRSSKiB": 74604}+{"arm": "before", "trial": 2, "language": "python", "count": 100, "sourceBytes": 7079, "importMs": 495.9070019999999, "firstInspectMs": 1710.80235, "coldTotalMs": 2206.709352, "warmMs": [7.074876000000131, 9.873181000000386, 5.688456999999744, 8.220041000000037, 6.2009109999999055, 7.84724899999992, 6.607402999999977, 6.803741000000173, 4.74127499999986, 7.4944070000001375], "outputHash": "d60eb4dcc07256979253ba72b530788056b0a1b609a8e8958f1b69d9ba4354c7", "parentMaxRSSKiB": 135184, "workerRSSKiB": 166476}+{"arm": "after", "trial": 2, "language": "python", "count": 100, "sourceBytes": 7079, "importMs": 480.411167, "firstInspectMs": 152.14845300000002, "coldTotalMs": 632.55962, "warmMs": [15.940404000000058, 10.27655500000003, 9.992007999999942, 9.860544000000004, 7.795988000000079, 5.836131000000023, 11.930531999999971, 8.981667000000016, 22.436871999999994, 9.182585000000017], "outputHash": "d60eb4dcc07256979253ba72b530788056b0a1b609a8e8958f1b69d9ba4354c7", "parentMaxRSSKiB": 136136, "workerRSSKiB": 81988}+{"arm": "before", "trial": 3, "language": "python", "count": 100, "sourceBytes": 7079, "importMs": 467.417004, "firstInspectMs": 2392.5994370000003, "coldTotalMs": 2860.016441, "warmMs": [9.55074599999989, 10.721544999999878, 8.16381999999976, 10.92246699999987, 7.367788000000019, 7.426727999999912, 7.820938000000297, 9.835941999999704, 7.475572999999713, 7.592587999999978], "outputHash": "d60eb4dcc07256979253ba72b530788056b0a1b609a8e8958f1b69d9ba4354c7", "parentMaxRSSKiB": 135344, "workerRSSKiB": 148824}+{"arm": "after", "trial": 3, "language": "python", "count": 100, "sourceBytes": 7079, "importMs": 579.185348, "firstInspectMs": 107.07026599999995, "coldTotalMs": 686.2556139999999, "warmMs": [26.77907099999993, 10.205351000000064, 8.948148999999944, 6.578743000000031, 5.27658299999996, 5.067263000000025, 6.241625999999997, 31.512732000000028, 5.511920999999916, 6.333424000000036], "outputHash": "d60eb4dcc07256979253ba72b530788056b0a1b609a8e8958f1b69d9ba4354c7", "parentMaxRSSKiB": 135388, "workerRSSKiB": 79768}+{"arm": "before", "trial": 4, "language": "python", "count": 100, "sourceBytes": 7079, "importMs": 465.770353, "firstInspectMs": 2489.627464, "coldTotalMs": 2955.397817, "warmMs": [11.062460999999985, 9.770179999999982, 9.618355999999949, 10.819054999999935, 8.553813999999875, 7.718457000000399, 6.3041049999997085, 8.373728000000028, 6.675424000000021, 7.762759999999616], "outputHash": "d60eb4dcc07256979253ba72b530788056b0a1b609a8e8958f1b69d9ba4354c7", "parentMaxRSSKiB": 133008, "workerRSSKiB": 153568}+{"arm": "after", "trial": 4, "language": "python", "count": 100, "sourceBytes": 7079, "importMs": 436.994255, "firstInspectMs": 105.50425800000005, "coldTotalMs": 542.498513, "warmMs": [14.236756000000014, 9.651767999999947, 9.623767000000043, 8.779141999999979, 8.430438000000095, 8.20963699999993, 38.21056399999998, 8.13443099999995, 7.777304000000072, 7.702381999999943], "outputHash": "d60eb4dcc07256979253ba72b530788056b0a1b609a8e8958f1b69d9ba4354c7", "parentMaxRSSKiB": 136612, "workerRSSKiB": 74504}+{"arm": "before", "trial": 0, "language": "python", "count": 1500, "sourceBytes": 110279, "importMs": 449.69859199999996, "firstInspectMs": 1777.567699, "coldTotalMs": 2227.266291, "warmMs": [118.55793399999993, 62.099165000000085, 67.17342300000018, 109.85863599999993, 61.617925000000014, 110.61443499999996, 59.66126000000031, 62.009712000000036, 101.56597899999997, 62.70445400000017], "outputHash": "c044306aed312c9472b0205d1915ed3865055822a03ac36a0f1a5c492c98589b", "parentMaxRSSKiB": 148052, "workerRSSKiB": 176704}+{"arm": "after", "trial": 0, "language": "python", "count": 1500, "sourceBytes": 110279, "importMs": 439.42380299999996, "firstInspectMs": 245.279158, "coldTotalMs": 684.702961, "warmMs": [96.16830800000002, 80.18031199999996, 70.01307699999995, 63.64343199999996, 70.94238399999995, 65.5074619999998, 67.23670199999992, 65.629459, 76.82360299999982, 63.03289399999994], "outputHash": "c044306aed312c9472b0205d1915ed3865055822a03ac36a0f1a5c492c98589b", "parentMaxRSSKiB": 149932, "workerRSSKiB": 104272}+{"arm": "before", "trial": 1, "language": "python", "count": 1500, "sourceBytes": 110279, "importMs": 440.226764, "firstInspectMs": 1793.708043, "coldTotalMs": 2233.934807, "warmMs": [97.50024600000006, 65.84433900000022, 79.751127, 161.3412330000001, 100.72541900000033, 154.93604499999992, 97.44414000000006, 97.4427499999997, 140.69497899999988, 98.48509899999999], "outputHash": "c044306aed312c9472b0205d1915ed3865055822a03ac36a0f1a5c492c98589b", "parentMaxRSSKiB": 146348, "workerRSSKiB": 180672}+{"arm": "after", "trial": 1, "language": "python", "count": 1500, "sourceBytes": 110279, "importMs": 433.206659, "firstInspectMs": 300.43733399999996, "coldTotalMs": 733.643993, "warmMs": [81.46434499999998, 80.38060300000006, 68.44980700000008, 64.57513900000015, 62.56344300000001, 68.18193199999996, 62.45391900000004, 61.840646000000106, 65.25393400000007, 60.492979000000105], "outputHash": "c044306aed312c9472b0205d1915ed3865055822a03ac36a0f1a5c492c98589b", "parentMaxRSSKiB": 148996, "workerRSSKiB": 98776}+{"arm": "before", "trial": 2, "language": "python", "count": 1500, "sourceBytes": 110279, "importMs": 460.572582, "firstInspectMs": 1978.57586, "coldTotalMs": 2439.1484419999997, "warmMs": [147.4319919999998, 97.86999399999968, 103.72576800000024, 158.48749399999997, 102.45045800000025, 160.94378899999992, 74.9661930000002, 84.66840199999979, 143.4218390000001, 90.6616869999998], "outputHash": "c044306aed312c9472b0205d1915ed3865055822a03ac36a0f1a5c492c98589b", "parentMaxRSSKiB": 148960, "workerRSSKiB": 176240}+{"arm": "after", "trial": 2, "language": "python", "count": 1500, "sourceBytes": 110279, "importMs": 553.187147, "firstInspectMs": 247.86814900000002, "coldTotalMs": 801.055296, "warmMs": [86.44851100000005, 88.13130100000001, 102.34795000000008, 101.26598099999978, 102.66396000000009, 98.81544700000018, 84.90504699999997, 61.677370999999994, 64.79306199999996, 80.70341299999995], "outputHash": "c044306aed312c9472b0205d1915ed3865055822a03ac36a0f1a5c492c98589b", "parentMaxRSSKiB": 148136, "workerRSSKiB": 104876}+{"arm": "before", "trial": 3, "language": "python", "count": 1500, "sourceBytes": 110279, "importMs": 453.214711, "firstInspectMs": 1833.544437, "coldTotalMs": 2286.759148, "warmMs": [100.69500299999982, 70.41655600000013, 64.40530900000022, 120.293181, 75.20360600000004, 107.91797700000006, 62.93260199999986, 63.10222900000008, 97.27740600000016, 62.72326699999985], "outputHash": "c044306aed312c9472b0205d1915ed3865055822a03ac36a0f1a5c492c98589b", "parentMaxRSSKiB": 143488, "workerRSSKiB": 177400}+{"arm": "after", "trial": 3, "language": "python", "count": 1500, "sourceBytes": 110279, "importMs": 508.89227099999994, "firstInspectMs": 325.6828290000001, "coldTotalMs": 834.5751, "warmMs": [138.41170899999997, 118.98326099999997, 113.08066499999995, 87.67337099999986, 101.14019600000006, 87.00848099999985, 64.06007700000009, 99.96461900000008, 102.422595, 99.10086799999999], "outputHash": "c044306aed312c9472b0205d1915ed3865055822a03ac36a0f1a5c492c98589b", "parentMaxRSSKiB": 148316, "workerRSSKiB": 99732}+{"arm": "before", "trial": 4, "language": "python", "count": 1500, "sourceBytes": 110279, "importMs": 471.54155000000003, "firstInspectMs": 1854.728481, "coldTotalMs": 2326.270031, "warmMs": [142.28364999999985, 67.36732000000029, 72.47769699999981, 117.022066, 71.12040699999989, 115.24714700000004, 64.47627599999987, 63.37813700000015, 110.78267600000027, 78.09664900000007], "outputHash": "c044306aed312c9472b0205d1915ed3865055822a03ac36a0f1a5c492c98589b", "parentMaxRSSKiB": 149904, "workerRSSKiB": 191540}+{"arm": "after", "trial": 4, "language": "python", "count": 1500, "sourceBytes": 110279, "importMs": 434.780929, "firstInspectMs": 293.77234799999997, "coldTotalMs": 728.553277, "warmMs": [118.56362899999999, 83.20836799999995, 103.21642199999997, 64.473792, 69.2843069999999, 64.88177500000006, 64.87875099999997, 67.06862799999999, 65.55666599999995, 64.09233100000006], "outputHash": "c044306aed312c9472b0205d1915ed3865055822a03ac36a0f1a5c492c98589b", "parentMaxRSSKiB": 147732, "workerRSSKiB": 107928}+{"arm": "before", "trial": 0, "language": "typescript", "count": 100, "sourceBytes": 8979, "importMs": 544.782751, "firstInspectMs": 24.520336000000043, "coldTotalMs": 569.303087, "warmMs": [15.118770999999924, 10.49615499999993, 8.616207000000031, 9.471947, 6.494685000000004, 5.204291000000012, 6.171021999999994, 6.272739000000001, 5.783828999999969, 7.255835999999931], "outputHash": "f95f65599da0d758fa702b41aab26262ed270e156330686e91bd4b344cb3f329", "parentMaxRSSKiB": 140056, "workerRSSKiB": null}+{"arm": "after", "trial": 0, "language": "typescript", "count": 100, "sourceBytes": 8979, "importMs": 436.220836, "firstInspectMs": 24.916920000000005, "coldTotalMs": 461.137756, "warmMs": [13.385891000000015, 10.640803000000005, 8.08522599999992, 7.394500999999991, 7.635404000000108, 5.721708000000035, 6.576380999999969, 5.979525999999964, 21.65032599999995, 8.118530000000078], "outputHash": "f95f65599da0d758fa702b41aab26262ed270e156330686e91bd4b344cb3f329", "parentMaxRSSKiB": 139084, "workerRSSKiB": null}+{"arm": "before", "trial": 1, "language": "typescript", "count": 100, "sourceBytes": 8979, "importMs": 445.77997, "firstInspectMs": 29.29503500000004, "coldTotalMs": 475.07500500000003, "warmMs": [15.111103999999955, 10.224545999999918, 7.619269000000031, 7.525255000000016, 7.797598999999991, 5.633711000000062, 7.679850999999985, 13.253905000000032, 6.208030000000008, 7.832273999999984], "outputHash": "f95f65599da0d758fa702b41aab26262ed270e156330686e91bd4b344cb3f329", "parentMaxRSSKiB": 140712, "workerRSSKiB": null}+{"arm": "after", "trial": 1, "language": "typescript", "count": 100, "sourceBytes": 8979, "importMs": 456.369745, "firstInspectMs": 27.97152299999999, "coldTotalMs": 484.341268, "warmMs": [16.154954999999973, 10.401851000000079, 7.866707999999903, 7.275826999999936, 6.776703999999995, 7.013090999999918, 7.490521999999942, 6.632290999999896, 5.32168999999999, 7.5311060000000225], "outputHash": "f95f65599da0d758fa702b41aab26262ed270e156330686e91bd4b344cb3f329", "parentMaxRSSKiB": 138928, "workerRSSKiB": null}+{"arm": "before", "trial": 2, "language": "typescript", "count": 100, "sourceBytes": 8979, "importMs": 433.295798, "firstInspectMs": 23.452518999999995, "coldTotalMs": 456.748317, "warmMs": [12.127890999999977, 8.372044000000074, 7.553435000000036, 9.243196000000012, 6.908424999999966, 5.556211000000076, 6.33750299999997, 15.788520999999946, 5.942926000000057, 6.324860000000058], "outputHash": "f95f65599da0d758fa702b41aab26262ed270e156330686e91bd4b344cb3f329", "parentMaxRSSKiB": 139868, "workerRSSKiB": null}+{"arm": "after", "trial": 2, "language": "typescript", "count": 100, "sourceBytes": 8979, "importMs": 448.364262, "firstInspectMs": 27.871338000000037, "coldTotalMs": 476.23560000000003, "warmMs": [14.846900000000005, 10.680303999999978, 7.365778999999975, 7.294048999999973, 7.418628000000012, 6.6512330000000475, 6.447741000000065, 6.423738000000071, 6.803720999999996, 7.454714999999965], "outputHash": "f95f65599da0d758fa702b41aab26262ed270e156330686e91bd4b344cb3f329", "parentMaxRSSKiB": 139056, "workerRSSKiB": null}+{"arm": "before", "trial": 3, "language": "typescript", "count": 100, "sourceBytes": 8979, "importMs": 460.28150000000005, "firstInspectMs": 34.81328100000002, "coldTotalMs": 495.094781, "warmMs": [16.818648000000053, 12.165478000000007, 9.70164299999999, 10.094449000000054, 8.640377999999941, 8.097266999999988, 7.9537820000000465, 7.9144770000000335, 7.613706999999977, 7.915768000000071], "outputHash": "f95f65599da0d758fa702b41aab26262ed270e156330686e91bd4b344cb3f329", "parentMaxRSSKiB": 139860, "workerRSSKiB": null}+{"arm": "after", "trial": 3, "language": "typescript", "count": 100, "sourceBytes": 8979, "importMs": 460.72148, "firstInspectMs": 23.805027999999993, "coldTotalMs": 484.526508, "warmMs": [13.144046000000003, 10.373327000000018, 8.416323000000034, 7.356965000000059, 6.748460000000023, 5.667784999999981, 6.228340000000003, 6.793514999999957, 8.297184000000016, 22.46493899999996], "outputHash": "f95f65599da0d758fa702b41aab26262ed270e156330686e91bd4b344cb3f329", "parentMaxRSSKiB": 139060, "workerRSSKiB": null}+{"arm": "before", "trial": 4, "language": "typescript", "count": 100, "sourceBytes": 8979, "importMs": 453.59155400000003, "firstInspectMs": 25.80976499999997, "coldTotalMs": 479.401319, "warmMs": [12.389673000000016, 9.542212000000063, 7.4824049999999716, 6.995235999999977, 6.493325000000027, 5.314277000000061, 7.625803000000019, 7.022339999999986, 5.376473000000033, 6.038347000000044], "outputHash": "f95f65599da0d758fa702b41aab26262ed270e156330686e91bd4b344cb3f329", "parentMaxRSSKiB": 139792, "workerRSSKiB": null}+{"arm": "after", "trial": 4, "language": "typescript", "count": 100, "sourceBytes": 8979, "importMs": 439.03968299999997, "firstInspectMs": 24.354266999999993, "coldTotalMs": 463.39394999999996, "warmMs": [13.542063000000041, 10.94310500000006, 7.208609999999908, 7.18464999999992, 7.184656000000018, 5.699631000000068, 9.769002, 16.535590999999954, 5.200294999999983, 7.490832999999952], "outputHash": "f95f65599da0d758fa702b41aab26262ed270e156330686e91bd4b344cb3f329", "parentMaxRSSKiB": 138816, "workerRSSKiB": null}+{"arm": "before", "trial": 0, "language": "typescript", "count": 1500, "sourceBytes": 138779, "importMs": 470.348906, "firstInspectMs": 147.50822400000004, "coldTotalMs": 617.8571300000001, "warmMs": [108.13686799999994, 78.939391, 70.20689300000004, 21.89259800000002, 22.320441999999957, 21.840148999999997, 22.914154999999937, 21.523506999999995, 18.883084000000053, 22.065664999999854], "outputHash": "9f622b94732b835cff58c3ba2f849aa3304270fa1bb4b11e9a5e41cb1e141e80", "parentMaxRSSKiB": 180368, "workerRSSKiB": null}+{"arm": "after", "trial": 0, "language": "typescript", "count": 1500, "sourceBytes": 138779, "importMs": 456.004268, "firstInspectMs": 175.06508499999995, "coldTotalMs": 631.069353, "warmMs": [107.33653700000002, 80.09661100000005, 41.44764600000008, 46.82933400000002, 36.52336700000001, 35.164845000000014, 35.842260000000124, 41.70021299999985, 36.40544499999987, 33.4715819999999], "outputHash": "9f622b94732b835cff58c3ba2f849aa3304270fa1bb4b11e9a5e41cb1e141e80", "parentMaxRSSKiB": 182232, "workerRSSKiB": null}+{"arm": "before", "trial": 1, "language": "typescript", "count": 1500, "sourceBytes": 138779, "importMs": 463.389033, "firstInspectMs": 148.89062500000006, "coldTotalMs": 612.279658, "warmMs": [117.02239900000006, 88.45639200000005, 64.87624800000003, 33.67207599999995, 34.27058699999998, 26.748391000000083, 22.28621499999997, 24.402008000000023, 31.9386199999999, 23.468028000000004], "outputHash": "9f622b94732b835cff58c3ba2f849aa3304270fa1bb4b11e9a5e41cb1e141e80", "parentMaxRSSKiB": 182320, "workerRSSKiB": null}+{"arm": "after", "trial": 1, "language": "typescript", "count": 1500, "sourceBytes": 138779, "importMs": 434.448447, "firstInspectMs": 181.390044, "coldTotalMs": 615.838491, "warmMs": [101.32446700000003, 94.00351799999999, 25.064024000000018, 21.363028999999983, 31.223982999999976, 24.827244000000064, 23.846571999999924, 24.464900000000057, 23.432042999999908, 28.92685599999993], "outputHash": "9f622b94732b835cff58c3ba2f849aa3304270fa1bb4b11e9a5e41cb1e141e80", "parentMaxRSSKiB": 182468, "workerRSSKiB": null}+{"arm": "before", "trial": 2, "language": "typescript", "count": 1500, "sourceBytes": 138779, "importMs": 584.1261360000001, "firstInspectMs": 205.456552, "coldTotalMs": 789.5826880000001, "warmMs": [134.02887099999998, 74.42759600000011, 44.31258100000014, 61.626307, 43.349268000000166, 31.104795000000195, 39.890394000000015, 37.72568000000001, 33.418496000000005, 35.331989999999905], "outputHash": "9f622b94732b835cff58c3ba2f849aa3304270fa1bb4b11e9a5e41cb1e141e80", "parentMaxRSSKiB": 187824, "workerRSSKiB": null}+{"arm": "after", "trial": 2, "language": "typescript", "count": 1500, "sourceBytes": 138779, "importMs": 427.82814099999996, "firstInspectMs": 142.96878099999998, "coldTotalMs": 570.796922, "warmMs": [108.201142, 88.37492199999997, 63.07927799999993, 20.817426999999952, 21.457446000000004, 22.213617999999997, 23.385214999999903, 23.458648999999923, 36.138423999999986, 40.783919999999966], "outputHash": "9f622b94732b835cff58c3ba2f849aa3304270fa1bb4b11e9a5e41cb1e141e80", "parentMaxRSSKiB": 182692, "workerRSSKiB": null}+{"arm": "before", "trial": 3, "language": "typescript", "count": 1500, "sourceBytes": 138779, "importMs": 436.94211600000006, "firstInspectMs": 161.86028299999992, "coldTotalMs": 598.8023989999999, "warmMs": [105.48207100000002, 87.65060599999993, 41.175738000000024, 44.13999799999999, 35.756303, 36.14517999999998, 36.200198, 27.45716300000015, 29.534546999999975, 26.37405200000012], "outputHash": "9f622b94732b835cff58c3ba2f849aa3304270fa1bb4b11e9a5e41cb1e141e80", "parentMaxRSSKiB": 181848, "workerRSSKiB": null}+{"arm": "after", "trial": 3, "language": "typescript", "count": 1500, "sourceBytes": 138779, "importMs": 586.961859, "firstInspectMs": 161.140491, "coldTotalMs": 748.10235, "warmMs": [108.15880100000004, 114.14014800000007, 53.36402900000007, 37.123412000000144, 34.888651999999865, 33.57789200000002, 33.6040680000001, 34.18891200000007, 35.858035999999856, 34.618204000000105], "outputHash": "9f622b94732b835cff58c3ba2f849aa3304270fa1bb4b11e9a5e41cb1e141e80", "parentMaxRSSKiB": 180260, "workerRSSKiB": null}+{"arm": "before", "trial": 4, "language": "typescript", "count": 1500, "sourceBytes": 138779, "importMs": 433.763053, "firstInspectMs": 154.29449300000005, "coldTotalMs": 588.057546, "warmMs": [95.4240329999999, 96.01548200000002, 33.206946000000016, 22.30215300000009, 36.63349900000003, 22.088609999999903, 18.898955, 20.513480000000072, 36.7211430000001, 22.025308999999993], "outputHash": "9f622b94732b835cff58c3ba2f849aa3304270fa1bb4b11e9a5e41cb1e141e80", "parentMaxRSSKiB": 181576, "workerRSSKiB": null}+{"arm": "after", "trial": 4, "language": "typescript", "count": 1500, "sourceBytes": 138779, "importMs": 580.398206, "firstInspectMs": 198.61478499999998, "coldTotalMs": 779.0129909999999, "warmMs": [132.77812300000005, 58.76169899999991, 75.96188999999993, 36.433584999999994, 37.021167000000105, 36.659025000000156, 40.54892199999995, 35.855798999999934, 34.91765499999997, 33.67135600000006], "outputHash": "9f622b94732b835cff58c3ba2f849aa3304270fa1bb4b11e9a5e41cb1e141e80", "parentMaxRSSKiB": 182788, "workerRSSKiB": null}diff --git a/specs/tree-sitter/assets/query-confirmation.jsonl b/specs/tree-sitter/assets/query-confirmation.jsonlnew file mode 100644index 0000000..6ba03c1--- /dev/null+++ b/specs/tree-sitter/assets/query-confirmation.jsonl@@ -0,0 +1,20 @@+{"arm": "after", "trial": 0, "language": "python", "count": 100, "sourceBytes": 7079, "importMs": 419.559079, "firstInspectMs": 101.009457, "coldTotalMs": 520.568536, "warmMs": [67.77063199999998, 10.477176999999983, 9.564754999999991, 8.401895000000081, 6.532903000000033, 5.468711999999982, 6.40119500000003, 6.77003400000001, 7.697994999999992, 7.770851999999991], "outputHash": "d60eb4dcc07256979253ba72b530788056b0a1b609a8e8958f1b69d9ba4354c7", "parentMaxRSSKiB": 133924, "workerRSSKiB": 74096}+{"arm": "after", "trial": 1, "language": "python", "count": 100, "sourceBytes": 7079, "importMs": 455.978165, "firstInspectMs": 85.59142199999997, "coldTotalMs": 541.569587, "warmMs": [14.929965999999922, 6.142135000000053, 7.286379000000011, 6.020771999999965, 6.094395000000077, 5.318065999999931, 6.558597999999961, 7.265985999999998, 5.424342999999908, 6.348768000000064], "outputHash": "d60eb4dcc07256979253ba72b530788056b0a1b609a8e8958f1b69d9ba4354c7", "parentMaxRSSKiB": 136476, "workerRSSKiB": 75176}+{"arm": "after", "trial": 2, "language": "python", "count": 100, "sourceBytes": 7079, "importMs": 416.908488, "firstInspectMs": 88.19278599999996, "coldTotalMs": 505.10127399999993, "warmMs": [14.707817000000091, 6.517470000000003, 6.11291499999993, 9.25294400000007, 6.703484000000003, 5.022337999999991, 6.507470000000012, 8.825290999999993, 31.555674000000067, 8.132725999999934], "outputHash": "d60eb4dcc07256979253ba72b530788056b0a1b609a8e8958f1b69d9ba4354c7", "parentMaxRSSKiB": 136044, "workerRSSKiB": 76504}+{"arm": "after", "trial": 3, "language": "python", "count": 100, "sourceBytes": 7079, "importMs": 449.92780899999997, "firstInspectMs": 88.68537100000003, "coldTotalMs": 538.61318, "warmMs": [31.637506999999914, 6.5587730000000874, 6.101658000000043, 6.234935999999948, 6.103550000000041, 4.806954000000019, 5.9160459999999375, 4.911685000000034, 4.823750000000018, 4.524179000000004], "outputHash": "d60eb4dcc07256979253ba72b530788056b0a1b609a8e8958f1b69d9ba4354c7", "parentMaxRSSKiB": 136340, "workerRSSKiB": 71908}+{"arm": "after", "trial": 4, "language": "python", "count": 100, "sourceBytes": 7079, "importMs": 420.95918600000005, "firstInspectMs": 120.488967, "coldTotalMs": 541.448153, "warmMs": [62.816553, 10.371637999999962, 10.476687999999967, 10.386143999999945, 8.148490000000038, 9.60127, 8.54372699999999, 9.028214999999932, 7.99851799999999, 7.625122000000033], "outputHash": "d60eb4dcc07256979253ba72b530788056b0a1b609a8e8958f1b69d9ba4354c7", "parentMaxRSSKiB": 136416, "workerRSSKiB": 76384}+{"arm": "after", "trial": 0, "language": "python", "count": 1500, "sourceBytes": 110279, "importMs": 464.409217, "firstInspectMs": 216.3683719999999, "coldTotalMs": 680.7775889999999, "warmMs": [82.49291800000003, 84.48440999999991, 70.65308299999992, 64.3482029999999, 64.34007900000006, 67.54317100000003, 63.40586300000018, 61.52279200000021, 65.86222199999997, 62.03728099999989], "outputHash": "c044306aed312c9472b0205d1915ed3865055822a03ac36a0f1a5c492c98589b", "parentMaxRSSKiB": 148628, "workerRSSKiB": 99448}+{"arm": "after", "trial": 1, "language": "python", "count": 1500, "sourceBytes": 110279, "importMs": 403.569904, "firstInspectMs": 222.38082199999997, "coldTotalMs": 625.9507259999999, "warmMs": [75.578846, 75.96798799999999, 61.743548999999916, 58.96085500000004, 60.16723400000001, 61.164190999999846, 63.946707999999944, 59.43543599999998, 60.80761699999994, 57.47740500000009], "outputHash": "c044306aed312c9472b0205d1915ed3865055822a03ac36a0f1a5c492c98589b", "parentMaxRSSKiB": 149304, "workerRSSKiB": 106624}+{"arm": "after", "trial": 2, "language": "python", "count": 1500, "sourceBytes": 110279, "importMs": 422.41599799999995, "firstInspectMs": 195.24631399999998, "coldTotalMs": 617.6623119999999, "warmMs": [89.0456559999999, 74.81057999999996, 60.793008999999984, 57.23359700000003, 64.40792999999996, 64.62113399999998, 73.43545199999994, 94.78663800000004, 104.34809300000006, 81.8252100000002], "outputHash": "c044306aed312c9472b0205d1915ed3865055822a03ac36a0f1a5c492c98589b", "parentMaxRSSKiB": 146936, "workerRSSKiB": 101192}+{"arm": "after", "trial": 3, "language": "python", "count": 1500, "sourceBytes": 110279, "importMs": 538.798334, "firstInspectMs": 281.094161, "coldTotalMs": 819.8924949999999, "warmMs": [82.01409699999999, 88.88230499999997, 97.68050200000016, 81.61230300000011, 94.65847100000019, 96.55309800000009, 73.08011899999997, 57.25798499999996, 56.176001999999926, 58.73494699999992], "outputHash": "c044306aed312c9472b0205d1915ed3865055822a03ac36a0f1a5c492c98589b", "parentMaxRSSKiB": 150944, "workerRSSKiB": 101808}+{"arm": "after", "trial": 4, "language": "python", "count": 1500, "sourceBytes": 110279, "importMs": 577.235045, "firstInspectMs": 285.891023, "coldTotalMs": 863.126068, "warmMs": [115.58239700000001, 110.63283100000001, 103.831232, 106.09513700000002, 77.132386, 59.08212000000003, 70.74507399999993, 66.76484099999993, 60.09056099999998, 65.4426390000001], "outputHash": "c044306aed312c9472b0205d1915ed3865055822a03ac36a0f1a5c492c98589b", "parentMaxRSSKiB": 145752, "workerRSSKiB": 106576}+{"arm": "after", "trial": 0, "language": "typescript", "count": 100, "sourceBytes": 8979, "importMs": 435.281713, "firstInspectMs": 22.467630999999983, "coldTotalMs": 457.749344, "warmMs": [11.827151000000015, 10.480025000000012, 8.081456000000003, 8.623692000000005, 5.892873000000009, 4.924533999999994, 6.124071000000072, 5.871729000000073, 5.640795999999909, 10.66969400000005], "outputHash": "f95f65599da0d758fa702b41aab26262ed270e156330686e91bd4b344cb3f329", "parentMaxRSSKiB": 137372, "workerRSSKiB": null}+{"arm": "after", "trial": 1, "language": "typescript", "count": 100, "sourceBytes": 8979, "importMs": 433.86358600000005, "firstInspectMs": 25.66138099999995, "coldTotalMs": 459.52496699999995, "warmMs": [14.62369000000001, 11.264092000000005, 9.006312999999977, 10.191175000000044, 8.865987999999902, 8.999220000000037, 9.134106999999972, 8.597698000000037, 8.97302000000002, 19.515195000000062], "outputHash": "f95f65599da0d758fa702b41aab26262ed270e156330686e91bd4b344cb3f329", "parentMaxRSSKiB": 139664, "workerRSSKiB": null}+{"arm": "after", "trial": 2, "language": "typescript", "count": 100, "sourceBytes": 8979, "importMs": 462.68861599999997, "firstInspectMs": 25.307571999999993, "coldTotalMs": 487.99618799999996, "warmMs": [13.14155900000003, 10.315673999999944, 7.301376000000005, 7.735119999999938, 7.422533000000044, 5.854165999999964, 6.6663899999999785, 6.789442000000008, 5.756738000000041, 7.682344000000057], "outputHash": "f95f65599da0d758fa702b41aab26262ed270e156330686e91bd4b344cb3f329", "parentMaxRSSKiB": 138500, "workerRSSKiB": null}+{"arm": "after", "trial": 3, "language": "typescript", "count": 100, "sourceBytes": 8979, "importMs": 471.97276899999997, "firstInspectMs": 25.730715000000032, "coldTotalMs": 497.703484, "warmMs": [13.833284000000049, 10.538289000000077, 8.638938999999937, 9.524509999999964, 8.038233999999989, 7.114845000000059, 13.403936000000044, 10.455625999999938, 5.846058000000085, 6.764090999999894], "outputHash": "f95f65599da0d758fa702b41aab26262ed270e156330686e91bd4b344cb3f329", "parentMaxRSSKiB": 137956, "workerRSSKiB": null}+{"arm": "after", "trial": 4, "language": "typescript", "count": 100, "sourceBytes": 8979, "importMs": 500.99916499999995, "firstInspectMs": 31.34562500000004, "coldTotalMs": 532.34479, "warmMs": [15.996431999999913, 11.664337000000046, 9.54529500000001, 8.023356000000035, 7.614408000000026, 7.242311000000086, 7.987967000000026, 7.615831999999955, 5.655719999999974, 9.957460000000083], "outputHash": "f95f65599da0d758fa702b41aab26262ed270e156330686e91bd4b344cb3f329", "parentMaxRSSKiB": 138660, "workerRSSKiB": null}+{"arm": "after", "trial": 0, "language": "typescript", "count": 1500, "sourceBytes": 138779, "importMs": 556.7939359999999, "firstInspectMs": 134.03595900000005, "coldTotalMs": 690.829895, "warmMs": [143.94003299999997, 90.21560399999998, 36.928061999999954, 25.120036000000027, 29.52185600000007, 32.15813099999991, 21.322004000000106, 26.42033399999991, 31.794773000000077, 30.238432999999986], "outputHash": "9f622b94732b835cff58c3ba2f849aa3304270fa1bb4b11e9a5e41cb1e141e80", "parentMaxRSSKiB": 185632, "workerRSSKiB": null}+{"arm": "after", "trial": 1, "language": "typescript", "count": 1500, "sourceBytes": 138779, "importMs": 549.598677, "firstInspectMs": 159.13417400000003, "coldTotalMs": 708.732851, "warmMs": [93.08231799999999, 65.36234300000001, 27.760828999999944, 46.25024199999996, 23.19944099999998, 22.99337800000012, 22.804707000000008, 29.52491699999996, 21.940302999999858, 21.493992000000162], "outputHash": "9f622b94732b835cff58c3ba2f849aa3304270fa1bb4b11e9a5e41cb1e141e80", "parentMaxRSSKiB": 179336, "workerRSSKiB": null}+{"arm": "after", "trial": 2, "language": "typescript", "count": 1500, "sourceBytes": 138779, "importMs": 405.15084900000005, "firstInspectMs": 138.06007299999993, "coldTotalMs": 543.210922, "warmMs": [94.71060999999997, 44.43424500000003, 66.65764100000001, 19.52935500000001, 25.314292000000023, 20.70780400000001, 19.947564000000057, 22.38648699999999, 26.422396999999933, 20.79472199999998], "outputHash": "9f622b94732b835cff58c3ba2f849aa3304270fa1bb4b11e9a5e41cb1e141e80", "parentMaxRSSKiB": 181364, "workerRSSKiB": null}+{"arm": "after", "trial": 3, "language": "typescript", "count": 1500, "sourceBytes": 138779, "importMs": 395.277149, "firstInspectMs": 130.51637099999994, "coldTotalMs": 525.79352, "warmMs": [101.724152, 93.53675099999998, 71.83164499999998, 29.84302200000002, 26.539595000000077, 32.89271099999996, 19.309078999999997, 21.147212999999965, 31.346670000000017, 23.76565800000003], "outputHash": "9f622b94732b835cff58c3ba2f849aa3304270fa1bb4b11e9a5e41cb1e141e80", "parentMaxRSSKiB": 182100, "workerRSSKiB": null}+{"arm": "after", "trial": 4, "language": "typescript", "count": 1500, "sourceBytes": 138779, "importMs": 391.821507, "firstInspectMs": 134.30381200000005, "coldTotalMs": 526.1253190000001, "warmMs": [94.94887700000004, 78.89439200000004, 28.39608599999997, 25.562427999999954, 31.773776999999995, 19.84723299999996, 19.887569999999982, 20.41116599999998, 18.20050100000003, 19.357095999999956], "outputHash": "9f622b94732b835cff58c3ba2f849aa3304270fa1bb4b11e9a5e41cb1e141e80", "parentMaxRSSKiB": 179720, "workerRSSKiB": null}diff --git a/specs/tree-sitter/summarize.py b/specs/tree-sitter/summarize.pynew file mode 100644index 0000000..ac889e4--- /dev/null+++ b/specs/tree-sitter/summarize.py@@ -0,0 +1,96 @@+"""Generate RESULTS.md from the final paired benchmark, not hand-edited timings."""+import json+from pathlib import Path+from statistics import median+root=Path(__file__).resolve().parent+records=[json.loads(line) for line in (root/'assets/confirmation.jsonl').read_text().splitlines()]+rows=[row for row in records if 'arm' in row]+text='''# Tree-sitter replacement results++Performance Improvement++Fixed baseline: upstream `2dc1d3c`. Five fresh processes per arm/workload,+interleaved before/after in Docker (Linux/amd64, Node 22, two CPUs, 2 GiB,+network disabled). Each process measures the first production `inspect()` call+and ten subsequent calls on new snapshots. No provider calls were made.++Cold time includes importing the source module and starting the parser worker;+it excludes container/Node process launch. Warm time is the median of ten calls,+then the median across five processes. These are local inspection measurements,+not end-to-end search latency. Output SHA-256 hashes match between arms for every+fixture. The source files contain Unicode comments and function bodies.++| Language | Declarations | Cold before → after (ms) | Cold reduction | Warm before → after (ms) | Warm change |+|---|---:|---:|---:|---:|---:|+'''+for lang in ['python','typescript']:+ for count in [100,1500]:+ arms=[[r for r in rows if r['arm']==arm and r['language']==lang and r['count']==count] for arm in ['before','after']]+ assert all(len(a)==5 for a in arms)+ assert len({r['outputHash'] for a in arms for r in a})==1+ cold=[median(r['coldTotalMs'] for r in a) for a in arms]+ warm=[median(median(r['warmMs']) for r in a) for a in arms]+ text+=f'| {lang} | {count:,} | {cold[0]:.1f} → {cold[1]:.1f} | {(1-cold[1]/cold[0])*100:.1f}% | {warm[0]:.2f} → {warm[1]:.2f} | {(warm[1]/warm[0]-1)*100:+.1f}% |\n'+text+='''+Negative warm change means faster. TypeScript is unchanged and is included as a+noise/control workload; its fluctuations are not attributed to Tree-sitter.+The supported performance claim is lower cold Python inspection latency.+Earlier cohorts included warm regressions, and the unchanged TypeScript control+also fluctuates. Treat warm differences as noisy, not a general speedup.++| Python declarations | Worker RSS before → after (MiB) |+|---|---:|+'''+for count in [100,1500]:+ rss=[median(r['workerRSSKiB']/1024 for r in rows if r['arm']==arm and r['language']=='python' and r['count']==count) for arm in ['before','after']]+ text+=f'| {count:,} | {rss[0]:.1f} → {rss[1]:.1f} |\n'+text+='''+Worker RSS is a Linux `/proc` snapshot after the repeated inspections, not peak+whole-search memory. Parent peak RSS is retained in the raw data separately.++## Language support and correctness++Python uses Tree-sitter; TypeScript/JavaScript retain their compiler parser.+Go and Rust now provide named declarations. Tests cover Go functions, receivers,+types, variables, constants and grouped specs; Rust functions, impls, traits,+modules, attributes and foreign declarations. Installed tests assert that large+Go/Rust files send named declarations in role previews and selection requests,+and return their locations. This proves structural coverage, not language-server+semantics, provider accuracy or support for every Tree-sitter grammar.++Python-specific preview, neighbourhood and inherited-call analyses remain+Python-specific. Frozen test-only Python helpers check compatible outputs.+Modern Python syntax is accepted; Tree-sitter is not a CPython semantic validator.+Bare-CR Python uses lossless text fallback; LF and CRLF structural parsing work.+Missing/corrupt packaged assets fail closed; no runtime parser downloads, Python+installation, native compiler or repository-source execution is required.++## Reproduction and evidence++Create a separate clean checkout at `2dc1d3c`, then from this branch run:++```sh+python3 test/parser/run-tree-sitter-bench.py /path/to/baseline > specs/tree-sitter/assets/confirmation.jsonl+python3 specs/tree-sitter/summarize.py+```++The runner builds both actual source images and records image identities and+candidate source hashes. Both use exactly the same benchmark script. It rejects+output mismatches and unsupported benchmark language labels.++[Final raw data](assets/confirmation.jsonl),+[initial cohort](assets/development.jsonl), and+[query-development confirmation](assets/query-confirmation.jsonl), and+[pre-review confirmation](assets/pre-review-confirmation.jsonl) retain all+recorded trials. The initial implementation improved startup but regressed warm+inspection; syntax-node filtering was revised before final confirmation.+See [review disposition](REVIEW.md) and [validation](VALIDATION.md).++These measurements precede the final Python-only scope and call-context fixes.+[Final validation](VALIDATION.md) records the integrated candidate separately.++Limits of this cohort: synthetic inspection fixtures; no paid/live-provider evaluation, macOS,+ARM, full repository search-latency benchmark, or integration with the separate+unsubmitted calibration/parsed-reuse branches. This cohort is historical evidence rather than a timing guarantee for the final merge.+'''+(root/'RESULTS.md').write_text(text)diff --git a/test/installed.test.mjs b/test/installed.test.mjsindex 82a1efd..0756abd 100644--- a/test/installed.test.mjs+++ b/test/installed.test.mjs@@ -988,15 +988,14 @@ test("source budget preserves every file and lead while explicitly omitting sourassertCachedRequestsAreReused(fixture.requests, before);});-test("missing or corrupt packaged Python assets fail closed without downloads", async (t) => {+test("missing or corrupt packaged parser assets fail closed without downloads", async (t) => {const scratch = await mkdtemp(join(tmpdir(), "jg-missing-python-"));t.after(() => rm(scratch, { recursive: true, force: true }));for (const [asset, corrupt] of [- ["dist/bin/python-worker.mjs", false],- ["dist/assets/python/inspect.py", false],- ["node_modules/pyodide/pyodide.asm.wasm", false],- ["node_modules/pyodide/python_stdlib.zip", false],- ["node_modules/pyodide/pyodide.asm.wasm", true],+ ["dist/bin/parser-worker.mjs", false],+ ["dist/assets/tree-sitter/tree-sitter-python.wasm", false],+ ["node_modules/web-tree-sitter/web-tree-sitter.wasm", false],+ ["dist/assets/tree-sitter/tree-sitter-python.wasm", true],]) {const copy = join(scratch, "package");await cp(packageDirectory, copy, { recursive: true, dereference: true });diff --git a/test/parser/README.md b/test/parser/README.mdindex b77f624..0a2f835 100644--- a/test/parser/README.md+++ b/test/parser/README.md@@ -1,13 +1,25 @@# Parser behavior-These tests cover source coordinates, Unicode byte boundaries, decorators,-comments, invalid-syntax fallback, structural class ownership and cancellation.-They exercise the bundled Python runtime and TypeScript parser directly, without-requiring a system Python installation or matching a historical spike.+Tests cover original source coordinates, Unicode boundaries, declaration owners,+syntax fallback and cancellation through the production inspection API. Unsupported languages retain lossless text fallback.-Keep selected units tied to their immutable source snapshot. Splitting large-units must preserve source bytes, and duplicate declaration names must not attach-the wrong class context. A malformed source file may use text fallback; a broken-bundled runtime must surface a setup failure.+Python helpers in `reference/` are frozen test-only oracles from the replaced+runtime. Differential fixtures compare declaration, preview, neighbourhood and+inherited-call output using system Python in the test container. They are never+shipped or executed by the CLI. Tree-sitter also recognizes modern Python syntax;+it is not a CPython semantic validator. Python preview class-header context stops+before the first member's decorators; the frozen CPython helper includes the+first decorator line in that header. Decorators remain attached to the member's+source. Neighbourhood ranges may also arrive in a different order; consumers+combine them as ranges rather than relying on helper order.-Run `bun run test:parser` for isolated Docker checks and packaged CLI coverage.+Build once (`bun scripts/build-cli.ts`) before running source parser tests: the+build copies pinned official grammar WASM into the generated assets directory.+`bun run dev` prepares these assets automatically.+`bun run test:parser` does this in Docker and checks the installed package too.+Missing/corrupt parser assets are setup errors, never silently downloaded or+misrepresented as malformed user source.++Inherited-call tests preserve useful reading leads when a receiver or callee is+parenthesized, or a selected excerpt contains only a multiline call’s opening+line. They assert returned locations rather than the grammar’s node shape.diff --git a/test/parser/call-leads.test.ts b/test/parser/call-leads.test.tsnew file mode 100644index 0000000..e27cd81--- /dev/null+++ b/test/parser/call-leads.test.ts@@ -0,0 +1,170 @@+import { test } from "node:test";+import assert from "node:assert/strict";+import { runParser } from "../../packages/core/src/parser.ts";+const source = (body) => "class Base:\n def helper(self): return 1\nclass Child(Base):\n" + body;+test("parenthesized calls and receivers retain inherited-method reading leads", async () => {+ for (const call of ["(self).helper()", "(self.helper)()", "((self).helper)()"])+ assert.deepEqual(+ await runParser(+ "calls",+ JSON.stringify({+ source: source(` def target(self):\n return ${call}\n`),+ ranges: [{ startLine: 5, endLine: 5 }],+ }),+ ),+ [+ {+ caller: "Child.target",+ name: "Base.helper",+ startLine: 2,+ endLine: 2,+ unknownEarlierBases: [],+ ownerHeader: { startLine: 1, endLine: 1 },+ },+ ],+ call,+ );+});+test("comments inside parentheses preserve inherited-method reading leads", async () => {+ for (const call of [+ "(\n # receiver\n self\n ).helper()",+ "(\n # callee\n self.helper\n )()",+ ]) {+ const input = source(` def target(self):\n return ${call}\n`).replace(+ "Child(Base)",+ "Child(\n # base\n (Base)\n)",+ );+ assert.deepEqual(+ await runParser(+ "calls",+ JSON.stringify({ source: input, ranges: [{ startLine: 4, endLine: 20 }] }),+ ),+ [+ {+ caller: "Child.target",+ name: "Base.helper",+ startLine: 2,+ endLine: 2,+ unknownEarlierBases: [],+ ownerHeader: { startLine: 1, endLine: 1 },+ },+ ],+ );+ }+});+test("selecting a multiline call's opening line retains its inherited-method lead", async () => {+ const input = source(" def target(self):\n return self.helper(\n )\n");+ assert.deepEqual(+ await runParser(+ "calls",+ JSON.stringify({ source: input, ranges: [{ startLine: 5, endLine: 5 }] }),+ ),+ [+ {+ caller: "Child.target",+ name: "Base.helper",+ startLine: 2,+ endLine: 2,+ unknownEarlierBases: [],+ ownerHeader: { startLine: 1, endLine: 1 },+ },+ ],+ );+ assert.deepEqual(+ await runParser(+ "calls",+ JSON.stringify({ source: input, ranges: [{ startLine: 6, endLine: 6 }] }),+ ),+ [],+ );+});+test("writing an instance attribute preserves inherited self-call leads", async () => {+ const calls = await runParser(+ "calls",+ JSON.stringify({+ source: source(" def target(self):\n self.x = 1\n return self.helper()\n"),+ ranges: [{ startLine: 6, endLine: 6 }],+ }),+ );+ assert.deepEqual(calls, [+ {+ caller: "Child.target",+ name: "Base.helper",+ startLine: 2,+ endLine: 2,+ unknownEarlierBases: [],+ ownerHeader: { startLine: 1, endLine: 1 },+ },+ ]);+});+test("a keyword-rest argument named self is not an instance receiver", async () => {+ assert.deepEqual(+ await runParser(+ "calls",+ JSON.stringify({+ source: source(" def target(**self):\n return self.helper()\n"),+ ranges: [{ startLine: 5, endLine: 5 }],+ }),+ ),+ [],+ );+});+test("rebinding self suppresses leads while Unicode receiver identifiers normalize", async () => {+ for (const statement of [+ "self = other",+ "self, x = pair",+ "for self in things: pass",+ "with context() as self: pass",+ ]) {+ assert.deepEqual(+ await runParser(+ "calls",+ JSON.stringify({+ source: source(+ ` def target(self):\n ${statement}\n return self.helper()\n`,+ ),+ ranges: [{ startLine: 6, endLine: 6 }],+ }),+ ),+ [],+ );+ }+ const result = await runParser(+ "calls",+ JSON.stringify({+ source: source(" def target(ſelf):\n return ſelf.helper()\n"),+ ranges: [{ startLine: 5, endLine: 5 }],+ }),+ );+ assert.equal(result[0].name, "Base.helper");+});+test("keyword-only self and rebound receiver names do not create inherited-call leads", async () => {+ const examples = [+ " def target(*, self):\n return self.helper()\n",+ " def target(self):\n import module as self\n return self.helper()\n",+ " def target(self):\n try: pass\n except Error as self: return self.helper()\n",+ " def target(self):\n match value:\n case self: return self.helper()\n",+ ];+ for (const body of examples)+ assert.deepEqual(+ await runParser(+ "calls",+ JSON.stringify({ source: source(body), ranges: [{ startLine: 4, endLine: 12 }] }),+ ),+ [],+ body,+ );+});+test("parenthesized local base names still resolve inherited methods", async () => {+ const result = await runParser(+ "calls",+ JSON.stringify({+ source: source(" def target(self): return self.helper()\n").replace(+ "Child(Base)",+ "Child((Base))",+ ),+ ranges: [{ startLine: 4, endLine: 4 }],+ }),+ );+ assert.equal(result[0]?.name, "Base.helper");+});diff --git a/test/parser/parity.test.ts b/test/parser/parity.test.tsnew file mode 100644index 0000000..cad3f83--- /dev/null+++ b/test/parser/parity.test.ts@@ -0,0 +1,55 @@+import { test } from "node:test";+import assert from "node:assert/strict";+import { spawnSync } from "node:child_process";+import { fileURLToPath } from "node:url";+import { runParser } from "../../packages/core/src/parser.ts";+const reference = (helper: string, input: string) => {+ const result = spawnSync(+ "python3",+ ["-I", fileURLToPath(new URL(`./reference/python/${helper}.py`, import.meta.url))],+ { input, encoding: "utf8" },+ );+ assert.equal(result.status, 0, result.stderr);+ return JSON.parse(result.stdout);+};+test("Python declaration, preview, neighborhood and inherited-call outputs match the frozen helpers", async () => {+ const sources = [+ 'def target():\n ("' ++ "long docs ".repeat(100) ++ '" # comment\n "rest")\n return "implementation"\n',+ '@decorator\nclass Café:\n """doc"""\n @property\n def first(self):\n return "🙂"\n def second(self):\n return 2\n',+ 'class Root:\n def helper(self):\n return "🙂"\nclass Child(Root):\n def target(self):\n return self.helper()\n',+ 'class Root:\n def helper(self): pass\nclass Child(Unknown, Root):\n def target(self: "Child"):\n return self.helper()\n',+ "class A:\n def target(self):\n if True:\n return 1\n # trailing\n # class tail\n",+ 'def target(): "docs"; return "🙂 implementation"\n',+ 'def K():\n ("""long docs""")\n return "🙂 implementation"\n',+ "class Root:\n def helper(self): pass\nclass Child(Root):\n def target(self):\n with context() as self:\n return self.helper()\n",+ ];+ for (const base of sources)+ for (const ending of ["\n", "\r\n"]) {+ const source = (base + "# padding\n".repeat(200)).replaceAll("\n", ending);+ for (const helper of ["inspect", "neighborhood", "calls", "preview"] as const) {+ const input =+ helper === "inspect"+ ? source+ : JSON.stringify(+ helper === "preview"+ ? { path: "x.py", text: source, query: "target first K", budget: 600 }+ : {+ source,+ ranges: [+ {+ startLine: base.trimEnd().split("\n").length,+ endLine: base.trimEnd().split("\n").length,+ },+ ],+ },+ );+ assert.deepEqual(+ await runParser(helper, input),+ reference(helper, input),+ `${helper}: ${base}`,+ );+ }+ }+});diff --git a/packages/core/assets/python/calls.py b/test/parser/reference/python/calls.pysimilarity index 100%rename from packages/core/assets/python/calls.pyrename to test/parser/reference/python/calls.pydiff --git a/packages/core/assets/python/inspect.py b/test/parser/reference/python/inspect.pysimilarity index 100%rename from packages/core/assets/python/inspect.pyrename to test/parser/reference/python/inspect.pydiff --git a/packages/core/assets/python/neighborhood.py b/test/parser/reference/python/neighborhood.pysimilarity index 100%rename from packages/core/assets/python/neighborhood.pyrename to test/parser/reference/python/neighborhood.pydiff --git a/packages/core/assets/python/preview.py b/test/parser/reference/python/preview.pysimilarity index 100%rename from packages/core/assets/python/preview.pyrename to test/parser/reference/python/preview.pydiff --git a/test/parser/run-tree-sitter-bench.py b/test/parser/run-tree-sitter-bench.pynew file mode 100644index 0000000..6fc228e--- /dev/null+++ b/test/parser/run-tree-sitter-bench.py@@ -0,0 +1,36 @@+"""Compare fixed upstream and this checkout; stdout is JSONL, diagnostics go to stderr."""+import argparse+import hashlib+import json+from pathlib import Path+import subprocess+import sys++parser = argparse.ArgumentParser()+parser.add_argument("baseline", type=Path, help="clean checkout of 2dc1d3c")+args = parser.parse_args()+candidate = Path(__file__).resolve().parents[2]+baseline = args.baseline.resolve()+commit = subprocess.check_output(["git", "rev-parse", "HEAD"], cwd=baseline, text=True).strip()+if not commit.startswith("2dc1d3c"):+ raise SystemExit("Baseline must be upstream 2dc1d3c")+subprocess.run(["git", "diff", "--quiet", "HEAD", "--"], cwd=baseline, check=True)+images = {}+for arm, root in [("before", baseline), ("after", candidate)]:+ image = "jevgrep-tree-bench-" + arm+ subprocess.run(["docker", "build", "-q", "-f", "test/Dockerfile", "-t", image, "."], cwd=root, stdout=sys.stderr, check=True, timeout=600)+ images[arm] = subprocess.check_output(["docker", "image", "inspect", image, "--format", "{{.Id}}"], text=True).strip()+metadata = {"baseline": commit, "images": images, "sourceSHA256": {str(p.relative_to(candidate)): hashlib.sha256(p.read_bytes()).hexdigest() for p in sorted((candidate / "packages/core/src").iterdir()) if p.is_file()}, "node": "22 (image)", "cpus": 2, "memory": "2g"}+print(json.dumps({"metadata": metadata}), flush=True)+for language in ["python", "typescript"]:+ for count in [100, 1500]:+ hashes = set()+ for trial in range(5):+ for arm in ["before", "after"]:+ command = ["docker", "run", "--rm", "--network", "none", "--read-only", "--cpus", "2", "--memory", "2g", "--tmpfs", "/tmp", "-v", str(candidate / "test/parser/tree-sitter.bench.mjs") + ":/work/test/parser/tree-sitter.bench.mjs:ro", images[arm], "node", "--experimental-strip-types", "test/parser/tree-sitter.bench.mjs", language, str(count)]+ result = subprocess.run(command, text=True, capture_output=True, timeout=45, check=True)+ row = json.loads(result.stdout)+ hashes.add(row["outputHash"])+ print(json.dumps(dict(arm=arm, trial=trial, **row)), flush=True)+ if len(hashes) != 1:+ raise SystemExit(f"Output mismatch for {language}/{count}")diff --git a/test/parser/source.test.ts b/test/parser/source.test.tsindex 5e480c0..caa5674 100644--- a/test/parser/source.test.ts+++ b/test/parser/source.test.ts@@ -21,6 +21,38 @@ test("Python preserves decorators, class context and nested declarations", asyncassert.deepEqual(result.comments, [{ startLine: 1, endLine: 1 }]);});+test("comments between adjacent byte strings preserve structural source selection", async () => {+ const source = "def target():\n return (b'a' # comment\n b'b')\n";+ const snapshot = { path: "sample.py", contentHash: "fixture", source };+ const result = await inspect(snapshot);+ assert.equal(result.mode, "python");+ assert.deepEqual(+ result.units.map(({ name, range }) => ({ name, ...range })),+ [{ name: "target", startLine: 1, endLine: 3 }],+ );+ const { sourceForUnit } = await import("../../packages/core/src/source.ts");+ assert.equal(sourceForUnit(snapshot, result.units[0]!), source);+});++test("parenthesized deletion targets preserve Python declaration ranges", async () => {+ for (const target of [+ "(self.cached)",+ "(\n # target\n self.cached\n )",+ "((items[0]))",+ ]) {+ const source = `def target(self, items):\n del ${target}\n`;+ const snapshot = { path: "sample.py", contentHash: "fixture", source };+ const result = await inspect(snapshot);+ assert.equal(result.mode, "python");+ assert.deepEqual(+ result.units.map(({ name, range }) => ({ name, ...range })),+ [{ name: "target", startLine: 1, endLine: source.trimEnd().split("\n").length }],+ );+ const { sourceForUnit } = await import("../../packages/core/src/source.ts");+ assert.equal(sourceForUnit(snapshot, result.units[0]!), source);+ }+});+test("syntax errors and unsupported source fall back without losing source lines", async () => {for (const [path, source, reason] of [["bad.py", "def broken(:\n return 2\n", "syntax"],@@ -102,7 +134,7 @@ test("TS/JS uses original source coordinates, comments, and decorator-bearing me]);});-test("syntax outside reference Python 3.11 falls back across inspection, preview and neighbors", async () => {+test("unsupported Python 2 syntax falls back across inspection, preview and neighbors", async () => {const { pythonNeighborhood, pythonPreview, sourceForUnit } =await import("../../packages/core/src/source.ts");for (const source of [@@ -121,14 +153,6 @@ test("syntax outside reference Python 3.11 falls back across inspection, preview"def target((first, second)):\n return first\n","def target((first, second)=(1, 2)):\n return first\n","value = lambda (first, second): first\n",- "type Alias = int\n",- "def target[T](value: T):\n return value\n",- 'value = f"{mapping["key"]}"\n',- "value = f\"{'\\n'}\"\n",- 'value = f"""{value # comment\n}"""\n',- 'value = f"{(value +\n other)}"\n',- "value = f'{1:{mapping['width']}}'\n",- "value = f'{1:{\"\\n\"}}'\n",]) {const snapshot = {path: "old.py",@@ -155,6 +179,14 @@ test("syntax outside reference Python 3.11 falls back across inspection, previewtest("Python 3 equivalents and Python 2-looking strings remain parsed", async () => {for (const source of [+ "type Alias = int\n",+ "def target[T](value: T):\n return value\n",+ 'value = f"{mapping["key"]}"\n',+ "value = f\"{'\\n'}\"\n",+ 'value = f"""{value # comment\n}"""\n',+ 'value = f"{(value +\n other)}"\n',+ "value = f'{1:{mapping['width']}}'\n",+ "value = f'{1:{\"\\n\"}}'\n",'print("old")\n',"print >> stream, value\n","print +1\nprint [1,2]\n",diff --git a/test/parser/tree-sitter.bench.mjs b/test/parser/tree-sitter.bench.mjsnew file mode 100644index 0000000..4c7d7e2--- /dev/null+++ b/test/parser/tree-sitter.bench.mjs@@ -0,0 +1,54 @@+import { createHash } from "node:crypto";+import { readFile } from "node:fs/promises";+import { ChildProcess } from "node:child_process";+const [language = "python", countText = "100"] = process.argv.slice(2),+ count = Number(countText);+if (!["python", "typescript"].includes(language) || !Number.isSafeInteger(count) || count < 1)+ throw new Error("Use python or typescript and a positive declaration count");+let child;+const emit = ChildProcess.prototype.emit;+ChildProcess.prototype.emit = function (event, ...args) {+ if (event === "spawn") child = this;+ return emit.call(this, event, ...args);+};+const source = Array.from({ length: count }, (_, i) =>+ language === "python"+ ? `def target_${i}(value):\n # original 🙂 bytes\n return value + ${i}\n`+ : `export function target_${i}(value: number) {\n // original 🙂 bytes\n return value + ${i};\n}\n`,+).join("\n");+const snapshot = {+ source,+ path: language === "python" ? "fixture.py" : "fixture.ts",+ contentHash: "fixture",+};+const start = performance.now();+const { inspect } = await import("../../packages/core/src/source.ts");+const before = performance.now();+const result = await inspect(snapshot);+const after = performance.now();+const warm = [];+for (let i = 0; i < 10; i++) {+ const t = performance.now();+ await inspect({ ...snapshot });+ warm.push(performance.now() - t);+}+const digest = createHash("sha256").update(JSON.stringify(result)).digest("hex");+let workerRSSKiB = null;+if (child?.pid) {+ const status = await readFile(`/proc/${child.pid}/status`, "utf8");+ workerRSSKiB = Number(/VmRSS:\s+(\d+)/.exec(status)?.[1]);+}+console.log(+ JSON.stringify({+ language,+ count,+ sourceBytes: Buffer.byteLength(source),+ importMs: before - start,+ firstInspectMs: after - before,+ coldTotalMs: after - start,+ warmMs: warm,+ outputHash: digest,+ parentMaxRSSKiB: process.resourceUsage().maxRSS,+ workerRSSKiB,+ }),+);diff --git a/test/parser/cpython.test.ts b/test/parser/worker.test.tssimilarity index 80%rename from test/parser/cpython.test.tsrename to test/parser/worker.test.tsindex e3d955c..9ab6d19 100644--- a/test/parser/cpython.test.ts+++ b/test/parser/worker.test.ts@@ -2,7 +2,7 @@ import { test } from "node:test";import assert from "node:assert/strict";import { inspect } from "../../packages/core/src/source.ts";-test("CPython decorator coordinates and invalid AST syntax retain Python language semantics", async () => {+test("Python decorator coordinates and malformed syntax retain structural boundaries", async () => {const snapshot = (source: string) => ({ path: "sample.py", source, contentHash: "fixture" });const decorated = await inspect(snapshot("@(\n decorator\n)\ndef target():\n return 1\n"));assert.deepEqual(@@ -19,24 +19,24 @@ test("CPython decorator coordinates and invalid AST syntax retain Python languag});test("cancelled Python startup and active work recover without losing the next request", async () => {- const { runPython } = await import("../../packages/core/src/python.ts");+ const { runParser } = await import("../../packages/core/src/parser.ts");const first = new AbortController();- const pending = runPython("inspect", "def first():\n pass\n", first.signal);+ const pending = runParser("inspect", "def first():\n pass\n", first.signal);first.abort();await assert.rejects(pending, { name: "AbortError" });- assert.deepEqual(await runPython("inspect", "def recovered():\n pass\n"), [+ assert.deepEqual(await runParser("inspect", "def recovered():\n pass\n"), [{ name: "recovered", startLine: 1, endLine: 2, ownerHeaders: [] },]);const active = new AbortController();- const parsing = runPython("inspect", "value = 1\n".repeat(500_000), active.signal);+ const parsing = runParser("inspect", "value = 1\n".repeat(500_000), active.signal);const timer = setTimeout(() => active.abort(), 20);try {await assert.rejects(parsing, { name: "AbortError" });} finally {clearTimeout(timer);}- assert.equal(await runPython("inspect", "def broken():\n del 1\n"), null);- assert.deepEqual(await runPython("inspect", "def healthy():\n pass\n"), [+ assert.equal(await runParser("inspect", "def broken():\n del 1\n"), null);+ assert.deepEqual(await runParser("inspect", "def healthy():\n pass\n"), [{ name: "healthy", startLine: 1, endLine: 2, ownerHeaders: [] },]);});@@ -49,7 +49,7 @@ test("a completed Python helper does not keep the Node process alive", async ()"--experimental-strip-types","--input-type=module","-e",- `import { runPython } from ${JSON.stringify(new URL("../../packages/core/src/python.ts", import.meta.url).href)}; console.log(JSON.stringify(await runPython('inspect', 'def done():\\n pass\\n')));`,+ `import { runParser } from ${JSON.stringify(new URL("../../packages/core/src/parser.ts", import.meta.url).href)}; console.log(JSON.stringify(await runParser('inspect', 'def done():\\n pass\\n')));`,],{ stdio: ["ignore", "pipe", "pipe"] },);@@ -78,10 +78,10 @@ test("a completed Python helper does not keep the Node process alive", async ()});test("cancelling one query preserves unrelated concurrent Python work", async () => {- const { runPython } = await import("../../packages/core/src/python.ts");+ const { runParser } = await import("../../packages/core/src/parser.ts");const controller = new AbortController();- const cancelled = runPython("inspect", "value = 1\n".repeat(100_000), controller.signal);- const independent = runPython(+ const cancelled = runParser("inspect", "value = 1\n".repeat(100_000), controller.signal);+ const independent = runParser("inspect","def retained():\n pass\n",new AbortController().signal,@@ -98,6 +98,7 @@ test("oversized CR-only declarations retain every source byte in bounded units",const source = 'def target():\r return "' + "x".repeat(25_000) + '"\r';const snapshot = { path: "source.py", source, contentHash: "fixture" };const result = await inspect(snapshot);+ assert.equal(result.mode, "text"); // Bare CR is outside the LF source-coordinate contract.assert.equal(result.units.map((unit) => sourceForUnit(snapshot, unit)).join(""), source);assert.ok(result.units.every((unit) => Buffer.byteLength(sourceForUnit(snapshot, unit)) <= 24_000),@@ -108,7 +109,7 @@ test("repeated diamond inheritance resolves the same helper without exponential traversal",{ timeout: 120_000 },async () => {- const { runPython } = await import("../../packages/core/src/python.ts");+ const { runParser } = await import("../../packages/core/src/parser.ts");let source = "class Root:\n def helper(self):\n return 1\n";let parent = "Root";for (let i = 0; i < 24; i++) {@@ -117,7 +118,7 @@ test(}source += `class Leaf(${parent}):\n def target(self):\n return self.helper()\n`;const end = source.trimEnd().split("\n").length;- const actual = await runPython(+ const actual = await runParser("calls",JSON.stringify({ source, ranges: [{ startLine: end - 1, endLine: end }] }),);diff --git a/test/release.test.mjs b/test/release.test.mjsindex e111653..6892ae0 100644--- a/test/release.test.mjs+++ b/test/release.test.mjs@@ -8,7 +8,7 @@ const metadata = {publishConfig: { access: "public" },license: "MIT",engines: { node: ">=22" },- dependencies: { typescript: "5.9.3", pyodide: "0.25.1" },+ dependencies: { typescript: "5.9.3", "web-tree-sitter": "0.27.0" },};test("release tags select the authored version and keep prereleases off latest", () => {assert.deepEqual(releaseIdentity(metadata, "v1.2.3"), {@@ -88,13 +88,22 @@ test("archive validation rejects changed skill bytes and accidental source paylo"apps/cli/package.json": JSON.stringify(metadata),LICENSE: "MIT canonical copyright\n","skills/jevgrep/SKILL.md": "Use jg for unfamiliar code.\n",- "packages/core/src/python-worker.mjs": "// worker fixture",...Object.fromEntries(- ["inspect", "preview", "neighborhood", "calls"].map((name) => [- `packages/core/assets/python/${name}.py`,- `# ${name} helper fixture`,+ ["parser-worker", "parser-helpers", "parser-preview"].map((name) => [+ `packages/core/src/${name}.mjs`,+ "// fixture",]),),+ "packages/core/package.json": JSON.stringify({+ devDependencies: { "tree-sitter-python": "1.0.0" },+ }),+ "packages/core/node_modules/tree-sitter-python/package.json": JSON.stringify({+ name: "tree-sitter-python",+ version: "1.0.0",+ license: "MIT",+ }),+ "packages/core/node_modules/tree-sitter-python/LICENSE": "MIT fixture grammar license",+ "packages/core/assets/tree-sitter/tree-sitter-python.wasm": "Python grammar fixture",};for (const [path, text] of Object.entries(files)) {await mkdir(join(root, path, ".."), { recursive: true });@@ -104,44 +113,47 @@ test("archive validation rejects changed skill bytes and accidental source paylopkg = join(archiveRoot, "package");await mkdir(join(pkg, "dist/bin"), { recursive: true });await mkdir(join(pkg, "dist/skills/jevgrep"), { recursive: true });- await mkdir(join(pkg, "dist/assets/python"), { recursive: true });+ await mkdir(join(pkg, "dist/assets/tree-sitter"), { recursive: true });for (const [from, to] of [["apps/cli/package.json", "package.json"],["LICENSE", "dist/LICENSE"],["skills/jevgrep/SKILL.md", "dist/skills/jevgrep/SKILL.md"],- ["packages/core/src/python-worker.mjs", "dist/bin/python-worker.mjs"],- ...["inspect", "preview", "neighborhood", "calls"].map((name) => [- `packages/core/assets/python/${name}.py`,- `dist/assets/python/${name}.py`,+ ...["parser-worker", "parser-helpers", "parser-preview"].map((name) => [+ `packages/core/src/${name}.mjs`,+ `dist/bin/${name}.mjs`,]),+ [+ "packages/core/assets/tree-sitter/tree-sitter-python.wasm",+ "dist/assets/tree-sitter/tree-sitter-python.wasm",+ ],])await cp(join(root, from), join(pkg, to));await writeFile(join(pkg, "dist/bin/index.js"), '#!/usr/bin/env node\nconsole.log("jg");\n');await chmod(join(pkg, "dist/bin/index.js"), 0o755);- const { pythonRuntimeNotices } = await import("../scripts/package-notices.mjs");+ const { grammarAssets } = await import("../scripts/parser-assets.mjs");await writeFile(join(pkg, "dist/THIRD_PARTY_NOTICES.txt"),"Third-party notices for bundled JavaScript dependencies\n\n=== [email protected] (MIT) ===\nFixture license\n" +- (await pythonRuntimeNotices("0.25.1")),+ (await grammarAssets(root)),);const tarball = join(root, "package.tgz"),pack = () => execute("tar", ["-czf", tarball, "-C", archiveRoot, "package"]);const { validateRelease } = await import("../scripts/validate-release.mjs");await pack();assert.equal((await validateRelease(tarball, "v1.2.3", root)).version, "1.2.3");- await writeFile(join(pkg, "dist/bin/python-worker.mjs"), "changed worker");+ await writeFile(join(pkg, "dist/bin/parser-worker.mjs"), "changed worker");await pack();await assert.rejects(validateRelease(tarball, "v1.2.3", root), /canonical source/);await cp(- join(root, "packages/core/src/python-worker.mjs"),- join(pkg, "dist/bin/python-worker.mjs"),+ join(root, "packages/core/src/parser-worker.mjs"),+ join(pkg, "dist/bin/parser-worker.mjs"),);- await rm(join(pkg, "dist/assets/python/inspect.py"));+ await rm(join(pkg, "dist/assets/tree-sitter/tree-sitter-python.wasm"));await pack();await assert.rejects(validateRelease(tarball, "v1.2.3", root), /Missing packaged file/);await cp(- join(root, "packages/core/assets/python/inspect.py"),- join(pkg, "dist/assets/python/inspect.py"),+ join(root, "packages/core/assets/tree-sitter/tree-sitter-python.wasm"),+ join(pkg, "dist/assets/tree-sitter/tree-sitter-python.wasm"),);await writeFile(join(pkg, "dist/skills/jevgrep/SKILL.md"), "Changed skill");await pack();@@ -157,13 +169,9 @@ test("archive validation rejects changed skill bytes and accidental source payloawait assert.rejects(validateRelease(tarball, "v1.2.3", root), /Unexpected published file/);});-test("external Python runtime notices retain conflicting metadata and component provenance", async () => {- const { pythonRuntimeNotices } = await import("../scripts/package-notices.mjs");- const notices = await pythonRuntimeNotices("0.25.1");- assert.match(notices, /Mozilla Public License Version 2.0/);- assert.match(notices, /PYTHON SOFTWARE FOUNDATION LICENSE VERSION 2/);- assert.match(notices, /CPython 3.11.3/);- assert.match(notices, /github.com\/pyodide\/pyodide\/tree\/0.25.1/);- assert.match(notices, /Apache License/);- await assert.rejects(pythonRuntimeNotices("0.26.0"), /Review Python runtime notices/);+test("grammar notices retain the official Python parser license", async () => {+ const { grammarAssets } = await import("../scripts/parser-assets.mjs");+ const notices = await grammarAssets();+ assert.match(notices, /tree-sitter-python@/);+ assert.match(notices, /Permission is hereby granted/);});diff --git a/test/runtime.Dockerfile b/test/runtime.Dockerfileindex e0feb55..ddef29d 100644--- a/test/runtime.Dockerfile+++ b/test/runtime.Dockerfile@@ -11,7 +11,7 @@ COPY packages/typescript-config packages/typescript-configRUN bun install --frozen-lockfileCOPY apps/cli apps/cliCOPY packages/core packages/core-COPY scripts/build-cli.ts scripts/package-notices.mjs scripts/+COPY scripts/build-cli.ts scripts/package-notices.mjs scripts/parser-assets.mjs scripts/COPY scripts/licenses scripts/licensesCOPY LICENSE LICENSECOPY skills skills