
The semantics mimic other languages like Python, Java, JS, etc. To advance past a zero-length match, the search algorithm first tries to find a non-zero alternative branch. If that fails, it force-advances by 1 character. Fixes: #13790, #13792, #18690, #26629
11 lines
295 B
ReStructuredText
11 lines
295 B
ReStructuredText
regex-fixes
|
|
-----------
|
|
|
|
* Regular expressions match the ``^`` anchor at most once in repeated
|
|
searches, at the start of the input. See policy :policy:`CMP0186`.
|
|
|
|
* References to unmatched groups are allowed, they are replaced with empty
|
|
strings.
|
|
|
|
* Zero-length matches are always allowed.
|