Re^12: [OT] The interesting problem of comparing (long) bit-strings.

Do you really expect someone to step in and provide you with a well-coded, robust, generic, library-quality implementation of a bitstring search

No. Something more than unsubstantiated statements of opinion would be nice though.

Something -- pseudo-code, a link, a paper (on bit-string search) -- anything more than "I think...therefore it must be so", would be good.

I've stated what I'm doing; I've posted enough code to show how I'm doing it; I've posted a substantial table of the results.

I've explained (ad-neaseum) why I don't believe Boyer-Moore works for bit-string search; and all I've got in return is opinions. (apart from oiskuu who posted code that doesn't appear to work!)

I really think that until you've tried to implement this; you do not appreciate that trying to extrapolate byte-string search algorithms to bit-string search is fraught with problems that YOU haven't thought about. I have, because I done it!

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^12: [OT] The interesting problem of comparing (long) bit-strings.