I bet you could use the same basic idea of building a state machine of the next address to check
Um. Boyer Moore is an optimisation of the basic string search isn't it?
Right now I'm stuck just trying to implement the basic search taking into account the bit-level offsets. Optimisations can come later if required.
In reply to Re^2: [OT] The interesting problem of comparing bit-strings.
by BrowserUk
in thread [OT] The interesting problem of comparing bit-strings.
by BrowserUk
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |