Initial try at checking the best byte in [0,lmin) rather than always
byte 0 for starting threads.
Check best two-byte sequence in [0,lmin] rather than always byte 0 for
starting threads.
Adjusted Program serialization for best two-byte bitset.
Merge branch 'master' into best2byte
Merge branch 'master' into best2byte
Adjusted search(), startsWith() not to run off end of buffer when
checking two-byte sequences.
Adjusted VM tests to use two-byte init sequences.
Fixed some bugs in generating the best 2-byte factor. Added tests.
Excised some unused code. Added additional best two-byte tests.
Cleanup.
Use a std::set instead of a std::queue when walking the tree to prevent
multiple visits to the same depth-vertex pairs. Duh.