bdelta: Simple, fast binary diff/patch
Compute a patch between two ByteStrings which can later be applied to the first to produce the second. This can be used to save bandwidth and disk space when many strings differing by a small number of bytes need to be transmitted or stored.
The underlying implementation is written in C, and can also be found at http://ccan.ozlabs.org/info/bdelta.html.
Currently, a patch does not save any space when two strings differ by more than 1000 bytes. This arbitrary limit serves to keep applications from spiking in memory and CPU usage, as the algorithm uses quadratic space and time with respect to the length of the patch. A better algorithm may be introduced in a future version of bdelta.
|Versions [faq]||0.1, 0.1.1, 0.1.1.1|
|Dependencies||base (==4.*), bytestring [details]|
|Copyright||Copyright (c) Joseph Adams 2011|
|Source repo||head: git clone git://github.com/joeyadams/haskell-bdelta.git|
|Uploaded||by JoeyAdams at Wed Sep 21 08:23:48 UTC 2011|
|Downloads||1696 total (37 in the last 30 days)|
|Rating||(no votes yet) [estimated by rule of succession]|
Docs uploaded by user
Build status unknown [no reports yet]
For package maintainers and hackage trustees