+/* If the user asks for a *lot* of threads, lets give some results as
+ * quickly as possible and let the user read those while we compute
+ * the remainder. */
+#define NOTMUCH_SHOW_INITIAL_BURST 100
+
+static void
+do_search_threads (const void *ctx,
+ notmuch_query_t *query,
+ notmuch_sort_t sort,
+ int first, int max_threads)
+{
+ notmuch_thread_t *thread;
+ notmuch_threads_t *threads;
+ notmuch_tags_t *tags;
+ time_t date;
+ const char *relative_date;
+
+ for (threads = notmuch_query_search_threads (query, first, max_threads);
+ notmuch_threads_has_more (threads);
+ notmuch_threads_advance (threads))
+ {
+ int first_tag = 1;
+
+ thread = notmuch_threads_get (threads);
+
+ if (sort == NOTMUCH_SORT_OLDEST_FIRST)
+ date = notmuch_thread_get_oldest_date (thread);
+ else
+ date = notmuch_thread_get_newest_date (thread);
+
+ relative_date = notmuch_time_relative_date (ctx, date);
+
+ printf ("thread:%s %12s [%d/%d] %s; %s",
+ notmuch_thread_get_thread_id (thread),
+ relative_date,
+ notmuch_thread_get_matched_messages (thread),
+ notmuch_thread_get_total_messages (thread),
+ notmuch_thread_get_authors (thread),
+ notmuch_thread_get_subject (thread));
+
+ printf (" (");
+ for (tags = notmuch_thread_get_tags (thread);
+ notmuch_tags_has_more (tags);
+ notmuch_tags_advance (tags))
+ {
+ if (! first_tag)
+ printf (" ");
+ printf ("%s", notmuch_tags_get (tags));
+ first_tag = 0;
+ }
+ printf (")\n");
+
+ notmuch_thread_destroy (thread);
+ }
+}
+