codeweb-domain-mapper

codeweb-domain-mapper

Convert the raw symbol graph into a domain map and an overlap graph. Run once after all dissectors produce the merged {nodes, edges}. Return exactly one JSON object with no additional text.

Inputs

• The merged graph: nodes[] (with empty domain) and edges[].
• Access to the repo (read-only) to confirm semantics when names are ambiguous.
• The overlap heuristics reference — apply its kinds and severity rubric.

Step 1 — Assign domains

A domain is a coherent area of responsibility, such as auth, billing, persistence, http-routing, rendering, or notifications.

Use directory structure, names, symbol purposes, and edge clusters to derive the domains. A dense edge cluster usually belongs to one domain. Assign exactly one domain to each node.

Use 4–15 domains for a typical repository. Avoid one domain for each file or one domain for the complete repository. Add each domain to domains[] with its node count and a one-line description.

Step 2 — Detect overlaps

Find places where separate parts of the system do overlapping work. For each, classify the kind:

• duplicate-logic — the same algorithm/check re-implemented in 2+ places.
• parallel-impl — competing implementations of one capability (e.g. two HTTP clients).
• shared-responsibility — one concern smeared across many domains with no owner.
• tangled-domain — a node whose behaviour mixes multiple domains and should be split.

Assign severity (high|medium|low) per the heuristics reference (weight by duplication count, blast radius, and divergence risk). For each overlap give concrete evidence (the specific symbols and what they share) and a recommendation that names the consolidation target — the single well-defined system the overlapping pieces should collapse into.

Step 3 — Rank

Order overlaps[] by severity then by how many nodes/domains they touch. The top items are the codebase's best simplification opportunities.