aboutsummaryrefslogtreecommitdiff
path: root/vmime-master/src/vmime/addressList.cpp
blob: 03c9e8f41eee1ae063ac1bcd965203d3d30258a6 (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
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
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
//
// VMime library (http://www.vmime.org)
// Copyright (C) 2002 Vincent Richard <vincent@vmime.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 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, write to the Free Software Foundation, Inc.,
// 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
//
// Linking this library statically or dynamically with other modules is making
// a combined work based on this library.  Thus, the terms and conditions of
// the GNU General Public License cover the whole combination.
//

#include "vmime/addressList.hpp"
#include "vmime/parserHelpers.hpp"
#include "vmime/exception.hpp"
#include "vmime/mailboxList.hpp"
#include "vmime/mailboxGroup.hpp"


namespace vmime {


addressList::addressList() {

}


addressList::addressList(const addressList& addrList)
	: headerFieldValue() {

	copyFrom(addrList);
}


addressList::~addressList() {

	removeAllAddresses();
}


void addressList::parseImpl(
	const parsingContext& ctx,
	const string& buffer,
	const size_t position,
	const size_t end,
	size_t* newPosition
) {

	removeAllAddresses();

	size_t pos = position;

	while (pos < end) {

		shared_ptr <address> parsedAddress = address::parseNext(ctx, buffer, pos, end, &pos, NULL);

		if (parsedAddress) {
			m_list.push_back(parsedAddress);
		}
	}

	setParsedBounds(position, end);

	if (newPosition) {
		*newPosition = end;
	}
}


void addressList::generateImpl(
	const generationContext& ctx,
	utility::outputStream& os,
	const size_t curLinePos,
	size_t* newLinePos
) const {

	size_t pos = curLinePos;

	generationContext tmpCtx(ctx);
	tmpCtx.setMaxLineLength(tmpCtx.getMaxLineLength() - 2);

	if (!m_list.empty()) {

		for (std::vector <shared_ptr <address> >::const_iterator i = m_list.begin() ; ; ) {

			(*i)->generate(ctx, os, pos, &pos);

			if (++i == m_list.end()) {
				break;
			}

			os << ", ";
			pos += 2;
		}
	}

	if (newLinePos) {
		*newLinePos = pos;
	}
}


void addressList::copyFrom(const component& other) {

	const addressList& addrList = dynamic_cast <const addressList&>(other);

	removeAllAddresses();

	for (std::vector <shared_ptr <address> >::const_iterator it = addrList.m_list.begin() ;
	     it != addrList.m_list.end() ; ++it) {

		m_list.push_back(vmime::clone(*it));
	}
}


addressList& addressList::operator=(const addressList& other) {

	copyFrom(other);
	return *this;
}


addressList& addressList::operator=(const mailboxList& other) {

	removeAllAddresses();

	for (size_t i = 0 ; i < other.getMailboxCount() ; ++i) {
		m_list.push_back(dynamicCast <address>(other.getMailboxAt(i)->clone()));
	}

	return *this;
}


shared_ptr <component> addressList::clone() const {

	return make_shared <addressList>(*this);
}


void addressList::appendAddress(const shared_ptr <address> &addr) {

	m_list.push_back(addr);
}


void addressList::insertAddressBefore(const shared_ptr <address>& beforeAddress, const shared_ptr <address>& addr) {

	const std::vector <shared_ptr <address> >::iterator it = std::find(
		m_list.begin(), m_list.end(), beforeAddress
	);

	if (it == m_list.end()) {
		throw std::out_of_range("Invalid position");
	}

	m_list.insert(it, addr);
}


void addressList::insertAddressBefore(const size_t pos, const shared_ptr <address>& addr) {

	if (pos >= m_list.size()) {
		throw std::out_of_range("Invalid position");
	}

	m_list.insert(m_list.begin() + pos, addr);
}


void addressList::insertAddressAfter(
	const shared_ptr <address>& afterAddress,
	const shared_ptr <address>& addr
) {

	const std::vector <shared_ptr <address> >::iterator it = std::find(
		m_list.begin(), m_list.end(), afterAddress
	);

	if (it == m_list.end()) {
		throw std::out_of_range("Invalid position");
	}

	m_list.insert(it + 1, addr);
}


void addressList::insertAddressAfter(const size_t pos, const shared_ptr <address>& addr) {

	if (pos >= m_list.size()) {
		throw std::out_of_range("Invalid position");
	}

	m_list.insert(m_list.begin() + pos + 1, addr);
}


void addressList::removeAddress(const shared_ptr <address>& addr) {

	const std::vector <shared_ptr <address> >::iterator it = std::find(
		m_list.begin(), m_list.end(), addr
	);

	if (it == m_list.end()) {
		throw std::out_of_range("Invalid position");
	}

	m_list.erase(it);
}


void addressList::removeAddress(const size_t pos) {

	if (pos >= m_list.size()) {
		throw std::out_of_range("Invalid position");
	}

	const std::vector <shared_ptr <address> >::iterator it = m_list.begin() + pos;

	m_list.erase(it);
}


void addressList::removeAllAddresses() {

	m_list.clear();
}


size_t addressList::getAddressCount() const {

	return m_list.size();
}


bool addressList::isEmpty() const {

	return m_list.empty();
}


shared_ptr <address> addressList::getAddressAt(const size_t pos) {

	return m_list[pos];
}


const shared_ptr <const address> addressList::getAddressAt(const size_t pos) const {

	return m_list[pos];
}


const std::vector <shared_ptr <const address> > addressList::getAddressList() const {

	std::vector <shared_ptr <const address> > list;

	list.reserve(m_list.size());

	for (std::vector <shared_ptr <address> >::const_iterator it = m_list.begin() ;
	     it != m_list.end() ; ++it) {

		list.push_back(*it);
	}

	return list;
}


const std::vector <shared_ptr <address> > addressList::getAddressList() {

	return m_list;
}


const std::vector <shared_ptr <component> > addressList::getChildComponents() {

	std::vector <shared_ptr <component> > list;

	copy_vector(m_list, list);

	return list;
}


shared_ptr <mailboxList> addressList::toMailboxList() const {

	shared_ptr <mailboxList> res = make_shared <mailboxList>();

	for (std::vector <shared_ptr <address> >::const_iterator it = m_list.begin() ;
	     it != m_list.end() ; ++it) {

		shared_ptr <const address> addr = *it;

		if (addr->isGroup()) {

			const std::vector <shared_ptr <const mailbox> > mailboxes =
				dynamicCast <const mailboxGroup>(addr)->getMailboxList();

			for (std::vector <shared_ptr <const mailbox> >::const_iterator jt = mailboxes.begin() ;
			     jt != mailboxes.end() ; ++jt) {

				res->appendMailbox(vmime::clone(*jt));
			}

		} else {

			res->appendMailbox(dynamicCast <mailbox>(addr->clone()));
		}
	}

	return res;
}


} // vmime