From c9d59b1ca908be5a3ff82f3bf555a6784878c892 Mon Sep 17 00:00:00 2001 From: Stephan Sokolow Date: Wed, 20 Aug 2014 19:37:20 -0400 Subject: [PATCH] Move more TODOs into issues #12, #13, and #14. --- fastdupes.py | 5 ----- 1 file changed, 5 deletions(-) diff --git a/fastdupes.py b/fastdupes.py index 16629ab..16bd833 100644 --- a/fastdupes.py +++ b/fastdupes.py @@ -10,10 +10,6 @@ --snip-- @todo: - - When in hash comparison mode, start the second comparison at the point the - header check left off at. (Which, for small files, means to just skip it) - - The result groups should be sorted by their first entry and the entries - within each group should be sorted too. - As I understand it, C{fnmatch.fnmatch} uses regexes internally and doesn't cache them. Given how many times it gets called, I should try using C{re.compile} with C{fnmatch.translate} instead. @@ -34,7 +30,6 @@ U{http://ubuntu.wordpress.com/2005/10/08/find-duplicate-copies-of-files/} - Look into possible solutions for pathological cases of thousands of files with the same size and same pre-filter results. (File handle exhaustion) - - Support displaying duplicated directory trees as single results. - Run this through a memory profiler and look for obvious bloat to trim. - Look into supporting gettext localization.