Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Detect and handle hardlinks #16

Open
ssokolow opened this issue Aug 21, 2014 · 0 comments
Open

Detect and handle hardlinks #16

ssokolow opened this issue Aug 21, 2014 · 0 comments

Comments

@ssokolow
Copy link
Owner

  1. It's a waste of time to read the same inode once for each hardlink associated with it and unnecessarily slows things down if the user re-runs fastdupes later.
  2. It doesn't make much sense to list things as duplicates when, presumably, the hardlinking was the chosen method of deduplication.
  3. At the same time, it's not immediately obvious how to represent multiple names for the same inode in the output. (Possibly indenting all but the first one?)

I'll need to come up with some proposals than implement a groupBy classifier that operates on inodes. Ideally, sharing cached stat() results with the size classifier.

(Though its output won't behave quite the same way as the others since, instead of determining what should be compared to what in the final full-content examination, it'll be used to determine which paths don't need to be compared at all.)

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Projects
None yet
Development

No branches or pull requests

1 participant