1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
|
/* tags.cc - Iterator for tags returned from message or thread
*
* 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-cxx.h"
#include "database-private.h"
#include <xapian.h>
typedef struct _notmuch_terms {
char prefix_char;
Xapian::TermIterator iterator;
Xapian::TermIterator iterator_end;
} notmuch_terms_t;
struct _notmuch_tags {
notmuch_terms_t terms;
};
notmuch_terms_t *
_notmuch_terms_create (void *ctx,
Xapian::Document doc,
const char *prefix_name);
/* The assertion is to ensure that 'type' is a derivative of
* notmuch_terms_t in that it contains a notmuch_terms_t as its first
* member. We do this by name of 'terms' as opposed to type, because
* that's as clever as I've been so far. */
#define _notmuch_terms_create_type(ctx, doc, prefix_name, type) \
(COMPILE_TIME_ASSERT(offsetof(type, terms) == 0), \
(type *) _notmuch_terms_create (ctx, doc, prefix_name))
/* 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_terms_destructor (notmuch_terms_t *terms)
{
terms->iterator.~TermIterator ();
terms->iterator_end.~TermIterator ();
return 0;
}
notmuch_terms_t *
_notmuch_terms_create (void *ctx,
Xapian::Document doc,
const char *prefix_name)
{
notmuch_terms_t *terms;
const char *prefix = _find_prefix (prefix_name);
/* Currently, notmuch_terms_t is written with the assumption that
* any prefix its derivatives use will be only a single
* character. */
assert (strlen (prefix) == 1);
terms = talloc (ctx, notmuch_terms_t);
if (unlikely (terms == NULL))
return NULL;
terms->prefix_char = *prefix;
new (&terms->iterator) Xapian::TermIterator;
new (&terms->iterator_end) Xapian::TermIterator;
talloc_set_destructor (terms, _notmuch_terms_destructor);
terms->iterator = doc.termlist_begin ();
terms->iterator.skip_to (prefix);
terms->iterator_end = doc.termlist_end ();
return terms;
}
static notmuch_bool_t
_notmuch_terms_has_more (notmuch_terms_t *terms)
{
std::string s;
if (terms->iterator == terms->iterator_end)
return FALSE;
s = *terms->iterator;
if (! s.empty () && s[0] == terms->prefix_char)
return TRUE;
else
return FALSE;
}
static const char *
_notmuch_terms_get (notmuch_terms_t *terms)
{
return talloc_strdup (terms, (*terms->iterator).c_str () + 1);
}
static void
_notmuch_terms_advance (notmuch_terms_t *terms)
{
terms->iterator++;
}
static void
_notmuch_terms_destroy (notmuch_terms_t *terms)
{
talloc_free (terms);
}
notmuch_tags_t *
_notmuch_tags_create_terms (void *ctx,
Xapian::Document doc,
const char *prefix_name)
{
return _notmuch_terms_create_type (ctx, doc, prefix_name, notmuch_tags_t);
}
notmuch_bool_t
notmuch_tags_has_more (notmuch_tags_t *tags)
{
return _notmuch_terms_has_more (&tags->terms);
}
const char *
notmuch_tags_get (notmuch_tags_t *tags)
{
return _notmuch_terms_get (&tags->terms);
}
void
notmuch_tags_advance (notmuch_tags_t *tags)
{
return _notmuch_terms_advance (&tags->terms);
}
void
notmuch_tags_destroy (notmuch_tags_t *tags)
{
return _notmuch_terms_destroy (&tags->terms);
}
|
