This leaves the current program behaviour as close as possible to the original behaviour
(with the exception of the byte by byte feeding to the hash algorithm which was probably
a bug)
* Increase block size ro 8MB to make the process faster and still light on
memory on a low memory machine
* Added a --quiet argument to reduce very verbose output.
Still needs a work over in terms of error handling, progress reporting, warning output, refactoring etc.
Also misses the volume reuse/reclaim algorithms.
But it passes the unit tests now, with and without a local database.
git-svn-id: https://duplicati.googlecode.com/svn/sandboxes/Kenneth/ForestHash@1526 59da171f-624f-0410-aa54-27559c288bec