1 /* thread.cc - Results of thread-based searches from a notmuch database
3 * Copyright © 2009 Carl Worth
5 * This program is free software: you can redistribute it and/or modify
6 * it under the terms of the GNU General Public License as published by
7 * the Free Software Foundation, either version 3 of the License, or
8 * (at your option) any later version.
10 * This program is distributed in the hope that it will be useful,
11 * but WITHOUT ANY WARRANTY; without even the implied warranty of
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
13 * GNU General Public License for more details.
15 * You should have received a copy of the GNU General Public License
16 * along with this program. If not, see http://www.gnu.org/licenses/ .
18 * Author: Carl Worth <cworth@cworth.org>
21 #include "notmuch-private.h"
22 #include "database-private.h"
26 #include <glib.h> /* GHashTable */
28 struct _notmuch_thread {
29 notmuch_database_t *notmuch;
34 notmuch_bool_t has_message;
40 _notmuch_thread_destructor (notmuch_thread_t *thread)
42 g_hash_table_unref (thread->tags);
47 /* Create a new notmuch_thread_t object for an existing document in
50 * Here, 'talloc owner' is an optional talloc context to which the new
51 * thread will belong. This allows for the caller to not bother
52 * calling notmuch_thread_destroy on the thread, and know that all
53 * memory will be reclaimed with 'talloc_owner' is freed. The caller
54 * still can call notmuch_thread_destroy when finished with the
57 * The 'talloc_owner' argument can also be NULL, in which case the
58 * caller *is* responsible for calling notmuch_thread_destroy.
60 * This function returns NULL in the case of any error.
63 _notmuch_thread_create (const void *talloc_owner,
64 notmuch_database_t *notmuch,
65 const char *thread_id)
67 notmuch_thread_t *thread;
69 thread = talloc (talloc_owner, notmuch_thread_t);
70 if (unlikely (thread == NULL))
73 talloc_set_destructor (thread, _notmuch_thread_destructor);
75 thread->notmuch = notmuch;
76 thread->thread_id = talloc_strdup (thread, thread_id);
77 thread->subject = NULL;
78 thread->tags = g_hash_table_new_full (g_str_hash, g_str_equal,
81 thread->has_message = 0;
89 notmuch_thread_get_thread_id (notmuch_thread_t *thread)
91 return thread->thread_id;
95 _notmuch_thread_add_message (notmuch_thread_t *thread,
96 notmuch_message_t *message)
102 if (! thread->subject) {
104 subject = notmuch_message_get_header (message, "subject");
105 thread->subject = talloc_strdup (thread, subject);
108 for (tags = notmuch_message_get_tags (message);
109 notmuch_tags_has_more (tags);
110 notmuch_tags_advance (tags))
112 tag = notmuch_tags_get (tags);
113 g_hash_table_insert (thread->tags, xstrdup (tag), NULL);
116 date = notmuch_message_get_date (message);
118 if (date < thread->oldest || ! thread->has_message)
119 thread->oldest = date;
121 if (date > thread->newest || ! thread->has_message)
122 thread->newest = date;
124 thread->has_message = 1;
128 notmuch_thread_get_subject (notmuch_thread_t *thread)
130 return thread->subject;
134 notmuch_thread_get_oldest_date (notmuch_thread_t *thread)
136 return thread->oldest;
140 notmuch_thread_get_newest_date (notmuch_thread_t *thread)
142 return thread->newest;
146 notmuch_thread_get_tags (notmuch_thread_t *thread)
148 notmuch_tags_t *tags;
151 tags = _notmuch_tags_create (thread);
152 if (unlikely (tags == NULL))
155 keys = g_hash_table_get_keys (thread->tags);
157 for (l = keys; l; l = l->next)
158 _notmuch_tags_add_tag (tags, (char *) l->data);
162 _notmuch_tags_prepare_iterator (tags);
168 notmuch_thread_destroy (notmuch_thread_t *thread)
170 talloc_free (thread);