Collect tree entries from dir arrays. */

Free dir arrays. */

Fallback: derive packages from QN segments when no Package nodes exist. */

Path scoping for architecture / schema (shared). */

Register dir hierarchy for one file path. */

ASCII case-insensitive equality vs a lowercase literal (CFML attribute names are case-insensitive, e.g. NAME / Name / name).

Check if an aspect is requested. NULL aspects = all. The array can contain * "all" (everything), "overview" (everything except file_tree — see * cbm

Phase 4: assemble JSON output from search results */

* assert_calls_callable_sourced * * Index `files[0..nfiles)` through the production pipeline, collect all CALLS * edges, and assert that each edge'

Edge type parity tests */

* assert_lsp_strategy * * Index a single-file fixture and assert the per-pass LSP RESOLUTION CONTRACT: * 1. the store opened (precondition — a se

Single-file convenience wrapper. */

Single-file convenience wrapper. */

── Shared per-strategy runner (DRY) — identical contract to repro_lsp_c_cpp.c * * Index a single-file fixture and assert the per-pass LSP RESOLUTION

── Shared per-strategy runner (DRY, identical to repro_lsp_c_cpp.c) ───────── * * Index a single-file fixture and assert the per-pass LSP RESOLUTION

* assert_no_resolvable_edge — the ACCURATE invariant for a call whose callee is * genuinely UNRESOLVABLE (undeclared, or an external/DLL symbol with

* assert_no_resolvable_edge — the ACCURATE invariant for a call whose callee is * genuinely UNRESOLVABLE (undeclared symbol). No node can exist for i

* assert_no_resolvable_edge — the ACCURATE invariant for a call whose callee is * genuinely UNRESOLVABLE: undeclared (totallyUnknownFn), an external

* assert_strategy_absent — assert a given strategy tag NEVER surfaces on any * CALLS edge. Used for the bare "lsp_ts" probe: the default fallback tag

Attach source or context lines to a search result JSON item. */

Drive the already-indexed connect path (initialize → maybe_auto_index → * watcher registration) and return the resulting watch count. * auto_watch_v

auto_watch config: gates background watcher registration (default on). * Multi-project users can contain a session to its own project with * `config

Return 1 if base_classes contains `want` exactly. */

Return 1 if ANY base_classes entry contains `substr` as a substring. * Used to assert that keywords like "extends" / "implements" / ":" do NOT * app

Count entries in a NULL-terminated base_classes array. */

Resolve one document: look up each token's global ID, fill the corpus * doc_token_ids[d], and bump the per-token doc_freq counter atomically. The *

Build parameterized placeholder list "?1,?2,?3" for N edge types. */

Convert BFS traversal results into a yyjson_mut array. */ Find the CALLS-edge "args" JSON (the serialized arg expressions) on the edge * that leads t

BFS from EVERY node sharing the resolved name and merge the results, so the * caller/callee set is complete even when one logical symbol is represent

Build a context, register one or more imports, run the binding pass, * and let the caller verify scope state. */

Given a method-invocation node and its resolved CBMRegisteredFunc, walk * each lambda argument: bind its formal_parameters to the SAM's parameter *

Resolve any method-reference args of a method call. */

@var Type $name — bind a variable in current scope. * Generic types like `array<User>` may contain whitespace-free `<>` — we * tolerate those by inc

Bind a variable_declarator: `let x: T = init` / `const x = init` / `var x = ...`.

Apply skip and limit to a binding array, freeing discarded entries */

Run the BM25 full-text search path and return the JSON result string. * Returns NULL if FTS5 is unavailable or the query produced no usable tokens,

On a breadth failure, explain WHY: does direct extraction (no pipeline, no * timeout) yield defs, and what node labels did the pipeline actually crea

Phase 2b: Connect prefix Routes to decorator handler Functions. * For each prefix Route (__route__ANY__/path), find the CALLS edge leading to it * (

── Structural-base battery (dims 1-4) ────────────────────────────────────── * * Runs the four core invariants on valid input. No defs-present asser

── Callable battery (dims 1-6) ───────────────────────────────────────────── * * Adds dims 5 (optional) and 6 (calls-extracted) to the base invarian

Build deduplicated file list from search results + raw matches. */

Build properties JSON for a definition node. */

Build default 3-column headers (name, qualified_name, label) per variable */

Build directory distribution object from search results (top-level dir → count). */

Build dump-ready edge array with remapped IDs. Returns url_paths and * local_names (heap string arrays owned by the caller) via out params. */

Build an edge index from a pre-sorted permutation using a cell builder callback. */

Build all 7 edge index B-trees. Returns 0 on success, ERR_SORT_FAILED on failure. */

Build an edges table record: (id, project, source_id, target_id, type, properties) url_path_gen and local_name_gen are VIRTUAL generated columns — NOT

Index: short_name -> chain of FREE-function (receiver_type==NULL) indices. * Descending-iterate + prepend for ascending chain order (as above). */

Build N synthetic class/call pairs into an arena-backed buffer. */

Build the grep/search command string based on scoped vs recursive mode. * On Windows, uses PowerShell Select-String with tab-delimited output. * On

Build a SQLite "file:" URI with immutable=1 from a filesystem path. * immutable=1 bypasses WAL and locking and reads the main DB file directly — * u

Build import map from graph buffer IMPORTS edges (read-only access to gbuf). */

Build per-file import map from cached extraction result or graph buffer edges. */

Build per-file import map from cached extraction result or graph buffer edges. */

Build import map from cached extraction result (fast path). */

Build import map from graph buffer IMPORTS edges (slow path). */

Build UNIQUE index entry for (int64, int64, text, text) + rowid — edges unique(source_id, target_id, type, local_name_gen) (#768).

Build the success portion of the index_repository response. * Returns true when status should be "degraded" (#334 plausibility gate). */

Build interior pages from child page references. Returns the root page number. SQLite interior page structure: - Header has right-child pointer (the

Distinct from "unknown project": the caller omitted the project argument * entirely (no recognized key). Name the literal "project" key so the fix is

Build a 2-text node index from a pre-sorted permutation. Returns root page or 0. */

Build all 4 node index B-trees. Returns 0 on success, ERR_SORT_FAILED on failure. */

Build a nodes table record: (id, project, label, name, qualified_name, file_path, start_line, end_line, properties)

Build the >50-file fixture into files[]/name_bufs[]/body_bufs[] (caller * arrays sized k_nfiles + REPRO787_FILLER_COUNT). Returns total file count.

Assemble dir/name+ext into a heap-allocated path. */

── Full-pipeline battery (dims 7-8) ─────────────────────────────────────── * * Indexes the single-file fixture through the production pipeline and

Open a .db file briefly, collect node/edge counts and root_path, * then append a JSON entry to arr. */

Build a projects table record: (name, indexed_at, root_path)