Finding a reasonably compact example to demonstrate the problem has (I think) allowed me to clarify where the problem lies.
Perl -v == 5.8.3, though 5.8.2 and 5.8.1 also suffer the same problem.
The scalars I am searching contain packed binary (numeric) data. To avoid the need to unpack large volumes of data before looking to see if certain values exist within the scalar, I was converting the search value to it's binary representation and then searching for that using index. Obviously, to avoid mismatches, once the search term is located, it is necessary to check that the match occured at a boundary appropriate to the size of the packed elements. Eg. If the scalar contains 0x00ff, 0xff00 & 0xffff in that (non-byte swapped) order, then when searching for 0xffff, you have to check that the position at which it is found is word-aligned, in order to not fall for the false hit at the zero-based index position 1.
$s = x'00ffff00ffff';
# [ffff] this a non word-aligned false hit
# [ffff] Word-align true hit
However, testing for alignment using index requires putting the search into a loop to skip over false hits and detect later true ones. It's also necessary to avoid arbitrary abuttments of binary bytes being misinterpreted as unicode data, hence the use of use bytes;
It struck me that rather than have a loop to test the alignment and continue after misaligned matches, I could move the search and alignment test into the regex engine.
print "'$1' found at ", pos( $s ) - 4
while $s =~ m[(?<=^.{4})*?(....)]g;
'the ' found at 0
'quic' found at 4
'k br' found at 8
'own ' found at 12
'fox ' found at 16
'jump' found at 20
's ov' found at 24
'er t' found at 28
'he l' found at 32
'azy ' found at 36
Unfortunately, it seems that use bytes is not honoured by the regex engine, at least as far as the numbers in repetition modifiers are concerned.
Examine what is said, not who speaks.
"Efficiency is intelligent laziness." -David Dunham
"Think for yourself!" - Abigail
|