reatom-extension-candidates

To find reusable Reatom patterns without over-abstraction, locate repeated primitive-shaped code like atoms or actions and classify each instance against a strict decision ladder to determine if it belongs in core, reusables, or should remain inline. This evidence-based triage prevents incorrect abstractions during refactoring.

Triage repeated Reatom code for upstream contribution by applying a decision ladder that checks minimum-bar criteria and upstream-to-reusables signals. Classify the patterns as core, reusables, or local extensions, and validate candidates using optional upstream checklist criteria to prepare a defensible proposal.

Leave duplicated Reatom wiring inline when the pattern fails to meet the minimum-bar criteria for generic reuse during the triage ladder evaluation. If the code is too specific to your local codebase context and lacks evidence of broad applicability, extracting a local extension would risk over-abstraction.

This triage process explicitly excludes active bug-debugging and bootstrap ordering work, targeting instead existing codebases during refactoring audits and dependency decisions. It focuses on discovering repeated primitive-shaped patterns and evaluating their reuse quality, not resolving runtime execution order or state errors.

The best way to audit Reatom dependencies is to detect repeated primitive-shaped patterns and apply a strict decision ladder that evaluates upstream coverage. Compare the findings against core and reatom/reusables coverage to determine whether a local factory or a formal extension is the correct defensible classification.

Reatom pattern discovery requires evidence-based classification for code refactoring, producing a quick triage table and detailed findings with file-path evidence. This ensures every abstraction recommendation is defensible and directly traces back to concrete instances of repeated wiring in the codebase.