i did implement this in C but want to add features i didn't have time for, so i set it aside. soon, i want to re-do the whole thing in Python.
this program scans (iterates?) through a file tree keeping track of regular files as it goes, particularly inodes, sizes, and times. when it encounters a file with the same size and different inode (and different time unless opted not to consider this), it will read the files and calculate a (probably strong, can be specified) checksum. if the checksum has previously been calculated, then the saved copy will be used. if 2 files (different inodes) are found to have the same checksum (and maybe also the same date/time, definitely also the same size and same filesystem), they will be assumed to be identical and will be hard linked together. the goal is to avoid duplicate space in subtrees where hardlinking doesn't matter.
this program scans (iterates?) through a file tree keeping track of regular files as it goes, particularly inodes, sizes, and times. when it encounters a file with the same size and different inode (and different time unless opted not to consider this), it will read the files and calculate a (probably strong, can be specified) checksum. if the checksum has previously been calculated, then the saved copy will be used. if 2 files (different inodes) are found to have the same checksum (and maybe also the same date/time, definitely also the same size and same filesystem), they will be assumed to be identical and will be hard linked together. the goal is to avoid duplicate space in subtrees where hardlinking doesn't matter.
Tradition is peer pressure from dead people
What do you call someone who speaks three languages? Trilingual. Two languages? Bilingual. One language? American.
What do you call someone who speaks three languages? Trilingual. Two languages? Bilingual. One language? American.