So I can do whatever I want on the "right side" with no undefined behaviour.
Great news!
I suppose you are saying that reentrancy is only an issue with ?{code} and ??{code} constructs.
I knew these were problematic (and experimental features) but thought that making substitutions using the re engine on the evaluated code could also be a problem.
Any idea where I can find documentation that mentions this explicitly
Thank you.
In reply to Re^2: is perl's regular expression engine reentrant ? (works)
by plank
in thread is perl's regular expression engine reentrant ?
by plank
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |