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

📄 file_list_iterator.h

📁 linux federo 6下的bt软件的类库文件
💻 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_FILE_LIST_ITERATOR_H#define LIBTORRENT_FILE_LIST_ITERATOR_H#include <torrent/common.h>#include <torrent/data/file_list.h>namespace torrent {class File;// A special purpose iterator class for iterating through FileList as// a dired structure.class LIBTORRENT_EXPORT FileListIterator {public:  typedef FileList::iterator iterator;  typedef File*              reference;  typedef File**             pointer;  FileListIterator() {}  explicit FileListIterator(iterator pos, uint32_t depth = 0) : m_position(pos), m_depth(depth) {}  bool                is_file() const;  bool                is_empty() const;  bool                is_entering() const;  bool                is_leaving() const  { return m_depth < 0; }  uint32_t            depth() const       { return std::abs(m_depth); }  iterator            base() const        { return m_position; }  reference           file() const        { return *m_position; }  reference           operator *() const  { return *m_position; }  pointer             operator ->() const { return &*m_position; }    FileListIterator&   operator ++();  FileListIterator&   operator --();  FileListIterator    operator ++(int);  FileListIterator    operator --(int);  FileListIterator&   forward_current_depth();    FileListIterator&   backward_current_depth();    friend bool         operator ==(const FileListIterator& left, const FileListIterator& right);  friend bool         operator !=(const FileListIterator& left, const FileListIterator& right);private:  iterator            m_position;  int32_t             m_depth;};inline FileListIteratorFileListIterator::operator ++(int) {  FileListIterator tmp = *this;  ++(*this);  return tmp;}inline FileListIteratorFileListIterator::operator --(int) {  FileListIterator tmp = *this;  --(*this);  return tmp;}inline booloperator ==(const FileListIterator& left, const FileListIterator& right) {  return left.m_position == right.m_position && left.m_depth == right.m_depth;}inline booloperator !=(const FileListIterator& left, const FileListIterator& right) {  return left.m_position != right.m_position || left.m_depth != right.m_depth;}// Take a range as input and return the next entry at the same// directory depth as first. If the returned iterator equals 'last' or// is_leaving() == true then the search failed.class LIBTORRENT_EXPORT file_list_collapsed_iterator : private FileListIterator {public:  typedef FileListIterator             base_type;  typedef file_list_collapsed_iterator this_type;  using base_type::iterator;  using base_type::reference;  using base_type::pointer;  using base_type::is_file;  using base_type::is_empty;  using base_type::is_entering;  using base_type::is_leaving;  using base_type::depth;  using base_type::file;  file_list_collapsed_iterator() {}  file_list_collapsed_iterator(const FileListIterator& src) : FileListIterator(src) {}  explicit file_list_collapsed_iterator(iterator pos, uint32_t depth = 0) : FileListIterator(pos, depth) {}  base_type           base() const { return *static_cast<const base_type*>(this); }  this_type&          operator ++() { base_type::forward_current_depth(); return *this; }  this_type&          operator --() { base_type::backward_current_depth(); return *this; }  this_type           operator ++(int);  this_type           operator --(int);  friend bool         operator ==(const file_list_collapsed_iterator& left, const file_list_collapsed_iterator& right);  friend bool         operator !=(const file_list_collapsed_iterator& left, const file_list_collapsed_iterator& right);};inline booloperator ==(const file_list_collapsed_iterator& left, const file_list_collapsed_iterator& right) {  return left.base() == right.base();}inline booloperator !=(const file_list_collapsed_iterator& left, const file_list_collapsed_iterator& right) {  return left.base() != right.base();}inline file_list_collapsed_iteratorfile_list_collapsed_iterator::operator ++(int) {  this_type tmp = *this;  ++(*this);  return tmp;}inline file_list_collapsed_iteratorfile_list_collapsed_iterator::operator --(int) {  this_type tmp = *this;  --(*this);  return tmp;}}#endif

⌨️ 快捷键说明

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