Re^6: [OT] The interesting problem of comparing bit-strings. (More info.)

Please see Re^6: [OT] The interesting problem of comparing bit-strings. for the problems of finding bitstring needles that cross byte boundaries using byte-wise operations.

In brief, you need to perform two (different) byte compares using two different byte masks at each of 7 different offsets (with different masks and comparison values for each) for every byte in the haystack in order to locate a single byte needle.

With the rise and rise of 'Social' network sites: 'Computers are making people easier to use everyday'

Examine what is said, not who speaks -- Silence betokens consent -- Love the truth but pardon error.

"Science is about questioning the status quo. Questioning authority". I'm with torvalds on this

In the absence of evidence, opinion is indistinguishable from prejudice. Agile (and TDD) debunked

Comment on Re^6: [OT] The interesting problem of comparing bit-strings. (More info.)

Replies are listed 'Best First'.
Re^7: [OT] The interesting problem of comparing bit-strings. (More info.) by marinersk (Priest) on Mar 25, 2015 at 15:52 UTC
Yes. And I am proposing that that is where your solution lies. This is a relatively simple but fun coding exercise. I happily accept the gauntlet, and will return with my shield, or on it..	[reply]
Re^8: [OT] The interesting problem of comparing bit-strings. (More info.) by marinersk (Priest) on Mar 25, 2015 at 20:19 UTC
Wow. I haven't been caught using "that that" in decades. I guess I was in too much of a hurry and hadn't had my coffee yet for that one.	[reply]