mirror of
https://git.notmuchmail.org/git/notmuch
synced 2024-11-22 19:08:09 +01:00
143 lines
3.5 KiB
C++
143 lines
3.5 KiB
C++
/* message.cc - Results of message-based searches from a notmuch database
|
|
*
|
|
* Copyright © 2009 Carl Worth
|
|
*
|
|
* This program is free software: you can redistribute it and/or modify
|
|
* it under the terms of the GNU General Public License as published by
|
|
* the Free Software Foundation, either version 3 of the License, or
|
|
* (at your option) any later version.
|
|
*
|
|
* This program is distributed in the hope that it will be useful,
|
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
* GNU General Public License for more details.
|
|
*
|
|
* You should have received a copy of the GNU General Public License
|
|
* along with this program. If not, see http://www.gnu.org/licenses/ .
|
|
*
|
|
* Author: Carl Worth <cworth@cworth.org>
|
|
*/
|
|
|
|
#include "notmuch-private.h"
|
|
#include "database-private.h"
|
|
|
|
#include <xapian.h>
|
|
|
|
struct _notmuch_message {
|
|
Xapian::Document doc;
|
|
};
|
|
|
|
struct _notmuch_tags {
|
|
Xapian::TermIterator iterator;
|
|
Xapian::TermIterator iterator_end;
|
|
};
|
|
|
|
/* We end up having to call the destructor explicitly because we had
|
|
* to use "placement new" in order to initialize C++ objects within a
|
|
* block that we allocated with talloc. So C++ is making talloc
|
|
* slightly less simple to use, (we wouldn't need
|
|
* talloc_set_destructor at all otherwise).
|
|
*/
|
|
static int
|
|
_notmuch_message_destructor (notmuch_message_t *message)
|
|
{
|
|
message->doc.~Document ();
|
|
|
|
return 0;
|
|
}
|
|
|
|
notmuch_message_t *
|
|
_notmuch_message_create (notmuch_results_t *owner,
|
|
notmuch_database_t *notmuch,
|
|
Xapian::docid doc_id)
|
|
{
|
|
notmuch_message_t *message;
|
|
|
|
message = talloc (owner, notmuch_message_t);
|
|
if (unlikely (message == NULL))
|
|
return NULL;
|
|
|
|
new (&message->doc) Xapian::Document;
|
|
|
|
talloc_set_destructor (message, _notmuch_message_destructor);
|
|
|
|
message->doc = notmuch->xapian_db->get_document (doc_id);
|
|
|
|
return message;
|
|
}
|
|
|
|
const char *
|
|
notmuch_message_get_message_id (notmuch_message_t *message)
|
|
{
|
|
Xapian::TermIterator i;
|
|
|
|
i = message->doc.termlist_begin ();
|
|
i.skip_to ("Q");
|
|
if (i != message->doc.termlist_end ())
|
|
return talloc_strdup (message, (*i).c_str () + 1);
|
|
else
|
|
return NULL;
|
|
}
|
|
|
|
/* We end up having to call the destructors explicitly because we had
|
|
* to use "placement new" in order to initialize C++ objects within a
|
|
* block that we allocated with talloc. So C++ is making talloc
|
|
* slightly less simple to use, (we wouldn't need
|
|
* talloc_set_destructor at all otherwise).
|
|
*/
|
|
static int
|
|
_notmuch_tags_destructor (notmuch_tags_t *tags)
|
|
{
|
|
tags->iterator.~TermIterator ();
|
|
tags->iterator_end.~TermIterator ();
|
|
|
|
return 0;
|
|
}
|
|
|
|
notmuch_tags_t *
|
|
notmuch_message_get_tags (notmuch_message_t *message)
|
|
{
|
|
notmuch_tags_t *tags;
|
|
|
|
tags = talloc (message, notmuch_tags_t);
|
|
if (unlikely (tags == NULL))
|
|
return NULL;
|
|
|
|
new (&tags->iterator) Xapian::TermIterator;
|
|
new (&tags->iterator_end) Xapian::TermIterator;
|
|
|
|
talloc_set_destructor (tags, _notmuch_tags_destructor);
|
|
|
|
tags->iterator = message->doc.termlist_begin ();
|
|
tags->iterator.skip_to ("L");
|
|
tags->iterator_end = message->doc.termlist_end ();
|
|
|
|
return tags;
|
|
}
|
|
|
|
notmuch_bool_t
|
|
notmuch_tags_has_more (notmuch_tags_t *tags)
|
|
{
|
|
std::string s;
|
|
|
|
if (tags->iterator == tags->iterator_end)
|
|
return FALSE;
|
|
|
|
s = *tags->iterator;
|
|
if (s.size () && s[0] == 'L')
|
|
return TRUE;
|
|
else
|
|
return FALSE;
|
|
}
|
|
|
|
const char *
|
|
notmuch_tags_get (notmuch_tags_t *tags)
|
|
{
|
|
return talloc_strdup (tags, (*tags->iterator).c_str () + 1);
|
|
}
|
|
|
|
void
|
|
notmuch_tags_advance (notmuch_tags_t *tags)
|
|
{
|
|
tags->iterator++;
|
|
}
|