1
// libTorrent - BitTorrent library
2
// Copyright (C) 2005-2007, Jari Sundell
4
// This program is free software; you can redistribute it and/or modify
5
// it under the terms of the GNU General Public License as published by
6
// the Free Software Foundation; either version 2 of the License, or
7
// (at your option) any later version.
9
// This program is distributed in the hope that it will be useful,
10
// but WITHOUT ANY WARRANTY; without even the implied warranty of
11
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
12
// GNU General Public License for more details.
14
// You should have received a copy of the GNU General Public License
15
// along with this program; if not, write to the Free Software
16
// Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
18
// In addition, as a special exception, the copyright holders give
19
// permission to link the code of portions of this program with the
20
// OpenSSL library under certain conditions as described in each
21
// individual source file, and distribute linked combinations
24
// You must obey the GNU General Public License in all respects for
25
// all of the code used other than OpenSSL. If you modify file(s)
26
// with this exception, you may extend this exception to your version
27
// of the file(s), but you are not obligated to do so. If you do not
28
// wish to do so, delete this exception statement from your version.
29
// If you delete this exception statement from all source files in the
30
// program, then also delete it here.
32
// Contact: Jari Sundell <jaris@ifi.uio.no>
35
// 3185 Skoppum, NORWAY
43
#include "torrent/exceptions.h"
44
#include "available_list.h"
48
AvailableList::value_type
49
AvailableList::pop_random() {
51
throw internal_error("AvailableList::pop_random() called on an empty container");
53
size_type idx = random() % size();
55
value_type tmp = *(begin() + idx);
56
*(begin() + idx) = back();
64
AvailableList::push_back(const rak::socket_address* sa) {
65
if (std::find(begin(), end(), *sa) != end())
68
base_type::push_back(*sa);
72
AvailableList::insert(AddressList* l) {
76
std::sort(begin(), end());
78
// Can i use use the std::remove* semantics for this, and just copy
81
// 'l' is guaranteed to be sorted, so we can just do
82
// std::set_difference.
83
AddressList difference;
84
std::set_difference(l->begin(), l->end(), begin(), end(), std::back_inserter(difference));
86
std::copy(difference.begin(), difference.end(), std::back_inserter(*static_cast<base_type*>(this)));
90
AvailableList::erase(const rak::socket_address& sa) {
91
iterator itr = std::find(begin(), end(), sa);
94
value_type tmp = *itr;