How to find offsets in Unicode Text fast

[Brian Milby]

I just pushed an updated binary stack that adds check boxes for case
sensitive and no overlaps.  These settings are per card so separate tests
can be performed each way.  Of note, the search for "The" in John 1 is
quite a bit faster if case sensitive is true.  Also, if case sensitive is
true, then the Offset method is just as fast as the one Geoff developed -
even without converting to UTF16/32.

My code can be found here:
https://github.com/bwmilby/alloffsets/tree/bwm/bwm

Thanks,
Brian