Re^2: Binary Comparision

When I've built these sorts of byte and bit scanners in the past I've tended to use two buffers to read into. I make one buffer the size of the largest search string and the other twice that size. Then I scan across the larger buffer to the halfway point, move the 2nd half of the data in the buffer up and stick a new chunk on it.

Later, I gave up on that and just used a 4 or 8k buffer that I loaded the second half of and worked in it. This strategy beats the file-size limit and the span issue at the same time.

Bit-wise scanning sucks, tho. That just isn't fun in Perl 5.

--
$you = new YOU;
honk() if $you->love(perl)

Comment on Re^2: Binary Comparision Download Code

Replies are listed 'Best First'.
Re^3: Binary Comparision by ikegami (Patriarch) on Feb 28, 2007 at 18:25 UTC
Thanks, but I've already implemented that my other post. I even optimized it to limit the amount of bytes that are scanned twice. `$block = substr($block, -($longuest_sig_len-1)) . $_; ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ ^^^^^^^^^ Minimal portion of last block New block` [download]	[reply] [d/l]