sub f { 'network' =~ /^network$/g } print f()?1:0, "\n" for 1..6;
1 0 1 0 1 0
The failing match should be faster than the succeeding match.
In reply to Re^2: Why this code run faster?
by ikegami
in thread Why this code run faster?
by Gangabass
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |