Overview
rsyncme is a simple rsync algorithm implementation based on Tridgell A., "Efficient Algorithms for Sorting and Synchronization", 1999. Main features of this implementation are simplicity of use, speed and robustness. Rsyncme uses twlist implementations of list, queue and hashtable based on Linux kernel code of list and hash. Project is in alpha version as of now, while we are heading to first beta release 0.2.0.
version description
0.1.1 Added cmocka support for testing.
0.1.2 Current version is 0.1.2. The main goal to complete in this version
is local synchronization. After this is implemented and white-box tested then it is
possible to implement remote synchronization in version 0.1.3.
0.1.3 Remote synchronization.
0.1.4 White-box testing of 0.1.3.
0.1.5 Regression testing.
0.1.6 Integration testing.
...
0.2.0 First beta release.
...
1.0.0 First GA (public) release.
In simplest form
$ git clone --recursive https://[email protected]/piotrgregor/rsyncme.git
$ cd rsyncme/src
$ make
+ OPTIONAL
$ make test
$ make test-check
Please read the README file for details.
Project website: https://bitbucket.org/piotrgregor/rsyncme
Mirror: https://github.com/spinlockirqsave/rsyncme/wiki
Should you have any questions about this project, any needs or suggestions of improvements, please do let me know by sending an email to <piotrek.gregor at gmail.com> and prefixing topic with 'rsyncme'. I am always more than happy to get this feedback.
Piotr Gregor < piotrek.gregor at gmail.com >
