This is a preliminary proof-of-concept implementation of bsdiff
using libdivsufsort instead of qsufsort. (if we consider this
as the right direction I'll import the code into vendor area
instead).
My test shows this would offer a 36% speed up for generating
patch.
Ported from Chromium: https://chromium-review.googlesource.com/#/c/1080/
x before
+ after
+------------------------------------------------------------+
| + x | ||
| + x | ||
| + x | ||
| ++ xx | ||
| A | A | |
+------------------------------------------------------------+
N Min Max Median Avg Stddev
x 5 8.56 8.6 8.58 8.584 0.016733201
+ 5 5.41 5.44 5.43 5.426 0.011401754
Difference at 95.0% confidence
-3.158 +/- 0.0208817
-36.7894% +/- 0.243263%
(Student's t, pooled s = 0.0143178)