in reply to Re^9: [OT] The interesting problem of comparing bit-strings.
in thread [OT] The interesting problem of comparing bit-strings.
In your diagram above, draw two vertical pencil-lines, 64 bits apart, with at least 64 bits to the left of the leftmost line. (In other words, this is the second quadword in the value being sought.)
There is no "second quadword in the value being sought", there are SIXTY FOUR second quadwords being sought; because the second quadword of the needle, could appear at any bit offset!
Even though the haystack might consist of millions of exact repetitions of the needle. They only need to be offset from the alignment by 1 bit (or 2 bits, or 3 bits or ... or 62-bits) and your REPNE SCASx instruction will simply never *&^&&%$ see them!
Please stop talking bollocks, and STFU.
|Replies are listed 'Best First'.|
Re^11: [OT] The interesting problem of comparing bit-strings.
by AppleFritter (Vicar) on Mar 25, 2015 at 20:06 UTC