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
37
#ifndef LIBTORRENT_DOWNLOAD_AVAILABLE_LIST_H
38
#define LIBTORRENT_DOWNLOAD_AVAILABLE_LIST_H
43
#include <rak/socket_address.h>
45
#include "net/address_list.h"
49
class AvailableList : private std::vector<rak::socket_address> {
51
typedef std::vector<rak::socket_address> base_type;
52
typedef uint32_t size_type;
54
using base_type::value_type;
55
using base_type::reference;
56
using base_type::const_reference;
58
using base_type::iterator;
59
using base_type::const_iterator;
60
using base_type::reverse_iterator;
61
using base_type::size;
62
using base_type::capacity;
63
using base_type::reserve;
64
using base_type::empty;
65
using base_type::clear;
67
using base_type::back;
68
using base_type::pop_back;
69
using base_type::begin;
71
using base_type::rbegin;
72
using base_type::rend;
74
AvailableList() : m_maxSize(1000) {}
76
value_type pop_random();
79
size_type max_size() const { return m_maxSize; }
80
void set_max_size(size_type s) { m_maxSize = s; }
82
bool want_more() const { return size() <= m_maxSize; }
84
// This push is somewhat inefficient as it iterates through the
85
// whole container to see if the address already exists.
86
void push_back(const rak::socket_address* sa);
88
void insert(AddressList* l);
89
void erase(const rak::socket_address& sa);
90
void erase(iterator itr) { *itr = back(); pop_back(); }
92
// A place to temporarily put addresses before re-adding them to the
94
AddressList* buffer() { return &m_buffer; }