Your proposal seem to assume that there will be one continuous sequence of the N characters in the mask. What if there are non-N characters between $start and $start+$length?
In reply to Re^2: Lower-casing Substrings and Iterating Two Files together
by kirillm
in thread Lower-casing Substrings and Iterating Two Files together
by neversaint
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |