1 /* message.cc - Results of message-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 struct _notmuch_message {
30 struct _notmuch_tags {
31 Xapian::TermIterator iterator;
32 Xapian::TermIterator iterator_end;
35 #define ARRAY_SIZE(arr) (sizeof (arr) / sizeof (arr[0]))
37 /* These prefix values are specifically chosen to be compatible
38 * with sup, (http://sup.rubyforge.org), written by
39 * William Morgan <wmorgan-sup@masanjin.net>, and released
40 * under the GNU GPL v2.
48 prefix_t NORMAL_PREFIX[] = {
51 { "from_name", "FN" },
57 prefix_t BOOLEAN_PREFIX[] = {
59 { "from_email", "FE" },
65 { "attachment_extension", "O" },
72 _find_prefix (const char *name)
76 for (i = 0; i < ARRAY_SIZE (NORMAL_PREFIX); i++)
77 if (strcmp (name, NORMAL_PREFIX[i].name) == 0)
78 return NORMAL_PREFIX[i].prefix;
80 for (i = 0; i < ARRAY_SIZE (BOOLEAN_PREFIX); i++)
81 if (strcmp (name, BOOLEAN_PREFIX[i].name) == 0)
82 return BOOLEAN_PREFIX[i].prefix;
87 /* We end up having to call the destructor explicitly because we had
88 * to use "placement new" in order to initialize C++ objects within a
89 * block that we allocated with talloc. So C++ is making talloc
90 * slightly less simple to use, (we wouldn't need
91 * talloc_set_destructor at all otherwise).
94 _notmuch_message_destructor (notmuch_message_t *message)
96 message->doc.~Document ();
102 _notmuch_message_create (notmuch_results_t *owner,
103 notmuch_database_t *notmuch,
104 Xapian::docid doc_id)
106 notmuch_message_t *message;
108 message = talloc (owner, notmuch_message_t);
109 if (unlikely (message == NULL))
112 new (&message->doc) Xapian::Document;
114 talloc_set_destructor (message, _notmuch_message_destructor);
116 message->doc = notmuch->xapian_db->get_document (doc_id);
122 notmuch_message_get_message_id (notmuch_message_t *message)
124 Xapian::TermIterator i;
126 i = message->doc.termlist_begin ();
128 if (i != message->doc.termlist_end ())
129 return talloc_strdup (message, (*i).c_str () + 1);
134 /* We end up having to call the destructors explicitly because we had
135 * to use "placement new" in order to initialize C++ objects within a
136 * block that we allocated with talloc. So C++ is making talloc
137 * slightly less simple to use, (we wouldn't need
138 * talloc_set_destructor at all otherwise).
141 _notmuch_tags_destructor (notmuch_tags_t *tags)
143 tags->iterator.~TermIterator ();
144 tags->iterator_end.~TermIterator ();
150 notmuch_message_get_tags (notmuch_message_t *message)
152 notmuch_tags_t *tags;
154 tags = talloc (message, notmuch_tags_t);
155 if (unlikely (tags == NULL))
158 new (&tags->iterator) Xapian::TermIterator;
159 new (&tags->iterator_end) Xapian::TermIterator;
161 talloc_set_destructor (tags, _notmuch_tags_destructor);
163 tags->iterator = message->doc.termlist_begin ();
164 tags->iterator.skip_to ("L");
165 tags->iterator_end = message->doc.termlist_end ();
171 notmuch_message_destroy (notmuch_message_t *message)
173 talloc_free (message);
177 notmuch_tags_has_more (notmuch_tags_t *tags)
181 if (tags->iterator == tags->iterator_end)
185 if (s.size () && s[0] == 'L')
192 notmuch_tags_get (notmuch_tags_t *tags)
194 return talloc_strdup (tags, (*tags->iterator).c_str () + 1);
198 notmuch_tags_advance (notmuch_tags_t *tags)
204 notmuch_tags_destroy (notmuch_tags_t *tags)