blob: 2f7c283ecbb220a3fcf6dca033efced805791335 (
plain)
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
|
/* messages.c - Iterator for a set of messages
*
* 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 <glib.h> /* GList */
struct _notmuch_messages {
notmuch_message_node_t *iterator;
};
/* Create a new notmuch_message_list_t object, with 'ctx' as its
* talloc owner.
*
* This function can return NULL in case of out-of-memory.
*/
notmuch_message_list_t *
_notmuch_message_list_create (const void *ctx)
{
notmuch_message_list_t *list;
list = talloc (ctx, notmuch_message_list_t);
if (unlikely (list == NULL))
return NULL;
list->head = NULL;
list->tail = &list->head;
return list;
}
/* Append 'node' (which can of course point to an arbitrarily long
* list of nodes) to the end of 'list'.
*/
void
_notmuch_message_list_append (notmuch_message_list_t *list,
notmuch_message_node_t *node)
{
*(list->tail) = node;
list->tail = &node->next;
}
/* Allocate a new node for 'message' and append it to the end of
* 'list'.
*/
void
_notmuch_message_list_add_message (notmuch_message_list_t *list,
notmuch_message_t *message)
{
notmuch_message_node_t *node = talloc (list, notmuch_message_node_t);
node->message = message;
node->next = NULL;
_notmuch_message_list_append (list, node);
}
notmuch_messages_t *
_notmuch_messages_create (notmuch_message_list_t *list)
{
notmuch_messages_t *messages;
if (list->head == NULL)
return NULL;
messages = talloc (list, notmuch_messages_t);
if (unlikely (messages == NULL))
return NULL;
messages->iterator = list->head;
return messages;
}
notmuch_bool_t
notmuch_messages_has_more (notmuch_messages_t *messages)
{
return (messages != NULL && messages->iterator != NULL);
}
notmuch_message_t *
notmuch_messages_get (notmuch_messages_t *messages)
{
if (messages->iterator == NULL)
return NULL;
return messages->iterator->message;
}
void
notmuch_messages_advance (notmuch_messages_t *messages)
{
if (messages->iterator == NULL)
return;
messages->iterator = messages->iterator->next;
}
void
notmuch_messages_destroy (notmuch_messages_t *messages)
{
talloc_free (messages);
}
|
