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
158
|
/* -*- Mode: C; tab-width: 8; indent-tabs-mode: t; c-basic-offset: 8 -*- */
/* camel-recipient.h : handle recipients (addresses) and recipiemt lists */
/*
*
* Copyright (C) 1999 Bertrand Guiheneuf <Bertrand.Guiheneuf@aful.org> .
*
* 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 2 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, write to the Free Software
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307
* USA
*/
#include "glib.h"
#include "hash-table-utils.h"
#include "camel-recipient.h"
CamelRecipientTable *
camel_recipient_new ()
{
CamelRecipientTable *recipient_table;
recipient_table = g_new0 (CamelRecipientTable, 1);
recipient_table->recipient_hash_table = g_hash_table_new (g_strcase_hash, g_strcase_equal);
recipient_table->ref_count = 1;
return recipient_table;
}
void
camel_recipient_ref (CamelRecipientTable *recipient_table)
{
g_return_if_fail (recipient_table);
recipient_table->ref_count += 1;
}
static void
_free_recipient_list (gpointer key, gpointer value, gpointer user_data)
{
GList *recipient_list = (GList *)value;
gchar *recipient_name = (gchar *)key;
while (recipient_list) {
g_free (recipient_list->data);
recipient_list = recipient_list->next;
}
g_free (recipient_name);
}
void
camel_recipient_free (CamelRecipientTable *recipient_table)
{
g_return_if_fail (recipient_table);
/* free each recipient list */
g_hash_table_foreach (recipient_table->recipient_hash_table, _free_recipient_list, NULL);
g_hash_table_destroy (recipient_table->recipient_hash_table);
}
void
camel_recipient_unref (CamelRecipientTable *recipient_table)
{
g_return_if_fail (recipient_table);
recipient_table->ref_count -= 1;
if (recipient_table->ref_count <1)
camel_recipient_free (recipient_table);
}
void
camel_recipient_add (CamelRecipientTable *recipient_table,
const gchar *recipient_type,
const gchar *recipient)
{
GList *recipients_list;
GList *existent_list;
/* see if there is already a list for this recipient type */
existent_list = (GList *)g_hash_table_lookup (recipient_table->recipient_hash_table, recipient_type);
/* append the new recipient to the recipient list
if the existent_list is NULL, then a new GList is
automagically created */
recipients_list = g_list_append (existent_list, (gpointer)recipient);
if (!existent_list) /* if there was no recipient of this type create the section */
g_hash_table_insert (recipient_table->recipient_hash_table, recipient_type, recipients_list);
else
g_free (recipient_type);
}
static void
camel_recipient_remove (CamelRecipientTable *recipient_table,
const gchar *recipient_type,
const gchar *recipient)
{
GList *recipients_list;
GList *new_recipients_list;
GList *old_element;
gchar *old_recipient_type;
/* if the recipient type section does not exist, do nothing */
if (! g_hash_table_lookup_extended (recipient_table->recipient_hash_table,
recipient_type,
(gpointer)&(old_recipient_type),
(gpointer)&(recipients_list))
) return;
/* look for the recipient to remove */
/* g_list_find_custom does use "const" for recipient, is it a mistake ? */
old_element = g_list_find_custom (recipients_list, recipient, g_strcase_equal);
if (old_element) {
/* if recipient exists, remove it */
new_recipients_list = g_list_remove_link (recipients_list, old_element);
/* if glist head has changed, fix up hash table */
if (new_recipients_list != recipients_list)
g_hash_table_insert (recipient_table->recipient_hash_table, old_recipient_type, new_recipients_list);
g_free( (gchar *)(old_element->data));
g_list_free_1 (old_element);
}
}
const GList *
camel_recipient_get (CamelRecipientTable *recipient_table,
const gchar *recipient_type)
{
return (const GList *)g_hash_table_lookup (recipient_table->recipient_hash_table, recipient_type);
}
|
