X-Git-Url: https://mattmccutchen.net/rsync/rsync.git/blobdiff_plain/430d841a2c6ee003d8ea5c9e083bcab98c939687..bb7c4fa3612a6202e92611acca7f25c0d8bcf799:/TODO

diff --git a/TODO b/TODO
index ef1bc312..5d720d38 100644
--- a/TODO
+++ b/TODO
@@ -32,6 +32,16 @@ use chroot
   for people who want to generate the file list using a find(1)
   command or a script.
 
+File list structure in memory
+
+  Rather than one big array, perhaps have a tree in memory mirroring
+  the directory tree.  
+
+  This might make sorting much faster!  (I'm not sure it's a big CPU
+  problem, mind you.)  
+
+  It might also reduce memory use in storing repeated directory names
+  -- again I'm not sure this is a problem.
 
 Performance
 
@@ -94,9 +104,6 @@ Memory accounting
   not sure this makes sense with modern mallocs.  At any rate it will
   make us allocate a huge amount of memory for large file lists.
 
-  We can try using the GNU/SVID/XPG mallinfo() function to get some
-  heap statistics.
-
 
 Hard-link handling