1
// libTorrent - BitTorrent library
2
// Copyright (C) 2005-2006, 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_BLOCK_FAILED_H
38
#define LIBTORRENT_BLOCK_FAILED_H
43
#include <torrent/common.h>
47
class BlockFailed : public std::vector<std::pair<char*, uint32_t> > {
49
typedef std::vector<std::pair<char*, uint32_t> > base_type;
51
using base_type::value_type;
52
using base_type::reference;
53
using base_type::size_type;
54
using base_type::difference_type;
56
using base_type::iterator;
57
using base_type::reverse_iterator;
58
using base_type::size;
59
using base_type::empty;
61
using base_type::begin;
63
using base_type::rbegin;
64
using base_type::rend;
66
using base_type::operator[];
68
static const uint32_t invalid_index = ~uint32_t();
70
BlockFailed() : m_current(invalid_index) {}
73
size_type current() const { return m_current; }
74
iterator current_iterator() { return begin() + m_current; }
75
reverse_iterator current_reverse_iterator() { return reverse_iterator(begin() + m_current + 1); }
77
void set_current(size_type idx) { m_current = idx; }
78
void set_current(iterator itr) { m_current = itr - begin(); }
79
void set_current(reverse_iterator itr) { m_current = itr.base() - begin() - 1; }
81
iterator max_element();
82
reverse_iterator reverse_max_element();
85
BlockFailed(const BlockFailed&);
86
void operator = (const BlockFailed&);
88
static void delete_entry(const reference e) { delete [] e.first; }
89
static bool compare_entries(const reference e1, const reference e2) { return e1.second < e2.second; }
95
BlockFailed::~BlockFailed() {
96
std::for_each(begin(), end(), std::ptr_fun(&BlockFailed::delete_entry));
99
inline BlockFailed::iterator
100
BlockFailed::max_element() {
101
return std::max_element(begin(), end(), std::ptr_fun(&BlockFailed::compare_entries));
104
inline BlockFailed::reverse_iterator
105
BlockFailed::reverse_max_element() {
106
return std::max_element(rbegin(), rend(), std::ptr_fun(&BlockFailed::compare_entries));
added
removed
src/torrent/data/block_failed.h
