<regex>: Simplify matching of _N_if NFA nodes in leftmost-longest mode (#5405)

muellerj2 · web-flow · commit f57e71da2ba7 · 2025-04-22T14:20:24.000-07:00
diff --git a/stl/inc/regex b/stl/inc/regex
@@ -3198,26 +3198,15 @@ bool _Matcher<_BidIt, _Elem, _RxTraits, _It>::_Do_if(_Node_if* _Node) { // apply
     }
 
     // see if there is a longer match
-    _Tgt_state_t<_It> _Final = _Tgt_state;
-    auto _Final_len          = _STD distance(_St._Cur, _Tgt_state._Cur);
     for (;;) { // process one branch of if
         _Node = _Node->_Child;
         if (!_Node) {
             break;
         }
 
         _Tgt_state = _St;
-        if (_Match_pat(_Node->_Next)) { // record match if it is longer
-            const auto _Len = _STD distance(_St._Cur, _Tgt_state._Cur);
-            if (_Final_len < _Len) { // memorize longest so far
-                _Final     = _Tgt_state;
-                _Final_len = _Len;
-            }
-        }
+        (void) _Match_pat(_Node->_Next);
     }
-
-    // set the input end to the longest match
-    _Tgt_state = _Final;
     return true;
 }
 
