X-Git-Url: https://git.notmuchmail.org/git?p=notmuch;a=blobdiff_plain;f=TODO;h=87f84a42935920d26c0503661288d6d1a2c0aa0b;hp=65d6c75ccea0f72e89d1128e173077d7fa76e081;hb=8b445212e46a194b59edbd6857449430fe460165;hpb=793cbf80495b8230e0b4de6ac609e2ca88b7dd4b

diff --git a/TODO b/TODO
index 65d6c75c..87f84a42 100644
--- a/TODO
+++ b/TODO
@@ -4,9 +4,7 @@ Fix the things that are causing the most pain to new users
 
 2. Allow an easy way to get tags from directory names (if the user has them)
 
-3. Make emacs fast for big search results (see "lazy searching" below)
-
-4. Fix Xapian defect #250 so tagging is fast.
+3. Fix Xapian defect #250 so tagging is fast.
 
 Emacs interface (notmuch.el)
 ----------------------------
@@ -17,11 +15,7 @@ Add a global keybinding table for notmuch, and then view-specific
 tables that add to it.
 
 Add a command to archive all threads in a search view.
-
-Lazy searching: call "notmuch search" with --first and --max to fill
-just a screenful of results, and then fill in more as ther user pages
-through the buffer.
-
+	
 Add a '|' binding from the search view.
 
 Add a binding to run a search from notmuch-show-mode.
@@ -47,8 +41,6 @@ Portability
 -----------
 Fix configure script to test each compiler warning we want to use.
 
-Implement strndup locally (or call talloc_strndup instead).
-
 Implement getline locally, (look at gnulib).
 
 Completion
@@ -119,6 +111,10 @@ any of this we're probably going to need to break down an write our
 own parser for the query string rather than using Xapian's QueryParser
 class.
 
+Make failure to read a file (such as a permissions problem) a warning
+rather than an error (should be similar to the existing warning for a
+non-mail file).
+
 Add support for files that are moved or deleted (which obviously need
 to be handled differently).
 
@@ -134,6 +130,11 @@ Add support for configuring "virtual tags" which are a tuple of
 (tag-name, search-specification). The database is responsible for
 ensuring that the virtual tag is always consistent.
 
+Think about optimizing chunked searches (max-threads > 0) to avoid
+repeating work. That would be saving state from the previous chunk and
+reusing it if the next search is the next chunk with the same search
+string.
+
 General
 -------
 Audit everything for dealing with out-of-memory (and drop xutil.c).