Untitled

Here is my logic for the comparing of the hash files in case the sync fails again.

 

File: test1

========================================================

aaa06b08037dbcb62570cb0ef6672734  /TEST1/usr/local/src/md5deep-4.1/src/utf8/unchecked.h

b73d30e88b9db3eab9732728cadabd76  /TEST1/usr/local/src/md5deep-4.1/src/utf8/core.h

3fc4217e1921d22a854acfbadd82d613  /TEST1/usr/local/src/md5deep-4.1/src/utf8/checked.h

========================================================

 

File: test2

========================================================

0d55a58b2864bd1bcfe8cee37432ea6d  /TEST2/usr/local/src/md5deep-4.1/man/Makefile.in

a6b8c48374b93527a8c085ffdb43ee59  /TEST2/usr/local/src/md5deep-4.1/man/tigerdeep.1

a6b8c48374b93527a8c085ffdb43ee59  /TEST2/usr/local/src/md5deep-4.1/man/whirlpooldeep.1

a6b8c48374b93527a8c085ffdb43ee59  /TEST2/usr/local/src/md5deep-4.1/man/sha1deep.1

a6b8c48374b93527a8c085ffdb43ee59  /TEST2/usr/local/src/md5deep-4.1/man/sha256deep.1

48cd1b862061561a21312b02c7dcf248  /TEST2/usr/local/src/md5deep-4.1/man/Makefile.am

1980113e6356c42a59794ad59521d06c  /TEST2/usr/local/src/md5deep-4.1/man/hashdeep.1

a6b8c48374b93527a8c085ffdb43ee59  /TEST2/usr/local/src/md5deep-4.1/man/md5deep.1

69e6f6ce3d3e91d83a212d3ae3740233  /TEST2/usr/local/src/md5deep-4.1/man/Makefile

b73d30e88b9db3eab9732728cadabd76  /TEST2/usr/local/src/md5deep-4.1/src/utf8/core.h

aaa06b08037dbcb62570cb0ef6672734  /TEST2/usr/local/src/md5deep-4.1/src/utf8/unchecked.h

3fc4217e1921d22a854acfbadd82d613  /TEST2/usr/local/src/md5deep-4.1/src/utf8/checked.h

========================================================

 

$sort test* | uniq -c -w 32 | grep "^      1 "

 

Basically I am reading both files (test*) and sorting them. Then I am showing the number of occurrences for the first 32 characters(THE HASH). Then I filter the listing by files with only 1 occurrence. This will allow me to see which side has a file and which side doesn’t to determine a copy or a delete.

 

Does this look or at least sound logical?