Deduplicate Recursive SMARTS Solves

[scal444]

When the same recursive SMARTS occurs multiple times at the same level, we should solve it once and broadcast rather than solving multiple times. We do that simply by mapping the pattern to multiple output bits. If that ever becomes a problem we could alias bits.

[greptile-apps]

Confidence Score: 5/5

The PR appears safe to merge, with no outstanding correctness, security, or repository-rule issues identified.

Summary

The PR deduplicates equivalent recursive SMARTS patterns at each nesting depth, evaluates each unique pattern once, and broadcasts its result through a combined bit mask.

• Uses depth-qualified SMARTS strings to identify duplicate patterns.
• Replaces single pattern IDs with masks covering equivalent occurrences.
• Reuses precomputed per-query pattern metadata during mini-batch preprocessing.
• Adds preprocessing and end-to-end matching coverage for repeated flat and nested recursive patterns.

_{Reviews (3) · Last reviewed commit: "Remove unused recursive preprocessor par..."}

[evasnow1992]

Thank you for add the deduplication. Changes look good to me. One comment for cleaning up an unused parameter.