The \A anchor in the scanner's adjacencyProbe is untested: with the anchor removed and the fixed probe window kept, the whole scanner package passes (confirmed by the gallop lane's second implementer and by its review, item 4). scanAllPatterns rejects any probe match whose start is not 0, so an unanchored probe returns no wrong result; the window still bounds each attempt, so the loss is a constant-factor cost (each attempt searches its whole window for a leftmost match instead of failing at byte 0, up to 512x per attempt), not a wrong finding. No cost guard sees it, because the count guards assert growth ratios and a constant factor leaves every ratio unchanged. This duplicates the parked iss-2609021205449871, which is not on main: whoever lands the parked sweep closes one of the pair as a duplicate of the other. <!-- record-lint: forward-looking -->

The \A anchor in the scanner's adjacencyProbe is untested: with the anchor removed and the fixed probe window kept, the whole scanner package passes (confirmed by the gallop lane's second implementer and by its review, item 4). scanAllPatterns rejects any probe match whose start is not 0, so an unanchored probe returns no wrong result; the window still bounds each attempt, so the loss is a constant-factor cost (each attempt searches its whole window for a leftmost match instead of failing at byte 0, up to 512x per attempt), not a wrong finding. No cost guard sees it, because the count guards assert growth ratios and a constant factor leaves every ratio unchanged. This duplicates the parked iss-2609021205449871, which is not on main: whoever lands the parked sweep closes one of the pair as a duplicate of the other.

Grounds

• pursued: removing the start anchor now fails a test; a mutant with the anchor dropped that passes the package would show it wrong