codingest 0.2.34__tar.gz → 0.2.35__tar.gz

{codingest-0.2.34 → codingest-0.2.35}/Cargo.lock

@@ -306,7 +306,7 @@ dependencies = [
 
 [[package]]
 name = "codingest"
-version = "0.2.34"
+version = "0.2.35"
 dependencies = [
  "aho-corasick",
  "base64",
@@ -342,7 +342,7 @@ dependencies = [
 
 [[package]]
 name = "codingest-cli"
-version = "0.2.34"
+version = "0.2.35"
 dependencies = [
  "anyhow",
  "clap",
@@ -354,7 +354,7 @@ dependencies = [
 
 [[package]]
 name = "codingest-mcp"
-version = "0.2.34"
+version = "0.2.35"
 dependencies = [
  "anyhow",
  "codingest",
@@ -365,7 +365,7 @@ dependencies = [
 
 [[package]]
 name = "codingest-py"
-version = "0.2.34"
+version = "0.2.35"
 dependencies = [
  "codingest",
  "codingest-cli",
@@ -1421,9 +1421,9 @@ dependencies = [
 
 [[package]]
 name = "kglite"
-version = "0.21.4"
+version = "0.21.5"
 source = "registry+https://github.com/rust-lang/crates.io-index"
-checksum = "ea25c6ce4f981f578525b076e8c6fae3b0a3c4b79dcdf50967312a5ae52f3ebd"
+checksum = "68f04fd73825dfbf10f9da22f85a2bdb084fd642b36a9b99400719f1df33c7ed"
 dependencies = [
  "bzip2",
  "chrono",
@@ -1461,9 +1461,9 @@ dependencies = [
 
 [[package]]
 name = "kglite-mcp-server"
-version = "0.21.4"
+version = "0.21.5"
 source = "registry+https://github.com/rust-lang/crates.io-index"
-checksum = "059267ba7a8bc228da3cef35351ce6b01bbc866447688f3940e5e5346c4c898b"
+checksum = "867346f8685bc1c76c698049a347583ebdef43907b22335d5b62d0aea7f29b6f"
 dependencies = [
  "anyhow",
  "base64",

{codingest-0.2.34 → codingest-0.2.35}/Cargo.toml

@@ -3,7 +3,7 @@ members = ["crates/codingest", "crates/codingest-cli", "crates/codingest-mcp", "
 resolver = "2"
 
 [workspace.package]
-version = "0.2.34"
+version = "0.2.35"
 edition = "2021"
 rust-version = "1.88"
 license = "MIT"
@@ -12,8 +12,12 @@ repository = "https://github.com/kkollsga/codingest"
 [workspace.dependencies]
 base64 = "0.23.1"
 sha2 = "0.11"
-# kglite engine + MCP server — imported as crates.io libraries. The 0.21.4
-# floor is a patch step within 0.21 (0.21.2 -> 0.21.4: MCP clients that never
+# kglite engine + MCP server — imported as crates.io libraries. The 0.21.5
+# floor is a patch step within 0.21 (0.21.4 -> 0.21.5): a query-path speedup
+# only — a fused columnar kernel for single-label filtered `count`/`sum`/`avg`/
+# `min`/`max` and negative-literal pushdown, results identical. It changes no
+# `kglite::api` codingest calls and nothing the builder writes. The 0.21.4
+# floor was a patch step within 0.21 (0.21.2 -> 0.21.4: MCP clients that never
 # send `initialize`, Python 3.12+ wheel, `with_identity` `--help` fix and the
 # embedder `serverInfo.name`); it changes no `kglite::api` codingest calls. The 0.21.1
 # floor is an engine minor (0.20.0 -> 0.21.1, taking 0.21.0 with it): graphs of
@@ -660,8 +664,8 @@ sha2 = "0.11"
 # and no disk storage. Neither 0.15.7 nor 0.15.8 changes the `kglite::api` we
 # call, graph output, property encoding, or `.kgl` serialization.
 # Keep both libraries aligned so the graph and server share one engine release.
-kglite = { version = "0.21.4", default-features = false }
-kglite-mcp-server = { version = "0.21.4", default-features = false }
+kglite = { version = "0.21.5", default-features = false }
+kglite-mcp-server = { version = "0.21.5", default-features = false }
 
 # Dependency debuginfo capped at line tables (kglite coordination, 2026-08-31,
 # after unbounded debug trees filled the build-cache disk to zero): a

{codingest-0.2.34 → codingest-0.2.35}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: codingest
-Version: 0.2.34
+Version: 0.2.35
 Classifier: Development Status :: 3 - Alpha
 Classifier: Intended Audience :: Developers
 Classifier: Programming Language :: Python :: 3
@@ -11,7 +11,7 @@ Classifier: Programming Language :: Python :: 3.15
 Classifier: Programming Language :: Rust
 Classifier: Topic :: Software Development
 Classifier: Topic :: Software Development :: Libraries
-Requires-Dist: kglite>=0.21.4,<0.22
+Requires-Dist: kglite>=0.21.5,<0.22
 License-File: LICENSE
 Summary: Build fast, queryable code graphs for AI agents, MCP code review, and local or GitHub repository analysis.
 Keywords: ai-agents,mcp,code-review,knowledge-graph,code-analysis,github,tree-sitter,cypher
@@ -193,7 +193,7 @@ codingest skill install        # code-review Agent Skill
 ```
 
 The wheel bundles every grammar plus the `codingest` and `codingest-mcp`
-commands. KGLite ≥0.21.4 is installed automatically as the query/storage
+commands. KGLite ≥0.21.5 is installed automatically as the query/storage
 engine; its MCP server and the transitive `mcp-methods` framework power the
 builder-aware Codingest server. Nothing else needs to be installed.
 
@@ -206,7 +206,7 @@ Python prerequisites.
 ```toml
 [dependencies]
 codingest = "0.2"
-kglite = "0.21.4"
+kglite = "0.21.5"
 ```
 
 ```rust
@@ -278,7 +278,7 @@ diagnostic.
 ## Dependency policy
 
 `kglite` and `kglite-mcp-server` use matching crates.io requirements with a
-0.21.4 minimum and a shared lockfile. This keeps the builder, persistence
+0.21.5 minimum and a shared lockfile. This keeps the builder, persistence
 handoff, and embedded MCP server on one compatible engine patch line.
 
 ## Parity with the (now-removed) in-tree component

{codingest-0.2.34 → codingest-0.2.35}/README.md

@@ -167,7 +167,7 @@ codingest skill install        # code-review Agent Skill
 ```
 
 The wheel bundles every grammar plus the `codingest` and `codingest-mcp`
-commands. KGLite ≥0.21.4 is installed automatically as the query/storage
+commands. KGLite ≥0.21.5 is installed automatically as the query/storage
 engine; its MCP server and the transitive `mcp-methods` framework power the
 builder-aware Codingest server. Nothing else needs to be installed.
 
@@ -180,7 +180,7 @@ Python prerequisites.
 ```toml
 [dependencies]
 codingest = "0.2"
-kglite = "0.21.4"
+kglite = "0.21.5"
 ```
 
 ```rust
@@ -252,7 +252,7 @@ diagnostic.
 ## Dependency policy
 
 `kglite` and `kglite-mcp-server` use matching crates.io requirements with a
-0.21.4 minimum and a shared lockfile. This keeps the builder, persistence
+0.21.5 minimum and a shared lockfile. This keeps the builder, persistence
 handoff, and embedded MCP server on one compatible engine patch line.
 
 ## Parity with the (now-removed) in-tree component

{codingest-0.2.34 → codingest-0.2.35}/crates/codingest/Cargo.toml

@@ -10,7 +10,7 @@ keywords = ["knowledge-graph", "code-analysis", "tree-sitter", "cypher", "kglite
 categories = ["development-tools", "parser-implementations"]
 
 # Requires the kglite 0.15 engine API (`kglite::api::code_entities`); the
-# workspace pins the current engine floor (0.21.4).
+# workspace pins the current engine floor (0.21.5).
 
 [lib]
 name = "codingest"

codingest-0.2.35/crates/codingest/assets/code_review/skill.md

@@ -0,0 +1,60 @@
+# Reviewing a codingest code graph
+
+codingest built every graph this server serves, so the shapes are fixed:
+`Function`, `Struct`, `Class`, `Trait`, `Interface`, `Protocol`, `Enum`,
+`Module`, `File`, `Doc` nodes keyed by `qualified_name`; `CALLS`,
+`USES_TYPE`, `IMPLEMENTS`, `EXTENDS`, `HAS_METHOD`, `IMPORTS`, `DEFINES`,
+`HAS_FILE` edges. Functions carry `file_path`, `line_number`, `is_test`.
+Use the graph only as far as the question requires.
+
+## Sequence
+
+Recipe `code_review/<name>` runs as `run_recipe_query("code_review", "<name>", {…})`.
+
+1. **Resolve targets first** with `code_review/target_coverage`
+   (`{"requested": [...]}`). A null `target` means the name is not in this
+   graph (typo, macro-generated, other revision); `callers` of zero for an
+   existing target is a real absence. Never read an empty result as an absence
+   until the target has resolved.
+2. **Count before paging.** `code_review/caller_coverage` splits one target's
+   callers into production and test counts. One target per call: a shared page
+   can fill with one target and hide another.
+3. **Page callers by kind.** `code_review/callers_page` with `is_test: false`
+   gives the production callers, `is_test: true` the tests that would notice,
+   25 at a time with file and line. Each row carries the `CALLS` edge's
+   evidence: `resolution`, `candidates` (>1 = the call site fanned out),
+   `import_backed` (false is unconfirmed, not refuted) and `call_lines`.
+4. **Walk the other way** with `code_review/direct_callees`, same evidence
+   columns. An unresolved source call has no `CALLS` edge at all, so read the
+   source before concluding a call is absent.
+5. **Witness reachability, do not explore it.** `code_review/bounded_call_path`
+   returns up to ten paths of at most four hops between two resolved functions.
+6. **Type and trait impact.** `code_review/type_consumers` lists functions
+   taking a struct as an explicit parameter; `code_review/trait_implementations`
+   lists structs with an `IMPLEMENTS` edge to a trait. Macro-generated or
+   heuristic structure may be missing — a reason to read source.
+7. **Read the selected source** with `read_code_source` (qualified name) or
+   `read_source` (path), bounded by `start_line` / `end_line`.
+8. **Use `cypher_query` only for a question no recipe shapes** — imports,
+   module structure, docs links, `CALL rev_diff({from, to})` on a multi-rev
+   graph — and check the shape with `graph_overview` first.
+
+For a diff-scoped review, start from the functions whose `file_path` the diff
+touched, resolve them, then run steps 2 to 4 on each.
+
+## Reading results
+
+A page is complete only up to its literal size (25 rows, 10 paths); a full page
+proves nothing about other targets. Expansion cannot recover rows a `LIMIT`
+excluded — narrow the target instead. A warning about an unknown property or
+reversed relationship means the query shape is wrong, not that the result is
+empty.
+
+## Findings and honesty
+
+A finding names a concrete failure — the input or state and the wrong outcome
+— verified against exact source lines at the reviewed revision. "No findings"
+is a valid review; design preferences are not findings, and an edge showing
+coupling is a fact, not a defect. Never invent labels, properties, edge types
+or recipe names; a missing edge is absence of evidence, not proof of absence;
+never build or execute a repository's code merely to review it.

{codingest-0.2.34 → codingest-0.2.35}/crates/codingest/src/builder/other_edges.rs

@@ -228,11 +228,11 @@ fn path_import_candidates(file: &FileInfo, raw: &str) -> Vec<String> {
 }
 
 /// Module-path suffixes a TS/JS specifier may carry. Stripped before matching,
-/// mirroring `JstsParser::file_to_module_path`. `.js`/`.mjs`/`.cjs` are in the
-/// list because TS's NodeNext resolution has source files import each other by
-/// their *emitted* name (`import "./util.js"` resolving to `util.ts`).
-const MODULE_PATH_EXTENSIONS: &[&str] =
-    &[".tsx", ".ts", ".jsx", ".mjs", ".cjs", ".mts", ".cts", ".js"];
+/// with the same list `JstsParser::file_to_module_path` strips. The JS
+/// suffixes matter for TS too: NodeNext resolution has source files import
+/// each other by their *emitted* name (`import "./util.js"` resolving to
+/// `util.ts`).
+const MODULE_PATH_EXTENSIONS: &[&str] = crate::parsers::typescript::JSTS_MODULE_SUFFIXES;
 
 /// Candidate module paths for one TS/JS import specifier, in fixed priority
 /// order — first match wins, and the order IS the documented tie-break.

{codingest-0.2.34 → codingest-0.2.35}/crates/codingest/src/methodology.rs

@@ -228,6 +228,23 @@ mod tests {
         assert_eq!(record.references_tools, REFERENCES_TOOLS);
     }
 
+    /// mcp-methods warns on every server boot and `--selftest` when a skill
+    /// exceeds its soft limit (`SOFT_SIZE_LIMIT_BYTES`, 4 KiB in 0.6.2), and it
+    /// measures the skill as served: the frontmatter kglite renders from the
+    /// record fields plus the body. A body sized against the limit alone
+    /// (4,093 bytes) rendered to 4,709 and warned on every boot.
+    #[test]
+    fn rendered_skill_fits_the_mcp_soft_size_limit() {
+        const MCP_SOFT_SIZE_LIMIT_BYTES: usize = 4 * 1024;
+        let rendered = skills::render_markdown(&skill_record());
+        assert!(
+            rendered.len() <= MCP_SOFT_SIZE_LIMIT_BYTES,
+            "rendered skill is {} bytes (body {}), soft limit is {MCP_SOFT_SIZE_LIMIT_BYTES}",
+            rendered.len(),
+            SKILL_BODY.len()
+        );
+    }
+
     #[test]
     fn skill_body_names_every_recipe_and_the_description_loads_it_before_cypher() {
         for record in recipe_records() {

{codingest-0.2.34 → codingest-0.2.35}/crates/codingest/src/parsers/registry.rs

@@ -192,7 +192,7 @@ language_registry! {
         make_parser: python_parser,
     },
     "typescript" => {
-        extensions: ["ts", "tsx"],
+        extensions: ["ts", "tsx", "mts", "cts"],
         module_sep: "/",
         edge_sep: "/",
         group: LangGroup::GoTsJs,
@@ -200,7 +200,7 @@ language_registry! {
         make_parser: typescript_parser,
     },
     "javascript" => {
-        extensions: ["js", "jsx", "mjs"],
+        extensions: ["js", "jsx", "mjs", "cjs"],
         module_sep: "/",
         edge_sep: "/",
         group: LangGroup::GoTsJs,
@@ -411,9 +411,12 @@ mod tests {
                 ("pyi", "python"),
                 ("ts", "typescript"),
                 ("tsx", "typescript"),
+                ("mts", "typescript"),
+                ("cts", "typescript"),
                 ("js", "javascript"),
                 ("jsx", "javascript"),
                 ("mjs", "javascript"),
+                ("cjs", "javascript"),
                 ("go", "go"),
                 ("java", "java"),
                 ("cs", "csharp"),

{codingest-0.2.34 → codingest-0.2.35}/crates/codingest/src/parsers/typescript.rs

@@ -142,18 +142,26 @@ thread_local! {
     };
 }
 
+/// File-name suffixes stripped to form a TS/JS module path, shared by
+/// `file_to_module_path` and the import resolver in `builder::other_edges` so
+/// the two agree on module identity. Every extension the `typescript` and
+/// `javascript` registry entries claim must be here, or its files get a
+/// module path that still carries the extension and no import can reach them.
+pub(crate) const JSTS_MODULE_SUFFIXES: &[&str] =
+    &[".tsx", ".ts", ".jsx", ".mjs", ".cjs", ".mts", ".cts", ".js"];
+
 impl JstsParser {
     pub fn typescript() -> Self {
         JstsParser {
             lang_name: "typescript",
-            extensions: &["ts", "tsx"],
+            extensions: &["ts", "tsx", "mts", "cts"],
         }
     }
 
     pub fn javascript() -> Self {
         JstsParser {
             lang_name: "javascript",
-            extensions: &["js", "jsx", "mjs"],
+            extensions: &["js", "jsx", "mjs", "cjs"],
         }
     }
 
@@ -1095,7 +1103,7 @@ impl JstsParser {
             .filter_map(|c| c.as_os_str().to_str().map(str::to_string))
             .collect();
         if let Some(last) = parts.last_mut() {
-            for ext in [".tsx", ".ts", ".jsx", ".mjs", ".js"] {
+            for ext in JSTS_MODULE_SUFFIXES {
                 if let Some(stem) = last.strip_suffix(ext) {
                     *last = stem.to_string();
                     break;
@@ -1248,7 +1256,19 @@ impl JstsParser {
             None => module_path.to_string(),
         };
         let qualified_name = format!("{}.{}", prefix, name);
-        let block = Self::get_block(node);
+        // A concise arrow (`x => expr`) has no `{ … }` block; its expression IS
+        // the body. Without this fallback such a function had null metrics and
+        // dropped every call it made (`const run = c => execSync(c)` had no
+        // CALLS edge at all).
+        let body = Self::get_block(node).or_else(|| {
+            (node.kind() == "arrow_function")
+                .then(|| node.child_by_field_name("body"))
+                .flatten()
+        });
+        // A concise body that is itself a nested scope (`a => b => f()`) stays
+        // behind the boundary a `{ return b => f(); }` block puts it behind:
+        // measured as empty, its calls not folded into this function.
+        let block = body.filter(|b| !NESTED_SCOPES.contains(&b.kind()));
 
         let mut metadata = crate::models::MetadataMap::new();
         let mut cursor = node.walk();
@@ -1269,12 +1289,13 @@ impl JstsParser {
                 .filter(|p| p.kind != ParameterKind::Receiver)
                 .count() as u32,
         );
-        let (branch_count, max_nesting) = match block {
-            Some(b) => {
+        let (branch_count, max_nesting) = match (block, body) {
+            (Some(b), _) => {
                 let (c, n) = compute_complexity(b, BRANCH_KINDS_TS, NESTED_SCOPES);
                 (Some(c), Some(n))
             }
-            None => (None, None),
+            (None, Some(_)) => (Some(0), Some(0)),
+            (None, None) => (None, None),
         };
         let is_recursive = Some(calls.iter().any(|(n, _)| n == &name));
         let docstring = Self::get_docstring(node, source);
@@ -1865,6 +1886,12 @@ impl LanguageParser for JstsParser {
             ".spec.jsx",
             ".test.mjs",
             ".spec.mjs",
+            ".test.cjs",
+            ".spec.cjs",
+            ".test.mts",
+            ".spec.mts",
+            ".test.cts",
+            ".spec.cts",
         ];
         let is_test = crate::parsers::shared::is_test_path(&rel_path, &filename, &test_suffixes);
 
@@ -2759,3 +2786,68 @@ export function outer(items: string[]) {
         assert_eq!(calls_of(src, "a.outer"), vec!["items.forEach", "transform"]);
     }
 }
+
+#[cfg(test)]
+mod concise_arrow_tests {
+    use super::*;
+    use crate::parsers::LanguageParser;
+
+    /// `(branch_count, max_nesting, call names)` for the Function named `name`.
+    fn measured(src: &str, name: &str) -> (Option<u32>, Option<u32>, Vec<String>) {
+        let dir = tempfile::tempdir().expect("tempdir");
+        let path = dir.path().join("a.ts");
+        std::fs::write(&path, src).expect("write fixture");
+        let result = JstsParser::typescript().parse_file(&path, dir.path());
+        let f = result
+            .functions
+            .iter()
+            .find(|f| f.name == name)
+            .unwrap_or_else(|| panic!("no Function named {name}"));
+        let calls = f.calls.iter().map(|(c, _)| c.clone()).collect();
+        (f.branch_count, f.max_nesting, calls)
+    }
+
+    /// The regression: an arrow whose body is an expression rather than a
+    /// `{ … }` block had null metrics and no calls at all.
+    #[test]
+    fn concise_arrow_is_measured_and_keeps_its_calls() {
+        let src = "const run = (cmd: string) => execSync(cmd, { stdio: \"inherit\" });\n";
+        assert_eq!(
+            measured(src, "run"),
+            (Some(0), Some(0), vec!["execSync".to_string()])
+        );
+        let src = "const pick = (x: number) => x > 0 ? up(x) : down(x);\n";
+        assert_eq!(
+            measured(src, "pick"),
+            (Some(1), Some(1), vec!["up".to_string(), "down".to_string()])
+        );
+    }
+
+    /// A concise body that is itself an arrow reads the same as its
+    /// block-bodied twin: the inner scope stays behind the nested-scope
+    /// boundary in both spellings.
+    #[test]
+    fn curried_concise_arrow_matches_its_block_twin() {
+        let concise = "const f = (a: number) => (b: number) => g(a ? b : 0);\n";
+        let block = "const f = (a: number) => { return (b: number) => g(a ? b : 0); };\n";
+        assert_eq!(measured(concise, "f"), (Some(0), Some(0), Vec::new()));
+        assert_eq!(measured(concise, "f"), measured(block, "f"));
+    }
+
+    /// Every extension the registry routes to this parser must be stripped
+    /// to form a module path; one left out makes its files unreachable by
+    /// any import.
+    #[test]
+    fn module_suffixes_cover_every_registered_extension() {
+        for language in ["typescript", "javascript"] {
+            let spec = crate::parsers::registry::spec(language).expect("registered");
+            for ext in spec.extensions {
+                let suffix = format!(".{ext}");
+                assert!(
+                    JSTS_MODULE_SUFFIXES.contains(&suffix.as_str()),
+                    "{language} extension {suffix} is parsed but not stripped from module paths"
+                );
+            }
+        }
+    }
+}

{codingest-0.2.34 → codingest-0.2.35}/crates/codingest/tests/goldens/README.md

@@ -389,6 +389,28 @@ what shows the change is pure identity and not behaviour. Verified the strict
 way: `capture_goldens` rewrote every file, and afterwards `git status` reported
 exactly those two digests as modified.
 
+The additive `js_module_exts` digest was captured on 2026-11-01 with the
+corpus itself. The parser registry listed `js`/`jsx`/`mjs` and `ts`/`tsx` only,
+so every `.cjs`, `.mts` and `.cts` file was skipped without a diagnostic — and
+no corpus contained one, so the gap had no golden to move. The corpus pins all
+three extensions and a `.d.mts` declaration file, the `.test.cts` test flag,
+and import resolution onto a `.mts` module both by its emitted name
+(`./util.mjs`, NodeNext) and by its own (`./util.mts`). Verified additive the
+strict way: `capture_goldens` rewrote every file, and afterwards `git status`
+reported only `js_module_exts.sha256` as new. Every pre-existing corpus is a
+control and does not move.
+
+**`ts_hof_binding` regenerated 2026-11-01 (concise-arrow bodies).** A
+TS/JS arrow whose body is an expression rather than a `{ … }` block was never
+measured and never walked for calls: `branch_count`/`max_nesting` were null and
+`const run = c => execSync(c)` had no CALLS edge. The parser now treats the
+expression as the body. The digest movement is the record: `ts_hof_binding` is
+the only corpus with a concise-bodied Function node, and its one such node
+(`createMemo(() => 1 + 2)`'s binding, no calls) gained `branch_count=0` and
+`max_nesting=0` — two added properties, nothing else. Verified by dumping every
+corpus with and without the fix (`dump_canonical`); only that file differed.
+The calls half is pinned by `concise_arrow_tests` in the parser.
+
 ## The 2026-08-10 bulk regeneration (13 of 14 digests)
 
 **This is the first bulk regeneration since the extraction**, and the only one

codingest-0.2.35/crates/codingest/tests/goldens/js_module_exts.sha256

@@ -0,0 +1 @@
+ecba2b7d126857eab60248df7d88753f68fcf00e5774ba1308b4c27260411a8e

codingest-0.2.35/crates/codingest/tests/goldens/ts_hof_binding.sha256

@@ -0,0 +1 @@
+804888ec5bbf3e6b76f5d17a4f31f8bf62b4fd3bd422507ede01f45adc327863

{codingest-0.2.34 → codingest-0.2.35}/crates/codingest/tests/parity.rs

@@ -351,6 +351,16 @@ const CORPORA: &[&str] = &[
     // root is still tried first. Its golden is captured additively (see
     // `tests/goldens/README.md`).
     "web_served_root",
+    // Added 2026-11-01. No other corpus contains a `.cjs`, `.mts` or `.cts`
+    // file — the parser registry did not list those extensions at all, so the
+    // builder skipped them without a word (an Electron app's whole
+    // `electron/*.cjs` main process was absent from its graph). It pins all
+    // three extensions plus a `.d.mts` declaration file, the `.test.cts` test
+    // flag, and import resolution onto a `.mts` module both by its emitted
+    // name (`./util.mjs`, NodeNext) and by its own (`./util.mts`). Its golden
+    // is captured additively (see
+    // `tests/goldens/README.md`).
+    "js_module_exts",
 ];
 
 /// Independent builds of each corpus per `golden_parity` run.

{codingest-0.2.34 → codingest-0.2.35}/crates/codingest-cli/Cargo.toml

@@ -14,7 +14,7 @@ name = "codingest"
 path = "src/main.rs"
 
 [dependencies]
-codingest = { version = "0.2.34", path = "../codingest" }
+codingest = { version = "0.2.35", path = "../codingest" }
 kglite = { workspace = true }
 anyhow = "1.0.104"
 clap = { version = "4.6.7", features = ["derive"] }

{codingest-0.2.34 → codingest-0.2.35}/crates/codingest-cli/skills/codingest-code-review/SKILL.md

@@ -14,7 +14,7 @@ git diff, source reading, and literal-text search; it does not replace them.
 > codingest` also provides the builder-aware `codingest-mcp` server and a
 > compatible graph engine. Rust-only environments can alternatively use Cargo.
 > Examples that invoke the external `kglite` CLI require a compatible
-> `kglite>=0.21.4,<0.22`; verify `kglite --version` before using its
+> `kglite>=0.21.5,<0.22`; verify `kglite --version` before using its
 > agent-response features.
 
 Inspect the diff and repository guidance first. Identify changed symbols and

{codingest-0.2.34 → codingest-0.2.35}/crates/codingest-cli/skills/codingest-code-review/references/mcp-upgrade.md

@@ -54,7 +54,7 @@ preconditions are still current.
 ## External CLI agent output is optional
 
 The examples below require an external `kglite` CLI satisfying
-`>=0.21.4,<0.22`:
+`>=0.21.5,<0.22`:
 
 ```console
 kglite --version

{codingest-0.2.34 → codingest-0.2.35}/crates/codingest-mcp/Cargo.toml

@@ -14,7 +14,7 @@ name = "codingest-mcp"
 path = "src/main.rs"
 
 [dependencies]
-codingest = { version = "0.2.34", path = "../codingest" }
+codingest = { version = "0.2.35", path = "../codingest" }
 kglite-mcp-server = { workspace = true }
 anyhow = "1.0.104"
 

{codingest-0.2.34 → codingest-0.2.35}/crates/codingest-py/Cargo.toml

@@ -42,7 +42,7 @@ doctest = false
 pyo3 = { version = "0.30" }
 # The engine-free builder (parsers, call/type/route edges, rev merge, repo
 # clone, manifest reader). Docs pass gated by this crate's `docs` feature.
-codingest = { version = "0.2.34", path = "../codingest", default-features = false }
+codingest = { version = "0.2.35", path = "../codingest", default-features = false }
 # `.kgl` persistence (`kglite::api::io::save_graph`) for the serialize half of
 # the build-then-load handoff, plus the `DirGraph` type the builder returns.
 kglite = { workspace = true }
@@ -53,9 +53,9 @@ tempfile = "3.27.0"
 # through `_run_cli`, so `pip install codingest` also installs the `codingest`
 # command without a second wheel or a duplicated builder build. Mirrors
 # kglite-py's `kglite-cli` bundling.
-codingest-cli = { version = "0.2.34", path = "../codingest-cli" }
+codingest-cli = { version = "0.2.35", path = "../codingest-cli" }
 # Source-building MCP composition. The graph server and generic MCP lifecycle
 # remain owned by its existing kglite-mcp-server -> mcp-methods Rust dependency
 # chain; linking this thin library into the extension gives pip users the same
 # builder-aware server as the standalone `codingest-mcp` binary.
-codingest-mcp = { version = "0.2.34", path = "../codingest-mcp" }
+codingest-mcp = { version = "0.2.35", path = "../codingest-mcp" }

{codingest-0.2.34 → codingest-0.2.35}/crates/codingest-py/src/lib.rs

@@ -86,7 +86,7 @@ fn load_via_kglite(py: Python<'_>, path: &Path) -> PyResult<Py<PyAny>> {
         PyRuntimeError::new_err(format!(
             "codingest.build() returns a kglite.KnowledgeGraph, but importing \
              `kglite` failed ({e}). Install it: `pip install \
-             'kglite>=0.21.4,<0.22'`."
+             'kglite>=0.21.5,<0.22'`."
         ))
     })?;
     let graph = kglite.call_method1("load", (path.to_string_lossy().as_ref(),))?;

{codingest-0.2.34 → codingest-0.2.35}/pyproject.toml

@@ -41,9 +41,9 @@ dynamic = ["version"]
 # minor releases (e.g. the v3->v4 break, which refuses old files outright), so
 # pip must never be free to pair our writer with a reader from a different
 # minor. This range therefore mirrors the Cargo semver range for the pin above
-# (`version = "0.21.4"` == `>=0.21.4,<0.22.0`) exactly — bump both together.
+# (`version = "0.21.5"` == `>=0.21.5,<0.22.0`) exactly — bump both together.
 dependencies = [
-    "kglite>=0.21.4,<0.22",
+    "kglite>=0.21.5,<0.22",
 ]
 
 [project.urls]

codingest-0.2.34/crates/codingest/assets/code_review/skill.md

@@ -1,70 +0,0 @@
-# Reviewing a codingest code graph
-
-codingest built every graph this server serves, so the shapes are fixed:
-`Function`, `Struct`, `Class`, `Trait`, `Interface`, `Protocol`, `Enum`,
-`Module`, `File`, `Doc` nodes keyed by `qualified_name`; `CALLS`,
-`USES_TYPE`, `IMPLEMENTS`, `EXTENDS`, `HAS_METHOD`, `IMPORTS`, `DEFINES`,
-`HAS_FILE` edges. Functions carry `file_path`, `line_number`, `is_test`.
-The graph is structural evidence beside the diff and the source; use it
-only as far as the question requires.
-
-## Sequence
-
-1. **Resolve targets first** with `run_recipe_query("code_review",
-   "target_coverage", {"requested": [...]})`. A null `target` means the name is
-   not in this graph (typo, macro-generated, other revision); `callers` of zero
-   for an existing target is a real absence. Never read an empty result as an
-   absence until the target has resolved.
-2. **Count before paging.** `caller_coverage` splits one target's callers into
-   production and test counts. One target per call: a shared page can fill
-   with one target and hide another.
-3. **Page callers by kind.** `callers_page` with `is_test: false` gives the
-   production callers, `is_test: true` the tests that would notice, 25 at a
-   time with file and line. Each row carries the `CALLS` edge's evidence:
-   `resolution`, `candidates` (>1 = the call site fanned out), `import_backed`
-   (false is unconfirmed, not refuted) and `call_lines`.
-4. **Walk the other way** with `direct_callees`, same evidence columns. An
-   unresolved source call has no `CALLS` edge at all, so read the source before
-   concluding a call is absent.
-5. **Witness reachability, do not explore it.** `bounded_call_path` returns up
-   to ten paths of at most four hops between two resolved functions.
-6. **Type and trait impact.** `type_consumers` lists functions taking a struct
-   as an explicit parameter; `trait_implementations` lists structs with an
-   `IMPLEMENTS` edge to a trait. Macro-generated or heuristic structure may be
-   missing, so a missing edge is a reason to read source.
-7. **Read the selected source** with `read_code_source` (qualified name) or
-   `read_source` (path), bounded by `start_line` / `end_line`.
-8. **Use `cypher_query` only for a question no recipe shapes** — imports,
-   module structure, docs links, `CALL rev_diff({from, to})` on a multi-rev
-   graph — and check the shape with `graph_overview` first.
-
-## Recipes served for this graph
-
-- `code_review/target_coverage` — existence plus caller count, for a list of names.
-- `code_review/caller_coverage` — production versus test caller counts for one target.
-- `code_review/callers_page` — direct callers of one kind, 25 at a time, with edge evidence.
-- `code_review/direct_callees` — what one function calls, 25 at a time, with edge evidence.
-- `code_review/bounded_call_path` — up to ten paths of at most four hops between two functions.
-- `code_review/type_consumers` — functions taking a struct as an explicit parameter.
-- `code_review/trait_implementations` — structs implementing a trait.
-
-For a diff-scoped review, start from the functions whose `file_path` the
-diff touched, resolve them, then run steps 2 to 4 on each.
-
-## Reading results
-
-A page is complete only up to its literal size (25 rows, 10 paths); a full
-page proves nothing about other targets or edges the builder never emitted.
-Follow a retained result's advertised expansion; expansion cannot recover
-rows a `LIMIT` excluded — narrow the target instead. A warning about an
-unknown property or reversed relationship means the query shape is wrong, not
-that the result is empty.
-
-## Findings and honesty
-
-A finding names a concrete failure — the input or state and the wrong outcome
-— verified against exact source lines at the reviewed revision. "No findings"
-is a valid review; design preferences are not findings, and an edge showing
-coupling is a fact, not a defect. Never invent labels, properties, edge types
-or recipe names; a missing edge is absence of evidence, not proof of absence;
-never build or execute a repository's code merely to review it.

codingest-0.2.34/crates/codingest/tests/goldens/ts_hof_binding.sha256

@@ -1 +0,0 @@
-68ea85e83b5135a8030d282475490e453fb4afd2f98779e05e5cd5992f3e5585