⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 resource_manager.h

📁 LibTorrent is a BitTorrent library written in C++ for *nix, with a focus on high performance and goo
💻 H
字号:
// libTorrent - BitTorrent library// Copyright (C) 2005-2006, Jari Sundell//// 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//// In addition, as a special exception, the copyright holders give// permission to link the code of portions of this program with the// OpenSSL library under certain conditions as described in each// individual source file, and distribute linked combinations// including the two.//// You must obey the GNU General Public License in all respects for// all of the code used other than OpenSSL.  If you modify file(s)// with this exception, you may extend this exception to your version// of the file(s), but you are not obligated to do so.  If you do not// wish to do so, delete this exception statement from your version.// If you delete this exception statement from all source files in the// program, then also delete it here.//// Contact:  Jari Sundell <jaris@ifi.uio.no>////           Skomakerveien 33//           3185 Skoppum, NORWAY#ifndef LIBTORRENT_DOWNLOAD_RESOURCE_MANAGER_H#define LIBTORRENT_DOWNLOAD_RESOURCE_MANAGER_H#include <vector>#include <inttypes.h>namespace torrent {// This class will handle the division of various resources like// uploads. For now the weight is equal to the value of the priority.//// Add unlimited handling later.class DownloadMain;class ResourceManager : public std::vector<std::pair<uint16_t, DownloadMain*> > {public:  typedef std::vector<std::pair<uint16_t, DownloadMain*> > base_type;  typedef base_type::value_type                            value_type;  using base_type::begin;  using base_type::end;  ResourceManager() :    m_currentlyUnchoked(0),    m_maxUnchoked(0) {}  ~ResourceManager();  void                insert(DownloadMain* d, uint16_t priority);  void                erase(DownloadMain* d);  iterator            find(DownloadMain* d);  void                set_priority(iterator itr, uint16_t pri);  // When setting this, make sure you choke peers, else change  // receive_can_unchoke.  unsigned int        currently_unchoked() const       { return m_currentlyUnchoked; }  unsigned int        max_unchoked() const             { return m_maxUnchoked; }  void                set_max_unchoked(unsigned int m) { m_maxUnchoked = m; }  void                receive_choke(unsigned int num);  void                receive_unchoke(unsigned int num);  unsigned int        retrieve_can_unchoke();  void                receive_tick();private:  unsigned int        total_weight() const;  void                balance_unchoked(unsigned int weight);  unsigned int        m_currentlyUnchoked;  unsigned int        m_maxUnchoked;};}#endif

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -