in reply to Re: Lower-casing Substrings and Iterating Two Files together
in thread Lower-casing Substrings and Iterating Two Files together
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?
|
|---|
| Replies are listed 'Best First'. | |
|---|---|
|
Re^3: Lower-casing Substrings and Iterating Two Files together
by linuxer (Curate) on Dec 27, 2008 at 16:26 UTC |