The basic usage is as follows:
\nconstruct a session, possibly passing in the state from a previous session.\n use read_session_params() and pass in the resulting session_params object to\n the session constructor.
\nstart extensions (see add_extension()).
\n+start extensions (see add_extension()).
\nstart DHT, LSD, UPnP, NAT-PMP etc (see start_dht(), start_lsd(), start_upnp()\n and start_natpmp()).
\nparse .torrent-files and add them to the session (see torrent_info,\n async_add_torrent() and add_torrent())
\nmain loop (see session)
\n\n\n\n
\n- poll for alerts (see wait_for_alert(), pop_alerts())
\n- handle updates to torrents, (see state_update_alert).
\n- handle other alerts, (see alert).
\n- query the session for information (see session::status()).
\n-- add and remove torrents from the session (remove_torrent())
\n+- add and remove torrents from the session (remove_torrent())
\n
save resume data for all torrent_handles (optional, see\n save_resume_data())
\nsave session state (see session_state() and write_session_params())
\n"}, {"source1": "./usr/share/doc/libtorrent-rasterbar-doc/html/reference-Add_Torrent.html", "source2": "./usr/share/doc/libtorrent-rasterbar-doc/html/reference-Add_Torrent.html", "unified_diff": "@@ -31,15 +31,15 @@\n \nTable of contents
\n \nDeclared in "libtorrent/add_torrent_params.hpp"
\n@@ -370,40 +370,40 @@\n requiring the same type be requested out of it as was assigned to it.\n\n struct client_data_t\n {\n client_data_t () = default;\n explicit client_data_t (T* v);\n client_data_t& operator= (T* v);\n- explicit operator T () const;\n T* get () const;\n- client_data_t& operator= (void const*) = delete;\n- client_data_t& operator= (void*) = delete;\n+ explicit operator T () const;\n operator void* () const = delete;\n operator void const* () const = delete;\n+ client_data_t& operator= (void*) = delete;\n+ client_data_t& operator= (void const*) = delete;\n \n template <typename T, typename U = typename std::enable_if<std::is_pointer<T>::value>::type>\n };\n \n [report issue]\n client_data_t () = default;\n\n
construct a nullptr client data
\n-\n \n-[report issue]\n-client_data_t& operator= (void const*) = delete;\n-client_data_t& operator= (void*) = delete;\n operator void* () const = delete;\n operator void const* () const = delete;\n+client_data_t& operator= (void*) = delete;\n+client_data_t& operator= (void const*) = delete;\n\n
we don't allow type-unsafe operations
\nDeclared in "libtorrent/alert_types.hpp"
\nThis is posted as a response to a torrent_handle::rename_file() call, if the rename\n operation succeeds.
\n\n struct file_renamed_alert final : torrent_alert\n {\n std::string message () const override;\n- char const* new_name () const;\n char const* old_name () const;\n+ char const* new_name () const;\n \n static constexpr alert_category_t static_category = alert_category::storage;\n file_index_t const index;\n };\n \n \n [report issue]\n-char const* new_name () const;\n char const* old_name () const;\n+char const* new_name () const;\n\n
returns the new and previous file name, respectively.
\n [report issue]\n std::vector<std::pair<sha1_hash, udp::endpoint>> nodes () const;\n int num_nodes () const;\n\n
the number of nodes in the routing table and the actual nodes.
\n [report issue]Declared in "libtorrent/bdecode.hpp"
\nSometimes it's important to get a non-owning reference to the root node (\n to be able to copy it as a reference for instance). For that, use the\n non_owning() member function.
\n-There are 5 different types of nodes, see type_t.
\n+There are 5 different types of nodes, see type_t.
\n\n struct bdecode_node\n {\n bdecode_node () = default;\n- bdecode_node& operator= (bdecode_node const&) &;\n bdecode_node& operator= (bdecode_node&&) & = default;\n bdecode_node (bdecode_node const&);\n+ bdecode_node& operator= (bdecode_node const&) &;\n bdecode_node (bdecode_node&&) noexcept;\n type_t type () const noexcept;\n explicit operator bool () const noexcept;\n bdecode_node non_owning () const;\n- span<char const> data_section () const noexcept;\n std::ptrdiff_t data_offset () const noexcept;\n+ span<char const> data_section () const noexcept;\n+ int list_size () const;\n bdecode_node list_at (int i) const;\n std::int64_t list_int_value_at (int i\n , std::int64_t default_val = 0) const;\n string_view list_string_value_at (int i\n , string_view default_val = string_view()) const;\n- int list_size () const;\n- bdecode_node dict_find (string_view key) const;\n- bdecode_node dict_find_int (string_view key) const;\n bdecode_node dict_find_list (string_view key) const;\n- bdecode_node dict_find_dict (string_view key) const;\n- std::int64_t dict_find_int_value (string_view key\n- , std::int64_t default_val = 0) const;\n- std::pair<string_view, bdecode_node> dict_at (int i) const;\n- bdecode_node dict_find_string (string_view key) const;\n+ bdecode_node dict_find_int (string_view key) const;\n+ std::pair<bdecode_node, bdecode_node> dict_at_node (int i) const;\n int dict_size () const;\n+ bdecode_node dict_find (string_view key) const;\n+ std::pair<string_view, bdecode_node> dict_at (int i) const;\n string_view dict_find_string_value (string_view key\n , string_view default_value = string_view()) const;\n- std::pair<bdecode_node, bdecode_node> dict_at_node (int i) const;\n+ bdecode_node dict_find_string (string_view key) const;\n+ std::int64_t dict_find_int_value (string_view key\n+ , std::int64_t default_val = 0) const;\n+ bdecode_node dict_find_dict (string_view key) const;\n std::int64_t int_value () const;\n+ int string_length () const;\n std::ptrdiff_t string_offset () const;\n string_view string_value () const;\n- int string_length () const;\n char const* string_ptr () const;\n void clear ();\n void swap (bdecode_node& n);\n void reserve (int tokens);\n void switch_underlying_buffer (char const* buf) noexcept;\n bool has_soft_error (span<char> error) const;\n \n@@ -121,28 +121,28 @@\n \n creates a default constructed node, it will have the type none_t.
\n \n [report issue]\n-bdecode_node& operator= (bdecode_node const&) &;\n bdecode_node& operator= (bdecode_node&&) & = default;\n bdecode_node (bdecode_node const&);\n+bdecode_node& operator= (bdecode_node const&) &;\n bdecode_node (bdecode_node&&) noexcept;\n\n
For owning nodes, the copy will create a copy of the tree, but the\n underlying buffer remains the same.
\n [report issue]\n type_t type () const noexcept;\n\n-
the type of this node. See type_t.
\n+the type of this node. See type_t.
\n [report issue]\n explicit operator bool () const noexcept;\n\n
returns true if type() != none_t.
\n@@ -150,71 +150,71 @@\n\n bdecode_node non_owning () const;\n\n
return a non-owning reference to this node. This is useful to refer to\n the root node without copying it in assignments.
\n-\n-[report issue]\n-span<char const> data_section () const noexcept;\n std::ptrdiff_t data_offset () const noexcept;\n+span<char const> data_section () const noexcept;\n\n
returns the buffer and length of the section in the original bencoded\n buffer where this node is defined. For a dictionary for instance, this\n starts with d and ends with e, and has all the content of the\n dictionary in between.\n the data_offset() function returns the byte-offset to this node in,\n starting from the beginning of the buffer that was parsed.
\n-\n-\n \n-[report issue]\n+int list_size () const;\n bdecode_node list_at (int i) const;\n std::int64_t list_int_value_at (int i\n , std::int64_t default_val = 0) const;\n string_view list_string_value_at (int i\n , string_view default_val = string_view()) const;\n-int list_size () const;\n\n
functions with the list_ prefix operate on lists. These functions are\n only valid if type() == list_t. list_at() returns the item\n in the list at index i. i may not be greater than or equal to the\n size of the list. size() returns the size of the list.
\n-\n+\n+\n \n \n-\n-\n-\n+\n+\n \n-\n \n-[report issue]\n-bdecode_node dict_find (string_view key) const;\n-bdecode_node dict_find_int (string_view key) const;\n bdecode_node dict_find_list (string_view key) const;\n-bdecode_node dict_find_dict (string_view key) const;\n-std::int64_t dict_find_int_value (string_view key\n- , std::int64_t default_val = 0) const;\n-std::pair<string_view, bdecode_node> dict_at (int i) const;\n-bdecode_node dict_find_string (string_view key) const;\n+bdecode_node dict_find_int (string_view key) const;\n+std::pair<bdecode_node, bdecode_node> dict_at_node (int i) const;\n int dict_size () const;\n+bdecode_node dict_find (string_view key) const;\n+std::pair<string_view, bdecode_node> dict_at (int i) const;\n string_view dict_find_string_value (string_view key\n , string_view default_value = string_view()) const;\n-std::pair<bdecode_node, bdecode_node> dict_at_node (int i) const;\n+bdecode_node dict_find_string (string_view key) const;\n+std::int64_t dict_find_int_value (string_view key\n+ , std::int64_t default_val = 0) const;\n+bdecode_node dict_find_dict (string_view key) const;\n\n
Functions with the dict_ prefix operates on dictionaries. They are\n only valid if type() == dict_t. In case a key you're looking up\n contains a 0 byte, you cannot use the 0-terminated string overloads,\n but have to use string_view instead. dict_find_list will return a\n valid bdecode_node if the key is found _and_ it is a list. Otherwise\n it will return a default-constructed bdecode_node.
\n@@ -229,24 +229,24 @@\n\n std::int64_t int_value () const;\n\n
this function is only valid if type() == int_t. It returns the\n value of the integer.
\n-\n-\n \n-[report issue]\n+int string_length () const;\n std::ptrdiff_t string_offset () const;\n string_view string_value () const;\n-int string_length () const;\n char const* string_ptr () const;\n\n
these functions are only valid if type() == string_t. They return\n the string values. Note that string_ptr() is not 0-terminated.\n string_length() returns the number of bytes in the string.\n string_offset() returns the byte offset from the start of the parsed\n bencoded buffer this string can be found.
\n@@ -345,20 +345,20 @@\nprint the bencoded structure in a human-readable format to a string\n that's returned.
\n [report issue]Declared in "libtorrent/bdecode.hpp"
\n\n-bdecode_node bdecode (span<char const> buffer\n+int bdecode (char const* start, char const* end, bdecode_node& ret\n , error_code& ec, int* error_pos = nullptr, int depth_limit = 100\n , int token_limit = 2000000);\n bdecode_node bdecode (span<char const> buffer\n , int depth_limit = 100, int token_limit = 2000000);\n-int bdecode (char const* start, char const* end, bdecode_node& ret\n+bdecode_node bdecode (span<char const> buffer\n , error_code& ec, int* error_pos = nullptr, int depth_limit = 100\n , int token_limit = 2000000);\n\n
This function decodes/parses bdecoded data (for example a .torrent file).\n The data structure is returned in the ret argument. the buffer to parse\n is specified by the start of the buffer as well as the end, i.e. one\n byte past the end. If the buffer fails to parse, the function returns a\n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -5,21 +5,21 @@\n Table of contents\n * _\bb_\bd_\be_\bc_\bo_\bd_\be_\b__\bn_\bo_\bd_\be\n o _\bb_\bd_\be_\bc_\bo_\bd_\be_\b__\bn_\bo_\bd_\be_\b(_\b)\n o _\bb_\bd_\be_\bc_\bo_\bd_\be_\b__\bn_\bo_\bd_\be_\b(_\b)_\b _\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b=_\b(_\b)\n o _\bt_\by_\bp_\be_\b(_\b)\n o _\bb_\bo_\bo_\bl_\b(_\b)\n o _\bn_\bo_\bn_\b__\bo_\bw_\bn_\bi_\bn_\bg_\b(_\b)\n- o _\bd_\ba_\bt_\ba_\b__\bo_\bf_\bf_\bs_\be_\bt_\b(_\b)_\b _\bd_\ba_\bt_\ba_\b__\bs_\be_\bc_\bt_\bi_\bo_\bn_\b(_\b)\n- o _\bl_\bi_\bs_\bt_\b__\bs_\bt_\br_\bi_\bn_\bg_\b__\bv_\ba_\bl_\bu_\be_\b__\ba_\bt_\b(_\b)_\b _\bl_\bi_\bs_\bt_\b__\bs_\bi_\bz_\be_\b(_\b)_\b _\bl_\bi_\bs_\bt_\b__\ba_\bt_\b(_\b)_\b _\bl_\bi_\bs_\bt_\b__\bi_\bn_\bt_\b__\bv_\ba_\bl_\bu_\be_\b__\ba_\bt_\b(_\b)\n- o _\bd_\bi_\bc_\bt_\b__\bf_\bi_\bn_\bd_\b__\bs_\bt_\br_\bi_\bn_\bg_\b(_\b)_\b _\bd_\bi_\bc_\bt_\b__\bf_\bi_\bn_\bd_\b__\bi_\bn_\bt_\b(_\b)_\b _\bd_\bi_\bc_\bt_\b__\bf_\bi_\bn_\bd_\b__\bi_\bn_\bt_\b__\bv_\ba_\bl_\bu_\be_\b(_\b)_\b _\bd_\bi_\bc_\bt_\b__\bs_\bi_\bz_\be\n- _\b(_\b)_\b _\bd_\bi_\bc_\bt_\b__\bf_\bi_\bn_\bd_\b(_\b)_\b _\bd_\bi_\bc_\bt_\b__\bf_\bi_\bn_\bd_\b__\bs_\bt_\br_\bi_\bn_\bg_\b__\bv_\ba_\bl_\bu_\be_\b(_\b)_\b _\bd_\bi_\bc_\bt_\b__\bf_\bi_\bn_\bd_\b__\bd_\bi_\bc_\bt_\b(_\b)\n- _\bd_\bi_\bc_\bt_\b__\bf_\bi_\bn_\bd_\b__\bl_\bi_\bs_\bt_\b(_\b)_\b _\bd_\bi_\bc_\bt_\b__\ba_\bt_\b__\bn_\bo_\bd_\be_\b(_\b)_\b _\bd_\bi_\bc_\bt_\b__\ba_\bt_\b(_\b)\n+ o _\bd_\ba_\bt_\ba_\b__\bs_\be_\bc_\bt_\bi_\bo_\bn_\b(_\b)_\b _\bd_\ba_\bt_\ba_\b__\bo_\bf_\bf_\bs_\be_\bt_\b(_\b)\n+ o _\bl_\bi_\bs_\bt_\b__\ba_\bt_\b(_\b)_\b _\bl_\bi_\bs_\bt_\b__\bs_\bt_\br_\bi_\bn_\bg_\b__\bv_\ba_\bl_\bu_\be_\b__\ba_\bt_\b(_\b)_\b _\bl_\bi_\bs_\bt_\b__\bi_\bn_\bt_\b__\bv_\ba_\bl_\bu_\be_\b__\ba_\bt_\b(_\b)_\b _\bl_\bi_\bs_\bt_\b__\bs_\bi_\bz_\be_\b(_\b)\n+ o _\bd_\bi_\bc_\bt_\b__\bf_\bi_\bn_\bd_\b__\bs_\bt_\br_\bi_\bn_\bg_\b__\bv_\ba_\bl_\bu_\be_\b(_\b)_\b _\bd_\bi_\bc_\bt_\b__\bf_\bi_\bn_\bd_\b(_\b)_\b _\bd_\bi_\bc_\bt_\b__\bf_\bi_\bn_\bd_\b__\bi_\bn_\bt_\b(_\b)\n+ _\bd_\bi_\bc_\bt_\b__\bf_\bi_\bn_\bd_\b__\bi_\bn_\bt_\b__\bv_\ba_\bl_\bu_\be_\b(_\b)_\b _\bd_\bi_\bc_\bt_\b__\bf_\bi_\bn_\bd_\b__\bs_\bt_\br_\bi_\bn_\bg_\b(_\b)_\b _\bd_\bi_\bc_\bt_\b__\ba_\bt_\b(_\b)_\b _\bd_\bi_\bc_\bt_\b__\bf_\bi_\bn_\bd_\b__\bd_\bi_\bc_\bt_\b(_\b)\n+ _\bd_\bi_\bc_\bt_\b__\ba_\bt_\b__\bn_\bo_\bd_\be_\b(_\b)_\b _\bd_\bi_\bc_\bt_\b__\bs_\bi_\bz_\be_\b(_\b)_\b _\bd_\bi_\bc_\bt_\b__\bf_\bi_\bn_\bd_\b__\bl_\bi_\bs_\bt_\b(_\b)\n o _\bi_\bn_\bt_\b__\bv_\ba_\bl_\bu_\be_\b(_\b)\n- o _\bs_\bt_\br_\bi_\bn_\bg_\b__\bv_\ba_\bl_\bu_\be_\b(_\b)_\b _\bs_\bt_\br_\bi_\bn_\bg_\b__\bo_\bf_\bf_\bs_\be_\bt_\b(_\b)_\b _\bs_\bt_\br_\bi_\bn_\bg_\b__\bl_\be_\bn_\bg_\bt_\bh_\b(_\b)_\b _\bs_\bt_\br_\bi_\bn_\bg_\b__\bp_\bt_\br_\b(_\b)\n+ o _\bs_\bt_\br_\bi_\bn_\bg_\b__\bl_\be_\bn_\bg_\bt_\bh_\b(_\b)_\b _\bs_\bt_\br_\bi_\bn_\bg_\b__\bo_\bf_\bf_\bs_\be_\bt_\b(_\b)_\b _\bs_\bt_\br_\bi_\bn_\bg_\b__\bp_\bt_\br_\b(_\b)_\b _\bs_\bt_\br_\bi_\bn_\bg_\b__\bv_\ba_\bl_\bu_\be_\b(_\b)\n o _\bc_\bl_\be_\ba_\br_\b(_\b)\n o _\bs_\bw_\ba_\bp_\b(_\b)\n o _\br_\be_\bs_\be_\br_\bv_\be_\b(_\b)\n o _\bs_\bw_\bi_\bt_\bc_\bh_\b__\bu_\bn_\bd_\be_\br_\bl_\by_\bi_\bn_\bg_\b__\bb_\bu_\bf_\bf_\be_\br_\b(_\b)\n o _\bh_\ba_\bs_\b__\bs_\bo_\bf_\bt_\b__\be_\br_\br_\bo_\br_\b(_\b)\n o _\be_\bn_\bu_\bm_\b _\bt_\by_\bp_\be_\b__\bt\n * _\bp_\br_\bi_\bn_\bt_\b__\be_\bn_\bt_\br_\by_\b(_\b)\n@@ -30,45 +30,45 @@\n Sometimes it's important to get a non-owning reference to the root node ( to be\n able to copy it as a reference for instance). For that, use the _\bn_\bo_\bn_\b__\bo_\bw_\bn_\bi_\bn_\bg_\b(_\b)\n member function.\n There are 5 different types of nodes, see _\bt_\by_\bp_\be_\b__\bt.\n struct bdecode_node\n {\n b\bbd\bde\bec\bco\bod\bde\be_\b_n\bno\bod\bde\be () = default;\n- bdecode_node& o\bop\bpe\ber\bra\bat\bto\bor\br=\b= (bdecode_node const&) &;\n bdecode_node& o\bop\bpe\ber\bra\bat\bto\bor\br=\b= (bdecode_node&&) & = default;\n b\bbd\bde\bec\bco\bod\bde\be_\b_n\bno\bod\bde\be (bdecode_node const&);\n+ bdecode_node& o\bop\bpe\ber\bra\bat\bto\bor\br=\b= (bdecode_node const&) &;\n b\bbd\bde\bec\bco\bod\bde\be_\b_n\bno\bod\bde\be (bdecode_node&&) noexcept;\n type_t t\bty\byp\bpe\be () const noexcept;\n explicit operator b\bbo\boo\bol\bl () const noexcept;\n bdecode_node n\bno\bon\bn_\b_o\bow\bwn\bni\bin\bng\bg () const;\n- span The entry class represents one node in a bencoded hierarchy. It works as a\n variant type, it can be either a list, a dictionary (std::map), an integer\n or a string. returns the concrete type of the entry\n
\n class entry\n {\n data_type type () const;\n- entry (span<char const>);\n entry (integer_type);\n- entry (list_type);\n entry (dictionary_type);\n entry (preformatted_type);\n+ entry (list_type);\n+ entry (span<char const>);\n entry (U v);\n entry (data_type t);\n entry (bdecode_node const& n);\n- entry& operator= (integer_type) &;\n- entry& operator= (span<char const>) &;\n entry& operator= (bdecode_node const&) &;\n+ entry& operator= (list_type) &;\n+ entry& operator= (dictionary_type) &;\n+ entry& operator= (entry&&) & noexcept;\n+ entry& operator= (span<char const>) &;\n entry& operator= (entry const&) &;\n entry& operator= (preformatted_type) &;\n- entry& operator= (entry&&) & noexcept;\n- entry& operator= (dictionary_type) &;\n- entry& operator= (list_type) &;\n+ entry& operator= (integer_type) &;\n entry& operator= (U v) &;\n+ dictionary_type& dict ();\n string_type const& string () const;\n- dictionary_type const& dict () const;\n- list_type const& list () const;\n+ preformatted_type& preformatted ();\n string_type& string ();\n- dictionary_type& dict ();\n- integer_type& integer ();\n list_type& list ();\n integer_type const& integer () const;\n- preformatted_type& preformatted ();\n+ dictionary_type const& dict () const;\n+ list_type const& list () const;\n preformatted_type const& preformatted () const;\n+ integer_type& integer ();\n void swap (entry& e);\n entry& operator[] (string_view key);\n entry const& operator[] (string_view key) const;\n- entry const* find_key (string_view key) const;\n entry* find_key (string_view key);\n+ entry const* find_key (string_view key) const;\n std::string to_string (bool single_line = false) const;\n \n enum data_type\n {\n int_t,\n string_t,\n list_t,\n@@ -124,19 +124,19 @@\n data_type type () const;\n \n
\n-entry (span<char const>);\n entry (integer_type);\n-entry (list_type);\n entry (dictionary_type);\n entry (preformatted_type);\n+entry (list_type);\n+entry (span<char const>);\n\n
constructors directly from a specific type.\n The content of the argument is copied into the\n newly constructed entry
\n [report issue]construct from bdecode_node parsed form (see bdecode())
\n [report issue]\n-entry& operator= (integer_type) &;\n-entry& operator= (span<char const>) &;\n entry& operator= (bdecode_node const&) &;\n+entry& operator= (list_type) &;\n+entry& operator= (dictionary_type) &;\n+entry& operator= (entry&&) & noexcept;\n+entry& operator= (span<char const>) &;\n entry& operator= (entry const&) &;\n entry& operator= (preformatted_type) &;\n-entry& operator= (entry&&) & noexcept;\n-entry& operator= (dictionary_type) &;\n-entry& operator= (list_type) &;\n+entry& operator= (integer_type) &;\n\n
copies the structure of the right hand side into this\n entry.
\n-\n-\n-\n+\n \n-[report issue]\n+dictionary_type& dict ();\n string_type const& string () const;\n-dictionary_type const& dict () const;\n-list_type const& list () const;\n+preformatted_type& preformatted ();\n string_type& string ();\n-dictionary_type& dict ();\n-integer_type& integer ();\n list_type& list ();\n integer_type const& integer () const;\n-preformatted_type& preformatted ();\n+dictionary_type const& dict () const;\n+list_type const& list () const;\n preformatted_type const& preformatted () const;\n+integer_type& integer ();\n\n
The integer(), string(), list() and dict() functions\n are accessors that return the respective type. If the entry object\n isn't of the type you request, the accessor will throw\n system_error. You can ask an entry for its type through the\n type() function.
\nIf you want to create an entry you give it the type you want it to\n@@ -248,16 +248,16 @@\n
The const version of operator[] will only return a reference to an\n existing element at the given key. If the key is not found, it will\n throw system_error.
\n [report issue]\n-entry const* find_key (string_view key) const;\n entry* find_key (string_view key);\n+entry const* find_key (string_view key) const;\n\n
These functions requires the entry to be a dictionary, if it isn't\n they will throw system_error.
\nThey will look for an element at the given key in the dictionary, if\n the element cannot be found, they will return nullptr. If an element\n with the given key is found, the return a pointer to it.
\n [report issue]Table of contents
\nDeclared in "libtorrent/peer_request.hpp"
\n-represents a byte range within a piece. Internally this is is used for\n-incoming piece requests.
\n-\n-struct peer_request\n-{\n- bool operator== (peer_request const& r) const;\n-\n- piece_index_t piece;\n- int start;\n- int length;\n-};\n-\n-[report issue]\n-bool operator== (peer_request const& r) const;\n-\n-
returns true if the right hand side peer_request refers to the same\n-range as this does.
\n-[report issue]Declared in "libtorrent/peer_info.hpp"
\nholds information and statistics about one peer\n that libtorrent is connected to
\n\n struct peer_info\n {\n@@ -606,16 +570,16 @@\n struct info_hash_t\n {\n info_hash_t (sha1_hash h1, sha256_hash h2) noexcept;\n explicit info_hash_t (sha256_hash h2) noexcept;\n explicit info_hash_t (sha1_hash h1) noexcept;\n info_hash_t () noexcept = default;\n bool has_v2 () const;\n- bool has_v1 () const;\n bool has (protocol_version v) const;\n+ bool has_v1 () const;\n sha1_hash get (protocol_version v) const;\n sha1_hash get_best () const;\n friend bool operator!= (info_hash_t const& lhs, info_hash_t const& rhs);\n friend bool operator== (info_hash_t const& lhs, info_hash_t const& rhs) noexcept;\n template <typename F> void for_each (F f) const;\n bool operator< (info_hash_t const& o) const;\n friend std::ostream& operator<< (std::ostream& os, info_hash_t const& ih);\n@@ -634,22 +598,22 @@\n \n The default constructor creates an object that has neither a v1 or v2\n hash.
\nFor backwards compatibility, make it possible to construct directly\n from a v1 hash. This constructor allows implicit conversion from a\n v1 hash, but the implicitness is deprecated.
\n \n-\n-[report issue]\n bool has_v2 () const;\n-bool has_v1 () const;\n bool has (protocol_version v) const;\n+bool has_v1 () const;\n\n
returns true if the corresponding info hash is present in this\n object.
\n [report issue]\n@@ -671,14 +635,50 @@\n template <typename F> void for_each (F f) const;\n\n
calls the function object f for each hash that is available.\n starting with v1. The signature of F is:
\n\n void(sha1_hash const&, protocol_version);\n\n+[report issue]
Declared in "libtorrent/peer_request.hpp"
\n+represents a byte range within a piece. Internally this is is used for\n+incoming piece requests.
\n+\n+struct peer_request\n+{\n+ bool operator== (peer_request const& r) const;\n+\n+ piece_index_t piece;\n+ int start;\n+ int length;\n+};\n+\n+[report issue]\n+bool operator== (peer_request const& r) const;\n+\n+
returns true if the right hand side peer_request refers to the same\n+range as this does.
\n+[report issue]Declared in "libtorrent/piece_block.hpp"
\n\n struct piece_block\n@@ -699,22 +699,62 @@\ntruncate_files()
\nDeclared in "libtorrent/truncate.hpp"
\n\n void truncate_files (file_storage const& fs, std::string const& save_path, storage_error& ec);\n\nTruncates files larger than specified in the file_storage, saved under\n the specified save_path.
\n+\n+\n+[report issue]
Declared in "libtorrent/load_torrent.hpp"
\n+\n+add_torrent_params load_torrent_buffer (\n+ span<char const> buffer, load_torrent_limits const& cfg);\n+add_torrent_params load_torrent_buffer (\n+ span<char const> buffer);\n+add_torrent_params load_torrent_parsed (\n+ bdecode_node const& torrent_file);\n+add_torrent_params load_torrent_parsed (\n+ bdecode_node const& torrent_file, load_torrent_limits const& cfg);\n+add_torrent_params load_torrent_file (\n+ std::string const& filename, load_torrent_limits const& cfg);\n+add_torrent_params load_torrent_file (\n+ std::string const& filename);\n+\n+
These functions load the content of a .torrent file into an\n+add_torrent_params object.\n+The immutable part of a torrent file (the info-dictionary) is stored in\n+the ti field in the add_torrent_params object (as a torrent_info\n+object).\n+The returned object is suitable to be:
\n+\n+\n+[report issue]\n+
\n+- added to a session via add_torrent() or async_add_torrent()
\n+- saved as a .torrent_file via write_torrent_file()
\n+- turned into a magnet link via make_magnet_uri()
\n+
Declared in "libtorrent/torrent_peer.hpp"
\n+\n+inline bool torrent_peer_equal (torrent_peer const* lhs, torrent_peer const* rhs);\n+\n [report issue]
Declared in "libtorrent/magnet_uri.hpp"
\n\n-std::string make_magnet_uri (torrent_handle const& handle);\n std::string make_magnet_uri (torrent_info const& info);\n std::string make_magnet_uri (add_torrent_params const& atp);\n+std::string make_magnet_uri (torrent_handle const& handle);\n\n
Generates a magnet URI from the specified torrent.
\nSeveral fields from the add_torrent_params objects are recorded in the\n magnet link. In order to not include them, they have to be cleared before\n calling make_magnet_uri(). These fields are used:
\n\n ti, info_hashes, url_seeds, dht_nodes,\n@@ -734,212 +774,145 @@\n an empty string is returned.\nFor more information about magnet links, see magnet links.
\n [report issue]
Declared in "libtorrent/magnet_uri.hpp"
\n\n-void parse_magnet_uri (string_view uri, add_torrent_params& p, error_code& ec);\n add_torrent_params parse_magnet_uri (string_view uri);\n+void parse_magnet_uri (string_view uri, add_torrent_params& p, error_code& ec);\n add_torrent_params parse_magnet_uri (string_view uri, error_code& ec);\n\n
This function parses out information from the magnet link and populates the\n add_torrent_params object. The overload that does not take an\n error_code reference will throw a system_error on error\n The overload taking an add_torrent_params reference will fill in the\n fields specified in the magnet URI.
\n-\n-\n-[report issue]Declared in "libtorrent/load_torrent.hpp"
\n-\n-add_torrent_params load_torrent_parsed (\n- bdecode_node const& torrent_file, load_torrent_limits const& cfg);\n-add_torrent_params load_torrent_buffer (\n- span<char const> buffer);\n-add_torrent_params load_torrent_buffer (\n- span<char const> buffer, load_torrent_limits const& cfg);\n-add_torrent_params load_torrent_file (\n- std::string const& filename, load_torrent_limits const& cfg);\n-add_torrent_params load_torrent_file (\n- std::string const& filename);\n-add_torrent_params load_torrent_parsed (\n- bdecode_node const& torrent_file);\n-\n-
These functions load the content of a .torrent file into an\n-add_torrent_params object.\n-The immutable part of a torrent file (the info-dictionary) is stored in\n-the ti field in the add_torrent_params object (as a torrent_info\n-object).\n-The returned object is suitable to be:
\n-\n-\n-[report issue]\n-
\n-- added to a session via add_torrent() or async_add_torrent()
\n-- saved as a .torrent_file via write_torrent_file()
\n-- turned into a magnet link via make_magnet_uri()
\n-
Declared in "libtorrent/torrent_peer.hpp"
\n-\n-inline bool torrent_peer_equal (torrent_peer const* lhs, torrent_peer const* rhs);\n-\n [report issue]
Declared in "libtorrent/version.hpp"
\n\n char const* version ();\n\n
returns the libtorrent version as string form in this format:\n "<major>.<minor>.<tiny>.<tag>"
\n-[report issue]Declared in "libtorrent/info_hash.hpp"
\n| name | \nvalue | \ndescription | \n|
|---|---|---|---|
| tcp | \n+|||
| V1 | \n0 | \n-\n+ | The original BitTorrent version, using SHA-1 hashes | \n
| socks5 | \n+|||
| V2 | \n1 | \n-\n+ | Version 2 of the BitTorrent protocol, using SHA-256 hashes | \n
| http | \n+|||
| NUM | \n2 | \n\n | |
| utp | \n-3 | \n-\n- | |
| i2p | \n-4 | \n-\n- | |
| tcp_ssl | \n-5 | \n-\n- | |
| socks5_ssl | \n-6 | \n-\n- | |
| http_ssl | \n-7 | \n-\n- | |
| utp_ssl | \n-8 | \n-\n- |
Declared in "libtorrent/peer_connection.hpp"
\n| name | \nvalue | \ndescription | \n|
|---|---|---|---|
| natpmp | \n+|||
| bittorrent | \n0 | \n-natpmp can be NAT-PMP or PCP | \n+\n |
| upnp | \n+|||
| url_seed | \n1 | \n\n | |
| http_seed | \n+2 | \n+\n+ |
Declared in "libtorrent/socket_type.hpp"
\n| name | \nvalue | \ndescription | \n
|---|---|---|
| none | \n+||
| tcp | \n0 | \n\n |
| tcp | \n+||
| socks5 | \n1 | \n\n |
| udp | \n+||
| http | \n2 | \n\n |
Declared in "libtorrent/info_hash.hpp"
\n-| name | \n-value | \n-description | \n+
|---|---|---|
| utp | \n+3 | \n+\n |
| V1 | \n-0 | \n-The original BitTorrent version, using SHA-1 hashes | \n+
| i2p | \n+4 | \n+\n |
| V2 | \n-1 | \n-Version 2 of the BitTorrent protocol, using SHA-256 hashes | \n+
| tcp_ssl | \n+5 | \n+\n |
| NUM | \n-2 | \n+|
| socks5_ssl | \n+6 | \n+\n+ |
| http_ssl | \n+7 | \n+\n+ |
| utp_ssl | \n+8 | \n\n |
Declared in "libtorrent/portmap.hpp"
\n| name | \nvalue | \ndescription | \n
|---|---|---|
| bittorrent | \n+||
| natpmp | \n0 | \n+natpmp can be NAT-PMP or PCP | \n+
| upnp | \n+1 | \n\n |
| url_seed | \n+
Declared in "libtorrent/portmap.hpp"
\n+| name | \n+value | \n+description | \n+
|---|---|---|
| none | \n+0 | \n+\n+ |
| tcp | \n1 | \n\n |
| http_seed | \n+||
| udp | \n2 | \n\n |
Declared in "libtorrent/pex_flags.hpp"
\n+Declared in "libtorrent/torrent_flags.hpp"
\nIf seed_mode is set, libtorrent will assume that all files\n@@ -1142,15 +1169,15 @@\n stop-when-ready immediately.
\nWhen the stop-when-ready logic fires, the flag is cleared. Any\n subsequent transitions between downloading and non-downloading states\n will not be affected, until this flag is set again.
\nThe behavior is more robust when setting this flag as part of adding\n the torrent. See add_torrent_params.
\nThe stop-when-ready flag fixes the inherent race condition of waiting\n-for the state_changed_alert and then call pause(). The download/seeding\n+for the state_changed_alert and then call pause(). The download/seeding\n will most likely start in between posting the alert and receiving the\n call to pause.
\nA downloading state is one where peers are being connected. Which means\n just downloading the metadata via the ut_metadata extension counts\n as a downloading state. In order to stop a torrent once the metadata\n has been downloaded, instead set all file priorities to dont_download
\nDeclared in "libtorrent/pex_flags.hpp"
\n-Declared in "libtorrent/version.hpp"
\nThis section describes the functions and classes that are used\n@@ -108,40 +108,40 @@\n .torrent file using bencode().
\n\n struct create_torrent\n {\n explicit create_torrent (torrent_info const& ti);\n explicit create_torrent (file_storage& fs, int piece_size = 0\n , create_flags_t flags = {});\n- entry generate () const;\n std::vector<char> generate_buf () const;\n+ entry generate () const;\n file_storage const& files () const;\n void set_comment (char const* str);\n void set_creator (char const* str);\n void set_creation_date (std::time_t timestamp);\n void set_hash (piece_index_t index, sha1_hash const& h);\n void set_hash2 (file_index_t file, piece_index_t::diff_type piece, sha256_hash const& h);\n- void add_http_seed (string_view url);\n void add_url_seed (string_view url);\n+ void add_http_seed (string_view url);\n void add_node (std::pair<std::string, int> node);\n void add_tracker (string_view url, int tier = 0);\n void set_root_cert (string_view cert);\n bool priv () const;\n void set_priv (bool p);\n bool is_v1_only () const;\n bool is_v2_only () const;\n int num_pieces () const;\n piece_index_t end_piece () const;\n index_range<piece_index_t> piece_range () const noexcept;\n file_index_t end_file () const;\n index_range<file_index_t> file_range () const noexcept;\n index_range<piece_index_t::diff_type> file_piece_range (file_index_t f);\n std::int64_t total_size () const;\n- int piece_length () const;\n int piece_size (piece_index_t i) const;\n+ int piece_length () const;\n void add_collection (string_view c);\n void add_similar_torrent (sha1_hash ih);\n \n static constexpr create_flags_t modification_time = 2_bit;\n static constexpr create_flags_t symlinks = 3_bit;\n static constexpr create_flags_t v2_only = 5_bit;\n static constexpr create_flags_t v1_only = 6_bit;\n@@ -178,16 +178,16 @@\n entire duration of the create_torrent object.\n \n-entry generate () const;\n std::vector<char> generate_buf () const;\n+entry generate () const;\n\n
This function will generate the .torrent file as a bencode tree, or a\n bencoded into a buffer.\n In order to encode the entry into a flat file, use the bencode() function.
\nThe function returning an entry may be useful to add custom entries\n to the torrent file before bencoding it and saving it to disk.
\nWhether the resulting torrent object is v1, v2 or hybrid depends on\n@@ -270,21 +270,21 @@\n 16 kiB blocks. Note that piece sizes must be powers-of-2, so all\n per-piece merkle trees are complete.\n A SHA-256 hash of all zeros is internally used to indicate a hash\n that has not been set. Setting such hash will not be considered set\n when calling generate().\n This function will throw std::system_error if it is called on an\n object constructed with the v1_only flag.
\n-\n-[report issue]\n-void add_http_seed (string_view url);\n void add_url_seed (string_view url);\n+void add_http_seed (string_view url);\n\n
This adds a url seed to the torrent. You can have any number of url seeds. For a\n single file torrent, this should be an HTTP url, pointing to a file with identical\n content as the file of the torrent. For a multi-file torrent, it should point to\n a directory containing a directory with the same name as this torrent, and all the\n files of the torrent in it.
\nThe second function, add_http_seed() adds an HTTP seed instead.
\n@@ -367,29 +367,29 @@\n [report issue]\n std::int64_t total_size () const;\n\n
the total number of bytes of all files and pad files
\n-\n-[report issue]\n-int piece_length () const;\n int piece_size (piece_index_t i) const;\n+int piece_length () const;\n\n
piece_length() returns the piece size of all pieces but the\n last one. piece_size() returns the size of the specified piece.\n these functions are just forwarding to the associated file_storage.
\n-\n-[report issue]\n void add_collection (string_view c);\n void add_similar_torrent (sha1_hash ih);\n\n
Add similar torrents (by info-hash) or collections of similar torrents.\n Similar torrents are expected to share some files with this torrent.\n Torrents sharing a collection name with this torrent are also expected\n@@ -480,26 +480,26 @@\n
The flags argument should be the same as the flags passed to the create_torrent\n constructor.
\n [report issue]Declared in "libtorrent/create_torrent.hpp"
\n\n-inline void set_piece_hashes (create_torrent& t, std::string const& p, error_code& ec);\n-inline void set_piece_hashes (create_torrent& t, std::string const& p);\n+void set_piece_hashes (create_torrent& t, std::string const& p\n+ , settings_interface const& settings\n+ , std::function<void(piece_index_t)> const& f, error_code& ec);\n inline void set_piece_hashes (create_torrent& t, std::string const& p\n+ , settings_interface const& settings\n , std::function<void(piece_index_t)> const& f);\n inline void set_piece_hashes (create_torrent& t, std::string const& p\n- , settings_interface const& settings\n , std::function<void(piece_index_t)> const& f);\n void set_piece_hashes (create_torrent& t, std::string const& p\n , std::function<void(piece_index_t)> const& f, error_code& ec);\n-void set_piece_hashes (create_torrent& t, std::string const& p\n- , settings_interface const& settings\n- , std::function<void(piece_index_t)> const& f, error_code& ec);\n+inline void set_piece_hashes (create_torrent& t, std::string const& p);\n+inline void set_piece_hashes (create_torrent& t, std::string const& p, error_code& ec);\n void set_piece_hashes (create_torrent& t, std::string const& p\n , settings_interface const& settings, disk_io_constructor_type disk_io\n , std::function<void(piece_index_t)> const& f, error_code& ec);\n\n
This function will assume that the files added to the torrent file exists at path\n p, read those files and hash the content and set the hashes in the create_torrent\n object. The optional function f is called in between every hash that is set. f\n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -8,26 +8,26 @@\n o _\bg_\be_\bn_\be_\br_\ba_\bt_\be_\b(_\b)_\b _\bg_\be_\bn_\be_\br_\ba_\bt_\be_\b__\bb_\bu_\bf_\b(_\b)\n o _\bf_\bi_\bl_\be_\bs_\b(_\b)\n o _\bs_\be_\bt_\b__\bc_\bo_\bm_\bm_\be_\bn_\bt_\b(_\b)\n o _\bs_\be_\bt_\b__\bc_\br_\be_\ba_\bt_\bo_\br_\b(_\b)\n o _\bs_\be_\bt_\b__\bc_\br_\be_\ba_\bt_\bi_\bo_\bn_\b__\bd_\ba_\bt_\be_\b(_\b)\n o _\bs_\be_\bt_\b__\bh_\ba_\bs_\bh_\b(_\b)\n o _\bs_\be_\bt_\b__\bh_\ba_\bs_\bh_\b2_\b(_\b)\n- o _\ba_\bd_\bd_\b__\bh_\bt_\bt_\bp_\b__\bs_\be_\be_\bd_\b(_\b)_\b _\ba_\bd_\bd_\b__\bu_\br_\bl_\b__\bs_\be_\be_\bd_\b(_\b)\n+ o _\ba_\bd_\bd_\b__\bu_\br_\bl_\b__\bs_\be_\be_\bd_\b(_\b)_\b _\ba_\bd_\bd_\b__\bh_\bt_\bt_\bp_\b__\bs_\be_\be_\bd_\b(_\b)\n o _\ba_\bd_\bd_\b__\bn_\bo_\bd_\be_\b(_\b)\n o _\ba_\bd_\bd_\b__\bt_\br_\ba_\bc_\bk_\be_\br_\b(_\b)\n o _\bs_\be_\bt_\b__\br_\bo_\bo_\bt_\b__\bc_\be_\br_\bt_\b(_\b)\n o _\bs_\be_\bt_\b__\bp_\br_\bi_\bv_\b(_\b)_\b _\bp_\br_\bi_\bv_\b(_\b)\n o _\bn_\bu_\bm_\b__\bp_\bi_\be_\bc_\be_\bs_\b(_\b)\n o _\bp_\bi_\be_\bc_\be_\b__\br_\ba_\bn_\bg_\be_\b(_\b)\n o _\bf_\bi_\bl_\be_\b__\br_\ba_\bn_\bg_\be_\b(_\b)\n o _\bf_\bi_\bl_\be_\b__\bp_\bi_\be_\bc_\be_\b__\br_\ba_\bn_\bg_\be_\b(_\b)\n o _\bt_\bo_\bt_\ba_\bl_\b__\bs_\bi_\bz_\be_\b(_\b)\n- o _\bp_\bi_\be_\bc_\be_\b__\bl_\be_\bn_\bg_\bt_\bh_\b(_\b)_\b _\bp_\bi_\be_\bc_\be_\b__\bs_\bi_\bz_\be_\b(_\b)\n- o _\ba_\bd_\bd_\b__\bc_\bo_\bl_\bl_\be_\bc_\bt_\bi_\bo_\bn_\b(_\b)_\b _\ba_\bd_\bd_\b__\bs_\bi_\bm_\bi_\bl_\ba_\br_\b__\bt_\bo_\br_\br_\be_\bn_\bt_\b(_\b)\n+ o _\bp_\bi_\be_\bc_\be_\b__\bs_\bi_\bz_\be_\b(_\b)_\b _\bp_\bi_\be_\bc_\be_\b__\bl_\be_\bn_\bg_\bt_\bh_\b(_\b)\n+ o _\ba_\bd_\bd_\b__\bs_\bi_\bm_\bi_\bl_\ba_\br_\b__\bt_\bo_\br_\br_\be_\bn_\bt_\b(_\b)_\b _\ba_\bd_\bd_\b__\bc_\bo_\bl_\bl_\be_\bc_\bt_\bi_\bo_\bn_\b(_\b)\n * _\ba_\bd_\bd_\b__\bf_\bi_\bl_\be_\bs_\b(_\b)\n * _\bs_\be_\bt_\b__\bp_\bi_\be_\bc_\be_\b__\bh_\ba_\bs_\bh_\be_\bs_\b(_\b)\n This section describes the functions and classes that are used to create\n torrent files. It is a layered API with low level classes and higher level\n convenience functions. A torrent is created in 4 steps:\n 1. first the files that will be part of the torrent are determined.\n 2. the torrent properties are set, such as tracker url, web seeds, DHT nodes\n@@ -69,41 +69,41 @@\n _\be_\bn_\bt_\br_\by that's returned can then be bencoded into a .torrent file using _\bb_\be_\bn_\bc_\bo_\bd_\be\n _\b(_\b).\n struct create_torrent\n {\n explicit c\bcr\bre\bea\bat\bte\be_\b_t\bto\bor\brr\bre\ben\bnt\bt (torrent_info const& ti);\n explicit c\bcr\bre\bea\bat\bte\be_\b_t\bto\bor\brr\bre\ben\bnt\bt (file_storage& fs, int piece_size = 0\n , create_flags_t flags = {});\n- entry g\bge\ben\bne\ber\bra\bat\bte\be () const;\n std::vector Table of contents Declared in "libtorrent/disk_observer.hpp" Declared in "libtorrent/settings_pack.hpp" the common interface to settings_pack and the internal representation of\n+settings. called when the disk cache size has dropped\n-below the low watermark again and we can\n-resume downloading from peers Declared in "libtorrent/disk_buffer_holder.hpp" the interface for freeing disk buffers, used by the disk_buffer_holder.\n when implementing disk_interface, this must also be implemented in order\n to return disk buffers back to libtorrent implicitly convertible to true if the object is currently holding a\n buffer Declared in "libtorrent/settings_pack.hpp" the common interface to settings_pack and the internal representation of\n-settings. Declared in "libtorrent/disk_observer.hpp" called when the disk cache size has dropped\n+below the low watermark again and we can\n+resume downloading from peers Declared in "libtorrent/disk_interface.hpp" this contains information about a file that's currently open by the\n libtorrent disk I/O subsystem. It's associated with a single torrent. remove the storage with the specified index. This is not expected to\n delete any files from disk, just to clean up any resources associated\n with the specified storage. perform a read or write operation from/to the specified storage\n index and the specified request. When the operation completes, call\n handler possibly with a disk_buffer_holder, holding the buffer with\n the result. Flags may be set to affect the read operation. See\n disk_job_flags_t. The disk_observer is a callback to indicate that\n@@ -865,17 +865,17 @@\n internal libtorrent torrent object to tie the storage object allocated\n for a torrent to the lifetime of the internal torrent object. When a\n torrent is removed from the session, this holder is destructed and will\n inform the disk object. Table of contents Declared in "libtorrent/kademlia/dht_state.hpp" This structure helps to store and load the state\n-of the dht_tracker.\n-At this moment the library is only a dual stack\n-implementation of the DHT. See BEP 32 Declared in "libtorrent/kademlia/dht_storage.hpp" This structure hold the relevant counters for the storage return stats counters for the store Declared in "libtorrent/kademlia/dht_state.hpp" This structure helps to store and load the state\n+of the dht_tracker.\n+At this moment the library is only a dual stack\n+implementation of the DHT. See BEP 32 Declared in "libtorrent/kademlia/dht_storage.hpp" Table of contents Declared in "libtorrent/error_code.hpp" used by storage to return errors\n also includes which underlying file the\n@@ -94,16 +94,31 @@\n Declared in "libtorrent/bdecode.hpp" Declared in "libtorrent/gzip.hpp" get the error_category for zip errors Declared in "libtorrent/error_code.hpp" return the instance of the libtorrent_error_category which\n@@ -112,63 +127,191 @@\n Declared in "libtorrent/error_code.hpp" returns the error_category for HTTP errors Declared in "libtorrent/natpmp.hpp" Declared in "libtorrent/socks5_stream.hpp" returns the error_category for SOCKS5 errors Declared in "libtorrent/gzip.hpp" get the error_category for zip errors Declared in "libtorrent/upnp.hpp" the boost.system error category for UPnP errors Declared in "libtorrent/bdecode.hpp" Declared in "libtorrent/i2p_stream.hpp" returns the error category for I2P errors Declared in "libtorrent/natpmp.hpp" Declared in "libtorrent/bdecode.hpp" Declared in "libtorrent/gzip.hpp" Declared in "libtorrent/error_code.hpp" Declared in "libtorrent/natpmp.hpp" Declared in "libtorrent/socks5_stream.hpp" Declared in "libtorrent/gzip.hpp" Declared in "libtorrent/upnp.hpp" Declared in "libtorrent/i2p_stream.hpp" Declared in "libtorrent/natpmp.hpp"2.0.10 \n \n \n \n \n-
\n-
\n+
\n \n-
\n+
\n \n
disk_observer
\n-settings_interface
\n+\n-struct disk_observer\n+struct settings_interface\n {\n- virtual void on_disk () = 0;\n+ virtual void set_bool (int name, bool val) = 0;\n+ virtual void set_str (int name, std::string val) = 0;\n+ virtual bool has_val (int name) const = 0;\n+ virtual void set_int (int name, int val) = 0;\n+ virtual bool get_bool (int name) const = 0;\n+ virtual std::string const& get_str (int name) const = 0;\n+ virtual int get_int (int name) const = 0;\n };\n \n-[report issue]on_disk()
\n-\n-virtual void on_disk () = 0;\n-
\n-buffer_allocator_interface
\n \n@@ -458,34 +457,35 @@\n
bool()
\n \n explicit operator bool () const noexcept;\n
\n settings_interface
\n-disk_observer
\n+\n-struct settings_interface\n+struct disk_observer\n {\n- virtual bool has_val (int name) const = 0;\n- virtual void set_bool (int name, bool val) = 0;\n- virtual void set_str (int name, std::string val) = 0;\n- virtual void set_int (int name, int val) = 0;\n- virtual int get_int (int name) const = 0;\n- virtual std::string const& get_str (int name) const = 0;\n- virtual bool get_bool (int name) const = 0;\n+ virtual void on_disk () = 0;\n };\n \n+[report issue]on_disk()
\n+\n+virtual void on_disk () = 0;\n+
\n+open_file_state
\n \n struct open_file_state\n@@ -529,21 +529,21 @@\n the constructor. The callbacks will be run in the network thread.\n
\n struct disk_interface\n {\n virtual storage_holder new_torrent (storage_params const& p\n , std::shared_ptr<void> const& torrent) = 0;\n virtual void remove_torrent (storage_index_t) = 0;\n+ virtual void async_read (storage_index_t storage, peer_request const& r\n+ , std::function<void(disk_buffer_holder, storage_error const&)> handler\n+ , disk_job_flags_t flags = {}) = 0;\n virtual bool async_write (storage_index_t storage, peer_request const& r\n , char const* buf, std::shared_ptr<disk_observer> o\n , std::function<void(storage_error const&)> handler\n , disk_job_flags_t flags = {}) = 0;\n- virtual void async_read (storage_index_t storage, peer_request const& r\n- , std::function<void(disk_buffer_holder, storage_error const&)> handler\n- , disk_job_flags_t flags = {}) = 0;\n virtual void async_hash (storage_index_t storage, piece_index_t piece, span<sha256_hash> v2\n , disk_job_flags_t flags\n , std::function<void(piece_index_t, sha1_hash const&, storage_error const&)> handler) = 0;\n virtual void async_hash2 (storage_index_t storage, piece_index_t piece, int offset, disk_job_flags_t flags\n , std::function<void(piece_index_t, sha256_hash const&, storage_error const&)> handler) = 0;\n virtual void async_move_storage (storage_index_t storage, std::string p, move_flags_t flags\n , std::function<void(status_t, std::string const&, storage_error const&)> handler) = 0;\n@@ -595,26 +595,26 @@\n remove_torrent()
\n \n virtual void remove_torrent (storage_index_t) = 0;\n
\n async_read() async_write()
\n \n+virtual void async_read (storage_index_t storage, peer_request const& r\n+ , std::function<void(disk_buffer_holder, storage_error const&)> handler\n+ , disk_job_flags_t flags = {}) = 0;\n virtual bool async_write (storage_index_t storage, peer_request const& r\n , char const* buf, std::shared_ptr<disk_observer> o\n , std::function<void(storage_error const&)> handler\n , disk_job_flags_t flags = {}) = 0;\n-virtual void async_read (storage_index_t storage, peer_request const& r\n- , std::function<void(disk_buffer_holder, storage_error const&)> handler\n- , disk_job_flags_t flags = {}) = 0;\n \n \n struct storage_holder\n {\n- storage_holder () = default;\n- storage_holder (storage_index_t idx, disk_interface& disk_io);\n ~storage_holder ();\n+ storage_holder (storage_index_t idx, disk_interface& disk_io);\n+ storage_holder () = default;\n explicit operator bool () const;\n operator storage_index_t () const;\n void reset ();\n storage_holder (storage_holder const&) = delete;\n storage_holder& operator= (storage_holder const&) = delete;\n storage_holder (storage_holder&& rhs) noexcept;\n storage_holder& operator= (storage_holder&& rhs) noexcept;\n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,30 +1,30 @@\n >\n _\b[_\bl_\bi_\bb_\bt_\bo_\br_\br_\be_\bn_\bt_\b _\bl_\bo_\bg_\bo_\b]\n V\bVe\ber\brs\bsi\bio\bon\bn:\b: 2.0.10\n _\bh_\bo_\bm_\be\n Table of contents\n- * _\bd_\bi_\bs_\bk_\b__\bo_\bb_\bs_\be_\br_\bv_\be_\br\n- o _\bo_\bn_\b__\bd_\bi_\bs_\bk_\b(_\b)\n+ * _\bs_\be_\bt_\bt_\bi_\bn_\bg_\bs_\b__\bi_\bn_\bt_\be_\br_\bf_\ba_\bc_\be\n * _\bb_\bu_\bf_\bf_\be_\br_\b__\ba_\bl_\bl_\bo_\bc_\ba_\bt_\bo_\br_\b__\bi_\bn_\bt_\be_\br_\bf_\ba_\bc_\be\n * _\bd_\bi_\bs_\bk_\b__\bb_\bu_\bf_\bf_\be_\br_\b__\bh_\bo_\bl_\bd_\be_\br\n o _\bd_\bi_\bs_\bk_\b__\bb_\bu_\bf_\bf_\be_\br_\b__\bh_\bo_\bl_\bd_\be_\br_\b(_\b)\n o _\bd_\bi_\bs_\bk_\b__\bb_\bu_\bf_\bf_\be_\br_\b__\bh_\bo_\bl_\bd_\be_\br_\b(_\b)\n o _\b~_\bd_\bi_\bs_\bk_\b__\bb_\bu_\bf_\bf_\be_\br_\b__\bh_\bo_\bl_\bd_\be_\br_\b(_\b)\n o _\bd_\ba_\bt_\ba_\b(_\b)\n o _\br_\be_\bs_\be_\bt_\b(_\b)\n o _\bs_\bw_\ba_\bp_\b(_\b)\n o _\bi_\bs_\b__\bm_\bu_\bt_\ba_\bb_\bl_\be_\b(_\b)\n o _\bb_\bo_\bo_\bl_\b(_\b)\n- * _\bs_\be_\bt_\bt_\bi_\bn_\bg_\bs_\b__\bi_\bn_\bt_\be_\br_\bf_\ba_\bc_\be\n+ * _\bd_\bi_\bs_\bk_\b__\bo_\bb_\bs_\be_\br_\bv_\be_\br\n+ o _\bo_\bn_\b__\bd_\bi_\bs_\bk_\b(_\b)\n * _\bo_\bp_\be_\bn_\b__\bf_\bi_\bl_\be_\b__\bs_\bt_\ba_\bt_\be\n * _\bd_\bi_\bs_\bk_\b__\bi_\bn_\bt_\be_\br_\bf_\ba_\bc_\be\n o _\bn_\be_\bw_\b__\bt_\bo_\br_\br_\be_\bn_\bt_\b(_\b)\n o _\br_\be_\bm_\bo_\bv_\be_\b__\bt_\bo_\br_\br_\be_\bn_\bt_\b(_\b)\n- o _\ba_\bs_\by_\bn_\bc_\b__\bw_\br_\bi_\bt_\be_\b(_\b)_\b _\ba_\bs_\by_\bn_\bc_\b__\br_\be_\ba_\bd_\b(_\b)\n+ o _\ba_\bs_\by_\bn_\bc_\b__\br_\be_\ba_\bd_\b(_\b)_\b _\ba_\bs_\by_\bn_\bc_\b__\bw_\br_\bi_\bt_\be_\b(_\b)\n o _\ba_\bs_\by_\bn_\bc_\b__\bh_\ba_\bs_\bh_\b(_\b)\n o _\ba_\bs_\by_\bn_\bc_\b__\bh_\ba_\bs_\bh_\b2_\b(_\b)\n o _\ba_\bs_\by_\bn_\bc_\b__\bm_\bo_\bv_\be_\b__\bs_\bt_\bo_\br_\ba_\bg_\be_\b(_\b)\n o _\ba_\bs_\by_\bn_\bc_\b__\br_\be_\bl_\be_\ba_\bs_\be_\b__\bf_\bi_\bl_\be_\bs_\b(_\b)\n o _\ba_\bs_\by_\bn_\bc_\b__\bc_\bh_\be_\bc_\bk_\b__\bf_\bi_\bl_\be_\bs_\b(_\b)\n o _\ba_\bs_\by_\bn_\bc_\b__\bs_\bt_\bo_\bp_\b__\bt_\bo_\br_\br_\be_\bn_\bt_\b(_\b)\n o _\ba_\bs_\by_\bn_\bc_\b__\br_\be_\bn_\ba_\bm_\be_\b__\bf_\bi_\bl_\be_\b(_\b)\n@@ -327,26 +327,29 @@\n \n std::unique_ptr2.0.10 \n \n \n \n \n-
\n-
\n+
\n \n-
\n dht_state
\n-\n-struct dht_state\n-{\n- void clear ();\n-\n- node_ids_t nids;\n- std::vector<udp::endpoint> nodes;\n- std::vector<udp::endpoint> nodes6;\n-};\n-\n-[report issue]\n-
\n-[report issue]\n-
\n-[report issue]dht_storage_counters
\n \n struct dht_storage_counters\n {\n void reset ();\n@@ -308,16 +282,42 @@\n [report issue]counters()
\n \n virtual dht_storage_counters counters () const = 0;\n
\n dht_state
\n+\n+struct dht_state\n+{\n+ void clear ();\n+\n+ node_ids_t nids;\n+ std::vector<udp::endpoint> nodes;\n+ std::vector<udp::endpoint> nodes6;\n+};\n+\n+[report issue]\n+
\n+[report issue]\n+
\n+[report issue]dht_default_storage_constructor()
\n \n std::unique_ptr<dht_storage_interface> dht_default_storage_constructor (\n settings_interface const& settings);\n
\n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,50 +1,31 @@\n >\n _\b[_\bl_\bi_\bb_\bt_\bo_\br_\br_\be_\bn_\bt_\b _\bl_\bo_\bg_\bo_\b]\n V\bVe\ber\brs\bsi\bio\bon\bn:\b: 2.0.10\n _\bh_\bo_\bm_\be\n Table of contents\n- * _\bd_\bh_\bt_\b__\bs_\bt_\ba_\bt_\be\n * _\bd_\bh_\bt_\b__\bs_\bt_\bo_\br_\ba_\bg_\be_\b__\bc_\bo_\bu_\bn_\bt_\be_\br_\bs\n o _\br_\be_\bs_\be_\bt_\b(_\b)\n * _\bd_\bh_\bt_\b__\bs_\bt_\bo_\br_\ba_\bg_\be_\b__\bi_\bn_\bt_\be_\br_\bf_\ba_\bc_\be\n o _\bu_\bp_\bd_\ba_\bt_\be_\b__\bn_\bo_\bd_\be_\b__\bi_\bd_\bs_\b(_\b)\n o _\bg_\be_\bt_\b__\bp_\be_\be_\br_\bs_\b(_\b)\n o _\ba_\bn_\bn_\bo_\bu_\bn_\bc_\be_\b__\bp_\be_\be_\br_\b(_\b)\n o _\bg_\be_\bt_\b__\bi_\bm_\bm_\bu_\bt_\ba_\bb_\bl_\be_\b__\bi_\bt_\be_\bm_\b(_\b)\n o _\bp_\bu_\bt_\b__\bi_\bm_\bm_\bu_\bt_\ba_\bb_\bl_\be_\b__\bi_\bt_\be_\bm_\b(_\b)\n o _\bg_\be_\bt_\b__\bm_\bu_\bt_\ba_\bb_\bl_\be_\b__\bi_\bt_\be_\bm_\b__\bs_\be_\bq_\b(_\b)\n o _\bg_\be_\bt_\b__\bm_\bu_\bt_\ba_\bb_\bl_\be_\b__\bi_\bt_\be_\bm_\b(_\b)\n o _\bp_\bu_\bt_\b__\bm_\bu_\bt_\ba_\bb_\bl_\be_\b__\bi_\bt_\be_\bm_\b(_\b)\n o _\bg_\be_\bt_\b__\bi_\bn_\bf_\bo_\bh_\ba_\bs_\bh_\be_\bs_\b__\bs_\ba_\bm_\bp_\bl_\be_\b(_\b)\n o _\bt_\bi_\bc_\bk_\b(_\b)\n o _\bc_\bo_\bu_\bn_\bt_\be_\br_\bs_\b(_\b)\n+ * _\bd_\bh_\bt_\b__\bs_\bt_\ba_\bt_\be\n * _\bd_\bh_\bt_\b__\bd_\be_\bf_\ba_\bu_\bl_\bt_\b__\bs_\bt_\bo_\br_\ba_\bg_\be_\b__\bc_\bo_\bn_\bs_\bt_\br_\bu_\bc_\bt_\bo_\br_\b(_\b)\n * _\bs_\bi_\bg_\bn_\b__\bm_\bu_\bt_\ba_\bb_\bl_\be_\b__\bi_\bt_\be_\bm_\b(_\b)\n * _\ba_\bn_\bn_\bo_\bu_\bn_\bc_\be_\b__\bf_\bl_\ba_\bg_\bs_\b__\bt\n [_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b**\b* d\bdh\bht\bt_\b_s\bst\bta\bat\bte\be *\b**\b**\b**\b**\b**\b*\n-Declared in \"_\bl_\bi_\bb_\bt_\bo_\br_\br_\be_\bn_\bt_\b/_\bk_\ba_\bd_\be_\bm_\bl_\bi_\ba_\b/_\bd_\bh_\bt_\b__\bs_\bt_\ba_\bt_\be_\b._\bh_\bp_\bp\"\n-This structure helps to store and load the state of the dht_tracker. At this\n-moment the library is only a dual stack implementation of the DHT. See _\bB_\bE_\bP_\b _\b3_\b2\n-struct dht_state\n-{\n- void c\bcl\ble\bea\bar\br ();\n-\n- node_ids_t nids;\n- std::vector\n
\n storage_error
\n \n
\n-[report issue]bdecode_category()
\n+\n+boost::system::error_category& bdecode_category ();\n+
\n+[report issue]gzip_category()
\n+\n+boost::system::error_category& gzip_category ();\n+
\n+libtorrent_category()
\n \n boost::system::error_category& libtorrent_category ();\n
\n http_category()
\n \n boost::system::error_category& http_category ();\n
\n pcp_category()
\n-\n-boost::system::error_category& pcp_category ();\n-
\n [report issue]socks_category()
\n \n boost::system::error_category& socks_category ();\n
\n gzip_category()
\n-\n-boost::system::error_category& gzip_category ();\n-
\n-upnp_category()
\n \n boost::system::error_category& upnp_category ();\n
\n bdecode_category()
\n-\n-boost::system::error_category& bdecode_category ();\n-
\n [report issue]i2p_category()
\n \n boost::system::error_category& i2p_category ();\n
\n pcp_category()
\n+\n+boost::system::error_category& pcp_category ();\n+
\n [report issue]enum error_code_enum
\n+\n+
\n+[report issue]name \n+value \n+description \n+no_error \n+0 \n+Not an error \n+expected_digit \n+1 \n+expected digit in bencoded string \n+expected_colon \n+2 \n+expected colon in bencoded string \n+unexpected_eof \n+3 \n+unexpected end of file in bencoded string \n+expected_value \n+4 \n+expected value (list, dict, int or string) in bencoded string \n+depth_exceeded \n+5 \n+bencoded recursion depth limit exceeded \n+limit_exceeded \n+6 \n+bencoded item count limit exceeded \n+overflow \n+7 \n+integer overflow \n+error_code_max \n+8 \n+the number of error codes \n+enum error_code_enum
\n+\n+
\n+[report issue]name \n+value \n+description \n+no_error \n+0 \n+Not an error \n+invalid_gzip_header \n+1 \n+the supplied gzip buffer has invalid header \n+inflated_data_too_large \n+2 \n+the gzip buffer would inflate to more bytes than the specified\n+maximum size, and was rejected. \n+data_did_not_terminate \n+3 \n+available inflate data did not terminate \n+space_exhausted \n+4 \n+output space exhausted before completing inflate \n+invalid_block_type \n+5 \n+invalid block type (type == 3) \n+invalid_stored_block_length \n+6 \n+stored block length did not match one's complement \n+too_many_length_or_distance_codes \n+7 \n+dynamic block code description: too many length or distance codes \n+code_lengths_codes_incomplete \n+8 \n+dynamic block code description: code lengths codes incomplete \n+repeat_lengths_with_no_first_length \n+9 \n+dynamic block code description: repeat lengths with no first length \n+repeat_more_than_specified_lengths \n+10 \n+dynamic block code description: repeat more than specified lengths \n+invalid_literal_length_code_lengths \n+11 \n+dynamic block code description: invalid literal/length code lengths \n+invalid_distance_code_lengths \n+12 \n+dynamic block code description: invalid distance code lengths \n+invalid_literal_code_in_block \n+13 \n+invalid literal/length or distance code in fixed or dynamic block \n+distance_too_far_back_in_block \n+14 \n+distance is too far back in fixed or dynamic block \n+unknown_gzip_error \n+15 \n+an unknown error occurred during gzip inflation \n+error_code_max \n+16 \n+the number of error codes \n+enum error_code_enum
\n \n
\n-[report issue]service_unavailable \n 503 \n \n enum pcp_errors
\n-\n-
\n [report issue]name \n-value \n-description \n-pcp_success \n-0 \n- \n-pcp_unsupp_version \n-1 \n- \n-pcp_not_authorized \n-2 \n- \n-pcp_malformed_request \n-3 \n- \n-pcp_unsupp_opcode \n-4 \n- \n-pcp_unsupp_option \n-5 \n- \n-pcp_malformed_option \n-6 \n- \n-pcp_network_failure \n-7 \n- \n-pcp_no_resources \n-8 \n- \n-pcp_unsupp_protocol \n-9 \n- \n-pcp_user_ex_quota \n-10 \n- \n-pcp_cannot_provide_external \n-11 \n- \n-pcp_address_mismatch \n-12 \n- \n-pcp_excessive_remote_peers \n-13 \n- \n-enum socks_error_code
\n \n
\n [report issue]num_errors \n 10 \n \n enum error_code_enum
\n-\n-
\n-[report issue]name \n-value \n-description \n-no_error \n-0 \n-Not an error \n-invalid_gzip_header \n-1 \n-the supplied gzip buffer has invalid header \n-inflated_data_too_large \n-2 \n-the gzip buffer would inflate to more bytes than the specified\n-maximum size, and was rejected. \n-data_did_not_terminate \n-3 \n-available inflate data did not terminate \n-space_exhausted \n-4 \n-output space exhausted before completing inflate \n-invalid_block_type \n-5 \n-invalid block type (type == 3) \n-invalid_stored_block_length \n-6 \n-stored block length did not match one's complement \n-too_many_length_or_distance_codes \n-7 \n-dynamic block code description: too many length or distance codes \n-code_lengths_codes_incomplete \n-8 \n-dynamic block code description: code lengths codes incomplete \n-repeat_lengths_with_no_first_length \n-9 \n-dynamic block code description: repeat lengths with no first length \n-repeat_more_than_specified_lengths \n-10 \n-dynamic block code description: repeat more than specified lengths \n-invalid_literal_length_code_lengths \n-11 \n-dynamic block code description: invalid literal/length code lengths \n-invalid_distance_code_lengths \n-12 \n-dynamic block code description: invalid distance code lengths \n-invalid_literal_code_in_block \n-13 \n-invalid literal/length or distance code in fixed or dynamic block \n-distance_too_far_back_in_block \n-14 \n-distance is too far back in fixed or dynamic block \n-unknown_gzip_error \n-15 \n-an unknown error occurred during gzip inflation \n-error_code_max \n-16 \n-the number of error codes \n-enum error_code_enum
\n \n
\n-[report issue]external_port_must_be_wildcard \n 727 \n ExternalPort must be a wildcard and cannot be a\n specific port \n enum i2p_error_code
\n+\n
\n-[report issue]name \n value \n description \n no_error \n 0 \n-Not an error \n+ \n expected_digit \n+parse_failed \n 1 \n-expected digit in bencoded string \n+ \n expected_colon \n+cant_reach_peer \n 2 \n-expected colon in bencoded string \n+ \n unexpected_eof \n+i2p_error \n 3 \n-unexpected end of file in bencoded string \n+ \n expected_value \n+invalid_key \n 4 \n-expected value (list, dict, int or string) in bencoded string \n+ \n depth_exceeded \n+invalid_id \n 5 \n-bencoded recursion depth limit exceeded \n+ \n limit_exceeded \n+timeout \n 6 \n-bencoded item count limit exceeded \n+ \n overflow \n+key_not_found \n 7 \n-integer overflow \n+ \n error_code_max \n+duplicated_id \n 8 \n-the number of error codes \n+ \n+num_errors \n+9 \n+ \n enum pcp_errors
\n+\n
\n name \n value \n description \n no_error \n+pcp_success \n 0 \n \n parse_failed \n+pcp_unsupp_version \n 1 \n \n cant_reach_peer \n+pcp_not_authorized \n 2 \n \n i2p_error \n+pcp_malformed_request \n 3 \n \n invalid_key \n+pcp_unsupp_opcode \n 4 \n \n invalid_id \n+pcp_unsupp_option \n 5 \n \n timeout \n+pcp_malformed_option \n 6 \n \n key_not_found \n+pcp_network_failure \n 7 \n \n duplicated_id \n+pcp_no_resources \n 8 \n \n num_errors \n+pcp_unsupp_protocol \n 9 \n \n pcp_user_ex_quota \n+10 \n+ \n+pcp_cannot_provide_external \n+11 \n+ \n+pcp_address_mismatch \n+12 \n+ \n+pcp_excessive_remote_peers \n+13 \n+ \n+
A default constructed ip_filter does not filter any address.
\n\n struct ip_filter\n {\n+ ~ip_filter ();\n ip_filter ();\n ip_filter (ip_filter const&);\n- ip_filter (ip_filter&&);\n- ip_filter& operator= (ip_filter const&);\n ip_filter& operator= (ip_filter&&);\n- ~ip_filter ();\n+ ip_filter& operator= (ip_filter const&);\n+ ip_filter (ip_filter&&);\n bool empty () const;\n void add_rule (address const& first, address const& last, std::uint32_t flags);\n std::uint32_t access (address const& addr) const;\n filter_tuple_t export_filter () const;\n \n enum access_flags\n {\n@@ -153,20 +153,20 @@\n the port filter maps non-overlapping port ranges to flags. This\n is primarily used to indicate whether a range of ports should\n be connected to or not. The default is to have the full port\n range (0-65535) set to flag 0.
\n \n class port_filter\n {\n- port_filter& operator= (port_filter&&);\n port_filter& operator= (port_filter const&);\n- ~port_filter ();\n- port_filter (port_filter&&);\n port_filter (port_filter const&);\n+ port_filter (port_filter&&);\n port_filter ();\n+ port_filter& operator= (port_filter&&);\n+ ~port_filter ();\n void add_rule (std::uint16_t first, std::uint16_t last, std::uint32_t flags);\n std::uint32_t access (std::uint16_t port) const;\n \n enum access_flags\n {\n blocked,\n };\n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -19,20 +19,20 @@\n The ip_filter class is a set of rules that uniquely categorizes all ip\n addresses as allowed or disallowed. The default constructor creates a single\n rule that allows all addresses (0.0.0.0 - 255.255.255.255 for the IPv4 range,\n and the equivalent range covering all addresses for the IPv6 range).\n A default constructed _\bi_\bp_\b__\bf_\bi_\bl_\bt_\be_\br does not filter any address.\n struct ip_filter\n {\n+ ~\b~i\bip\bp_\b_f\bfi\bil\blt\bte\ber\br ();\n i\bip\bp_\b_f\bfi\bil\blt\bte\ber\br ();\n i\bip\bp_\b_f\bfi\bil\blt\bte\ber\br (ip_filter const&);\n- i\bip\bp_\b_f\bfi\bil\blt\bte\ber\br (ip_filter&&);\n- ip_filter& o\bop\bpe\ber\bra\bat\bto\bor\br=\b= (ip_filter const&);\n ip_filter& o\bop\bpe\ber\bra\bat\bto\bor\br=\b= (ip_filter&&);\n- ~\b~i\bip\bp_\b_f\bfi\bil\blt\bte\ber\br ();\n+ ip_filter& o\bop\bpe\ber\bra\bat\bto\bor\br=\b= (ip_filter const&);\n+ i\bip\bp_\b_f\bfi\bil\blt\bte\ber\br (ip_filter&&);\n bool e\bem\bmp\bpt\bty\by () const;\n void a\bad\bdd\bd_\b_r\bru\bul\ble\be (address const& first, address const& last, std::uint32_t\n flags);\n std::uint32_t a\bac\bcc\bce\bes\bss\bs (address const& addr) const;\n filter_tuple_t e\bex\bxp\bpo\bor\brt\bt_\b_f\bfi\bil\blt\bte\ber\br () const;\n \n enum access_flags\n@@ -81,20 +81,20 @@\n *\b**\b**\b**\b**\b**\b* p\bpo\bor\brt\bt_\b_f\bfi\bil\blt\bte\ber\br *\b**\b**\b**\b**\b**\b*\n Declared in \"_\bl_\bi_\bb_\bt_\bo_\br_\br_\be_\bn_\bt_\b/_\bi_\bp_\b__\bf_\bi_\bl_\bt_\be_\br_\b._\bh_\bp_\bp\"\n the port filter maps non-overlapping port ranges to flags. This is primarily\n used to indicate whether a range of ports should be connected to or not. The\n default is to have the full port range (0-65535) set to flag 0.\n class port_filter\n {\n- port_filter& o\bop\bpe\ber\bra\bat\bto\bor\br=\b= (port_filter&&);\n port_filter& o\bop\bpe\ber\bra\bat\bto\bor\br=\b= (port_filter const&);\n- ~\b~p\bpo\bor\brt\bt_\b_f\bfi\bil\blt\bte\ber\br ();\n- p\bpo\bor\brt\bt_\b_f\bfi\bil\blt\bte\ber\br (port_filter&&);\n p\bpo\bor\brt\bt_\b_f\bfi\bil\blt\bte\ber\br (port_filter const&);\n+ p\bpo\bor\brt\bt_\b_f\bfi\bil\blt\bte\ber\br (port_filter&&);\n p\bpo\bor\brt\bt_\b_f\bfi\bil\blt\bte\ber\br ();\n+ port_filter& o\bop\bpe\ber\bra\bat\bto\bor\br=\b= (port_filter&&);\n+ ~\b~p\bpo\bor\brt\bt_\b_f\bfi\bil\blt\bte\ber\br ();\n void a\bad\bdd\bd_\b_r\bru\bul\ble\be (std::uint16_t first, std::uint16_t last, std::uint32_t\n flags);\n std::uint32_t a\bac\bcc\bce\bes\bss\bs (std::uint16_t port) const;\n \n enum access_flags\n {\n blocked,\n"}]}, {"source1": "./usr/share/doc/libtorrent-rasterbar-doc/html/reference-PeerClass.html", "source2": "./usr/share/doc/libtorrent-rasterbar-doc/html/reference-PeerClass.html", "unified_diff": "@@ -29,16 +29,16 @@\n \n \n \n \n Table of contents
\n \n - peer_class_type_filter\n
\n - peer_class_info
\n
\n \n@@ -47,16 +47,16 @@\n Declared in "libtorrent/peer_class_type_filter.hpp"
\n peer_class_type_filter is a simple container for rules for adding and subtracting\n peer-classes from peers. It is applied after the peer class filter is applied (which\n is based on the peer's IP address).
\n \n struct peer_class_type_filter\n {\n- void remove (socket_type_t const st, peer_class_t const peer_class);\n void add (socket_type_t const st, peer_class_t const peer_class);\n+ void remove (socket_type_t const st, peer_class_t const peer_class);\n void disallow (socket_type_t const st, peer_class_t const peer_class);\n void allow (socket_type_t const st, peer_class_t const peer_class);\n std::uint32_t apply (socket_type_t const st, std::uint32_t peer_class_mask);\n friend bool operator== (peer_class_type_filter const& lhs\n , peer_class_type_filter const& rhs);\n \n enum socket_type_t\n@@ -66,27 +66,27 @@\n ssl_tcp_socket,\n ssl_utp_socket,\n i2p_socket,\n num_socket_types,\n };\n };\n \n-\n-[report issue]\n-add() remove()
\n+\n+[report issue]\n+remove() add()
\n \n-void remove (socket_type_t const st, peer_class_t const peer_class);\n void add (socket_type_t const st, peer_class_t const peer_class);\n+void remove (socket_type_t const st, peer_class_t const peer_class);\n
\n add() and remove() adds and removes a peer class to be added\n to new peers based on socket type.
\n-\n-[report issue]\n-\n+\n+allow() disallow()
\n \n void disallow (socket_type_t const st, peer_class_t const peer_class);\n void allow (socket_type_t const st, peer_class_t const peer_class);\n
\n disallow() and allow() adds and removes a peer class to be\n removed from new peers based on socket type.
\n The peer_class argument cannot be greater than 31. The bitmasks representing\n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,28 +1,28 @@\n >\n _\b[_\bl_\bi_\bb_\bt_\bo_\br_\br_\be_\bn_\bt_\b _\bl_\bo_\bg_\bo_\b]\n V\bVe\ber\brs\bsi\bio\bon\bn:\b: 2.0.10\n _\bh_\bo_\bm_\be\n Table of contents\n * _\bp_\be_\be_\br_\b__\bc_\bl_\ba_\bs_\bs_\b__\bt_\by_\bp_\be_\b__\bf_\bi_\bl_\bt_\be_\br\n- o _\ba_\bd_\bd_\b(_\b)_\b _\br_\be_\bm_\bo_\bv_\be_\b(_\b)\n- o _\bd_\bi_\bs_\ba_\bl_\bl_\bo_\bw_\b(_\b)_\b _\ba_\bl_\bl_\bo_\bw_\b(_\b)\n+ o _\br_\be_\bm_\bo_\bv_\be_\b(_\b)_\b _\ba_\bd_\bd_\b(_\b)\n+ o _\ba_\bl_\bl_\bo_\bw_\b(_\b)_\b _\bd_\bi_\bs_\ba_\bl_\bl_\bo_\bw_\b(_\b)\n o _\ba_\bp_\bp_\bl_\by_\b(_\b)\n o _\be_\bn_\bu_\bm_\b _\bs_\bo_\bc_\bk_\be_\bt_\b__\bt_\by_\bp_\be_\b__\bt\n * _\bp_\be_\be_\br_\b__\bc_\bl_\ba_\bs_\bs_\b__\bi_\bn_\bf_\bo\n [_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n *\b**\b**\b**\b**\b**\b* p\bpe\bee\ber\br_\b_c\bcl\bla\bas\bss\bs_\b_t\bty\byp\bpe\be_\b_f\bfi\bil\blt\bte\ber\br *\b**\b**\b**\b**\b**\b*\n Declared in \"_\bl_\bi_\bb_\bt_\bo_\br_\br_\be_\bn_\bt_\b/_\bp_\be_\be_\br_\b__\bc_\bl_\ba_\bs_\bs_\b__\bt_\by_\bp_\be_\b__\bf_\bi_\bl_\bt_\be_\br_\b._\bh_\bp_\bp\"\n peer_class_type_filter is a simple container for rules for adding and\n subtracting peer-classes from peers. It is applied a\baf\bft\bte\ber\br the peer class filter\n is applied (which is based on the peer's IP address).\n struct peer_class_type_filter\n {\n- void r\bre\bem\bmo\bov\bve\be (socket_type_t const st, peer_class_t const peer_class);\n void a\bad\bdd\bd (socket_type_t const st, peer_class_t const peer_class);\n+ void r\bre\bem\bmo\bov\bve\be (socket_type_t const st, peer_class_t const peer_class);\n void d\bdi\bis\bsa\bal\bll\blo\bow\bw (socket_type_t const st, peer_class_t const peer_class);\n void a\bal\bll\blo\bow\bw (socket_type_t const st, peer_class_t const peer_class);\n std::uint32_t a\bap\bpp\bpl\bly\by (socket_type_t const st, std::uint32_t peer_class_mask);\n friend bool o\bop\bpe\ber\bra\bat\bto\bor\br=\b==\b= (peer_class_type_filter const& lhs\n , peer_class_type_filter const& rhs);\n \n enum socket_type_t\n@@ -32,21 +32,21 @@\n ssl_tcp_socket,\n ssl_utp_socket,\n i2p_socket,\n num_socket_types,\n };\n };\n [_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b* a\bad\bdd\bd(\b()\b) r\bre\bem\bmo\bov\bve\be(\b()\b) *\b**\b**\b**\b**\b*\n-void r\bre\bem\bmo\bov\bve\be (socket_type_t const st, peer_class_t const peer_class);\n+*\b**\b**\b**\b**\b* r\bre\bem\bmo\bov\bve\be(\b()\b) a\bad\bdd\bd(\b()\b) *\b**\b**\b**\b**\b*\n void a\bad\bdd\bd (socket_type_t const st, peer_class_t const peer_class);\n+void r\bre\bem\bmo\bov\bve\be (socket_type_t const st, peer_class_t const peer_class);\n add() and remove() adds and removes a peer class to be added to new peers based\n on socket type.\n [_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b* d\bdi\bis\bsa\bal\bll\blo\bow\bw(\b()\b) a\bal\bll\blo\bow\bw(\b()\b) *\b**\b**\b**\b**\b*\n+*\b**\b**\b**\b**\b* a\bal\bll\blo\bow\bw(\b()\b) d\bdi\bis\bsa\bal\bll\blo\bow\bw(\b()\b) *\b**\b**\b**\b**\b*\n void d\bdi\bis\bsa\bal\bll\blo\bow\bw (socket_type_t const st, peer_class_t const peer_class);\n void a\bal\bll\blo\bow\bw (socket_type_t const st, peer_class_t const peer_class);\n disallow() and allow() adds and removes a peer class to be removed from new\n peers based on socket type.\n The peer_class argument cannot be greater than 31. The bitmasks representing\n peer classes in the peer_class_type_filter are 32 bits.\n [_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n"}]}, {"source1": "./usr/share/doc/libtorrent-rasterbar-doc/html/reference-Plugins.html", "source2": "./usr/share/doc/libtorrent-rasterbar-doc/html/reference-Plugins.html", "unified_diff": "@@ -31,65 +31,65 @@\n
\n \n Table of contents
\n \n - a word of caution
\n - plugin-interface
\n - custom alerts
\n-- peer_connection_handle
\n-- bt_peer_connection_handle
\n-- plugin
\n-- implemented_features()
\n-- new_torrent()
\n-- added()
\n-- abort()
\n-- on_dht_request()
\n-- on_alert()
\n-- on_unknown_torrent()
\n-- on_tick()
\n-- get_unchoke_priority()
\n-- load_state()
\n+- plugin\n
\n-- torrent_plugin
\n-- new_connection()
\n-- on_piece_failed() on_piece_pass()
\n-- tick()
\n-- on_resume() on_pause()
\n-- on_files_checked()
\n-- on_state()
\n-- on_add_peer()
\n+- torrent_plugin\n
\n-- peer_plugin
\n-- type()
\n-- add_handshake()
\n-- on_disconnect()
\n-- on_connected()
\n-- on_handshake()
\n-- on_extension_handshake()
\n-- on_request() on_interested() on_have() on_not_interested() on_have_all() on_have_none() on_bitfield() on_unchoke() on_choke() on_dont_have() on_allowed_fast()
\n-- on_piece()
\n-- sent_unchoke() sent_not_interested() sent_piece() sent_have() sent_interested()
\n-- sent_payload()
\n-- can_disconnect()
\n-- on_extended()
\n-- on_unknown_message()
\n-- on_piece_failed() on_piece_pass()
\n-- tick()
\n-- write_request()
\n+- peer_plugin
\n+- type()
\n+- add_handshake()
\n+- on_disconnect()
\n+- on_connected()
\n+- on_handshake()
\n+- on_extension_handshake()
\n+- on_choke() on_not_interested() on_have() on_unchoke() on_allowed_fast() on_bitfield() on_have_none() on_interested() on_dont_have() on_have_all() on_request()
\n+- on_piece()
\n+- sent_have() sent_not_interested() sent_unchoke() sent_piece() sent_interested()
\n+- sent_payload()
\n+- can_disconnect()
\n+- on_extended()
\n+- on_unknown_message()
\n+- on_piece_pass() on_piece_failed()
\n+- tick()
\n+- write_request()
\n
\n \n-- crypto_plugin\n
\n libtorrent has a plugin interface for implementing extensions to the protocol.\n These can be general extensions for transferring metadata or peer exchange\n extensions, or it could be used to provide a way to customize the protocol\n to fit a particular (closed) network.
\n In short, the plugin interface makes it possible to:
\n@@ -178,84 +178,14 @@\n expected.\n The static category is required for checking whether or not the category\n for a specific alert is enabled or not, without instantiating the alert.\n The category virtual function is the run-time equivalence.
\n The what() virtual function may simply be a string literal of the class\n name of your alert.
\n For more information, see the alert section.
\n-[report issue]\n-\n-peer_connection_handle
\n-Declared in "libtorrent/peer_connection_handle.hpp"
\n-the peer_connection_handle class provides a handle to the internal peer\n-connection object, to be used by plugins. This is a low level interface that\n-may not be stable across libtorrent versions
\n-\n-struct peer_connection_handle\n-{\n- explicit peer_connection_handle (std::weak_ptr<peer_connection> impl);\n- connection_type type () const;\n- peer_plugin const* find_plugin (string_view type) const;\n- void add_extension (std::shared_ptr<peer_plugin>);\n- bool is_seed () const;\n- bool upload_only () const;\n- peer_id const& pid () const;\n- bool has_piece (piece_index_t i) const;\n- bool is_interesting () const;\n- bool is_choked () const;\n- bool is_peer_interested () const;\n- bool has_peer_choked () const;\n- void choke_this_peer ();\n- void maybe_unchoke_this_peer ();\n- void get_peer_info (peer_info& p) const;\n- torrent_handle associated_torrent () const;\n- tcp::endpoint const& remote () const;\n- tcp::endpoint local_endpoint () const;\n- bool is_connecting () const;\n- bool is_disconnecting () const;\n- void disconnect (error_code const& ec, operation_t op\n- , disconnect_severity_t = peer_connection_interface::normal);\n- bool is_outgoing () const;\n- bool ignore_unchoke_slots () const;\n- bool on_local_network () const;\n- bool failed () const;\n- bool should_log (peer_log_alert::direction_t direction) const;\n- void peer_log (peer_log_alert::direction_t direction\n- , char const* event, char const* fmt = "", ...) const TORRENT_FORMAT(4,5);\n- bool can_disconnect (error_code const& ec) const;\n- bool has_metadata () const;\n- bool in_handshake () const;\n- void send_buffer (char const* begin, int size);\n- time_point time_of_last_unchoke () const;\n- std::time_t last_seen_complete () const;\n- bool operator< (peer_connection_handle const& o) const;\n- bool operator== (peer_connection_handle const& o) const;\n- bool operator!= (peer_connection_handle const& o) const;\n- std::shared_ptr<peer_connection> native_handle () const;\n-};\n-\n-[report issue]\n-\n-bt_peer_connection_handle
\n-Declared in "libtorrent/peer_connection_handle.hpp"
\n-The bt_peer_connection_handle provides a handle to the internal bittorrent\n-peer connection object to plugins. It's low level and may not be a stable API\n-across libtorrent versions.
\n-\n-struct bt_peer_connection_handle : peer_connection_handle\n-{\n- explicit bt_peer_connection_handle (peer_connection_handle pc);\n- bool packet_finished () const;\n- bool support_extensions () const;\n- bool supports_encryption () const;\n- void switch_send_crypto (std::shared_ptr<crypto_plugin> crypto);\n- void switch_recv_crypto (std::shared_ptr<crypto_plugin> crypto);\n- std::shared_ptr<bt_peer_connection> native_handle () const;\n-};\n-\n [report issue]\n \n plugin
\n Declared in "libtorrent/extensions.hpp"
\n this is the base class for a session plugin. One primary feature\n is that it is notified of all torrents that are added to the session,\n and can add its own torrent_plugins.
\n@@ -415,19 +345,19 @@\n Torrent plugins are associated with a single torrent and have a number\n of functions called at certain events. Many of its functions have the\n ability to change or override the default libtorrent behavior.
\n \n struct torrent_plugin\n {\n virtual std::shared_ptr<peer_plugin> new_connection (peer_connection_handle const&);\n- virtual void on_piece_failed (piece_index_t);\n virtual void on_piece_pass (piece_index_t);\n+ virtual void on_piece_failed (piece_index_t);\n virtual void tick ();\n- virtual bool on_pause ();\n virtual bool on_resume ();\n+ virtual bool on_pause ();\n virtual void on_files_checked ();\n virtual void on_state (torrent_status::state_t);\n virtual void on_add_peer (tcp::endpoint const&,\n peer_source_flags_t, add_peer_flags_t);\n \n static constexpr add_peer_flags_t first_time = 1_bit;\n static constexpr add_peer_flags_t filtered = 2_bit;\n@@ -446,41 +376,41 @@\n are supposed to return an instance of your peer_plugin class. Which in\n turn will have its hook functions called on event specific to that peer.\n The peer_connection_handle will be valid as long as the shared_ptr\n is being held by the torrent object. So, it is generally a good idea to not\n keep a shared_ptr to your own peer_plugin. If you want to keep references\n to it, use weak_ptr.
\n If this function throws an exception, the connection will be closed.
\n-\n-[report issue]\n-\n+\n+on_piece_pass() on_piece_failed()
\n \n-virtual void on_piece_failed (piece_index_t);\n virtual void on_piece_pass (piece_index_t);\n+virtual void on_piece_failed (piece_index_t);\n
\n These hooks are called when a piece passes the hash check or fails the hash\n check, respectively. The index is the piece index that was downloaded.\n It is possible to access the list of peers that participated in sending the\n piece through the torrent and the piece_picker.
\n [report issue]\n \n tick()
\n \n virtual void tick ();\n
\n This hook is called approximately once per second. It is a way of making it\n easy for plugins to do timed events, for sending messages or whatever.
\n-\n-[report issue]\n-\n+\n+on_pause() on_resume()
\n \n-virtual bool on_pause ();\n virtual bool on_resume ();\n+virtual bool on_pause ();\n
\n These hooks are called when the torrent is paused and resumed respectively.\n The return value indicates if the event was handled. A return value of\n true indicates that it was handled, and no other plugin after this one\n will have this hook function called, and the standard handler will also not be\n invoked. So, returning true effectively overrides the standard behavior of\n pause or resume.
\n@@ -546,50 +476,50 @@\n virtual string_view type () const;\n virtual void add_handshake (entry&);\n virtual void on_disconnect (error_code const&);\n virtual void on_connected ();\n virtual bool on_handshake (span<char const>);\n virtual bool on_extension_handshake (bdecode_node const&);\n virtual bool on_bitfield (bitfield const& /*bitfield*/);\n- virtual bool on_have_none ();\n- virtual bool on_request (peer_request const&);\n- virtual bool on_choke ();\n- virtual bool on_unchoke ();\n- virtual bool on_interested ();\n- virtual bool on_not_interested ();\n- virtual bool on_allowed_fast (piece_index_t);\n virtual bool on_have_all ();\n+ virtual bool on_request (peer_request const&);\n+ virtual bool on_have_none ();\n virtual bool on_have (piece_index_t);\n+ virtual bool on_allowed_fast (piece_index_t);\n+ virtual bool on_interested ();\n virtual bool on_dont_have (piece_index_t);\n+ virtual bool on_unchoke ();\n+ virtual bool on_not_interested ();\n+ virtual bool on_choke ();\n virtual bool on_piece (peer_request const& /*piece*/\n , span<char const> /*buf*/);\n+ virtual bool on_cancel (peer_request const&);\n virtual bool on_suggest (piece_index_t);\n virtual bool on_reject (peer_request const&);\n- virtual bool on_cancel (peer_request const&);\n+ virtual void sent_allow_fast (piece_index_t);\n+ virtual void sent_reject_request (peer_request const&);\n+ virtual void sent_request (peer_request const&);\n virtual void sent_suggest (piece_index_t);\n virtual void sent_cancel (peer_request const&);\n- virtual void sent_request (peer_request const&);\n- virtual void sent_allow_fast (piece_index_t);\n- virtual void sent_have_all ();\n virtual void sent_have_none ();\n- virtual void sent_reject_request (peer_request const&);\n virtual void sent_choke ();\n+ virtual void sent_have_all ();\n virtual void sent_not_interested ();\n- virtual void sent_have (piece_index_t);\n- virtual void sent_unchoke ();\n- virtual void sent_piece (peer_request const&);\n virtual void sent_interested ();\n+ virtual void sent_piece (peer_request const&);\n+ virtual void sent_unchoke ();\n+ virtual void sent_have (piece_index_t);\n virtual void sent_payload (int /* bytes */);\n virtual bool can_disconnect (error_code const& /*ec*/);\n virtual bool on_extended (int /*length*/, int /*msg*/,\n span<char const> /*body*/);\n virtual bool on_unknown_message (int /*length*/, int /*msg*/,\n span<char const> /*body*/);\n- virtual void on_piece_failed (piece_index_t);\n virtual void on_piece_pass (piece_index_t);\n+ virtual void on_piece_failed (piece_index_t);\n virtual void tick ();\n virtual bool write_request (peer_request const&);\n };\n \n [report issue]\n type()
\n \n@@ -639,39 +569,39 @@\n virtual bool on_extension_handshake (bdecode_node const&);\n
\n called when the extension handshake from the other end is received\n if this returns false, it means that this extension isn't\n supported by this peer. It will result in this peer_plugin\n being removed from the peer_connection and destructed.\n this is not called for web seeds
\n-\n-\n-\n+\n \n-\n-\n-\n+\n \n-\n+\n+\n+\n+\n \n-[report issue]\n-\n-on_request() on_interested() on_have() on_not_interested() on_have_all() on_have_none() on_bitfield() on_unchoke() on_choke() on_dont_have() on_allowed_fast()
\n+\n+[report issue]\n+\n+on_choke() on_not_interested() on_have() on_unchoke() on_allowed_fast() on_bitfield() on_have_none() on_interested() on_dont_have() on_have_all() on_request()
\n \n virtual bool on_bitfield (bitfield const& /*bitfield*/);\n-virtual bool on_have_none ();\n-virtual bool on_request (peer_request const&);\n-virtual bool on_choke ();\n-virtual bool on_unchoke ();\n-virtual bool on_interested ();\n-virtual bool on_not_interested ();\n-virtual bool on_allowed_fast (piece_index_t);\n virtual bool on_have_all ();\n+virtual bool on_request (peer_request const&);\n+virtual bool on_have_none ();\n virtual bool on_have (piece_index_t);\n+virtual bool on_allowed_fast (piece_index_t);\n+virtual bool on_interested ();\n virtual bool on_dont_have (piece_index_t);\n+virtual bool on_unchoke ();\n+virtual bool on_not_interested ();\n+virtual bool on_choke ();\n
\n returning true from any of the message handlers\n indicates that the plugin has handled the message.\n it will break the plugin chain traversing and not let\n anyone else handle the message, including the default\n handler.
\n [report issue]\n@@ -683,27 +613,27 @@\n \n This function is called when the peer connection is receiving\n a piece. buf points (non-owning pointer) to the data in an\n internal immutable disk buffer. The length of the data is specified\n in the length member of the piece parameter.\n returns true to indicate that the piece is handled and the\n rest of the logic should be ignored.
\n-\n+\n \n+\n \n-\n-[report issue]\n-\n+\n+sent_have() sent_not_interested() sent_unchoke() sent_piece() sent_interested()
\n \n virtual void sent_not_interested ();\n-virtual void sent_have (piece_index_t);\n-virtual void sent_unchoke ();\n-virtual void sent_piece (peer_request const&);\n virtual void sent_interested ();\n+virtual void sent_piece (peer_request const&);\n+virtual void sent_unchoke ();\n+virtual void sent_have (piece_index_t);\n
\n called after a choke message has been sent to the peer
\n [report issue]\n \n sent_payload()
\n \n virtual void sent_payload (int /* bytes */);\n@@ -739,21 +669,21 @@\n \n on_unknown_message()
\n \n virtual bool on_unknown_message (int /*length*/, int /*msg*/,\n span<char const> /*body*/);\n
\n this is not called for web seeds
\n-\n-[report issue]\n-\n+\n+on_piece_pass() on_piece_failed()
\n \n-virtual void on_piece_failed (piece_index_t);\n virtual void on_piece_pass (piece_index_t);\n+virtual void on_piece_failed (piece_index_t);\n
\n called when a piece that this peer participated in either\n fails or passes the hash_check
\n [report issue]\n \n tick()
\n \n@@ -773,16 +703,16 @@\n
\n \n crypto_plugin
\n Declared in "libtorrent/extensions.hpp"
\n \n struct crypto_plugin\n {\n- virtual void set_outgoing_key (span<char const> key) = 0;\n virtual void set_incoming_key (span<char const> key) = 0;\n+ virtual void set_outgoing_key (span<char const> key) = 0;\n encrypt (span<span<char>> /*send_vec*/) = 0;\n virtual std::tuple<int, int, int> decrypt (span<span<char>> /*receive_vec*/) = 0;\n };\n \n [report issue]\n decrypt()
\n \n@@ -793,29 +723,112 @@\n (consume, produce, packet_size)\n consume is set to the number of bytes which should be trimmed from the\n head of the buffers, default is 0
\n produce is set to the number of bytes of payload which are now ready to\n be sent to the upper layer. default is the number of bytes passed in receive_vec
\n packet_size is set to the minimum number of bytes which must be read to\n advance the next step of decryption. default is 0
\n-[report issue]
\n+[report issue]\n
\n+\n+peer_connection_handle
\n+Declared in "libtorrent/peer_connection_handle.hpp"
\n+the peer_connection_handle class provides a handle to the internal peer\n+connection object, to be used by plugins. This is a low level interface that\n+may not be stable across libtorrent versions
\n+\n+struct peer_connection_handle\n+{\n+ explicit peer_connection_handle (std::weak_ptr<peer_connection> impl);\n+ connection_type type () const;\n+ peer_plugin const* find_plugin (string_view type) const;\n+ void add_extension (std::shared_ptr<peer_plugin>);\n+ bool is_seed () const;\n+ bool upload_only () const;\n+ peer_id const& pid () const;\n+ bool has_piece (piece_index_t i) const;\n+ bool is_interesting () const;\n+ bool is_choked () const;\n+ bool has_peer_choked () const;\n+ bool is_peer_interested () const;\n+ void maybe_unchoke_this_peer ();\n+ void choke_this_peer ();\n+ void get_peer_info (peer_info& p) const;\n+ torrent_handle associated_torrent () const;\n+ tcp::endpoint local_endpoint () const;\n+ tcp::endpoint const& remote () const;\n+ void disconnect (error_code const& ec, operation_t op\n+ , disconnect_severity_t = peer_connection_interface::normal);\n+ bool is_connecting () const;\n+ bool is_disconnecting () const;\n+ bool is_outgoing () const;\n+ bool ignore_unchoke_slots () const;\n+ bool on_local_network () const;\n+ bool failed () const;\n+ bool should_log (peer_log_alert::direction_t direction) const;\n+ void peer_log (peer_log_alert::direction_t direction\n+ , char const* event, char const* fmt = "", ...) const TORRENT_FORMAT(4,5);\n+ bool can_disconnect (error_code const& ec) const;\n+ bool has_metadata () const;\n+ bool in_handshake () const;\n+ void send_buffer (char const* begin, int size);\n+ time_point time_of_last_unchoke () const;\n+ std::time_t last_seen_complete () const;\n+ bool operator!= (peer_connection_handle const& o) const;\n+ bool operator< (peer_connection_handle const& o) const;\n+ bool operator== (peer_connection_handle const& o) const;\n+ std::shared_ptr<peer_connection> native_handle () const;\n+};\n+\n+[report issue]\n+\n+bt_peer_connection_handle
\n+Declared in "libtorrent/peer_connection_handle.hpp"
\n+The bt_peer_connection_handle provides a handle to the internal bittorrent\n+peer connection object to plugins. It's low level and may not be a stable API\n+across libtorrent versions.
\n+\n+struct bt_peer_connection_handle : peer_connection_handle\n+{\n+ explicit bt_peer_connection_handle (peer_connection_handle pc);\n+ bool packet_finished () const;\n+ bool support_extensions () const;\n+ bool supports_encryption () const;\n+ void switch_recv_crypto (std::shared_ptr<crypto_plugin> crypto);\n+ void switch_send_crypto (std::shared_ptr<crypto_plugin> crypto);\n+ std::shared_ptr<bt_peer_connection> native_handle () const;\n+};\n+\n+[report issue]\n \n create_ut_pex_plugin()
\n Declared in "libtorrent/extensions/ut_pex.hpp"
\n \n std::shared_ptr<torrent_plugin> create_ut_pex_plugin (torrent_handle const&, client_data_t);\n
\n constructor function for the ut_pex extension. The ut_pex\n extension allows peers to gossip about their connections, allowing\n the swarm stay well connected and peers aware of more peers in the\n swarm. This extension is enabled by default unless explicitly disabled in\n the session constructor.
\n This can either be passed in the add_torrent_params::extensions field, or\n via torrent_handle::add_extension().
\n+[report issue]\n+\n+create_smart_ban_plugin()
\n+Declared in "libtorrent/extensions/smart_ban.hpp"
\n+\n+std::shared_ptr<torrent_plugin> create_smart_ban_plugin (torrent_handle const&, client_data_t);\n+
\n+constructor function for the smart ban extension. The extension keeps\n+track of the data peers have sent us for failing pieces and once the\n+piece completes and passes the hash check bans the peers that turned\n+out to have sent corrupt data.\n+This function can either be passed in the add_torrent_params::extensions\n+field, or via torrent_handle::add_extension().
\n [report issue]\n \n create_ut_metadata_plugin()
\n Declared in "libtorrent/extensions/ut_metadata.hpp"
\n \n std::shared_ptr<torrent_plugin> create_ut_metadata_plugin (torrent_handle const&, client_data_t);\n
\n@@ -823,27 +836,14 @@\n extension allows peers to request the .torrent file (or more\n specifically the info-dictionary of the .torrent file) from each\n other. This is the main building block in making magnet links work.\n This extension is enabled by default unless explicitly disabled in\n the session constructor.\n This can either be passed in the add_torrent_params::extensions field, or\n via torrent_handle::add_extension().
\n-[report issue]\n-\n-create_smart_ban_plugin()
\n-Declared in "libtorrent/extensions/smart_ban.hpp"
\n-\n-std::shared_ptr<torrent_plugin> create_smart_ban_plugin (torrent_handle const&, client_data_t);\n-
\n-constructor function for the smart ban extension. The extension keeps\n-track of the data peers have sent us for failing pieces and once the\n-piece completes and passes the hash check bans the peers that turned\n-out to have sent corrupt data.\n-This function can either be passed in the add_torrent_params::extensions\n-field, or via torrent_handle::add_extension().
\n \n \n \n Table of contents
\n \nDeclared in "libtorrent/read_resume_data.hpp"
\n-\n-add_torrent_params read_resume_data (bdecode_node const& rd\n- , int piece_limit = 0x200000);\n-add_torrent_params read_resume_data (span<char const> buffer\n- , load_torrent_limits const& cfg = {});\n-add_torrent_params read_resume_data (bdecode_node const& rd\n- , error_code& ec, int piece_limit = 0x200000);\n-add_torrent_params read_resume_data (span<char const> buffer\n- , error_code& ec, load_torrent_limits const& cfg = {});\n-\n-these functions are used to parse resume data and populate the appropriate\n-fields in an add_torrent_params object. This object can then be used to add\n-the actual torrent_info object to and pass to session::add_torrent() or\n-session::async_add_torrent().
\n-If the client wants to override any field that was loaded from the resume\n-data, e.g. save_path, those fields must be changed after loading resume\n-data but before adding the torrent.
\n-The piece_limit parameter determines the largest number of pieces\n-allowed in the torrent that may be loaded as part of the resume data, if\n-it contains an info field. The overloads that take a flat buffer are\n-instead configured with limits on torrent sizes via load_torrent limits.
\n-In order to support large torrents, it may also be necessary to raise the\n-settings_pack::max_piece_count setting and pass a higher limit to calls\n-to torrent_info::parse_info_section().
\n-\n-[report issue]Declared in "libtorrent/write_resume_data.hpp"
\n\n std::vector<char> write_resume_data_buf (add_torrent_params const& atp);\n entry write_resume_data (add_torrent_params const& atp);\n\n
this function turns the resume data in an add_torrent_params object\n into a bencoded structure
\n \n [report issue]Declared in "libtorrent/write_resume_data.hpp"
\n\n+entry write_torrent_file (add_torrent_params const& atp);\n std::vector<char> write_torrent_file_buf (add_torrent_params const& atp\n , write_torrent_flags_t flags);\n entry write_torrent_file (add_torrent_params const& atp, write_torrent_flags_t flags);\n-entry write_torrent_file (add_torrent_params const& atp);\n\n
writes only the fields to create a .torrent file. This function may fail\n with a std::system_error exception if:
\nThe write_torrent_file_buf() overload returns the torrent file in\n bencoded buffer form. This overload may be faster at the expense of lost\n flexibility to add custom fields.
\n+[report issue]Declared in "libtorrent/read_resume_data.hpp"
\n+\n+add_torrent_params read_resume_data (span<char const> buffer\n+ , load_torrent_limits const& cfg = {});\n+add_torrent_params read_resume_data (bdecode_node const& rd\n+ , error_code& ec, int piece_limit = 0x200000);\n+add_torrent_params read_resume_data (bdecode_node const& rd\n+ , int piece_limit = 0x200000);\n+add_torrent_params read_resume_data (span<char const> buffer\n+ , error_code& ec, load_torrent_limits const& cfg = {});\n+\n+these functions are used to parse resume data and populate the appropriate\n+fields in an add_torrent_params object. This object can then be used to add\n+the actual torrent_info object to and pass to session::add_torrent() or\n+session::async_add_torrent().
\n+If the client wants to override any field that was loaded from the resume\n+data, e.g. save_path, those fields must be changed after loading resume\n+data but before adding the torrent.
\n+The piece_limit parameter determines the largest number of pieces\n+allowed in the torrent that may be loaded as part of the resume data, if\n+it contains an info field. The overloads that take a flat buffer are\n+instead configured with limits on torrent sizes via load_torrent limits.
\n+In order to support large torrents, it may also be necessary to raise the\n+settings_pack::max_piece_count setting and pass a higher limit to calls\n+to torrent_info::parse_info_section().
\n [report issue]Declared in "libtorrent/write_resume_data.hpp"
\nTable of contents
\nDeclared in "libtorrent/session.hpp"
\nthis is a holder for the internal session implementation object. Once the\n session destruction is explicitly initiated, this holder is used to\n@@ -99,32 +99,32 @@\n may outlive session, causing the session destructor to not block. The\n session_proxy destructor will block however, until the underlying session\n is done shutting down.
\n\n struct session_proxy\n {\n session_proxy ();\n- session_proxy& operator= (session_proxy const&) &;\n- session_proxy (session_proxy&&) noexcept;\n- session_proxy& operator= (session_proxy&&) & noexcept;\n session_proxy (session_proxy const&);\n ~session_proxy ();\n+ session_proxy& operator= (session_proxy&&) & noexcept;\n+ session_proxy (session_proxy&&) noexcept;\n+ session_proxy& operator= (session_proxy const&) &;\n };\n \n-\n \n-[report issue]\n session_proxy ();\n-session_proxy& operator= (session_proxy const&) &;\n-session_proxy (session_proxy&&) noexcept;\n-session_proxy& operator= (session_proxy&&) & noexcept;\n session_proxy (session_proxy const&);\n ~session_proxy ();\n+session_proxy& operator= (session_proxy&&) & noexcept;\n+session_proxy (session_proxy&&) noexcept;\n+session_proxy& operator= (session_proxy const&) &;\n\n
default constructor, does not refer to any session\n implementation object.
\n [report issue]see apply_settings().
\n\n struct session : session_handle\n {\n- session (session_params const& params, session_flags_t flags);\n- session ();\n explicit session (session_params&& params);\n- explicit session (session_params const& params);\n+ session ();\n+ session (session_params const& params, session_flags_t flags);\n session (session_params&& params, session_flags_t flags);\n- session (session_params const& params, io_context& ios, session_flags_t);\n- session (session_params const& params, io_context& ios);\n+ explicit session (session_params const& params);\n session (session_params&& params, io_context& ios, session_flags_t);\n session (session_params&& params, io_context& ios);\n+ session (session_params const& params, io_context& ios, session_flags_t);\n+ session (session_params const& params, io_context& ios);\n ~session ();\n session_proxy abort ();\n };\n \n [report issue]\n-session (session_params const& params, session_flags_t flags);\n-session ();\n explicit session (session_params&& params);\n-explicit session (session_params const& params);\n+session ();\n+session (session_params const& params, session_flags_t flags);\n session (session_params&& params, session_flags_t flags);\n+explicit session (session_params const& params);\n\n
Constructs the session objects which acts as the container of torrents.\n In order to avoid a race condition between starting the session and\n configuring it, you can pass in a session_params object. Its settings\n will take effect before the session starts up.
\nThe overloads taking flags can be used to start a session in\n paused mode (by passing in session::paused). Note that\n add_default_plugins do not have an affect on constructors that\n take a session_params object. It already contains the plugins to use.
\n [report issue]\n-session (session_params const& params, io_context& ios, session_flags_t);\n-session (session_params const& params, io_context& ios);\n session (session_params&& params, io_context& ios, session_flags_t);\n session (session_params&& params, io_context& ios);\n+session (session_params const& params, io_context& ios, session_flags_t);\n+session (session_params const& params, io_context& ios);\n\n
Overload of the constructor that takes an external io_context to run\n the session object on. This is primarily useful for tests that may want\n to run multiple sessions on a single io_context, or low resource\n systems where additional threads are expensive and sharing an\n io_context with other events is fine.
\n\n struct session_proxy {};\n \n+[report issue]Declared in "libtorrent/session_params.hpp"
\n+The session_params is a parameters pack for configuring the session\n+before it's started.
\n+\n+struct session_params\n+{\n+ session_params (settings_pack const& sp);\n+ session_params (settings_pack&& sp);\n+ session_params ();\n+ session_params (settings_pack&& sp\n+ , std::vector<std::shared_ptr<plugin>> exts);\n+ session_params (settings_pack const& sp\n+ , std::vector<std::shared_ptr<plugin>> exts);\n+\n+ settings_pack settings;\n+ std::vector<std::shared_ptr<plugin>> extensions;\n+ dht::dht_state dht_state;\n+ dht::dht_storage_constructor_type dht_storage_constructor;\n+ disk_io_constructor_type disk_io_constructor;\n+ std::map<std::string, std::string> ext_state;\n+ libtorrent::ip_filter ip_filter;\n+};\n+\n+[report issue]\n+session_params (settings_pack const& sp);\n+session_params (settings_pack&& sp);\n+session_params ();\n+\n+
This constructor can be used to start with the default plugins\n+(ut_metadata, ut_pex and smart_ban). Pass a settings_pack to set the\n+initial settings when the session starts.
\n+[report issue]\n+session_params (settings_pack&& sp\n+ , std::vector<std::shared_ptr<plugin>> exts);\n+session_params (settings_pack const& sp\n+ , std::vector<std::shared_ptr<plugin>> exts);\n+\n+
This constructor helps to configure the set of initial plugins\n+to be added to the session before it's started.
\n+[report issue]Declared in "libtorrent/session_handle.hpp"
\nthis class provides a non-owning handle to a session and a subset of the\n interface of the session class. If the underlying session is destructed\n-any handle to it will no longer be valid. is_valid() will return false and\n+any handle to it will no longer be valid. is_valid() will return false and\n any operation on it will throw a system_error exception, with error code\n invalid_session_handle.
\n\n struct session_handle\n {\n bool is_valid () const;\n session_params session_state (save_state_flags_t flags = save_state_flags_t::all()) const;\n- void refresh_torrent_status (std::vector<torrent_status>* ret\n- , status_flags_t flags = {}) const;\n std::vector<torrent_status> get_torrent_status (\n std::function<bool(torrent_status const&)> const& pred\n , status_flags_t flags = {}) const;\n+ void refresh_torrent_status (std::vector<torrent_status>* ret\n+ , status_flags_t flags = {}) const;\n void post_torrent_updates (status_flags_t flags = status_flags_t::all());\n void post_session_stats ();\n void post_dht_stats ();\n void set_dht_state (dht::dht_state&& st);\n void set_dht_state (dht::dht_state const& st);\n torrent_handle find_torrent (sha1_hash const& info_hash) const;\n std::vector<torrent_handle> get_torrents () const;\n- torrent_handle add_torrent (add_torrent_params const& params);\n- torrent_handle add_torrent (add_torrent_params&& params, error_code& ec);\n- torrent_handle add_torrent (add_torrent_params&& params);\n void async_add_torrent (add_torrent_params&& params);\n- torrent_handle add_torrent (add_torrent_params const& params, error_code& ec);\n+ torrent_handle add_torrent (add_torrent_params&& params);\n+ torrent_handle add_torrent (add_torrent_params&& params, error_code& ec);\n void async_add_torrent (add_torrent_params const& params);\n- bool is_paused () const;\n+ torrent_handle add_torrent (add_torrent_params const& params);\n+ torrent_handle add_torrent (add_torrent_params const& params, error_code& ec);\n void resume ();\n+ bool is_paused () const;\n void pause ();\n bool is_dht_running () const;\n void set_dht_storage (dht::dht_storage_constructor_type sc);\n void add_dht_node (std::pair<std::string, int> const& node);\n void dht_get_item (sha1_hash const& target);\n void dht_get_item (std::array<char, 32> key\n , std::string salt = std::string());\n sha1_hash dht_put_item (entry data);\n void dht_put_item (std::array<char, 32> key\n , std::function<void(entry&, std::array<char, 64>&\n , std::int64_t&, std::string const&)> cb\n , std::string salt = std::string());\n- void dht_announce (sha1_hash const& info_hash, int port = 0, dht::announce_flags_t flags = {});\n void dht_get_peers (sha1_hash const& info_hash);\n+ void dht_announce (sha1_hash const& info_hash, int port = 0, dht::announce_flags_t flags = {});\n void dht_live_nodes (sha1_hash const& nid);\n void dht_sample_infohashes (udp::endpoint const& ep, sha1_hash const& target);\n void dht_direct_request (udp::endpoint const& ep, entry const& e, client_data_t userdata = {});\n void add_extension (std::function<std::shared_ptr<torrent_plugin>(\n torrent_handle const&, client_data_t)> ext);\n void add_extension (std::shared_ptr<plugin> ext);\n- ip_filter get_ip_filter () const;\n void set_ip_filter (ip_filter f);\n+ ip_filter get_ip_filter () const;\n void set_port_filter (port_filter const& f);\n- unsigned short listen_port () const;\n unsigned short ssl_listen_port () const;\n bool is_listening () const;\n- ip_filter get_peer_class_filter () const;\n+ unsigned short listen_port () const;\n void set_peer_class_filter (ip_filter const& f);\n+ ip_filter get_peer_class_filter () const;\n void set_peer_class_type_filter (peer_class_type_filter const& f);\n peer_class_type_filter get_peer_class_type_filter () const;\n peer_class_t create_peer_class (char const* name);\n void delete_peer_class (peer_class_t cid);\n- peer_class_info get_peer_class (peer_class_t cid) const;\n void set_peer_class (peer_class_t cid, peer_class_info const& pci);\n+ peer_class_info get_peer_class (peer_class_t cid) const;\n void remove_torrent (const torrent_handle&, remove_flags_t = {});\n- settings_pack get_settings () const;\n void apply_settings (settings_pack&&);\n+ settings_pack get_settings () const;\n void apply_settings (settings_pack const&);\n+ alert* wait_for_alert (time_duration max_wait);\n void set_alert_notify (std::function<void()> const& fun);\n void pop_alerts (std::vector<alert*>* alerts);\n- alert* wait_for_alert (time_duration max_wait);\n std::vector<port_mapping_t> add_port_mapping (portmap_protocol t, int external_port, int local_port);\n void delete_port_mapping (port_mapping_t handle);\n void reopen_network_sockets (reopen_network_flags_t options = reopen_map_ports);\n std::shared_ptr<aux::session_impl> native_handle () const;\n \n static constexpr save_state_flags_t save_settings = 0_bit;\n static constexpr save_state_flags_t save_dht_state = 2_bit;\n@@ -345,19 +425,19 @@\n the flags parameter can be used to only save certain parts of the\n session state\n \n [report issue]\n-void refresh_torrent_status (std::vector<torrent_status>* ret\n- , status_flags_t flags = {}) const;\n std::vector<torrent_status> get_torrent_status (\n std::function<bool(torrent_status const&)> const& pred\n , status_flags_t flags = {}) const;\n+void refresh_torrent_status (std::vector<torrent_status>* ret\n+ , status_flags_t flags = {}) const;\n \n Note
\nthese calls are potentially expensive and won't scale well with\n lots of torrents. If you're concerned about performance, consider\n using post_torrent_updates() instead.
\n\n void set_dht_state (dht::dht_state&& st);\n void set_dht_state (dht::dht_state const& st);\n\n
set the DHT state for the session. This will be taken into account the\n next time the DHT is started, as if it had been passed in via the\n session_params on startup.
\n-\n-[report issue]\n torrent_handle find_torrent (sha1_hash const& info_hash) const;\n std::vector<torrent_handle> get_torrents () const;\n\n
find_torrent() looks for a torrent with the given info-hash. In\n case there is such a torrent in the session, a torrent_handle to that\n torrent is returned. In case the torrent cannot be found, an invalid\n torrent_handle is returned.
\nSee torrent_handle::is_valid() to know if the torrent was found or\n not.
\nget_torrents() returns a vector of torrent_handles to all the\n torrents currently in the session.
\n-\n-[report issue]\n-torrent_handle add_torrent (add_torrent_params const& params);\n-torrent_handle add_torrent (add_torrent_params&& params, error_code& ec);\n-torrent_handle add_torrent (add_torrent_params&& params);\n void async_add_torrent (add_torrent_params&& params);\n-torrent_handle add_torrent (add_torrent_params const& params, error_code& ec);\n+torrent_handle add_torrent (add_torrent_params&& params);\n+torrent_handle add_torrent (add_torrent_params&& params, error_code& ec);\n void async_add_torrent (add_torrent_params const& params);\n+torrent_handle add_torrent (add_torrent_params const& params);\n+torrent_handle add_torrent (add_torrent_params const& params, error_code& ec);\n\n
You add torrents through the add_torrent() function where you give an\n object with all the parameters. The add_torrent() overloads will block\n until the torrent has been added (or failed to be added) and returns\n an error code and a torrent_handle. In order to add torrents more\n efficiently, consider using async_add_torrent() which returns\n immediately, without waiting for the torrent to add. Notification of\n@@ -482,21 +562,21 @@\n torrent_flags::auto_managed. In order to add a magnet link that will\n just download the metadata, but no payload, set the\n torrent_flags::upload_mode flag.
\nSpecial consideration has to be taken when adding hybrid torrents\n (i.e. torrents that are BitTorrent v2 torrents that are backwards\n compatible with v1). For more details, see BitTorrent v2 torrents.
\n \n-\n-[report issue]\n-bool is_paused () const;\n void resume ();\n+bool is_paused () const;\n void pause ();\n\n
Pausing the session has the same effect as pausing every torrent in\n it, except that torrents will not be resumed by the auto-manage\n mechanism. Resuming will restore the torrents to their previous paused\n state. i.e. the session pause state is separate from the torrent pause\n state. A torrent is inactive if it is paused or if the session is\n@@ -605,21 +685,21 @@\n with the function object's context and make the function entirely\n self-contained. The only reason data blob's value is computed\n via a function instead of just passing in the new value is to avoid\n race conditions. If you want to update the value in the DHT, you\n must first retrieve it, then modify it, then write it back. The way\n the DHT works, it is natural to always do a lookup before storing and\n calling the callback in between is convenient.
\n-\n-[report issue]\n-void dht_announce (sha1_hash const& info_hash, int port = 0, dht::announce_flags_t flags = {});\n void dht_get_peers (sha1_hash const& info_hash);\n+void dht_announce (sha1_hash const& info_hash, int port = 0, dht::announce_flags_t flags = {});\n \n dht_get_peers() will issue a DHT get_peer request to the DHT for the\n specified info-hash. The response (the peers) will be posted back in a\n dht_get_peers_reply_alert.
\ndht_announce() will issue a DHT announce request to the DHT to the\n specified info-hash, advertising the specified port. If the port is\n left at its default, 0, the port will be implied by the DHT message's\n@@ -701,21 +781,21 @@\n that sends bad data with very high accuracy. Should\n eliminate most problems on poisoned torrents.\n \n
\n #include <libtorrent/extensions/smart_ban.hpp>\n ses.add_extension(<::create_smart_ban_plugin);\n\n-\n-[report issue]
\n-ip_filter get_ip_filter () const;\n void set_ip_filter (ip_filter f);\n+ip_filter get_ip_filter () const;\n\n
Sets a filter that will be used to reject and accept incoming as well\n as outgoing connections based on their originating ip address. The\n default filter will allow connections to any ip address. To build a\n set of rules for which addresses are accepted and not, see ip_filter.
\nEach time a peer is blocked because of the IP filter, a\n peer_blocked_alert is generated. get_ip_filter() Returns the\n@@ -726,37 +806,37 @@\n
\n void set_port_filter (port_filter const& f);\n\n
apply port_filter f to incoming and outgoing peers. a port filter\n will reject making outgoing peer connections to certain remote ports.\n The main intention is to be able to avoid triggering certain\n anti-virus software by connecting to SMTP, FTP ports.
\n-\n+\n \n-[report issue]\n-unsigned short listen_port () const;\n unsigned short ssl_listen_port () const;\n bool is_listening () const;\n+unsigned short listen_port () const;\n\n
is_listening() will tell you whether or not the session has\n successfully opened a listening port. If it hasn't, this function will\n return false, and then you can set a new\n settings_pack::listen_interfaces to try another interface and port to\n bind to.
\nlisten_port() returns the port we ended up listening on.
\n-\n-[report issue]\n-ip_filter get_peer_class_filter () const;\n void set_peer_class_filter (ip_filter const& f);\n+ip_filter get_peer_class_filter () const;\n\n
Sets the peer class filter for this session. All new peer connections\n will take this into account and be added to the peer classes specified\n by this filter, based on the peer's IP address.
\nThe ip-filter essentially maps an IP -> uint32. Each bit in that 32\n bit integer represents a peer class. The least significant bit\n represents class 0, the next bit class 1 and so on.
\n@@ -829,21 +909,21 @@\n remove the peer class if it's still assigned to torrents or peers. It\n will however remove it once the last peer and torrent drops their\n references to it.\nThere is no need to call this function for custom peer classes. All\n peer classes will be properly destructed when the session object\n destructs.
\nFor more information on peer classes, see peer classes.
\n-\n-[report issue]\n-peer_class_info get_peer_class (peer_class_t cid) const;\n void set_peer_class (peer_class_t cid, peer_class_info const& pci);\n+peer_class_info get_peer_class (peer_class_t cid) const;\n\n
These functions queries information from a peer class and updates the\n configuration of a peer class, respectively.
\ncid must refer to an existing peer class. If it does not, the\n return value of get_peer_class() is undefined.
\nset_peer_class() sets all the information in the\n peer_class_info object in the specified peer class. There is no\n@@ -858,28 +938,28 @@\n
\n void remove_torrent (const torrent_handle&, remove_flags_t = {});\n \n remove_torrent() will close all peer connections associated with\n the torrent and tell the tracker that we've stopped participating in\n the swarm. This operation cannot fail. When it completes, you will\n receive a torrent_removed_alert.
\n-remove_torrent() is non-blocking, but will remove the torrent from the\n+
remove_torrent() is non-blocking, but will remove the torrent from the\n session synchronously. Calling session_handle::add_torrent() immediately\n afterward with the same torrent will succeed. Note that this creates a\n new handle which is not equal to the removed one.
\nThe optional second argument options can be used to delete all the\n files downloaded by this torrent. To do so, pass in the value\n session_handle::delete_files. Once the torrent is deleted, a\n torrent_deleted_alert is posted.
\n-The torrent_handle remains valid for some time after remove_torrent() is\n+
The torrent_handle remains valid for some time after remove_torrent() is\n called. It will become invalid only after all libtorrent tasks (such as\n I/O tasks) release their references to the torrent. Until this happens,\n torrent_handle::is_valid() will return true, and other calls such\n as torrent_handle::status() will succeed. Because of this, and because\n-remove_torrent() is non-blocking, the following sequence usually\n+remove_torrent() is non-blocking, the following sequence usually\n succeeds (does not throw system_error):\n .. code:: c++
\n\n session.remove_handle(handle);\n handle.save_resume_data();\n
Note that when a queued or downloading torrent is removed, its position\n in the download queue is vacated and every subsequent torrent in the\n@@ -888,30 +968,30 @@\n advised to remove them from the back of the queue, to minimize the\n shifting.
\n \n [report issue]\n-settings_pack get_settings () const;\n void apply_settings (settings_pack&&);\n+settings_pack get_settings () const;\n void apply_settings (settings_pack const&);\n\n
Applies the settings specified by the settings_pack s. This is an\n asynchronous operation that will return immediately and actually apply\n the settings to the main thread of libtorrent some time later.
\n+\n \n-\n-[report issue]\n+alert* wait_for_alert (time_duration max_wait);\n void set_alert_notify (std::function<void()> const& fun);\n void pop_alerts (std::vector<alert*>* alerts);\n-alert* wait_for_alert (time_duration max_wait);\n\n
Alerts is the main mechanism for libtorrent to report errors and\n events. pop_alerts fills in the vector passed to it with pointers\n to new alerts. The session still owns these alerts and they will stay\n valid until the next time pop_alerts is called. You may not delete\n the alert objects.
\nIt is safe to call pop_alerts from multiple different threads, as\n@@ -957,18 +1037,18 @@\n message to an HWND or some other main message pump. The actual\n retrieval of alerts should not be done in the callback. In fact, the\n callback should not block. It should not perform any expensive work.\n It really should just notify the main application thread.
\nThe type of an alert is returned by the polymorphic function\n alert::type() but can also be queries from a concrete type via\n T::alert_type, as a static constant.
\n-\n-[report issue]\n std::vector<port_mapping_t> add_port_mapping (portmap_protocol t, int external_port, int local_port);\n void delete_port_mapping (port_mapping_t handle);\n\n
add_port_mapping adds one or more port forwards on UPnP and/or NAT-PMP,\n whichever is enabled. A mapping is created for each listen socket\n in the session. The return values are all handles referring to the\n@@ -1037,109 +1117,29 @@\n [report issue]
Declared in "libtorrent/session_params.hpp"
\n-The session_params is a parameters pack for configuring the session\n-before it's started.
\n-\n-struct session_params\n-{\n- session_params ();\n- session_params (settings_pack const& sp);\n- session_params (settings_pack&& sp);\n- session_params (settings_pack&& sp\n- , std::vector<std::shared_ptr<plugin>> exts);\n- session_params (settings_pack const& sp\n- , std::vector<std::shared_ptr<plugin>> exts);\n-\n- settings_pack settings;\n- std::vector<std::shared_ptr<plugin>> extensions;\n- dht::dht_state dht_state;\n- dht::dht_storage_constructor_type dht_storage_constructor;\n- disk_io_constructor_type disk_io_constructor;\n- std::map<std::string, std::string> ext_state;\n- libtorrent::ip_filter ip_filter;\n-};\n-\n-[report issue]\n-session_params ();\n-session_params (settings_pack const& sp);\n-session_params (settings_pack&& sp);\n-\n-
This constructor can be used to start with the default plugins\n-(ut_metadata, ut_pex and smart_ban). Pass a settings_pack to set the\n-initial settings when the session starts.
\n-[report issue]\n-session_params (settings_pack&& sp\n- , std::vector<std::shared_ptr<plugin>> exts);\n-session_params (settings_pack const& sp\n- , std::vector<std::shared_ptr<plugin>> exts);\n-\n-
This constructor helps to configure the set of initial plugins\n-to be added to the session before it's started.
\n-[report issue]Declared in "libtorrent/session_params.hpp"
\n\n-entry write_session_params (session_params const& sp\n+std::vector<char> write_session_params_buf (session_params const& sp\n , save_state_flags_t flags = save_state_flags_t::all());\n-session_params read_session_params (bdecode_node const& e\n+entry write_session_params (session_params const& sp\n , save_state_flags_t flags = save_state_flags_t::all());\n session_params read_session_params (span<char const> buf\n , save_state_flags_t flags = save_state_flags_t::all());\n-std::vector<char> write_session_params_buf (session_params const& sp\n+session_params read_session_params (bdecode_node const& e\n , save_state_flags_t flags = save_state_flags_t::all());\n\n
These functions serialize and de-serialize a session_params object to and\n from bencoded form. The session_params object is used to initialize a new\n session using the state from a previous one (or by programmatically configure\n the session up-front).\n The flags parameter can be used to only save and load certain aspects of the\n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,86 +1,86 @@\n >\n _\b[_\bl_\bi_\bb_\bt_\bo_\br_\br_\be_\bn_\bt_\b _\bl_\bo_\bg_\bo_\b]\n V\bVe\ber\brs\bsi\bio\bon\bn:\b: 2.0.10\n _\bh_\bo_\bm_\be\n Table of contents\n * _\bs_\be_\bs_\bs_\bi_\bo_\bn_\b__\bp_\br_\bo_\bx_\by\n- o _\bs_\be_\bs_\bs_\bi_\bo_\bn_\b__\bp_\br_\bo_\bx_\by_\b(_\b)_\b _\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b=_\b(_\b)_\b _\b~_\bs_\be_\bs_\bs_\bi_\bo_\bn_\b__\bp_\br_\bo_\bx_\by_\b(_\b)\n+ o _\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b=_\b(_\b)_\b _\bs_\be_\bs_\bs_\bi_\bo_\bn_\b__\bp_\br_\bo_\bx_\by_\b(_\b)_\b _\b~_\bs_\be_\bs_\bs_\bi_\bo_\bn_\b__\bp_\br_\bo_\bx_\by_\b(_\b)\n * _\bs_\be_\bs_\bs_\bi_\bo_\bn\n o _\bs_\be_\bs_\bs_\bi_\bo_\bn_\b(_\b)\n o _\bs_\be_\bs_\bs_\bi_\bo_\bn_\b(_\b)\n o _\b~_\bs_\be_\bs_\bs_\bi_\bo_\bn_\b(_\b)\n o _\ba_\bb_\bo_\br_\bt_\b(_\b)\n+ * _\bs_\be_\bs_\bs_\bi_\bo_\bn_\b__\bp_\ba_\br_\ba_\bm_\bs\n+ o _\bs_\be_\bs_\bs_\bi_\bo_\bn_\b__\bp_\ba_\br_\ba_\bm_\bs_\b(_\b)\n+ o _\bs_\be_\bs_\bs_\bi_\bo_\bn_\b__\bp_\ba_\br_\ba_\bm_\bs_\b(_\b)\n * _\bs_\be_\bs_\bs_\bi_\bo_\bn_\b__\bh_\ba_\bn_\bd_\bl_\be\n o _\bi_\bs_\b__\bv_\ba_\bl_\bi_\bd_\b(_\b)\n o _\bs_\be_\bs_\bs_\bi_\bo_\bn_\b__\bs_\bt_\ba_\bt_\be_\b(_\b)\n o _\br_\be_\bf_\br_\be_\bs_\bh_\b__\bt_\bo_\br_\br_\be_\bn_\bt_\b__\bs_\bt_\ba_\bt_\bu_\bs_\b(_\b)_\b _\bg_\be_\bt_\b__\bt_\bo_\br_\br_\be_\bn_\bt_\b__\bs_\bt_\ba_\bt_\bu_\bs_\b(_\b)\n o _\bp_\bo_\bs_\bt_\b__\bt_\bo_\br_\br_\be_\bn_\bt_\b__\bu_\bp_\bd_\ba_\bt_\be_\bs_\b(_\b)\n o _\bp_\bo_\bs_\bt_\b__\bs_\be_\bs_\bs_\bi_\bo_\bn_\b__\bs_\bt_\ba_\bt_\bs_\b(_\b)\n o _\bp_\bo_\bs_\bt_\b__\bd_\bh_\bt_\b__\bs_\bt_\ba_\bt_\bs_\b(_\b)\n o _\bs_\be_\bt_\b__\bd_\bh_\bt_\b__\bs_\bt_\ba_\bt_\be_\b(_\b)\n- o _\bf_\bi_\bn_\bd_\b__\bt_\bo_\br_\br_\be_\bn_\bt_\b(_\b)_\b _\bg_\be_\bt_\b__\bt_\bo_\br_\br_\be_\bn_\bt_\bs_\b(_\b)\n- o _\ba_\bs_\by_\bn_\bc_\b__\ba_\bd_\bd_\b__\bt_\bo_\br_\br_\be_\bn_\bt_\b(_\b)_\b _\ba_\bd_\bd_\b__\bt_\bo_\br_\br_\be_\bn_\bt_\b(_\b)\n- o _\bp_\ba_\bu_\bs_\be_\b(_\b)_\b _\br_\be_\bs_\bu_\bm_\be_\b(_\b)_\b _\bi_\bs_\b__\bp_\ba_\bu_\bs_\be_\bd_\b(_\b)\n+ o _\bg_\be_\bt_\b__\bt_\bo_\br_\br_\be_\bn_\bt_\bs_\b(_\b)_\b _\bf_\bi_\bn_\bd_\b__\bt_\bo_\br_\br_\be_\bn_\bt_\b(_\b)\n+ o _\ba_\bd_\bd_\b__\bt_\bo_\br_\br_\be_\bn_\bt_\b(_\b)_\b _\ba_\bs_\by_\bn_\bc_\b__\ba_\bd_\bd_\b__\bt_\bo_\br_\br_\be_\bn_\bt_\b(_\b)\n+ o _\bp_\ba_\bu_\bs_\be_\b(_\b)_\b _\bi_\bs_\b__\bp_\ba_\bu_\bs_\be_\bd_\b(_\b)_\b _\br_\be_\bs_\bu_\bm_\be_\b(_\b)\n o _\bi_\bs_\b__\bd_\bh_\bt_\b__\br_\bu_\bn_\bn_\bi_\bn_\bg_\b(_\b)\n o _\bs_\be_\bt_\b__\bd_\bh_\bt_\b__\bs_\bt_\bo_\br_\ba_\bg_\be_\b(_\b)\n o _\ba_\bd_\bd_\b__\bd_\bh_\bt_\b__\bn_\bo_\bd_\be_\b(_\b)\n o _\bd_\bh_\bt_\b__\bg_\be_\bt_\b__\bi_\bt_\be_\bm_\b(_\b)\n o _\bd_\bh_\bt_\b__\bg_\be_\bt_\b__\bi_\bt_\be_\bm_\b(_\b)\n o _\bd_\bh_\bt_\b__\bp_\bu_\bt_\b__\bi_\bt_\be_\bm_\b(_\b)\n o _\bd_\bh_\bt_\b__\bp_\bu_\bt_\b__\bi_\bt_\be_\bm_\b(_\b)\n- o _\bd_\bh_\bt_\b__\ba_\bn_\bn_\bo_\bu_\bn_\bc_\be_\b(_\b)_\b _\bd_\bh_\bt_\b__\bg_\be_\bt_\b__\bp_\be_\be_\br_\bs_\b(_\b)\n+ o _\bd_\bh_\bt_\b__\bg_\be_\bt_\b__\bp_\be_\be_\br_\bs_\b(_\b)_\b _\bd_\bh_\bt_\b__\ba_\bn_\bn_\bo_\bu_\bn_\bc_\be_\b(_\b)\n o _\bd_\bh_\bt_\b__\bl_\bi_\bv_\be_\b__\bn_\bo_\bd_\be_\bs_\b(_\b)\n o _\bd_\bh_\bt_\b__\bs_\ba_\bm_\bp_\bl_\be_\b__\bi_\bn_\bf_\bo_\bh_\ba_\bs_\bh_\be_\bs_\b(_\b)\n o _\bd_\bh_\bt_\b__\bd_\bi_\br_\be_\bc_\bt_\b__\br_\be_\bq_\bu_\be_\bs_\bt_\b(_\b)\n o _\ba_\bd_\bd_\b__\be_\bx_\bt_\be_\bn_\bs_\bi_\bo_\bn_\b(_\b)\n- o _\bg_\be_\bt_\b__\bi_\bp_\b__\bf_\bi_\bl_\bt_\be_\br_\b(_\b)_\b _\bs_\be_\bt_\b__\bi_\bp_\b__\bf_\bi_\bl_\bt_\be_\br_\b(_\b)\n+ o _\bs_\be_\bt_\b__\bi_\bp_\b__\bf_\bi_\bl_\bt_\be_\br_\b(_\b)_\b _\bg_\be_\bt_\b__\bi_\bp_\b__\bf_\bi_\bl_\bt_\be_\br_\b(_\b)\n o _\bs_\be_\bt_\b__\bp_\bo_\br_\bt_\b__\bf_\bi_\bl_\bt_\be_\br_\b(_\b)\n- o _\bi_\bs_\b__\bl_\bi_\bs_\bt_\be_\bn_\bi_\bn_\bg_\b(_\b)_\b _\bs_\bs_\bl_\b__\bl_\bi_\bs_\bt_\be_\bn_\b__\bp_\bo_\br_\bt_\b(_\b)_\b _\bl_\bi_\bs_\bt_\be_\bn_\b__\bp_\bo_\br_\bt_\b(_\b)\n- o _\bg_\be_\bt_\b__\bp_\be_\be_\br_\b__\bc_\bl_\ba_\bs_\bs_\b__\bf_\bi_\bl_\bt_\be_\br_\b(_\b)_\b _\bs_\be_\bt_\b__\bp_\be_\be_\br_\b__\bc_\bl_\ba_\bs_\bs_\b__\bf_\bi_\bl_\bt_\be_\br_\b(_\b)\n+ o _\bl_\bi_\bs_\bt_\be_\bn_\b__\bp_\bo_\br_\bt_\b(_\b)_\b _\bs_\bs_\bl_\b__\bl_\bi_\bs_\bt_\be_\bn_\b__\bp_\bo_\br_\bt_\b(_\b)_\b _\bi_\bs_\b__\bl_\bi_\bs_\bt_\be_\bn_\bi_\bn_\bg_\b(_\b)\n+ o _\bs_\be_\bt_\b__\bp_\be_\be_\br_\b__\bc_\bl_\ba_\bs_\bs_\b__\bf_\bi_\bl_\bt_\be_\br_\b(_\b)_\b _\bg_\be_\bt_\b__\bp_\be_\be_\br_\b__\bc_\bl_\ba_\bs_\bs_\b__\bf_\bi_\bl_\bt_\be_\br_\b(_\b)\n o _\bg_\be_\bt_\b__\bp_\be_\be_\br_\b__\bc_\bl_\ba_\bs_\bs_\b__\bt_\by_\bp_\be_\b__\bf_\bi_\bl_\bt_\be_\br_\b(_\b)_\b _\bs_\be_\bt_\b__\bp_\be_\be_\br_\b__\bc_\bl_\ba_\bs_\bs_\b__\bt_\by_\bp_\be_\b__\bf_\bi_\bl_\bt_\be_\br_\b(_\b)\n o _\bc_\br_\be_\ba_\bt_\be_\b__\bp_\be_\be_\br_\b__\bc_\bl_\ba_\bs_\bs_\b(_\b)\n o _\bd_\be_\bl_\be_\bt_\be_\b__\bp_\be_\be_\br_\b__\bc_\bl_\ba_\bs_\bs_\b(_\b)\n- o _\bg_\be_\bt_\b__\bp_\be_\be_\br_\b__\bc_\bl_\ba_\bs_\bs_\b(_\b)_\b _\bs_\be_\bt_\b__\bp_\be_\be_\br_\b__\bc_\bl_\ba_\bs_\bs_\b(_\b)\n+ o _\bs_\be_\bt_\b__\bp_\be_\be_\br_\b__\bc_\bl_\ba_\bs_\bs_\b(_\b)_\b _\bg_\be_\bt_\b__\bp_\be_\be_\br_\b__\bc_\bl_\ba_\bs_\bs_\b(_\b)\n o _\br_\be_\bm_\bo_\bv_\be_\b__\bt_\bo_\br_\br_\be_\bn_\bt_\b(_\b)\n o _\ba_\bp_\bp_\bl_\by_\b__\bs_\be_\bt_\bt_\bi_\bn_\bg_\bs_\b(_\b)_\b _\bg_\be_\bt_\b__\bs_\be_\bt_\bt_\bi_\bn_\bg_\bs_\b(_\b)\n- o _\bs_\be_\bt_\b__\ba_\bl_\be_\br_\bt_\b__\bn_\bo_\bt_\bi_\bf_\by_\b(_\b)_\b _\bw_\ba_\bi_\bt_\b__\bf_\bo_\br_\b__\ba_\bl_\be_\br_\bt_\b(_\b)_\b _\bp_\bo_\bp_\b__\ba_\bl_\be_\br_\bt_\bs_\b(_\b)\n- o _\ba_\bd_\bd_\b__\bp_\bo_\br_\bt_\b__\bm_\ba_\bp_\bp_\bi_\bn_\bg_\b(_\b)_\b _\bd_\be_\bl_\be_\bt_\be_\b__\bp_\bo_\br_\bt_\b__\bm_\ba_\bp_\bp_\bi_\bn_\bg_\b(_\b)\n+ o _\bp_\bo_\bp_\b__\ba_\bl_\be_\br_\bt_\bs_\b(_\b)_\b _\bs_\be_\bt_\b__\ba_\bl_\be_\br_\bt_\b__\bn_\bo_\bt_\bi_\bf_\by_\b(_\b)_\b _\bw_\ba_\bi_\bt_\b__\bf_\bo_\br_\b__\ba_\bl_\be_\br_\bt_\b(_\b)\n+ o _\bd_\be_\bl_\be_\bt_\be_\b__\bp_\bo_\br_\bt_\b__\bm_\ba_\bp_\bp_\bi_\bn_\bg_\b(_\b)_\b _\ba_\bd_\bd_\b__\bp_\bo_\br_\bt_\b__\bm_\ba_\bp_\bp_\bi_\bn_\bg_\b(_\b)\n o _\br_\be_\bo_\bp_\be_\bn_\b__\bn_\be_\bt_\bw_\bo_\br_\bk_\b__\bs_\bo_\bc_\bk_\be_\bt_\bs_\b(_\b)\n o _\bn_\ba_\bt_\bi_\bv_\be_\b__\bh_\ba_\bn_\bd_\bl_\be_\b(_\b)\n- * _\bs_\be_\bs_\bs_\bi_\bo_\bn_\b__\bp_\ba_\br_\ba_\bm_\bs\n- o _\bs_\be_\bs_\bs_\bi_\bo_\bn_\b__\bp_\ba_\br_\ba_\bm_\bs_\b(_\b)\n- o _\bs_\be_\bs_\bs_\bi_\bo_\bn_\b__\bp_\ba_\br_\ba_\bm_\bs_\b(_\b)\n- * _\bw_\br_\bi_\bt_\be_\b__\bs_\be_\bs_\bs_\bi_\bo_\bn_\b__\bp_\ba_\br_\ba_\bm_\bs_\b(_\b)_\b _\br_\be_\ba_\bd_\b__\bs_\be_\bs_\bs_\bi_\bo_\bn_\b__\bp_\ba_\br_\ba_\bm_\bs_\b(_\b)_\b _\bw_\br_\bi_\bt_\be_\b__\bs_\be_\bs_\bs_\bi_\bo_\bn_\b__\bp_\ba_\br_\ba_\bm_\bs_\b__\bb_\bu_\bf_\b(_\b)\n+ * _\bw_\br_\bi_\bt_\be_\b__\bs_\be_\bs_\bs_\bi_\bo_\bn_\b__\bp_\ba_\br_\ba_\bm_\bs_\b(_\b)_\b _\bw_\br_\bi_\bt_\be_\b__\bs_\be_\bs_\bs_\bi_\bo_\bn_\b__\bp_\ba_\br_\ba_\bm_\bs_\b__\bb_\bu_\bf_\b(_\b)_\b _\br_\be_\ba_\bd_\b__\bs_\be_\bs_\bs_\bi_\bo_\bn_\b__\bp_\ba_\br_\ba_\bm_\bs_\b(_\b)\n [_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n *\b**\b**\b**\b**\b**\b* s\bse\bes\bss\bsi\bio\bon\bn_\b_p\bpr\bro\box\bxy\by *\b**\b**\b**\b**\b**\b*\n Declared in \"_\bl_\bi_\bb_\bt_\bo_\br_\br_\be_\bn_\bt_\b/_\bs_\be_\bs_\bs_\bi_\bo_\bn_\b._\bh_\bp_\bp\"\n this is a holder for the internal _\bs_\be_\bs_\bs_\bi_\bo_\bn implementation object. Once the\n _\bs_\be_\bs_\bs_\bi_\bo_\bn destruction is explicitly initiated, this holder is used to synchronize\n the completion of the shutdown. The lifetime of this object may outlive\n _\bs_\be_\bs_\bs_\bi_\bo_\bn, causing the _\bs_\be_\bs_\bs_\bi_\bo_\bn destructor to not block. The _\bs_\be_\bs_\bs_\bi_\bo_\bn_\b__\bp_\br_\bo_\bx_\by\n destructor will block however, until the underlying _\bs_\be_\bs_\bs_\bi_\bo_\bn is done shutting\n down.\n struct session_proxy\n {\n s\bse\bes\bss\bsi\bio\bon\bn_\b_p\bpr\bro\box\bxy\by ();\n- session_proxy& o\bop\bpe\ber\bra\bat\bto\bor\br=\b= (session_proxy const&) &;\n- s\bse\bes\bss\bsi\bio\bon\bn_\b_p\bpr\bro\box\bxy\by (session_proxy&&) noexcept;\n- session_proxy& o\bop\bpe\ber\bra\bat\bto\bor\br=\b= (session_proxy&&) & noexcept;\n s\bse\bes\bss\bsi\bio\bon\bn_\b_p\bpr\bro\box\bxy\by (session_proxy const&);\n ~\b~s\bse\bes\bss\bsi\bio\bon\bn_\b_p\bpr\bro\box\bxy\by ();\n+ session_proxy& o\bop\bpe\ber\bra\bat\bto\bor\br=\b= (session_proxy&&) & noexcept;\n+ s\bse\bes\bss\bsi\bio\bon\bn_\b_p\bpr\bro\box\bxy\by (session_proxy&&) noexcept;\n+ session_proxy& o\bop\bpe\ber\bra\bat\bto\bor\br=\b= (session_proxy const&) &;\n };\n [_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b* s\bse\bes\bss\bsi\bio\bon\bn_\b_p\bpr\bro\box\bxy\by(\b()\b) o\bop\bpe\ber\bra\bat\bto\bor\br=\b=(\b()\b) ~\b~s\bse\bes\bss\bsi\bio\bon\bn_\b_p\bpr\bro\box\bxy\by(\b()\b) *\b**\b**\b**\b**\b*\n+*\b**\b**\b**\b**\b* o\bop\bpe\ber\bra\bat\bto\bor\br=\b=(\b()\b) s\bse\bes\bss\bsi\bio\bon\bn_\b_p\bpr\bro\box\bxy\by(\b()\b) ~\b~s\bse\bes\bss\bsi\bio\bon\bn_\b_p\bpr\bro\box\bxy\by(\b()\b) *\b**\b**\b**\b**\b*\n s\bse\bes\bss\bsi\bio\bon\bn_\b_p\bpr\bro\box\bxy\by ();\n-session_proxy& o\bop\bpe\ber\bra\bat\bto\bor\br=\b= (session_proxy const&) &;\n-s\bse\bes\bss\bsi\bio\bon\bn_\b_p\bpr\bro\box\bxy\by (session_proxy&&) noexcept;\n-session_proxy& o\bop\bpe\ber\bra\bat\bto\bor\br=\b= (session_proxy&&) & noexcept;\n s\bse\bes\bss\bsi\bio\bon\bn_\b_p\bpr\bro\box\bxy\by (session_proxy const&);\n ~\b~s\bse\bes\bss\bsi\bio\bon\bn_\b_p\bpr\bro\box\bxy\by ();\n+session_proxy& o\bop\bpe\ber\bra\bat\bto\bor\br=\b= (session_proxy&&) & noexcept;\n+s\bse\bes\bss\bsi\bio\bon\bn_\b_p\bpr\bro\box\bxy\by (session_proxy&&) noexcept;\n+session_proxy& o\bop\bpe\ber\bra\bat\bto\bor\br=\b= (session_proxy const&) &;\n default constructor, does not refer to any _\bs_\be_\bs_\bs_\bi_\bo_\bn implementation object.\n [_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n *\b**\b**\b**\b**\b**\b* s\bse\bes\bss\bsi\bio\bon\bn *\b**\b**\b**\b**\b**\b*\n Declared in \"_\bl_\bi_\bb_\bt_\bo_\br_\br_\be_\bn_\bt_\b/_\bs_\be_\bs_\bs_\bi_\bo_\bn_\b._\bh_\bp_\bp\"\n The _\bs_\be_\bs_\bs_\bi_\bo_\bn holds all state that spans multiple torrents. Among other things it\n runs the network loop and manages all torrents. Once it's created, the _\bs_\be_\bs_\bs_\bi_\bo_\bn\n object will spawn the main thread that will do all the work. The main thread\n@@ -88,47 +88,47 @@\n You have some control over _\bs_\be_\bs_\bs_\bi_\bo_\bn configuration through the session_handle::\n apply_settings() member function. To change one or more configuration options,\n create a _\bs_\be_\bt_\bt_\bi_\bn_\bg_\bs_\b__\bp_\ba_\bc_\bk. object and fill it with the settings to be set and pass\n it in to session::apply_settings().\n see _\ba_\bp_\bp_\bl_\by_\b__\bs_\be_\bt_\bt_\bi_\bn_\bg_\bs_\b(_\b).\n struct session : session_handle\n {\n- s\bse\bes\bss\bsi\bio\bon\bn (session_params const& params, session_flags_t flags);\n- s\bse\bes\bss\bsi\bio\bon\bn ();\n explicit s\bse\bes\bss\bsi\bio\bon\bn (session_params&& params);\n- explicit s\bse\bes\bss\bsi\bio\bon\bn (session_params const& params);\n+ s\bse\bes\bss\bsi\bio\bon\bn ();\n+ s\bse\bes\bss\bsi\bio\bon\bn (session_params const& params, session_flags_t flags);\n s\bse\bes\bss\bsi\bio\bon\bn (session_params&& params, session_flags_t flags);\n- s\bse\bes\bss\bsi\bio\bon\bn (session_params const& params, io_context& ios, session_flags_t);\n- s\bse\bes\bss\bsi\bio\bon\bn (session_params const& params, io_context& ios);\n+ explicit s\bse\bes\bss\bsi\bio\bon\bn (session_params const& params);\n s\bse\bes\bss\bsi\bio\bon\bn (session_params&& params, io_context& ios, session_flags_t);\n s\bse\bes\bss\bsi\bio\bon\bn (session_params&& params, io_context& ios);\n+ s\bse\bes\bss\bsi\bio\bon\bn (session_params const& params, io_context& ios, session_flags_t);\n+ s\bse\bes\bss\bsi\bio\bon\bn (session_params const& params, io_context& ios);\n ~\b~s\bse\bes\bss\bsi\bio\bon\bn ();\n session_proxy a\bab\bbo\bor\brt\bt ();\n };\n [_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n *\b**\b**\b**\b**\b* s\bse\bes\bss\bsi\bio\bon\bn(\b()\b) *\b**\b**\b**\b**\b*\n-s\bse\bes\bss\bsi\bio\bon\bn (session_params const& params, session_flags_t flags);\n-s\bse\bes\bss\bsi\bio\bon\bn ();\n explicit s\bse\bes\bss\bsi\bio\bon\bn (session_params&& params);\n-explicit s\bse\bes\bss\bsi\bio\bon\bn (session_params const& params);\n+s\bse\bes\bss\bsi\bio\bon\bn ();\n+s\bse\bes\bss\bsi\bio\bon\bn (session_params const& params, session_flags_t flags);\n s\bse\bes\bss\bsi\bio\bon\bn (session_params&& params, session_flags_t flags);\n+explicit s\bse\bes\bss\bsi\bio\bon\bn (session_params const& params);\n Constructs the _\bs_\be_\bs_\bs_\bi_\bo_\bn objects which acts as the container of torrents. In\n order to avoid a race condition between starting the _\bs_\be_\bs_\bs_\bi_\bo_\bn and configuring\n it, you can pass in a _\bs_\be_\bs_\bs_\bi_\bo_\bn_\b__\bp_\ba_\br_\ba_\bm_\bs object. Its settings will take effect\n before the _\bs_\be_\bs_\bs_\bi_\bo_\bn starts up.\n The overloads taking flags can be used to start a _\bs_\be_\bs_\bs_\bi_\bo_\bn in paused mode (by\n passing in session::paused). Note that add_default_plugins do not have an\n affect on constructors that take a _\bs_\be_\bs_\bs_\bi_\bo_\bn_\b__\bp_\ba_\br_\ba_\bm_\bs object. It already contains\n the plugins to use.\n [_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n *\b**\b**\b**\b**\b* s\bse\bes\bss\bsi\bio\bon\bn(\b()\b) *\b**\b**\b**\b**\b*\n-s\bse\bes\bss\bsi\bio\bon\bn (session_params const& params, io_context& ios, session_flags_t);\n-s\bse\bes\bss\bsi\bio\bon\bn (session_params const& params, io_context& ios);\n s\bse\bes\bss\bsi\bio\bon\bn (session_params&& params, io_context& ios, session_flags_t);\n s\bse\bes\bss\bsi\bio\bon\bn (session_params&& params, io_context& ios);\n+s\bse\bes\bss\bsi\bio\bon\bn (session_params const& params, io_context& ios, session_flags_t);\n+s\bse\bes\bss\bsi\bio\bon\bn (session_params const& params, io_context& ios);\n Overload of the constructor that takes an external io_context to run the\n _\bs_\be_\bs_\bs_\bi_\bo_\bn object on. This is primarily useful for tests that may want to run\n multiple sessions on a single io_context, or low resource systems where\n additional threads are expensive and sharing an io_context with other events is\n fine.\n Warning\n The _\bs_\be_\bs_\bs_\bi_\bo_\bn object does not cleanly terminate with an external io_context. The\n@@ -156,91 +156,155 @@\n then synchronize the threads. So, the destruction of the _\bs_\be_\bs_\bs_\bi_\bo_\bn is performed\n from the session destructor call until the session_proxy destructor call. The\n session_proxy does not have any operations on it (since the _\bs_\be_\bs_\bs_\bi_\bo_\bn is being\n closed down, no operations are allowed on it). The only valid operation is\n calling the destructor:\n struct session_proxy {};\n [_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n+*\b**\b**\b**\b**\b**\b* s\bse\bes\bss\bsi\bio\bon\bn_\b_p\bpa\bar\bra\bam\bms\bs *\b**\b**\b**\b**\b**\b*\n+Declared in \"_\bl_\bi_\bb_\bt_\bo_\br_\br_\be_\bn_\bt_\b/_\bs_\be_\bs_\bs_\bi_\bo_\bn_\b__\bp_\ba_\br_\ba_\bm_\bs_\b._\bh_\bp_\bp\"\n+The _\bs_\be_\bs_\bs_\bi_\bo_\bn_\b__\bp_\ba_\br_\ba_\bm_\bs is a parameters pack for configuring the _\bs_\be_\bs_\bs_\bi_\bo_\bn before it's\n+started.\n+struct session_params\n+{\n+ s\bse\bes\bss\bsi\bio\bon\bn_\b_p\bpa\bar\bra\bam\bms\bs (settings_pack const& sp);\n+ s\bse\bes\bss\bsi\bio\bon\bn_\b_p\bpa\bar\bra\bam\bms\bs (settings_pack&& sp);\n+ s\bse\bes\bss\bsi\bio\bon\bn_\b_p\bpa\bar\bra\bam\bms\bs ();\n+ s\bse\bes\bss\bsi\bio\bon\bn_\b_p\bpa\bar\bra\bam\bms\bs (settings_pack&& sp\n+ , std::vector Table of contents You have some control over session configuration through the session::apply_settings()\n member function. To change one or more configuration options, create a settings_pack\n object and fill it with the settings to be set and pass it in to session::apply_settings(). The settings_pack object is a collection of settings updates that are applied\n@@ -4562,24 +4562,24 @@\n i2p_port). set a configuration option in the settings_pack. name is one of\n the enum values from string_types, int_types or bool_types. They must\n match the respective type of the set_* function. queries the current configuration option from the settings_pack.\n name is one of the enumeration values from string_types, int_types\n or bool_types. The enum value must match the type of the get_*\n function. If the specified setting field has not been set, the default\n value is returned.\n
\n \n-
\n \n struct settings_pack final : settings_interface\n {\n friend void apply_pack_impl (settings_pack const*\n , aux::session_settings_single_thread&\n , std::vector<void(aux::session_impl::*)()>*);\n- void set_str (int name, std::string val) override;\n- void set_int (int name, flags::bitfield_flag<Type, Tag> const val);\n void set_bool (int name, bool val) override;\n+ void set_int (int name, flags::bitfield_flag<Type, Tag> const val);\n+ void set_str (int name, std::string val) override;\n void set_int (int name, int val) override;\n bool has_val (int name) const override;\n void clear ();\n void clear (int name);\n+ bool get_bool (int name) const override;\n std::string const& get_str (int name) const override;\n int get_int (int name) const override;\n- bool get_bool (int name) const override;\n void for_each (Fun&& f) const;\n \n enum type_bases\n {\n string_type_base,\n int_type_base,\n bool_type_base,\n@@ -4649,22 +4649,22 @@\n socks5,\n socks5_pw,\n http,\n http_pw,\n };\n };\n \n-\n \n-[report issue]set_bool() set_str() set_int()
\n+\n+[report issue]set_str() set_bool() set_int()
\n \n-void set_str (int name, std::string val) override;\n-void set_int (int name, flags::bitfield_flag<Type, Tag> const val);\n void set_bool (int name, bool val) override;\n+void set_int (int name, flags::bitfield_flag<Type, Tag> const val);\n+void set_str (int name, std::string val) override;\n void set_int (int name, int val) override;\n
\n get_int() get_bool() get_str()
\n \n+bool get_bool (int name) const override;\n std::string const& get_str (int name) const override;\n int get_int (int name) const override;\n-bool get_bool (int name) const override;\n
\n http_pw \n 5 \n The server is assumed to be an HTTP proxy that requires user\n authorization. The username and password will be sent to the proxy. \n
Declared in "libtorrent/settings_pack.hpp"
\n+\n+int setting_by_name (string_view name);\n+char const* name_for_setting (int s);\n+\n+
converts a setting integer (from the enums string_types, int_types or\n+bool_types) to a string, and vice versa.
\n+[report issue]Declared in "libtorrent/settings_pack.hpp"
\n+\n+settings_pack default_settings ();\n+\n+
returns a settings_pack with every setting set to its default value
\n \n [report issue]Declared in "libtorrent/session.hpp"
\n\n-settings_pack min_memory_usage ();\n settings_pack high_performance_seed ();\n+settings_pack min_memory_usage ();\n\n
The default values of the session settings are set for a regular\n bittorrent client running on a desktop system. There are functions that\n can set the session settings to pre set settings for other environments.\n These can be used for the basis, and should be tweaked to fit your needs\n better.
\nmin_memory_usage returns settings that will use the minimal amount of\n@@ -5090,33 +5109,14 @@\n pieces, instead of reading it all into memory before hashing.
\nThis configuration is intended to be the starting point for embedded\n devices. It will significantly reduce memory usage.
\nhigh_performance_seed returns settings optimized for a seed box,\n serving many peers and that doesn't do any downloading. It has a 128 MB\n disk cache and has a limit of 400 files in its file pool. It support fast\n upload rates by allowing large send buffers.
\n-\n-[report issue]Declared in "libtorrent/settings_pack.hpp"
\n-\n-char const* name_for_setting (int s);\n-int setting_by_name (string_view name);\n-\n-
converts a setting integer (from the enums string_types, int_types or\n-bool_types) to a string, and vice versa.
\n-[report issue]Declared in "libtorrent/settings_pack.hpp"
\n-\n-settings_pack default_settings ();\n-\n-
returns a settings_pack with every setting set to its default value
\n [report issue]Declared in "libtorrent/fingerprint.hpp"
\n\n std::string generate_fingerprint (std::string name\n , int major, int minor = 0, int revision = 0, int tag = 0);\n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,31 +1,31 @@\n >\n _\b[_\bl_\bi_\bb_\bt_\bo_\br_\br_\be_\bn_\bt_\b _\bl_\bo_\bg_\bo_\b]\n V\bVe\ber\brs\bsi\bio\bon\bn:\b: 2.0.10\n _\bh_\bo_\bm_\be\n Table of contents\n * _\bs_\be_\bt_\bt_\bi_\bn_\bg_\bs_\b__\bp_\ba_\bc_\bk\n- o _\bs_\be_\bt_\b__\bb_\bo_\bo_\bl_\b(_\b)_\b _\bs_\be_\bt_\b__\bs_\bt_\br_\b(_\b)_\b _\bs_\be_\bt_\b__\bi_\bn_\bt_\b(_\b)\n+ o _\bs_\be_\bt_\b__\bs_\bt_\br_\b(_\b)_\b _\bs_\be_\bt_\b__\bb_\bo_\bo_\bl_\b(_\b)_\b _\bs_\be_\bt_\b__\bi_\bn_\bt_\b(_\b)\n o _\bh_\ba_\bs_\b__\bv_\ba_\bl_\b(_\b)\n o _\bc_\bl_\be_\ba_\br_\b(_\b)\n o _\bc_\bl_\be_\ba_\br_\b(_\b)\n o _\bg_\be_\bt_\b__\bi_\bn_\bt_\b(_\b)_\b _\bg_\be_\bt_\b__\bb_\bo_\bo_\bl_\b(_\b)_\b _\bg_\be_\bt_\b__\bs_\bt_\br_\b(_\b)\n o _\be_\bn_\bu_\bm_\b _\bt_\by_\bp_\be_\b__\bb_\ba_\bs_\be_\bs\n o _\be_\bn_\bu_\bm_\b _\bm_\bm_\ba_\bp_\b__\bw_\br_\bi_\bt_\be_\b__\bm_\bo_\bd_\be_\b__\bt\n o _\be_\bn_\bu_\bm_\b _\bs_\bu_\bg_\bg_\be_\bs_\bt_\b__\bm_\bo_\bd_\be_\b__\bt\n o _\be_\bn_\bu_\bm_\b _\bc_\bh_\bo_\bk_\bi_\bn_\bg_\b__\ba_\bl_\bg_\bo_\br_\bi_\bt_\bh_\bm_\b__\bt\n o _\be_\bn_\bu_\bm_\b _\bs_\be_\be_\bd_\b__\bc_\bh_\bo_\bk_\bi_\bn_\bg_\b__\ba_\bl_\bg_\bo_\br_\bi_\bt_\bh_\bm_\b__\bt\n o _\be_\bn_\bu_\bm_\b _\bi_\bo_\b__\bb_\bu_\bf_\bf_\be_\br_\b__\bm_\bo_\bd_\be_\b__\bt\n o _\be_\bn_\bu_\bm_\b _\bb_\ba_\bn_\bd_\bw_\bi_\bd_\bt_\bh_\b__\bm_\bi_\bx_\be_\bd_\b__\ba_\bl_\bg_\bo_\b__\bt\n o _\be_\bn_\bu_\bm_\b _\be_\bn_\bc_\b__\bp_\bo_\bl_\bi_\bc_\by\n o _\be_\bn_\bu_\bm_\b _\be_\bn_\bc_\b__\bl_\be_\bv_\be_\bl\n o _\be_\bn_\bu_\bm_\b _\bp_\br_\bo_\bx_\by_\b__\bt_\by_\bp_\be_\b__\bt\n- * _\bm_\bi_\bn_\b__\bm_\be_\bm_\bo_\br_\by_\b__\bu_\bs_\ba_\bg_\be_\b(_\b)_\b _\bh_\bi_\bg_\bh_\b__\bp_\be_\br_\bf_\bo_\br_\bm_\ba_\bn_\bc_\be_\b__\bs_\be_\be_\bd_\b(_\b)\n- * _\bs_\be_\bt_\bt_\bi_\bn_\bg_\b__\bb_\by_\b__\bn_\ba_\bm_\be_\b(_\b)_\b _\bn_\ba_\bm_\be_\b__\bf_\bo_\br_\b__\bs_\be_\bt_\bt_\bi_\bn_\bg_\b(_\b)\n+ * _\bn_\ba_\bm_\be_\b__\bf_\bo_\br_\b__\bs_\be_\bt_\bt_\bi_\bn_\bg_\b(_\b)_\b _\bs_\be_\bt_\bt_\bi_\bn_\bg_\b__\bb_\by_\b__\bn_\ba_\bm_\be_\b(_\b)\n * _\bd_\be_\bf_\ba_\bu_\bl_\bt_\b__\bs_\be_\bt_\bt_\bi_\bn_\bg_\bs_\b(_\b)\n+ * _\bm_\bi_\bn_\b__\bm_\be_\bm_\bo_\br_\by_\b__\bu_\bs_\ba_\bg_\be_\b(_\b)_\b _\bh_\bi_\bg_\bh_\b__\bp_\be_\br_\bf_\bo_\br_\bm_\ba_\bn_\bc_\be_\b__\bs_\be_\be_\bd_\b(_\b)\n * _\bg_\be_\bn_\be_\br_\ba_\bt_\be_\b__\bf_\bi_\bn_\bg_\be_\br_\bp_\br_\bi_\bn_\bt_\b(_\b)\n You have some control over _\bs_\be_\bs_\bs_\bi_\bo_\bn configuration through the session::\n apply_settings() member function. To change one or more configuration options,\n create a _\bs_\be_\bt_\bt_\bi_\bn_\bg_\bs_\b__\bp_\ba_\bc_\bk object and fill it with the settings to be set and pass\n it in to session::apply_settings().\n The _\bs_\be_\bt_\bt_\bi_\bn_\bg_\bs_\b__\bp_\ba_\bc_\bk object is a collection of settings updates that are applied\n to the _\bs_\be_\bs_\bs_\bi_\bo_\bn when passed to session::apply_settings(). It's empty when\n@@ -1420,24 +1420,24 @@\n next time the SAM connection is re-established (by restarting or changing\n i2p_hostname or i2p_port).\n struct settings_pack final : settings_interface\n {\n friend void a\bap\bpp\bpl\bly\by_\b_p\bpa\bac\bck\bk_\b_i\bim\bmp\bpl\bl (settings_pack const*\n , aux::session_settings_single_thread&\n , std::vector*);\n- void s\bse\bet\bt_\b_s\bst\btr\br (int name, std::string val) override;\n- void s\bse\bet\bt_\b_i\bin\bnt\bt (int name, flags::bitfield_flag const val);\n void s\bse\bet\bt_\b_b\bbo\boo\bol\bl (int name, bool val) override;\n+ void s\bse\bet\bt_\b_i\bin\bnt\bt (int name, flags::bitfield_flag const val);\n+ void s\bse\bet\bt_\b_s\bst\btr\br (int name, std::string val) override;\n void s\bse\bet\bt_\b_i\bin\bnt\bt (int name, int val) override;\n bool h\bha\bas\bs_\b_v\bva\bal\bl (int name) const override;\n void c\bcl\ble\bea\bar\br ();\n void c\bcl\ble\bea\bar\br (int name);\n+ bool g\bge\bet\bt_\b_b\bbo\boo\bol\bl (int name) const override;\n std::string const& g\bge\bet\bt_\b_s\bst\btr\br (int name) const override;\n int g\bge\bet\bt_\b_i\bin\bnt\bt (int name) const override;\n- bool g\bge\bet\bt_\b_b\bbo\boo\bol\bl (int name) const override;\n void f\bfo\bor\br_\b_e\bea\bac\bch\bh (Fun&& f) const;\n \n enum type_bases\n {\n string_type_base,\n int_type_base,\n bool_type_base,\n@@ -1507,18 +1507,18 @@\n socks5,\n socks5_pw,\n http,\n http_pw,\n };\n };\n [_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b* s\bse\bet\bt_\b_b\bbo\boo\bol\bl(\b()\b) s\bse\bet\bt_\b_s\bst\btr\br(\b()\b) s\bse\bet\bt_\b_i\bin\bnt\bt(\b()\b) *\b**\b**\b**\b**\b*\n-void s\bse\bet\bt_\b_s\bst\btr\br (int name, std::string val) override;\n-void s\bse\bet\bt_\b_i\bin\bnt\bt (int name, flags::bitfield_flag const val);\n+*\b**\b**\b**\b**\b* s\bse\bet\bt_\b_s\bst\btr\br(\b()\b) s\bse\bet\bt_\b_b\bbo\boo\bol\bl(\b()\b) s\bse\bet\bt_\b_i\bin\bnt\bt(\b()\b) *\b**\b**\b**\b**\b*\n void s\bse\bet\bt_\b_b\bbo\boo\bol\bl (int name, bool val) override;\n+void s\bse\bet\bt_\b_i\bin\bnt\bt (int name, flags::bitfield_flag const val);\n+void s\bse\bet\bt_\b_s\bst\btr\br (int name, std::string val) override;\n void s\bse\bet\bt_\b_i\bin\bnt\bt (int name, int val) override;\n set a configuration option in the _\bs_\be_\bt_\bt_\bi_\bn_\bg_\bs_\b__\bp_\ba_\bc_\bk. name is one of the enum values\n from string_types, int_types or bool_types. They must match the respective type\n of the set_* function.\n [_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n *\b**\b**\b**\b**\b* h\bha\bas\bs_\b_v\bva\bal\bl(\b()\b) *\b**\b**\b**\b**\b*\n bool h\bha\bas\bs_\b_v\bva\bal\bl (int name) const override;\n@@ -1531,17 +1531,17 @@\n clear the settings pack from all settings\n [_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n *\b**\b**\b**\b**\b* c\bcl\ble\bea\bar\br(\b()\b) *\b**\b**\b**\b**\b*\n void c\bcl\ble\bea\bar\br (int name);\n clear a specific setting from the pack\n [_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n *\b**\b**\b**\b**\b* g\bge\bet\bt_\b_i\bin\bnt\bt(\b()\b) g\bge\bet\bt_\b_b\bbo\boo\bol\bl(\b()\b) g\bge\bet\bt_\b_s\bst\btr\br(\b()\b) *\b**\b**\b**\b**\b*\n+bool g\bge\bet\bt_\b_b\bbo\boo\bol\bl (int name) const override;\n std::string const& g\bge\bet\bt_\b_s\bst\btr\br (int name) const override;\n int g\bge\bet\bt_\b_i\bin\bnt\bt (int name) const override;\n-bool g\bge\bet\bt_\b_b\bbo\boo\bol\bl (int name) const override;\n queries the current configuration option from the _\bs_\be_\bt_\bt_\bi_\bn_\bg_\bs_\b__\bp_\ba_\bc_\bk. name is one of\n the enumeration values from string_types, int_types or bool_types. The enum\n value must match the type of the get_* function. If the specified setting field\n has not been set, the default value is returned.\n [_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n *\b**\b**\b**\b**\b* e\ben\bnu\bum\bm t\bty\byp\bpe\be_\b_b\bba\bas\bse\bes\bs *\b**\b**\b**\b**\b*\n Declared in \"_\bl_\bi_\bb_\bt_\bo_\br_\br_\be_\bn_\bt_\b/_\bs_\be_\bt_\bt_\bi_\bn_\bg_\bs_\b__\bp_\ba_\bc_\bk_\b._\bh_\bp_\bp\"\n@@ -1668,18 +1668,30 @@\n | | |trackers, a plain proxy will suffice. The proxy is assumed to|\n | | |not require authorization. The username and password will not|\n |_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\bb_\be_\b _\bu_\bs_\be_\bd_\b._\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n | | |The server is assumed to be an HTTP proxy that requires user |\n |http_pw |5 |authorization. The username and password will be sent to the |\n |_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\bp_\br_\bo_\bx_\by_\b._\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n [_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n+*\b**\b**\b**\b**\b**\b* n\bna\bam\bme\be_\b_f\bfo\bor\br_\b_s\bse\bet\btt\bti\bin\bng\bg(\b()\b) s\bse\bet\btt\bti\bin\bng\bg_\b_b\bby\by_\b_n\bna\bam\bme\be(\b()\b) *\b**\b**\b**\b**\b**\b*\n+Declared in \"_\bl_\bi_\bb_\bt_\bo_\br_\br_\be_\bn_\bt_\b/_\bs_\be_\bt_\bt_\bi_\bn_\bg_\bs_\b__\bp_\ba_\bc_\bk_\b._\bh_\bp_\bp\"\n+int s\bse\bet\btt\bti\bin\bng\bg_\b_b\bby\by_\b_n\bna\bam\bme\be (string_view name);\n+char const* n\bna\bam\bme\be_\b_f\bfo\bor\br_\b_s\bse\bet\btt\bti\bin\bng\bg (int s);\n+converts a setting integer (from the enums string_types, int_types or\n+bool_types) to a string, and vice versa.\n+[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n+*\b**\b**\b**\b**\b**\b* d\bde\bef\bfa\bau\bul\blt\bt_\b_s\bse\bet\btt\bti\bin\bng\bgs\bs(\b()\b) *\b**\b**\b**\b**\b**\b*\n+Declared in \"_\bl_\bi_\bb_\bt_\bo_\br_\br_\be_\bn_\bt_\b/_\bs_\be_\bt_\bt_\bi_\bn_\bg_\bs_\b__\bp_\ba_\bc_\bk_\b._\bh_\bp_\bp\"\n+settings_pack d\bde\bef\bfa\bau\bul\blt\bt_\b_s\bse\bet\btt\bti\bin\bng\bgs\bs ();\n+returns a _\bs_\be_\bt_\bt_\bi_\bn_\bg_\bs_\b__\bp_\ba_\bc_\bk with every setting set to its default value\n+[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n *\b**\b**\b**\b**\b**\b* m\bmi\bin\bn_\b_m\bme\bem\bmo\bor\bry\by_\b_u\bus\bsa\bag\bge\be(\b()\b) h\bhi\big\bgh\bh_\b_p\bpe\ber\brf\bfo\bor\brm\bma\ban\bnc\bce\be_\b_s\bse\bee\bed\bd(\b()\b) *\b**\b**\b**\b**\b**\b*\n Declared in \"_\bl_\bi_\bb_\bt_\bo_\br_\br_\be_\bn_\bt_\b/_\bs_\be_\bs_\bs_\bi_\bo_\bn_\b._\bh_\bp_\bp\"\n-settings_pack m\bmi\bin\bn_\b_m\bme\bem\bmo\bor\bry\by_\b_u\bus\bsa\bag\bge\be ();\n settings_pack h\bhi\big\bgh\bh_\b_p\bpe\ber\brf\bfo\bor\brm\bma\ban\bnc\bce\be_\b_s\bse\bee\bed\bd ();\n+settings_pack m\bmi\bin\bn_\b_m\bme\bem\bmo\bor\bry\by_\b_u\bus\bsa\bag\bge\be ();\n The default values of the _\bs_\be_\bs_\bs_\bi_\bo_\bn settings are set for a regular bittorrent\n client running on a desktop system. There are functions that can set the\n _\bs_\be_\bs_\bs_\bi_\bo_\bn settings to pre set settings for other environments. These can be used\n for the basis, and should be tweaked to fit your needs better.\n min_memory_usage returns settings that will use the minimal amount of RAM, at\n the potential expense of upload and download performance. It adjusts the socket\n buffer sizes, disables the disk cache, lowers the send buffer watermarks so\n@@ -1692,26 +1704,14 @@\n This configuration is intended to be the starting point for embedded devices.\n It will significantly reduce memory usage.\n high_performance_seed returns settings optimized for a seed box, serving many\n peers and that doesn't do any downloading. It has a 128 MB disk cache and has a\n limit of 400 files in its file pool. It support fast upload rates by allowing\n large send buffers.\n [_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b**\b* s\bse\bet\btt\bti\bin\bng\bg_\b_b\bby\by_\b_n\bna\bam\bme\be(\b()\b) n\bna\bam\bme\be_\b_f\bfo\bor\br_\b_s\bse\bet\btt\bti\bin\bng\bg(\b()\b) *\b**\b**\b**\b**\b**\b*\n-Declared in \"_\bl_\bi_\bb_\bt_\bo_\br_\br_\be_\bn_\bt_\b/_\bs_\be_\bt_\bt_\bi_\bn_\bg_\bs_\b__\bp_\ba_\bc_\bk_\b._\bh_\bp_\bp\"\n-char const* n\bna\bam\bme\be_\b_f\bfo\bor\br_\b_s\bse\bet\btt\bti\bin\bng\bg (int s);\n-int s\bse\bet\btt\bti\bin\bng\bg_\b_b\bby\by_\b_n\bna\bam\bme\be (string_view name);\n-converts a setting integer (from the enums string_types, int_types or\n-bool_types) to a string, and vice versa.\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b**\b* d\bde\bef\bfa\bau\bul\blt\bt_\b_s\bse\bet\btt\bti\bin\bng\bgs\bs(\b()\b) *\b**\b**\b**\b**\b**\b*\n-Declared in \"_\bl_\bi_\bb_\bt_\bo_\br_\br_\be_\bn_\bt_\b/_\bs_\be_\bt_\bt_\bi_\bn_\bg_\bs_\b__\bp_\ba_\bc_\bk_\b._\bh_\bp_\bp\"\n-settings_pack d\bde\bef\bfa\bau\bul\blt\bt_\b_s\bse\bet\btt\bti\bin\bng\bgs\bs ();\n-returns a _\bs_\be_\bt_\bt_\bi_\bn_\bg_\bs_\b__\bp_\ba_\bc_\bk with every setting set to its default value\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n *\b**\b**\b**\b**\b**\b* g\bge\ben\bne\ber\bra\bat\bte\be_\b_f\bfi\bin\bng\bge\ber\brp\bpr\bri\bin\bnt\bt(\b()\b) *\b**\b**\b**\b**\b**\b*\n Declared in \"_\bl_\bi_\bb_\bt_\bo_\br_\br_\be_\bn_\bt_\b/_\bf_\bi_\bn_\bg_\be_\br_\bp_\br_\bi_\bn_\bt_\b._\bh_\bp_\bp\"\n std::string g\bge\ben\bne\ber\bra\bat\bte\be_\b_f\bfi\bin\bng\bge\ber\brp\bpr\bri\bin\bnt\bt (std::string name\n , int major, int minor = 0, int revision = 0, int tag = 0);\n This is a utility function to produce a client ID fingerprint formatted to the\n most common convention. The fingerprint can be set via the peer_fingerprint\n setting, in _\bs_\be_\bt_\bt_\bi_\bn_\bg_\bs_\b__\bp_\ba_\bc_\bk.\n"}]}, {"source1": "./usr/share/doc/libtorrent-rasterbar-doc/html/reference-Stats.html", "source2": "./usr/share/doc/libtorrent-rasterbar-doc/html/reference-Stats.html", "comments": ["Ordering differences only"], "unified_diff": "@@ -45,28 +45,28 @@\n [report issue]\n counters
\n Declared in "libtorrent/performance_counters.hpp"
\n \n struct counters\n {\n counters () ;\n- counters (counters const&) ;\n counters& operator= (counters const&) & ;\n- std::int64_t operator[] (int i) const ;\n+ counters (counters const&) ;\n std::int64_t inc_stats_counter (int c, std::int64_t value = 1) ;\n- void blend_stats_counter (int c, std::int64_t value, int ratio) ;\n+ std::int64_t operator[] (int i) const ;\n void set_value (int c, std::int64_t value) ;\n+ void blend_stats_counter (int c, std::int64_t value, int ratio) ;\n };\n \n \n [report issue]\n operator[]() inc_stats_counter()
\n \n-std::int64_t operator[] (int i) const ;\n std::int64_t inc_stats_counter (int c, std::int64_t value = 1) ;\n+std::int64_t operator[] (int i) const ;\n
\n returns the new value
\n [report issue]\n \n \n stats_metric
\n Declared in "libtorrent/session_stats.hpp"
\n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -11,25 +11,25 @@\n * _\be_\bn_\bu_\bm_\b _\bm_\be_\bt_\br_\bi_\bc_\b__\bt_\by_\bp_\be_\b__\bt\n [_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n *\b**\b**\b**\b**\b**\b* c\bco\bou\bun\bnt\bte\ber\brs\bs *\b**\b**\b**\b**\b**\b*\n Declared in \"_\bl_\bi_\bb_\bt_\bo_\br_\br_\be_\bn_\bt_\b/_\bp_\be_\br_\bf_\bo_\br_\bm_\ba_\bn_\bc_\be_\b__\bc_\bo_\bu_\bn_\bt_\be_\br_\bs_\b._\bh_\bp_\bp\"\n struct counters\n {\n c\bco\bou\bun\bnt\bte\ber\brs\bs () ;\n- c\bco\bou\bun\bnt\bte\ber\brs\bs (counters const&) ;\n counters& o\bop\bpe\ber\bra\bat\bto\bor\br=\b= (counters const&) & ;\n- std::int64_t o\bop\bpe\ber\bra\bat\bto\bor\br[\b[]\b] (int i) const ;\n+ c\bco\bou\bun\bnt\bte\ber\brs\bs (counters const&) ;\n std::int64_t i\bin\bnc\bc_\b_s\bst\bta\bat\bts\bs_\b_c\bco\bou\bun\bnt\bte\ber\br (int c, std::int64_t value = 1) ;\n- void b\bbl\ble\ben\bnd\bd_\b_s\bst\bta\bat\bts\bs_\b_c\bco\bou\bun\bnt\bte\ber\br (int c, std::int64_t value, int ratio) ;\n+ std::int64_t o\bop\bpe\ber\bra\bat\bto\bor\br[\b[]\b] (int i) const ;\n void s\bse\bet\bt_\b_v\bva\bal\blu\bue\be (int c, std::int64_t value) ;\n+ void b\bbl\ble\ben\bnd\bd_\b_s\bst\bta\bat\bts\bs_\b_c\bco\bou\bun\bnt\bte\ber\br (int c, std::int64_t value, int ratio) ;\n };\n [_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n *\b**\b**\b**\b**\b* o\bop\bpe\ber\bra\bat\bto\bor\br[\b[]\b](\b()\b) i\bin\bnc\bc_\b_s\bst\bta\bat\bts\bs_\b_c\bco\bou\bun\bnt\bte\ber\br(\b()\b) *\b**\b**\b**\b**\b*\n-std::int64_t o\bop\bpe\ber\bra\bat\bto\bor\br[\b[]\b] (int i) const ;\n std::int64_t i\bin\bnc\bc_\b_s\bst\bta\bat\bts\bs_\b_c\bco\bou\bun\bnt\bte\ber\br (int c, std::int64_t value = 1) ;\n+std::int64_t o\bop\bpe\ber\bra\bat\bto\bor\br[\b[]\b] (int i) const ;\n returns the new value\n [_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n *\b**\b**\b**\b**\b**\b* s\bst\bta\bat\bts\bs_\b_m\bme\bet\btr\bri\bic\bc *\b**\b**\b**\b**\b**\b*\n Declared in \"_\bl_\bi_\bb_\bt_\bo_\br_\br_\be_\bn_\bt_\b/_\bs_\be_\bs_\bs_\bi_\bo_\bn_\b__\bs_\bt_\ba_\bt_\bs_\b._\bh_\bp_\bp\"\n describes one statistics metric from the _\bs_\be_\bs_\bs_\bi_\bo_\bn. For more information, see the\n _\bs_\be_\bs_\bs_\bi_\bo_\bn_\b _\bs_\bt_\ba_\bt_\bi_\bs_\bt_\bi_\bc_\bs section.\n struct stats_metric\n"}]}, {"source1": "./usr/share/doc/libtorrent-rasterbar-doc/html/reference-Storage.html", "source2": "./usr/share/doc/libtorrent-rasterbar-doc/html/reference-Storage.html", "unified_diff": "@@ -32,53 +32,53 @@\n \n Table of contents
\n \n - file_slice
\n - file_storage
\n - is_valid()
\n - reserve()
\n-- add_file_borrow() add_file()
\n+- add_file() add_file_borrow()
\n - rename_file()
\n - map_block()
\n - map_file()
\n - num_files()
\n - end_file()
\n - file_range()
\n - total_size()
\n-- set_num_pieces() num_pieces()
\n+- num_pieces() set_num_pieces()
\n - end_piece()
\n - last_piece()
\n - piece_range()
\n-- piece_length() set_piece_length()
\n+- set_piece_length() piece_length()
\n - piece_size()
\n - piece_size2()
\n - blocks_in_piece2()
\n - blocks_per_piece()
\n-- set_name() name()
\n+- name() set_name()
\n - swap()
\n - canonicalize()
\n-- mtime() file_size() root_ptr() pad_file_at() file_name() hash() symlink() root() file_offset() file_path()
\n-- file_num_pieces() file_piece_range() file_num_blocks()
\n-- file_first_block_node() file_first_piece_node()
\n+- symlink() pad_file_at() file_offset() root_ptr() root() file_size() file_name() file_path() hash() mtime()
\n+- file_piece_range() file_num_blocks() file_num_pieces()
\n+- file_first_piece_node() file_first_block_node()
\n - file_path_hash()
\n - all_path_hashes()
\n - file_flags()
\n - file_absolute_path()
\n-- file_index_at_offset() file_index_at_piece()
\n+- file_index_at_piece() file_index_at_offset()
\n - file_index_for_root()
\n - piece_index_at_file()
\n - sanitize_symlinks()
\n - v2()
\n
\n \n - storage_params
\n-- mmap_disk_io_constructor()
\n+- posix_disk_io_constructor()
\n - default_disk_io_constructor()
\n-- disabled_disk_io_constructor()
\n-- posix_disk_io_constructor()
\n+- mmap_disk_io_constructor()
\n+- disabled_disk_io_constructor()
\n - enum storage_mode_t
\n - enum status_t
\n - enum move_flags_t
\n
\n \n [report issue]\n file_slice
\n@@ -117,76 +117,76 @@\n size. Everything necessary to interpret a regular bittorrent storage\n file structure.\n \n class file_storage\n {\n bool is_valid () const;\n void reserve (int num_files);\n- void add_file_borrow (string_view filename\n+ void add_file_borrow (error_code& ec, string_view filename\n , std::string const& path, std::int64_t file_size\n , file_flags_t file_flags = {}, char const* filehash = nullptr\n , std::int64_t mtime = 0, string_view symlink_path = string_view()\n , char const* root_hash = nullptr);\n void add_file (error_code& ec, std::string const& path, std::int64_t file_size\n , file_flags_t file_flags = {}\n , std::time_t mtime = 0, string_view symlink_path = string_view()\n , char const* root_hash = nullptr);\n- void add_file (std::string const& path, std::int64_t file_size\n- , file_flags_t file_flags = {}\n- , std::time_t mtime = 0, string_view symlink_path = string_view()\n- , char const* root_hash = nullptr);\n- void add_file_borrow (error_code& ec, string_view filename\n+ void add_file_borrow (string_view filename\n , std::string const& path, std::int64_t file_size\n , file_flags_t file_flags = {}, char const* filehash = nullptr\n , std::int64_t mtime = 0, string_view symlink_path = string_view()\n , char const* root_hash = nullptr);\n+ void add_file (std::string const& path, std::int64_t file_size\n+ , file_flags_t file_flags = {}\n+ , std::time_t mtime = 0, string_view symlink_path = string_view()\n+ , char const* root_hash = nullptr);\n void rename_file (file_index_t index, std::string const& new_filename);\n std::vector<file_slice> map_block (piece_index_t piece, std::int64_t offset\n , std::int64_t size) const;\n peer_request map_file (file_index_t file, std::int64_t offset, int size) const;\n int num_files () const noexcept;\n file_index_t end_file () const noexcept;\n index_range<file_index_t> file_range () const noexcept;\n std::int64_t total_size () const;\n- void set_num_pieces (int n);\n int num_pieces () const;\n+ void set_num_pieces (int n);\n piece_index_t end_piece () const;\n piece_index_t last_piece () const;\n index_range<piece_index_t> piece_range () const noexcept;\n- int piece_length () const;\n void set_piece_length (int l);\n+ int piece_length () const;\n int piece_size (piece_index_t index) const;\n int piece_size2 (piece_index_t index) const;\n int blocks_in_piece2 (piece_index_t index) const;\n int blocks_per_piece () const;\n- std::string const& name () const;\n void set_name (std::string const& n);\n+ std::string const& name () const;\n void swap (file_storage& ti) noexcept;\n void canonicalize ();\n- std::string symlink (file_index_t index) const;\n- std::int64_t file_size (file_index_t index) const;\n- sha256_hash root (file_index_t index) const;\n- std::int64_t file_offset (file_index_t index) const;\n char const* root_ptr (file_index_t const index) const;\n- std::time_t mtime (file_index_t index) const;\n std::string file_path (file_index_t index, std::string const& save_path = "") const;\n- sha1_hash hash (file_index_t index) const;\n+ std::int64_t file_offset (file_index_t index) const;\n string_view file_name (file_index_t index) const;\n bool pad_file_at (file_index_t index) const;\n- int file_num_blocks (file_index_t index) const;\n+ std::string symlink (file_index_t index) const;\n+ std::int64_t file_size (file_index_t index) const;\n+ sha1_hash hash (file_index_t index) const;\n+ std::time_t mtime (file_index_t index) const;\n+ sha256_hash root (file_index_t index) const;\n index_range<piece_index_t::diff_type> file_piece_range (file_index_t) const;\n int file_num_pieces (file_index_t index) const;\n+ int file_num_blocks (file_index_t index) const;\n int file_first_piece_node (file_index_t index) const;\n int file_first_block_node (file_index_t index) const;\n std::uint32_t file_path_hash (file_index_t index, std::string const& save_path) const;\n void all_path_hashes (std::unordered_set<std::uint32_t>& table) const;\n file_flags_t file_flags (file_index_t index) const;\n bool file_absolute_path (file_index_t index) const;\n- file_index_t file_index_at_piece (piece_index_t piece) const;\n file_index_t file_index_at_offset (std::int64_t offset) const;\n+ file_index_t file_index_at_piece (piece_index_t piece) const;\n file_index_t file_index_for_root (sha256_hash const& root_hash) const;\n piece_index_t piece_index_at_file (file_index_t f) const;\n void sanitize_symlinks ();\n bool v2 () const;\n \n static constexpr file_flags_t flag_pad_file = 0_bit;\n static constexpr file_flags_t flag_hidden = 1_bit;\n@@ -208,37 +208,37 @@\n reserve()
\n \n void reserve (int num_files);\n
\n allocates space for num_files in the internal file list. This can\n be used to avoid reallocating the internal file list when the number\n of files to be added is known up-front.
\n-\n-[report issue]\n-\n+\n+add_file() add_file_borrow()
\n \n-void add_file_borrow (string_view filename\n+void add_file_borrow (error_code& ec, string_view filename\n , std::string const& path, std::int64_t file_size\n , file_flags_t file_flags = {}, char const* filehash = nullptr\n , std::int64_t mtime = 0, string_view symlink_path = string_view()\n , char const* root_hash = nullptr);\n void add_file (error_code& ec, std::string const& path, std::int64_t file_size\n , file_flags_t file_flags = {}\n , std::time_t mtime = 0, string_view symlink_path = string_view()\n , char const* root_hash = nullptr);\n-void add_file (std::string const& path, std::int64_t file_size\n- , file_flags_t file_flags = {}\n- , std::time_t mtime = 0, string_view symlink_path = string_view()\n- , char const* root_hash = nullptr);\n-void add_file_borrow (error_code& ec, string_view filename\n+void add_file_borrow (string_view filename\n , std::string const& path, std::int64_t file_size\n , file_flags_t file_flags = {}, char const* filehash = nullptr\n , std::int64_t mtime = 0, string_view symlink_path = string_view()\n , char const* root_hash = nullptr);\n+void add_file (std::string const& path, std::int64_t file_size\n+ , file_flags_t file_flags = {}\n+ , std::time_t mtime = 0, string_view symlink_path = string_view()\n+ , char const* root_hash = nullptr);\n \n Adds a file to the file storage. The add_file_borrow version\n expects that filename is the file name (without a path) of\n the file that's being added.\n This memory is borrowed, i.e. it is the caller's\n responsibility to make sure it stays valid throughout the lifetime\n of this file_storage object or any copy of it. The same thing applies\n@@ -288,29 +288,29 @@\n
map_block()
\n \n std::vector<file_slice> map_block (piece_index_t piece, std::int64_t offset\n , std::int64_t size) const;\n
\n returns a list of file_slice objects representing the portions of\n files the specified piece index, byte offset and size range overlaps.\n-this is the inverse mapping of map_file().
\n+this is the inverse mapping of map_file().\n Preconditions of this function is that the input range is within the\n torrents address space. piece may not be negative and
\n \n piece * piece_size + offset + size
\n may not exceed the total size of the torrent.
\n [report issue]\n \n map_file()
\n \n peer_request map_file (file_index_t file, std::int64_t offset, int size) const;\n
\n returns a peer_request representing the piece index, byte offset\n and size the specified file range overlaps. This is the inverse\n-mapping over map_block(). Note that the peer_request return type\n+mapping over map_block(). Note that the peer_request return type\n is meant to hold bittorrent block requests, which may not be larger\n than 16 kiB. Mapping a range larger than that may return an overflown\n integer.
\n [report issue]\n \n num_files()
\n \n@@ -336,21 +336,21 @@\n [report issue]
\n \n total_size()
\n \n std::int64_t total_size () const;\n
\n returns the total number of bytes all the files in this torrent spans
\n-\n-[report issue]\n-\n+\n+num_pieces() set_num_pieces()
\n \n-void set_num_pieces (int n);\n int num_pieces () const;\n+void set_num_pieces (int n);\n
\n set and get the number of pieces in the torrent
\n [report issue]\n \n end_piece()
\n \n piece_index_t end_piece () const;\n@@ -370,31 +370,31 @@\n piece_range()
\n \n index_range<piece_index_t> piece_range () const noexcept;\n
\n returns an implementation-defined type that can be used as the\n container in a range-for loop. Where the values are the indices of all\n pieces in the file_storage.
\n-\n-[report issue]
\n-\n+\n+set_piece_length() piece_length()
\n \n-int piece_length () const;\n void set_piece_length (int l);\n+int piece_length () const;\n
\n set and get the size of each piece in this torrent. It must be a power of two\n and at least 16 kiB.
\n [report issue]\n \n piece_size()
\n \n int piece_size (piece_index_t index) const;\n
\n-returns the piece size of index. This will be the same as piece_length(), except\n+
returns the piece size of index. This will be the same as piece_length(), except\n for the last piece, which may be shorter.
\n [report issue]\n \n piece_size2()
\n \n int piece_size2 (piece_index_t index) const;\n
\n@@ -413,21 +413,21 @@\n \n blocks_per_piece()
\n \n int blocks_per_piece () const;\n
\n returns the number of blocks there are in the typical piece. There\n may be fewer in the last piece)
\n-\n-[report issue]\n-\n+\n+name() set_name()
\n \n-std::string const& name () const;\n void set_name (std::string const& n);\n+std::string const& name () const;\n
\n set and get the name of this torrent. For multi-file torrents, this is also\n the name of the root directory all the files are stored in.
\n [report issue]\n \n swap()
\n \n@@ -438,37 +438,37 @@\n \n canonicalize()
\n \n void canonicalize ();\n
\n arrange files and padding to match the canonical form required\n by BEP 52
\n-\n-\n-\n+\n \n+\n+\n+\n+\n \n+\n \n-\n-\n-\n-[report issue]\n-\n-mtime() file_size() root_ptr() pad_file_at() file_name() hash() symlink() root() file_offset() file_path()
\n+[report issue]\n+\n+symlink() pad_file_at() file_offset() root_ptr() root() file_size() file_name() file_path() hash() mtime()
\n \n-std::string symlink (file_index_t index) const;\n-std::int64_t file_size (file_index_t index) const;\n-sha256_hash root (file_index_t index) const;\n-std::int64_t file_offset (file_index_t index) const;\n char const* root_ptr (file_index_t const index) const;\n-std::time_t mtime (file_index_t index) const;\n std::string file_path (file_index_t index, std::string const& save_path = "") const;\n-sha1_hash hash (file_index_t index) const;\n+std::int64_t file_offset (file_index_t index) const;\n string_view file_name (file_index_t index) const;\n bool pad_file_at (file_index_t index) const;\n+std::string symlink (file_index_t index) const;\n+std::int64_t file_size (file_index_t index) const;\n+sha1_hash hash (file_index_t index) const;\n+std::time_t mtime (file_index_t index) const;\n+sha256_hash root (file_index_t index) const;\n
\n These functions are used to query attributes of files at\n a given index.
\n The hash() is a SHA-1 hash of the file, or 0 if none was\n provided in the torrent file. This can potentially be used to\n join a bittorrent network with other file sharing networks.
\n root() returns the SHA-256 merkle tree root of the specified file,\n@@ -486,34 +486,34 @@\n index is a pad-file.
\n file_name() returns just the name of the file, whereas\n file_path() returns the path (inside the torrent file) with\n the filename appended.
\n file_offset() returns the byte offset within the torrent file\n where this file starts. It can be used to map the file to a piece\n index (given the piece size).
\n-\n \n-[report issue]\n-\n+\n+file_piece_range() file_num_blocks() file_num_pieces()
\n \n-int file_num_blocks (file_index_t index) const;\n index_range<piece_index_t::diff_type> file_piece_range (file_index_t) const;\n int file_num_pieces (file_index_t index) const;\n+int file_num_blocks (file_index_t index) const;\n
\n Returns the number of pieces or blocks the file at index spans,\n under the assumption that the file is aligned to the start of a piece.\n This is only meaningful for v2 torrents, where files are guaranteed\n such alignment.\n These numbers are used to size and navigate the merkle hash tree for\n each file.
\n-\n-[report issue]\n-\n+\n+file_first_piece_node() file_first_block_node()
\n \n int file_first_piece_node (file_index_t index) const;\n int file_first_block_node (file_index_t index) const;\n
\n index of first piece node in the merkle tree
\n [report issue]\n \n@@ -547,21 +547,21 @@\n file_absolute_path()
\n \n bool file_absolute_path (file_index_t index) const;\n
\n returns true if the file at the specified index has been renamed to\n have an absolute path, i.e. is not anchored in the save path of the\n torrent.
\n-\n-[report issue]\n-\n+\n+file_index_at_piece() file_index_at_offset()
\n \n-file_index_t file_index_at_piece (piece_index_t piece) const;\n file_index_t file_index_at_offset (std::int64_t offset) const;\n+file_index_t file_index_at_piece (piece_index_t piece) const;\n
\n returns the index of the file at the given offset in the torrent
\n [report issue]\n \n file_index_for_root()
\n \n file_index_t file_index_for_root (sha256_hash const& root_hash) const;\n@@ -630,56 +630,56 @@\n file_storage const* mapped_files = nullptr;\n std::string const& path;\n storage_mode_t mode {storage_mode_sparse};\n aux::vector<download_priority_t, file_index_t> const& priorities;\n sha1_hash info_hash;\n };\n \n-[report issue]\n-\n+\n+posix_disk_io_constructor()
\n+Declared in "libtorrent/posix_disk_io.hpp"
\n \n-std::unique_ptr<disk_interface> mmap_disk_io_constructor (\n+std::unique_ptr<disk_interface> posix_disk_io_constructor (\n io_context& ios, settings_interface const&, counters& cnt);\n
\n-constructs a memory mapped file disk I/O object.
\n+this is a simple posix disk I/O back-end, used for systems that don't\n+have a 64 bit virtual address space or don't support memory mapped files.\n+It's implemented using portable C file functions and is single-threaded.
\n [report issue]\n \n default_disk_io_constructor()
\n Declared in "libtorrent/session.hpp"
\n \n std::unique_ptr<disk_interface> default_disk_io_constructor (\n io_context& ios, settings_interface const&, counters& cnt);\n
\n the constructor function for the default storage. On systems that support\n memory mapped files (and a 64 bit address space) the memory mapped storage\n will be constructed, otherwise the portable posix storage.
\n+[report issue]\n+\n+mmap_disk_io_constructor()
\n+Declared in "libtorrent/mmap_disk_io.hpp"
\n+\n+std::unique_ptr<disk_interface> mmap_disk_io_constructor (\n+ io_context& ios, settings_interface const&, counters& cnt);\n+
\n+constructs a memory mapped file disk I/O object.
\n [report issue]\n \n disabled_disk_io_constructor()
\n Declared in "libtorrent/disabled_disk_io.hpp"
\n \n std::unique_ptr<disk_interface> disabled_disk_io_constructor (\n io_context& ios, settings_interface const&, counters& cnt);\n
\n creates a disk io object that discards all data written to it, and only\n returns zero-buffers when read from. May be useful for testing and\n benchmarking.
\n-[report issue]\n-\n-posix_disk_io_constructor()
\n-Declared in "libtorrent/posix_disk_io.hpp"
\n-\n-std::unique_ptr<disk_interface> posix_disk_io_constructor (\n- io_context& ios, settings_interface const&, counters& cnt);\n-
\n-this is a simple posix disk I/O back-end, used for systems that don't\n-have a 64 bit virtual address space or don't support memory mapped files.\n-It's implemented using portable C file functions and is single-threaded.
\n [report issue]\n \n enum storage_mode_t
\n Declared in "libtorrent/storage_defs.hpp"
\n \n \n m\bma\bap\bp_\b_b\bbl\blo\boc\bck\bk (piece_index_t piece, std::int64_t offset\n , std::int64_t size) const;\n peer_request m\bma\bap\bp_\b_f\bfi\bil\ble\be (file_index_t file, std::int64_t offset, int size)\n const;\n int n\bnu\bum\bm_\b_f\bfi\bil\ble\bes\bs () const noexcept;\n file_index_t e\ben\bnd\bd_\b_f\bfi\bil\ble\be () const noexcept;\n index_range f\bfi\bil\ble\be_\b_r\bra\ban\bng\bge\be () const noexcept;\n std::int64_t t\bto\bot\bta\bal\bl_\b_s\bsi\biz\bze\be () const;\n- void s\bse\bet\bt_\b_n\bnu\bum\bm_\b_p\bpi\bie\bec\bce\bes\bs (int n);\n int n\bnu\bum\bm_\b_p\bpi\bie\bec\bce\bes\bs () const;\n+ void s\bse\bet\bt_\b_n\bnu\bum\bm_\b_p\bpi\bie\bec\bce\bes\bs (int n);\n piece_index_t e\ben\bnd\bd_\b_p\bpi\bie\bec\bce\be () const;\n piece_index_t l\bla\bas\bst\bt_\b_p\bpi\bie\bec\bce\be () const;\n index_range p\bpi\bie\bec\bce\be_\b_r\bra\ban\bng\bge\be () const noexcept;\n- int p\bpi\bie\bec\bce\be_\b_l\ble\ben\bng\bgt\bth\bh () const;\n void s\bse\bet\bt_\b_p\bpi\bie\bec\bce\be_\b_l\ble\ben\bng\bgt\bth\bh (int l);\n+ int p\bpi\bie\bec\bce\be_\b_l\ble\ben\bng\bgt\bth\bh () const;\n int p\bpi\bie\bec\bce\be_\b_s\bsi\biz\bze\be (piece_index_t index) const;\n int p\bpi\bie\bec\bce\be_\b_s\bsi\biz\bze\be2\b2 (piece_index_t index) const;\n int b\bbl\blo\boc\bck\bks\bs_\b_i\bin\bn_\b_p\bpi\bie\bec\bce\be2\b2 (piece_index_t index) const;\n int b\bbl\blo\boc\bck\bks\bs_\b_p\bpe\ber\br_\b_p\bpi\bie\bec\bce\be () const;\n- std::string const& n\bna\bam\bme\be () const;\n void s\bse\bet\bt_\b_n\bna\bam\bme\be (std::string const& n);\n+ std::string const& n\bna\bam\bme\be () const;\n void s\bsw\bwa\bap\bp (file_storage& ti) noexcept;\n void c\bca\ban\bno\bon\bni\bic\bca\bal\bli\biz\bze\be ();\n- std::string s\bsy\bym\bml\bli\bin\bnk\bk (file_index_t index) const;\n- std::int64_t f\bfi\bil\ble\be_\b_s\bsi\biz\bze\be (file_index_t index) const;\n- sha256_hash r\bro\boo\bot\bt (file_index_t index) const;\n- std::int64_t f\bfi\bil\ble\be_\b_o\bof\bff\bfs\bse\bet\bt (file_index_t index) const;\n char const* r\bro\boo\bot\bt_\b_p\bpt\btr\br (file_index_t const index) const;\n- std::time_t m\bmt\bti\bim\bme\be (file_index_t index) const;\n std::string f\bfi\bil\ble\be_\b_p\bpa\bat\bth\bh (file_index_t index, std::string const& save_path =\n \"\") const;\n- sha1_hash h\bha\bas\bsh\bh (file_index_t index) const;\n+ std::int64_t f\bfi\bil\ble\be_\b_o\bof\bff\bfs\bse\bet\bt (file_index_t index) const;\n string_view f\bfi\bil\ble\be_\b_n\bna\bam\bme\be (file_index_t index) const;\n bool p\bpa\bad\bd_\b_f\bfi\bil\ble\be_\b_a\bat\bt (file_index_t index) const;\n- int f\bfi\bil\ble\be_\b_n\bnu\bum\bm_\b_b\bbl\blo\boc\bck\bks\bs (file_index_t index) const;\n+ std::string s\bsy\bym\bml\bli\bin\bnk\bk (file_index_t index) const;\n+ std::int64_t f\bfi\bil\ble\be_\b_s\bsi\biz\bze\be (file_index_t index) const;\n+ sha1_hash h\bha\bas\bsh\bh (file_index_t index) const;\n+ std::time_t m\bmt\bti\bim\bme\be (file_index_t index) const;\n+ sha256_hash r\bro\boo\bot\bt (file_index_t index) const;\n index_range f\bfi\bil\ble\be_\b_p\bpi\bie\bec\bce\be_\b_r\bra\ban\bng\bge\be (file_index_t) const;\n int f\bfi\bil\ble\be_\b_n\bnu\bum\bm_\b_p\bpi\bie\bec\bce\bes\bs (file_index_t index) const;\n+ int f\bfi\bil\ble\be_\b_n\bnu\bum\bm_\b_b\bbl\blo\boc\bck\bks\bs (file_index_t index) const;\n int f\bfi\bil\ble\be_\b_f\bfi\bir\brs\bst\bt_\b_p\bpi\bie\bec\bce\be_\b_n\bno\bod\bde\be (file_index_t index) const;\n int f\bfi\bil\ble\be_\b_f\bfi\bir\brs\bst\bt_\b_b\bbl\blo\boc\bck\bk_\b_n\bno\bod\bde\be (file_index_t index) const;\n std::uint32_t f\bfi\bil\ble\be_\b_p\bpa\bat\bth\bh_\b_h\bha\bas\bsh\bh (file_index_t index, std::string const&\n save_path) const;\n void a\bal\bll\bl_\b_p\bpa\bat\bth\bh_\b_h\bha\bas\bsh\bhe\bes\bs (std::unordered_set& table) const;\n file_flags_t f\bfi\bil\ble\be_\b_f\bfl\bla\bag\bgs\bs (file_index_t index) const;\n bool f\bfi\bil\ble\be_\b_a\bab\bbs\bso\bol\blu\but\bte\be_\b_p\bpa\bat\bth\bh (file_index_t index) const;\n- file_index_t f\bfi\bil\ble\be_\b_i\bin\bnd\bde\bex\bx_\b_a\bat\bt_\b_p\bpi\bie\bec\bce\be (piece_index_t piece) const;\n file_index_t f\bfi\bil\ble\be_\b_i\bin\bnd\bde\bex\bx_\b_a\bat\bt_\b_o\bof\bff\bfs\bse\bet\bt (std::int64_t offset) const;\n+ file_index_t f\bfi\bil\ble\be_\b_i\bin\bnd\bde\bex\bx_\b_a\bat\bt_\b_p\bpi\bie\bec\bce\be (piece_index_t piece) const;\n file_index_t f\bfi\bil\ble\be_\b_i\bin\bnd\bde\bex\bx_\b_f\bfo\bor\br_\b_r\bro\boo\bot\bt (sha256_hash const& root_hash) const;\n piece_index_t p\bpi\bie\bec\bce\be_\b_i\bin\bnd\bde\bex\bx_\b_a\bat\bt_\b_f\bfi\bil\ble\be (file_index_t f) const;\n void s\bsa\ban\bni\bit\bti\biz\bze\be_\b_s\bsy\bym\bml\bli\bin\bnk\bks\bs ();\n bool v\bv2\b2 () const;\n \n static constexpr file_flags_t f\bfl\bla\bag\bg_\b_p\bpa\bad\bd_\b_f\bfi\bil\ble\be = 0_bit;\n static constexpr file_flags_t f\bfl\bla\bag\bg_\b_h\bhi\bid\bdd\bde\ben\bn = 1_bit;\n@@ -166,33 +166,33 @@\n [_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n *\b**\b**\b**\b**\b* r\bre\bes\bse\ber\brv\bve\be(\b()\b) *\b**\b**\b**\b**\b*\n void r\bre\bes\bse\ber\brv\bve\be (int num_files);\n allocates space for num_files in the internal file list. This can be used to\n avoid reallocating the internal file list when the number of files to be added\n is known up-front.\n [_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b* a\bad\bdd\bd_\b_f\bfi\bil\ble\be_\b_b\bbo\bor\brr\bro\bow\bw(\b()\b) a\bad\bdd\bd_\b_f\bfi\bil\ble\be(\b()\b) *\b**\b**\b**\b**\b*\n-void a\bad\bdd\bd_\b_f\bfi\bil\ble\be_\b_b\bbo\bor\brr\bro\bow\bw (string_view filename\n+*\b**\b**\b**\b**\b* a\bad\bdd\bd_\b_f\bfi\bil\ble\be(\b()\b) a\bad\bdd\bd_\b_f\bfi\bil\ble\be_\b_b\bbo\bor\brr\bro\bow\bw(\b()\b) *\b**\b**\b**\b**\b*\n+void a\bad\bdd\bd_\b_f\bfi\bil\ble\be_\b_b\bbo\bor\brr\bro\bow\bw (error_code& ec, string_view filename\n , std::string const& path, std::int64_t file_size\n , file_flags_t file_flags = {}, char const* filehash = nullptr\n , std::int64_t mtime = 0, string_view symlink_path = string_view()\n , char const* root_hash = nullptr);\n void a\bad\bdd\bd_\b_f\bfi\bil\ble\be (error_code& ec, std::string const& path, std::int64_t file_size\n , file_flags_t file_flags = {}\n , std::time_t mtime = 0, string_view symlink_path = string_view()\n , char const* root_hash = nullptr);\n-void a\bad\bdd\bd_\b_f\bfi\bil\ble\be (std::string const& path, std::int64_t file_size\n- , file_flags_t file_flags = {}\n- , std::time_t mtime = 0, string_view symlink_path = string_view()\n- , char const* root_hash = nullptr);\n-void a\bad\bdd\bd_\b_f\bfi\bil\ble\be_\b_b\bbo\bor\brr\bro\bow\bw (error_code& ec, string_view filename\n+void a\bad\bdd\bd_\b_f\bfi\bil\ble\be_\b_b\bbo\bor\brr\bro\bow\bw (string_view filename\n , std::string const& path, std::int64_t file_size\n , file_flags_t file_flags = {}, char const* filehash = nullptr\n , std::int64_t mtime = 0, string_view symlink_path = string_view()\n , char const* root_hash = nullptr);\n+void a\bad\bdd\bd_\b_f\bfi\bil\ble\be (std::string const& path, std::int64_t file_size\n+ , file_flags_t file_flags = {}\n+ , std::time_t mtime = 0, string_view symlink_path = string_view()\n+ , char const* root_hash = nullptr);\n Adds a file to the file storage. The add_file_borrow version expects that\n filename is the file name (without a path) of the file that's being added. This\n memory is b\bbo\bor\brr\bro\bow\bwe\bed\bd, i.e. it is the caller's responsibility to make sure it\n stays valid throughout the lifetime of this _\bf_\bi_\bl_\be_\b__\bs_\bt_\bo_\br_\ba_\bg_\be object or any copy of\n it. The same thing applies to filehash, which is an optional pointer to a 20\n byte binary SHA-1 hash of the file.\n if filename is empty, the filename from path is used and not borrowed.\n@@ -261,17 +261,17 @@\n range-for loop. Where the values are the indices of all files in the\n _\bf_\bi_\bl_\be_\b__\bs_\bt_\bo_\br_\ba_\bg_\be.\n [_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n *\b**\b**\b**\b**\b* t\bto\bot\bta\bal\bl_\b_s\bsi\biz\bze\be(\b()\b) *\b**\b**\b**\b**\b*\n std::int64_t t\bto\bot\bta\bal\bl_\b_s\bsi\biz\bze\be () const;\n returns the total number of bytes all the files in this torrent spans\n [_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b* s\bse\bet\bt_\b_n\bnu\bum\bm_\b_p\bpi\bie\bec\bce\bes\bs(\b()\b) n\bnu\bum\bm_\b_p\bpi\bie\bec\bce\bes\bs(\b()\b) *\b**\b**\b**\b**\b*\n-void s\bse\bet\bt_\b_n\bnu\bum\bm_\b_p\bpi\bie\bec\bce\bes\bs (int n);\n+*\b**\b**\b**\b**\b* n\bnu\bum\bm_\b_p\bpi\bie\bec\bce\bes\bs(\b()\b) s\bse\bet\bt_\b_n\bnu\bum\bm_\b_p\bpi\bie\bec\bce\bes\bs(\b()\b) *\b**\b**\b**\b**\b*\n int n\bnu\bum\bm_\b_p\bpi\bie\bec\bce\bes\bs () const;\n+void s\bse\bet\bt_\b_n\bnu\bum\bm_\b_p\bpi\bie\bec\bce\bes\bs (int n);\n set and get the number of pieces in the torrent\n [_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n *\b**\b**\b**\b**\b* e\ben\bnd\bd_\b_p\bpi\bie\bec\bce\be(\b()\b) *\b**\b**\b**\b**\b*\n piece_index_t e\ben\bnd\bd_\b_p\bpi\bie\bec\bce\be () const;\n returns the index of the one-past-end piece in the file storage\n [_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n *\b**\b**\b**\b**\b* l\bla\bas\bst\bt_\b_p\bpi\bie\bec\bce\be(\b()\b) *\b**\b**\b**\b**\b*\n@@ -282,17 +282,17 @@\n [_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n *\b**\b**\b**\b**\b* p\bpi\bie\bec\bce\be_\b_r\bra\ban\bng\bge\be(\b()\b) *\b**\b**\b**\b**\b*\n index_range p\bpi\bie\bec\bce\be_\b_r\bra\ban\bng\bge\be () const noexcept;\n returns an implementation-defined type that can be used as the container in a\n range-for loop. Where the values are the indices of all pieces in the\n _\bf_\bi_\bl_\be_\b__\bs_\bt_\bo_\br_\ba_\bg_\be.\n [_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b* p\bpi\bie\bec\bce\be_\b_l\ble\ben\bng\bgt\bth\bh(\b()\b) s\bse\bet\bt_\b_p\bpi\bie\bec\bce\be_\b_l\ble\ben\bng\bgt\bth\bh(\b()\b) *\b**\b**\b**\b**\b*\n-int p\bpi\bie\bec\bce\be_\b_l\ble\ben\bng\bgt\bth\bh () const;\n+*\b**\b**\b**\b**\b* s\bse\bet\bt_\b_p\bpi\bie\bec\bce\be_\b_l\ble\ben\bng\bgt\bth\bh(\b()\b) p\bpi\bie\bec\bce\be_\b_l\ble\ben\bng\bgt\bth\bh(\b()\b) *\b**\b**\b**\b**\b*\n void s\bse\bet\bt_\b_p\bpi\bie\bec\bce\be_\b_l\ble\ben\bng\bgt\bth\bh (int l);\n+int p\bpi\bie\bec\bce\be_\b_l\ble\ben\bng\bgt\bth\bh () const;\n set and get the size of each piece in this torrent. It must be a power of two\n and at least 16 kiB.\n [_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n *\b**\b**\b**\b**\b* p\bpi\bie\bec\bce\be_\b_s\bsi\biz\bze\be(\b()\b) *\b**\b**\b**\b**\b*\n int p\bpi\bie\bec\bce\be_\b_s\bsi\biz\bze\be (piece_index_t index) const;\n returns the piece size of index. This will be the same as _\bp_\bi_\be_\bc_\be_\b__\bl_\be_\bn_\bg_\bt_\bh_\b(_\b),\n except for the last piece, which may be shorter.\n@@ -309,41 +309,41 @@\n returns the number of blocks in the specified piece, for v2 torrents.\n [_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n *\b**\b**\b**\b**\b* b\bbl\blo\boc\bck\bks\bs_\b_p\bpe\ber\br_\b_p\bpi\bie\bec\bce\be(\b()\b) *\b**\b**\b**\b**\b*\n int b\bbl\blo\boc\bck\bks\bs_\b_p\bpe\ber\br_\b_p\bpi\bie\bec\bce\be () const;\n returns the number of blocks there are in the typical piece. There may be fewer\n in the last piece)\n [_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b* s\bse\bet\bt_\b_n\bna\bam\bme\be(\b()\b) n\bna\bam\bme\be(\b()\b) *\b**\b**\b**\b**\b*\n-std::string const& n\bna\bam\bme\be () const;\n+*\b**\b**\b**\b**\b* n\bna\bam\bme\be(\b()\b) s\bse\bet\bt_\b_n\bna\bam\bme\be(\b()\b) *\b**\b**\b**\b**\b*\n void s\bse\bet\bt_\b_n\bna\bam\bme\be (std::string const& n);\n+std::string const& n\bna\bam\bme\be () const;\n set and get the name of this torrent. For multi-file torrents, this is also the\n name of the root directory all the files are stored in.\n [_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n *\b**\b**\b**\b**\b* s\bsw\bwa\bap\bp(\b()\b) *\b**\b**\b**\b**\b*\n void s\bsw\bwa\bap\bp (file_storage& ti) noexcept;\n swap all content of t\bth\bhi\bis\bs with t\bti\bi.\n [_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n *\b**\b**\b**\b**\b* c\bca\ban\bno\bon\bni\bic\bca\bal\bli\biz\bze\be(\b()\b) *\b**\b**\b**\b**\b*\n void c\bca\ban\bno\bon\bni\bic\bca\bal\bli\biz\bze\be ();\n arrange files and padding to match the canonical form required by BEP 52\n [_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b* m\bmt\bti\bim\bme\be(\b()\b) f\bfi\bil\ble\be_\b_s\bsi\biz\bze\be(\b()\b) r\bro\boo\bot\bt_\b_p\bpt\btr\br(\b()\b) p\bpa\bad\bd_\b_f\bfi\bil\ble\be_\b_a\bat\bt(\b()\b) f\bfi\bil\ble\be_\b_n\bna\bam\bme\be(\b()\b) h\bha\bas\bsh\bh(\b()\b) s\bsy\bym\bml\bli\bin\bnk\bk(\b()\b)\n-r\bro\boo\bot\bt(\b()\b) f\bfi\bil\ble\be_\b_o\bof\bff\bfs\bse\bet\bt(\b()\b) f\bfi\bil\ble\be_\b_p\bpa\bat\bth\bh(\b()\b) *\b**\b**\b**\b**\b*\n-std::string s\bsy\bym\bml\bli\bin\bnk\bk (file_index_t index) const;\n-std::int64_t f\bfi\bil\ble\be_\b_s\bsi\biz\bze\be (file_index_t index) const;\n-sha256_hash r\bro\boo\bot\bt (file_index_t index) const;\n-std::int64_t f\bfi\bil\ble\be_\b_o\bof\bff\bfs\bse\bet\bt (file_index_t index) const;\n+*\b**\b**\b**\b**\b* s\bsy\bym\bml\bli\bin\bnk\bk(\b()\b) p\bpa\bad\bd_\b_f\bfi\bil\ble\be_\b_a\bat\bt(\b()\b) f\bfi\bil\ble\be_\b_o\bof\bff\bfs\bse\bet\bt(\b()\b) r\bro\boo\bot\bt_\b_p\bpt\btr\br(\b()\b) r\bro\boo\bot\bt(\b()\b) f\bfi\bil\ble\be_\b_s\bsi\biz\bze\be(\b()\b)\n+f\bfi\bil\ble\be_\b_n\bna\bam\bme\be(\b()\b) f\bfi\bil\ble\be_\b_p\bpa\bat\bth\bh(\b()\b) h\bha\bas\bsh\bh(\b()\b) m\bmt\bti\bim\bme\be(\b()\b) *\b**\b**\b**\b**\b*\n char const* r\bro\boo\bot\bt_\b_p\bpt\btr\br (file_index_t const index) const;\n-std::time_t m\bmt\bti\bim\bme\be (file_index_t index) const;\n std::string f\bfi\bil\ble\be_\b_p\bpa\bat\bth\bh (file_index_t index, std::string const& save_path = \"\")\n const;\n-sha1_hash h\bha\bas\bsh\bh (file_index_t index) const;\n+std::int64_t f\bfi\bil\ble\be_\b_o\bof\bff\bfs\bse\bet\bt (file_index_t index) const;\n string_view f\bfi\bil\ble\be_\b_n\bna\bam\bme\be (file_index_t index) const;\n bool p\bpa\bad\bd_\b_f\bfi\bil\ble\be_\b_a\bat\bt (file_index_t index) const;\n+std::string s\bsy\bym\bml\bli\bin\bnk\bk (file_index_t index) const;\n+std::int64_t f\bfi\bil\ble\be_\b_s\bsi\biz\bze\be (file_index_t index) const;\n+sha1_hash h\bha\bas\bsh\bh (file_index_t index) const;\n+std::time_t m\bmt\bti\bim\bme\be (file_index_t index) const;\n+sha256_hash r\bro\boo\bot\bt (file_index_t index) const;\n These functions are used to query attributes of files at a given index.\n The hash() is a SHA-1 hash of the file, or 0 if none was provided in the\n torrent file. This can potentially be used to join a bittorrent network with\n other file sharing networks.\n root() returns the SHA-256 merkle tree root of the specified file, in case this\n is a v2 torrent. Otherwise returns zeros. root_ptr() returns a pointer to the\n SHA-256 merkle tree root hash for the specified file. The pointer points into\n@@ -356,24 +356,24 @@\n file_size() returns the size of a file.\n pad_file_at() returns true if the file at the given index is a pad-file.\n file_name() returns j\bju\bus\bst\bt the name of the file, whereas file_path() returns the\n path (inside the torrent file) with the filename appended.\n file_offset() returns the byte offset within the torrent file where this file\n starts. It can be used to map the file to a piece index (given the piece size).\n [_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b* f\bfi\bil\ble\be_\b_n\bnu\bum\bm_\b_p\bpi\bie\bec\bce\bes\bs(\b()\b) f\bfi\bil\ble\be_\b_p\bpi\bie\bec\bce\be_\b_r\bra\ban\bng\bge\be(\b()\b) f\bfi\bil\ble\be_\b_n\bnu\bum\bm_\b_b\bbl\blo\boc\bck\bks\bs(\b()\b) *\b**\b**\b**\b**\b*\n-int f\bfi\bil\ble\be_\b_n\bnu\bum\bm_\b_b\bbl\blo\boc\bck\bks\bs (file_index_t index) const;\n+*\b**\b**\b**\b**\b* f\bfi\bil\ble\be_\b_p\bpi\bie\bec\bce\be_\b_r\bra\ban\bng\bge\be(\b()\b) f\bfi\bil\ble\be_\b_n\bnu\bum\bm_\b_b\bbl\blo\boc\bck\bks\bs(\b()\b) f\bfi\bil\ble\be_\b_n\bnu\bum\bm_\b_p\bpi\bie\bec\bce\bes\bs(\b()\b) *\b**\b**\b**\b**\b*\n index_range f\bfi\bil\ble\be_\b_p\bpi\bie\bec\bce\be_\b_r\bra\ban\bng\bge\be (file_index_t) const;\n int f\bfi\bil\ble\be_\b_n\bnu\bum\bm_\b_p\bpi\bie\bec\bce\bes\bs (file_index_t index) const;\n+int f\bfi\bil\ble\be_\b_n\bnu\bum\bm_\b_b\bbl\blo\boc\bck\bks\bs (file_index_t index) const;\n Returns the number of pieces or blocks the file atindexspans, under the\n assumption that the file is aligned to the start of a piece. This is only\n meaningful for v2 torrents, where files are guaranteed such alignment. These\n numbers are used to size and navigate the merkle hash tree for each file.\n [_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b* f\bfi\bil\ble\be_\b_f\bfi\bir\brs\bst\bt_\b_b\bbl\blo\boc\bck\bk_\b_n\bno\bod\bde\be(\b()\b) f\bfi\bil\ble\be_\b_f\bfi\bir\brs\bst\bt_\b_p\bpi\bie\bec\bce\be_\b_n\bno\bod\bde\be(\b()\b) *\b**\b**\b**\b**\b*\n+*\b**\b**\b**\b**\b* f\bfi\bil\ble\be_\b_f\bfi\bir\brs\bst\bt_\b_p\bpi\bie\bec\bce\be_\b_n\bno\bod\bde\be(\b()\b) f\bfi\bil\ble\be_\b_f\bfi\bir\brs\bst\bt_\b_b\bbl\blo\boc\bck\bk_\b_n\bno\bod\bde\be(\b()\b) *\b**\b**\b**\b**\b*\n int f\bfi\bil\ble\be_\b_f\bfi\bir\brs\bst\bt_\b_p\bpi\bie\bec\bce\be_\b_n\bno\bod\bde\be (file_index_t index) const;\n int f\bfi\bil\ble\be_\b_f\bfi\bir\brs\bst\bt_\b_b\bbl\blo\boc\bck\bk_\b_n\bno\bod\bde\be (file_index_t index) const;\n index of first piece node in the merkle tree\n [_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n *\b**\b**\b**\b**\b* f\bfi\bil\ble\be_\b_p\bpa\bat\bth\bh_\b_h\bha\bas\bsh\bh(\b()\b) *\b**\b**\b**\b**\b*\n std::uint32_t f\bfi\bil\ble\be_\b_p\bpa\bat\bth\bh_\b_h\bha\bas\bsh\bh (file_index_t index, std::string const& save_path)\n const;\n@@ -392,17 +392,17 @@\n returns a bitmask of flags from file_flags_t that apply to file at index.\n [_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n *\b**\b**\b**\b**\b* f\bfi\bil\ble\be_\b_a\bab\bbs\bso\bol\blu\but\bte\be_\b_p\bpa\bat\bth\bh(\b()\b) *\b**\b**\b**\b**\b*\n bool f\bfi\bil\ble\be_\b_a\bab\bbs\bso\bol\blu\but\bte\be_\b_p\bpa\bat\bth\bh (file_index_t index) const;\n returns true if the file at the specified index has been renamed to have an\n absolute path, i.e. is not anchored in the save path of the torrent.\n [_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b* f\bfi\bil\ble\be_\b_i\bin\bnd\bde\bex\bx_\b_a\bat\bt_\b_o\bof\bff\bfs\bse\bet\bt(\b()\b) f\bfi\bil\ble\be_\b_i\bin\bnd\bde\bex\bx_\b_a\bat\bt_\b_p\bpi\bie\bec\bce\be(\b()\b) *\b**\b**\b**\b**\b*\n-file_index_t f\bfi\bil\ble\be_\b_i\bin\bnd\bde\bex\bx_\b_a\bat\bt_\b_p\bpi\bie\bec\bce\be (piece_index_t piece) const;\n+*\b**\b**\b**\b**\b* f\bfi\bil\ble\be_\b_i\bin\bnd\bde\bex\bx_\b_a\bat\bt_\b_p\bpi\bie\bec\bce\be(\b()\b) f\bfi\bil\ble\be_\b_i\bin\bnd\bde\bex\bx_\b_a\bat\bt_\b_o\bof\bff\bfs\bse\bet\bt(\b()\b) *\b**\b**\b**\b**\b*\n file_index_t f\bfi\bil\ble\be_\b_i\bin\bnd\bde\bex\bx_\b_a\bat\bt_\b_o\bof\bff\bfs\bse\bet\bt (std::int64_t offset) const;\n+file_index_t f\bfi\bil\ble\be_\b_i\bin\bnd\bde\bex\bx_\b_a\bat\bt_\b_p\bpi\bie\bec\bce\be (piece_index_t piece) const;\n returns the index of the file at the given offset in the torrent\n [_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n *\b**\b**\b**\b**\b* f\bfi\bil\ble\be_\b_i\bin\bnd\bde\bex\bx_\b_f\bfo\bor\br_\b_r\bro\boo\bot\bt(\b()\b) *\b**\b**\b**\b**\b*\n file_index_t f\bfi\bil\ble\be_\b_i\bin\bnd\bde\bex\bx_\b_f\bfo\bor\br_\b_r\bro\boo\bot\bt (sha256_hash const& root_hash) const;\n finds the file with the given root hash and returns its index if there is no\n file with the root hash, file_index_t{-1} is returned\n [_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n@@ -450,43 +450,43 @@\n file_storage const* m\bma\bap\bpp\bpe\bed\bd_\b_f\bfi\bil\ble\bes\bs = nullptr;\n std::string const& path;\n storage_mode_t m\bmo\bod\bde\be {storage_mode_sparse};\n aux::vector const& priorities;\n sha1_hash info_hash;\n };\n [_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b**\b* m\bmm\bma\bap\bp_\b_d\bdi\bis\bsk\bk_\b_i\bio\bo_\b_c\bco\bon\bns\bst\btr\bru\buc\bct\bto\bor\br(\b()\b) *\b**\b**\b**\b**\b**\b*\n-Declared in \"_\bl_\bi_\bb_\bt_\bo_\br_\br_\be_\bn_\bt_\b/_\bm_\bm_\ba_\bp_\b__\bd_\bi_\bs_\bk_\b__\bi_\bo_\b._\bh_\bp_\bp\"\n-std::unique_ptr m\bmm\bma\bap\bp_\b_d\bdi\bis\bsk\bk_\b_i\bio\bo_\b_c\bco\bon\bns\bst\btr\bru\buc\bct\bto\bor\br (\n+*\b**\b**\b**\b**\b**\b* p\bpo\bos\bsi\bix\bx_\b_d\bdi\bis\bsk\bk_\b_i\bio\bo_\b_c\bco\bon\bns\bst\btr\bru\buc\bct\bto\bor\br(\b()\b) *\b**\b**\b**\b**\b**\b*\n+Declared in \"_\bl_\bi_\bb_\bt_\bo_\br_\br_\be_\bn_\bt_\b/_\bp_\bo_\bs_\bi_\bx_\b__\bd_\bi_\bs_\bk_\b__\bi_\bo_\b._\bh_\bp_\bp\"\n+std::unique_ptr p\bpo\bos\bsi\bix\bx_\b_d\bdi\bis\bsk\bk_\b_i\bio\bo_\b_c\bco\bon\bns\bst\btr\bru\buc\bct\bto\bor\br (\n io_context& ios, settings_interface const&, counters& cnt);\n-constructs a memory mapped file disk I/O object.\n+this is a simple posix disk I/O back-end, used for systems that don't have a 64\n+bit virtual address space or don't support memory mapped files. It's\n+implemented using portable C file functions and is single-threaded.\n [_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n *\b**\b**\b**\b**\b**\b* d\bde\bef\bfa\bau\bul\blt\bt_\b_d\bdi\bis\bsk\bk_\b_i\bio\bo_\b_c\bco\bon\bns\bst\btr\bru\buc\bct\bto\bor\br(\b()\b) *\b**\b**\b**\b**\b**\b*\n Declared in \"_\bl_\bi_\bb_\bt_\bo_\br_\br_\be_\bn_\bt_\b/_\bs_\be_\bs_\bs_\bi_\bo_\bn_\b._\bh_\bp_\bp\"\n std::unique_ptr d\bde\bef\bfa\bau\bul\blt\bt_\b_d\bdi\bis\bsk\bk_\b_i\bio\bo_\b_c\bco\bon\bns\bst\btr\bru\buc\bct\bto\bor\br (\n io_context& ios, settings_interface const&, counters& cnt);\n the constructor function for the default storage. On systems that support\n memory mapped files (and a 64 bit address space) the memory mapped storage will\n be constructed, otherwise the portable posix storage.\n [_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n+*\b**\b**\b**\b**\b**\b* m\bmm\bma\bap\bp_\b_d\bdi\bis\bsk\bk_\b_i\bio\bo_\b_c\bco\bon\bns\bst\btr\bru\buc\bct\bto\bor\br(\b()\b) *\b**\b**\b**\b**\b**\b*\n+Declared in \"_\bl_\bi_\bb_\bt_\bo_\br_\br_\be_\bn_\bt_\b/_\bm_\bm_\ba_\bp_\b__\bd_\bi_\bs_\bk_\b__\bi_\bo_\b._\bh_\bp_\bp\"\n+std::unique_ptr m\bmm\bma\bap\bp_\b_d\bdi\bis\bsk\bk_\b_i\bio\bo_\b_c\bco\bon\bns\bst\btr\bru\buc\bct\bto\bor\br (\n+ io_context& ios, settings_interface const&, counters& cnt);\n+constructs a memory mapped file disk I/O object.\n+[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n *\b**\b**\b**\b**\b**\b* d\bdi\bis\bsa\bab\bbl\ble\bed\bd_\b_d\bdi\bis\bsk\bk_\b_i\bio\bo_\b_c\bco\bon\bns\bst\btr\bru\buc\bct\bto\bor\br(\b()\b) *\b**\b**\b**\b**\b**\b*\n Declared in \"_\bl_\bi_\bb_\bt_\bo_\br_\br_\be_\bn_\bt_\b/_\bd_\bi_\bs_\ba_\bb_\bl_\be_\bd_\b__\bd_\bi_\bs_\bk_\b__\bi_\bo_\b._\bh_\bp_\bp\"\n std::unique_ptr d\bdi\bis\bsa\bab\bbl\ble\bed\bd_\b_d\bdi\bis\bsk\bk_\b_i\bio\bo_\b_c\bco\bon\bns\bst\btr\bru\buc\bct\bto\bor\br (\n io_context& ios, settings_interface const&, counters& cnt);\n creates a disk io object that discards all data written to it, and only returns\n zero-buffers when read from. May be useful for testing and benchmarking.\n [_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b**\b* p\bpo\bos\bsi\bix\bx_\b_d\bdi\bis\bsk\bk_\b_i\bio\bo_\b_c\bco\bon\bns\bst\btr\bru\buc\bct\bto\bor\br(\b()\b) *\b**\b**\b**\b**\b**\b*\n-Declared in \"_\bl_\bi_\bb_\bt_\bo_\br_\br_\be_\bn_\bt_\b/_\bp_\bo_\bs_\bi_\bx_\b__\bd_\bi_\bs_\bk_\b__\bi_\bo_\b._\bh_\bp_\bp\"\n-std::unique_ptr p\bpo\bos\bsi\bix\bx_\b_d\bdi\bis\bsk\bk_\b_i\bio\bo_\b_c\bco\bon\bns\bst\btr\bru\buc\bct\bto\bor\br (\n- io_context& ios, settings_interface const&, counters& cnt);\n-this is a simple posix disk I/O back-end, used for systems that don't have a 64\n-bit virtual address space or don't support memory mapped files. It's\n-implemented using portable C file functions and is single-threaded.\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n *\b**\b**\b**\b**\b**\b* e\ben\bnu\bum\bm s\bst\bto\bor\bra\bag\bge\be_\b_m\bmo\bod\bde\be_\b_t\bt *\b**\b**\b**\b**\b**\b*\n Declared in \"_\bl_\bi_\bb_\bt_\bo_\br_\br_\be_\bn_\bt_\b/_\bs_\bt_\bo_\br_\ba_\bg_\be_\b__\bd_\be_\bf_\bs_\b._\bh_\bp_\bp\"\n _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b \n |_\bn\bn_\ba\ba_\bm\bm_\be\be_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\bv\bv_\ba\ba_\bl\bl_\bu\bu_\be\be_\b|_\bd\bd_\be\be_\bs\bs_\bc\bc_\br\br_\bi\bi_\bp\bp_\bt\bt_\bi\bi_\bo\bo_\bn\bn_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n | | |All pieces will be written to their final |\n | | |position, all files will be allocated in full |\n |storage_mode_allocate|0 |when the torrent is first started. This mode |\n"}]}, {"source1": "./usr/share/doc/libtorrent-rasterbar-doc/html/reference-Torrent_Handle.html", "source2": "./usr/share/doc/libtorrent-rasterbar-doc/html/reference-Torrent_Handle.html", "unified_diff": "@@ -39,52 +39,52 @@\n \n - partial_piece_info
\n - torrent_handle
\n - torrent_handle()
\n - add_piece()
\n - read_piece()
\n - have_piece()
\n-- get_peer_info() post_peer_info()
\n-- post_status() status()
\n-- post_download_queue() get_download_queue()
\n-- set_piece_deadline() reset_piece_deadline() clear_piece_deadlines()
\n+- post_peer_info() get_peer_info()
\n+- status() post_status()
\n+- get_download_queue() post_download_queue()
\n+- clear_piece_deadlines() reset_piece_deadline() set_piece_deadline()
\n - file_progress() post_file_progress()
\n - file_status()
\n - clear_error()
\n-- add_tracker() replace_trackers() trackers() post_trackers()
\n-- url_seeds() remove_url_seed() add_url_seed()
\n-- http_seeds() add_http_seed() remove_http_seed()
\n+- post_trackers() trackers() replace_trackers() add_tracker()
\n+- add_url_seed() remove_url_seed() url_seeds()
\n+- http_seeds() remove_http_seed() add_http_seed()
\n - add_extension()
\n - set_metadata()
\n - is_valid()
\n - pause() resume()
\n-- unset_flags() flags() set_flags()
\n+- flags() set_flags() unset_flags()
\n - flush_cache()
\n - force_recheck()
\n - save_resume_data()
\n - need_save_resume_data()
\n-- queue_position_top() queue_position_bottom() queue_position() queue_position_down() queue_position_up()
\n+- queue_position_up() queue_position_down() queue_position_top() queue_position_bottom() queue_position()
\n - queue_position_set()
\n-- set_ssl_certificate() set_ssl_certificate_buffer()
\n+- set_ssl_certificate_buffer() set_ssl_certificate()
\n - torrent_file() torrent_file_with_hashes()
\n - piece_layers()
\n-- post_piece_availability() piece_availability()
\n-- prioritize_pieces() get_piece_priorities() piece_priority()
\n+- piece_availability() post_piece_availability()
\n+- piece_priority() get_piece_priorities() prioritize_pieces()
\n - prioritize_files() file_priority() get_file_priorities()
\n-- force_lsd_announce() force_dht_announce() force_reannounce()
\n+- force_reannounce() force_lsd_announce() force_dht_announce()
\n - scrape_tracker()
\n-- set_download_limit() set_upload_limit() upload_limit() download_limit()
\n+- upload_limit() set_download_limit() set_upload_limit() download_limit()
\n - connect_peer()
\n - clear_peers()
\n - max_uploads() set_max_uploads()
\n - max_connections() set_max_connections()
\n - move_storage()
\n - rename_file()
\n-- info_hashes() info_hash()
\n-- operator==() operator<() operator!=()
\n+- info_hash() info_hashes()
\n+- operator!=() operator<() operator==()
\n - id()
\n - native_handle()
\n - userdata()
\n - in_session()
\n
\n \n - hash_value()
\n@@ -94,16 +94,16 @@\n block_info
\n Declared in "libtorrent/torrent_handle.hpp"
\n holds the state of a block in a piece. Who we requested\n it from and how far along we are at downloading it.
\n \n struct block_info\n {\n- tcp::endpoint peer () const;\n void set_peer (tcp::endpoint const& ep);\n+ tcp::endpoint peer () const;\n \n enum block_state_t\n {\n none,\n requested,\n writing,\n finished,\n@@ -115,16 +115,16 @@\n unsigned num_peers:14;\n };\n \n \n [report issue]\n peer() set_peer()
\n \n-tcp::endpoint peer () const;\n void set_peer (tcp::endpoint const& ep);\n+tcp::endpoint peer () const;\n
\n The peer is the ip address of the peer this block was downloaded from.
\n [report issue]\n \n enum block_state_t
\n Declared in "libtorrent/torrent_handle.hpp"
\n \n@@ -254,119 +254,119 @@\n Which means you cannot perform any operation on it, unless you first\n assign it a valid handle. If you try to perform any operation on an\n uninitialized handle, it will throw invalid_handle.\n \n Warning
\n All operations on a torrent_handle may throw system_error\n exception, in case the handle is no longer referring to a torrent.\n-There is one exception is_valid() will never throw. Since the torrents\n+There is one exception is_valid() will never throw. Since the torrents\n are processed by a background thread, there is no guarantee that a\n handle will remain valid between two calls.
\n \n \n struct torrent_handle\n {\n friend std::size_t hash_value (torrent_handle const& th);\n torrent_handle () noexcept = default;\n void add_piece (piece_index_t piece, char const* data, add_piece_flags_t flags = {}) const;\n void add_piece (piece_index_t piece, std::vector<char> data, add_piece_flags_t flags = {}) const;\n void read_piece (piece_index_t piece) const;\n bool have_piece (piece_index_t piece) const;\n void post_peer_info () const;\n void get_peer_info (std::vector<peer_info>& v) const;\n- torrent_status status (status_flags_t flags = status_flags_t::all()) const;\n void post_status (status_flags_t flags = status_flags_t::all()) const;\n- void post_download_queue () const;\n+ torrent_status status (status_flags_t flags = status_flags_t::all()) const;\n std::vector<partial_piece_info> get_download_queue () const;\n+ void post_download_queue () const;\n void get_download_queue (std::vector<partial_piece_info>& queue) const;\n- void clear_piece_deadlines () const;\n void reset_piece_deadline (piece_index_t index) const;\n+ void clear_piece_deadlines () const;\n void set_piece_deadline (piece_index_t index, int deadline, deadline_flags_t flags = {}) const;\n- std::vector<std::int64_t> file_progress (file_progress_flags_t flags = {}) const;\n void file_progress (std::vector<std::int64_t>& progress, file_progress_flags_t flags = {}) const;\n+ std::vector<std::int64_t> file_progress (file_progress_flags_t flags = {}) const;\n void post_file_progress (file_progress_flags_t flags) const;\n std::vector<open_file_state> file_status () const;\n void clear_error () const;\n- std::vector<announce_entry> trackers () const;\n void post_trackers () const;\n- void add_tracker (announce_entry const&) const;\n+ std::vector<announce_entry> trackers () const;\n void replace_trackers (std::vector<announce_entry> const&) const;\n+ void add_tracker (announce_entry const&) const;\n void add_url_seed (std::string const& url) const;\n void remove_url_seed (std::string const& url) const;\n std::set<std::string> url_seeds () const;\n std::set<std::string> http_seeds () const;\n void remove_http_seed (std::string const& url) const;\n void add_http_seed (std::string const& url) const;\n void add_extension (\n std::function<std::shared_ptr<torrent_plugin>(torrent_handle const&, client_data_t)> const& ext\n , client_data_t userdata = client_data_t{});\n bool set_metadata (span<char const> metadata) const;\n bool is_valid () const;\n void resume () const;\n void pause (pause_flags_t flags = {}) const;\n- void set_flags (torrent_flags_t flags) const;\n+ void unset_flags (torrent_flags_t flags) const;\n void set_flags (torrent_flags_t flags, torrent_flags_t mask) const;\n+ void set_flags (torrent_flags_t flags) const;\n torrent_flags_t flags () const;\n- void unset_flags (torrent_flags_t flags) const;\n void flush_cache () const;\n void force_recheck () const;\n void save_resume_data (resume_data_flags_t flags = {}) const;\n bool need_save_resume_data () const;\n bool need_save_resume_data (resume_data_flags_t flags) const;\n void queue_position_up () const;\n void queue_position_top () const;\n void queue_position_bottom () const;\n queue_position_t queue_position () const;\n void queue_position_down () const;\n void queue_position_set (queue_position_t p) const;\n+ void set_ssl_certificate_buffer (std::string const& certificate\n+ , std::string const& private_key\n+ , std::string const& dh_params);\n void set_ssl_certificate (std::string const& certificate\n , std::string const& private_key\n , std::string const& dh_params\n , std::string const& passphrase = "");\n- void set_ssl_certificate_buffer (std::string const& certificate\n- , std::string const& private_key\n- , std::string const& dh_params);\n- std::shared_ptr<torrent_info> torrent_file_with_hashes () const;\n std::shared_ptr<const torrent_info> torrent_file () const;\n+ std::shared_ptr<torrent_info> torrent_file_with_hashes () const;\n std::vector<std::vector<sha256_hash>> piece_layers () const;\n void post_piece_availability () const;\n void piece_availability (std::vector<int>& avail) const;\n download_priority_t piece_priority (piece_index_t index) const;\n- void piece_priority (piece_index_t index, download_priority_t priority) const;\n+ void prioritize_pieces (std::vector<std::pair<piece_index_t, download_priority_t>> const& pieces) const;\n void prioritize_pieces (std::vector<download_priority_t> const& pieces) const;\n std::vector<download_priority_t> get_piece_priorities () const;\n- void prioritize_pieces (std::vector<std::pair<piece_index_t, download_priority_t>> const& pieces) const;\n- std::vector<download_priority_t> get_file_priorities () const;\n+ void piece_priority (piece_index_t index, download_priority_t priority) const;\n download_priority_t file_priority (file_index_t index) const;\n void prioritize_files (std::vector<download_priority_t> const& files) const;\n void file_priority (file_index_t index, download_priority_t priority) const;\n- void force_lsd_announce () const;\n+ std::vector<download_priority_t> get_file_priorities () const;\n void force_reannounce (int seconds = 0, int idx = -1, reannounce_flags_t = {}) const;\n+ void force_lsd_announce () const;\n void force_dht_announce () const;\n void scrape_tracker (int idx = -1) const;\n int download_limit () const;\n+ void set_download_limit (int limit) const;\n int upload_limit () const;\n void set_upload_limit (int limit) const;\n- void set_download_limit (int limit) const;\n void connect_peer (tcp::endpoint const& adr, peer_source_flags_t source = {}\n , pex_flags_t flags = pex_encryption | pex_utp | pex_holepunch) const;\n void clear_peers ();\n- void set_max_uploads (int max_uploads) const;\n int max_uploads () const;\n- void set_max_connections (int max_connections) const;\n+ void set_max_uploads (int max_uploads) const;\n int max_connections () const;\n+ void set_max_connections (int max_connections) const;\n void move_storage (std::string const& save_path\n , move_flags_t flags = move_flags_t::always_replace_files\n ) const;\n void rename_file (file_index_t index, std::string const& new_name) const;\n info_hash_t info_hashes () const;\n sha1_hash info_hash () const;\n bool operator< (const torrent_handle& h) const;\n- bool operator!= (const torrent_handle& h) const;\n bool operator== (const torrent_handle& h) const;\n+ bool operator!= (const torrent_handle& h) const;\n std::uint32_t id () const;\n std::shared_ptr<torrent> native_handle () const;\n client_data_t userdata () const;\n bool in_session () const;\n \n static constexpr add_piece_flags_t overwrite_existing = 0_bit;\n static constexpr status_flags_t query_distributed_copies = 0_bit;\n@@ -393,15 +393,15 @@\n \n [report issue]\n torrent_handle()
\n \n torrent_handle () noexcept = default;\n
\n constructs a torrent handle that does not refer to a torrent.\n-i.e. is_valid() will return false.
\n+i.e. is_valid() will return false.\n [report issue]\n \n add_piece()
\n \n void add_piece (piece_index_t piece, char const* data, add_piece_flags_t flags = {}) const;\n void add_piece (piece_index_t piece, std::vector<char> data, add_piece_flags_t flags = {}) const;\n \n@@ -444,39 +444,39 @@\n \n have_piece()
\n \n bool have_piece (piece_index_t piece) const;\n
\n Returns true if this piece has been completely downloaded and written\n to disk, and false otherwise.
\n-\n-[report issue]\n-\n+\n+post_peer_info() get_peer_info()
\n \n void post_peer_info () const;\n void get_peer_info (std::vector<peer_info>& v) const;\n
\n Query information about connected peers for this torrent. If the\n torrent_handle is invalid, it will throw a system_error exception.
\n post_peer_info() is asynchronous and will trigger the posting of\n a peer_info_alert. The alert contain a list of peer_info objects, one\n for each connected peer.
\n get_peer_info() is synchronous and takes a reference to a vector\n that will be cleared and filled with one entry for each peer\n connected to this torrent, given the handle is valid. Each entry in\n the vector contains information about that particular peer. See\n peer_info.
\n-\n-[report issue]\n-\n+\n+status() post_status()
\n \n-torrent_status status (status_flags_t flags = status_flags_t::all()) const;\n void post_status (status_flags_t flags = status_flags_t::all()) const;\n+torrent_status status (status_flags_t flags = status_flags_t::all()) const;\n
\n status() will return a structure with information about the status\n of this torrent. If the torrent_handle is invalid, it will throw\n system_error exception. See torrent_status. The flags\n argument filters what information is returned in the torrent_status.\n Some information in there is relatively expensive to calculate, and if\n you're not interested in it (and see performance issues), you can\n@@ -486,37 +486,37 @@\n instead call post_status(). It will trigger posting of a\n state_update_alert with a single torrent_status object for this\n torrent.
\n In order to get regular updates for torrents whose status changes,\n consider calling session::post_torrent_updates()`` instead.
\n By default everything is included. The flags you can use to decide\n what to include are defined in this class.
\n-\n-[report issue]\n-\n+\n+get_download_queue() post_download_queue()
\n \n-void post_download_queue () const;\n std::vector<partial_piece_info> get_download_queue () const;\n+void post_download_queue () const;\n void get_download_queue (std::vector<partial_piece_info>& queue) const;\n
\n post_download_queue() triggers a download_queue_alert to be\n posted.\n get_download_queue() is a synchronous call and returns a vector\n with information about pieces that are partially downloaded or not\n downloaded but partially requested. See partial_piece_info for the\n fields in the returned vector.
\n-\n+\n \n-[report issue]\n-\n+\n+clear_piece_deadlines() reset_piece_deadline() set_piece_deadline()
\n \n-void clear_piece_deadlines () const;\n void reset_piece_deadline (piece_index_t index) const;\n+void clear_piece_deadlines () const;\n void set_piece_deadline (piece_index_t index, int deadline, deadline_flags_t flags = {}) const;\n \n This function sets or resets the deadline associated with a specific\n piece index (index). libtorrent will attempt to download this\n entire piece before the deadline expires. This is not necessarily\n possible, but pieces with a more recent deadline will always be\n prioritized over pieces with a deadline further ahead in time. The\n@@ -533,16 +533,16 @@\n
clear_piece_deadlines() removes deadlines on all pieces in\n the torrent. As if reset_piece_deadline() was called on all pieces.
\n \n [report issue]\n \n file_progress() post_file_progress()
\n \n-std::vector<std::int64_t> file_progress (file_progress_flags_t flags = {}) const;\n void file_progress (std::vector<std::int64_t>& progress, file_progress_flags_t flags = {}) const;\n+std::vector<std::int64_t> file_progress (file_progress_flags_t flags = {}) const;\n void post_file_progress (file_progress_flags_t flags) const;\n \n This function fills in the supplied vector, or returns a vector, with\n the number of bytes downloaded of each file in this torrent. The\n progress values are ordered the same as the files in the\n torrent_info.
\n This operation is not very cheap. Its complexity is O(n + mj).\n@@ -572,25 +572,25 @@\n
\n clear_error()
\n \n void clear_error () const;\n
\n If the torrent is in an error state (i.e. torrent_status::error is\n non-empty), this will clear the error and start the torrent again.
\n-\n-\n+\n \n-[report issue]\n-\n+\n+post_trackers() trackers() replace_trackers() add_tracker()
\n \n-std::vector<announce_entry> trackers () const;\n void post_trackers () const;\n-void add_tracker (announce_entry const&) const;\n+std::vector<announce_entry> trackers () const;\n void replace_trackers (std::vector<announce_entry> const&) const;\n+void add_tracker (announce_entry const&) const;\n
\n trackers() returns the list of trackers for this torrent. The\n announce entry contains both a string url which specify the\n announce url for the tracker as well as an int tier, which is\n specifies the order in which this tracker is tried. If you want\n libtorrent to use another list of trackers for this torrent, you can\n use replace_trackers() which takes a list of the same form as the\n@@ -602,19 +602,19 @@\n
add_tracker() will look if the specified tracker is already in the\n set. If it is, it doesn't do anything. If it's not in the current set\n of trackers, it will insert it in the tier specified in the\n announce_entry.
\n The updated set of trackers will be saved in the resume data, and when\n a torrent is started with resume data, the trackers from the resume\n data will replace the original ones.
\n-\n+\n \n-[report issue]\n-\n+\n+add_url_seed() remove_url_seed() url_seeds()
\n \n void add_url_seed (std::string const& url) const;\n void remove_url_seed (std::string const& url) const;\n std::set<std::string> url_seeds () const;\n
\n add_url_seed() adds another url to the torrent's list of url\n seeds. If the given url already exists in that list, the call has no\n@@ -622,18 +622,18 @@\n pieces from it, unless it's paused, queued, checking or seeding.\n remove_url_seed() removes the given url if it exists already.\n url_seeds() return a set of the url seeds currently in this\n torrent. Note that URLs that fails may be removed automatically from\n the list.
\n See http seeding for more information.
\n \n-\n-[report issue]\n-\n+\n+http_seeds() remove_http_seed() add_http_seed()
\n \n std::set<std::string> http_seeds () const;\n void remove_http_seed (std::string const& url) const;\n void add_http_seed (std::string const& url) const;\n
\n These functions are identical as the *_url_seed() variants, but\n they operate on BEP 17 web seeds instead of BEP 19.
\n@@ -673,17 +673,17 @@\n Returns true if this handle refers to a valid torrent and false if it\n hasn't been initialized or if the torrent it refers to has been\n removed from the session AND destructed.
\n To tell if the torrent_handle is in the session, use\n torrent_handle::in_session(). This will return true before\n session_handle::remove_torrent() is called, and false\n afterward.
\n-Clients should only use is_valid() to determine if the result of\n+
Clients should only use is_valid() to determine if the result of\n session::find_torrent() was successful.
\n-Unlike other member functions which return a value, is_valid()\n+
Unlike other member functions which return a value, is_valid()\n completes immediately, without blocking on a result from the\n network thread. Also unlike other functions, it never throws\n the system_error exception.
\n \n [report issue]\n \n pause() resume()
\n@@ -704,24 +704,24 @@\n \n Note
\n Torrents that are auto-managed may be automatically resumed again. It\n does not make sense to pause an auto-managed torrent without making it\n not auto-managed first. Torrents are auto-managed by default when added\n to the session. For more information, see queuing.
\n \n-\n \n-[report issue]\n-\n+\n+flags() set_flags() unset_flags()
\n \n-void set_flags (torrent_flags_t flags) const;\n+void unset_flags (torrent_flags_t flags) const;\n void set_flags (torrent_flags_t flags, torrent_flags_t mask) const;\n+void set_flags (torrent_flags_t flags) const;\n torrent_flags_t flags () const;\n-void unset_flags (torrent_flags_t flags) const;\n
\n sets and gets the torrent state flags. See torrent_flags_t.\n The set_flags overload that take a mask will affect all\n flags part of the mask, and set their values to what the\n flags argument is set to. This allows clearing and\n setting flags in a single function call.\n The set_flags overload that just takes flags, sets all\n@@ -780,15 +780,15 @@\n
- No torrent state has changed since the last saving of resume\n data, and the only_if_modified flag is set.\n metadata (see libtorrent's metadata from peers extension)
\n \n \n Note that some counters may be outdated by the time you receive the fast resume data
\n When saving resume data because of shutting down, make sure not to\n-remove_torrent() before you receive the save_resume_data_alert.\n+remove_torrent() before you receive the save_resume_data_alert.\n There's no need to pause the session or torrent when saving resume\n data.
\n The paused state of a torrent is saved in the resume data, so pausing\n all torrents before saving resume data will all torrents be restored\n in a paused state.
\n \n Note
\n@@ -877,21 +877,21 @@\n \n Note
\n A torrent's resume data is considered saved as soon as the\n save_resume_data_alert is posted. It is important to make sure this\n alert is received and handled in order for this function to be\n meaningful.
\n \n+\n+\n \n \n-\n-\n-[report issue]\n-\n-queue_position_top() queue_position_bottom() queue_position() queue_position_down() queue_position_up()
\n+[report issue]\n+\n+queue_position_up() queue_position_down() queue_position_top() queue_position_bottom() queue_position()
\n \n void queue_position_up () const;\n void queue_position_top () const;\n void queue_position_bottom () const;\n queue_position_t queue_position () const;\n void queue_position_down () const;\n
\n@@ -916,26 +916,26 @@\n queue_position_set()
\n \n void queue_position_set (queue_position_t p) const;\n
\n updates the position in the queue for this torrent. The relative order\n of all other torrents remain intact but their numerical queue position\n shifts to make space for this torrent's new position
\n-\n-[report issue]\n-\n+\n+set_ssl_certificate_buffer() set_ssl_certificate()
\n \n+void set_ssl_certificate_buffer (std::string const& certificate\n+ , std::string const& private_key\n+ , std::string const& dh_params);\n void set_ssl_certificate (std::string const& certificate\n , std::string const& private_key\n , std::string const& dh_params\n , std::string const& passphrase = "");\n-void set_ssl_certificate_buffer (std::string const& certificate\n- , std::string const& private_key\n- , std::string const& dh_params);\n
\n For SSL torrents, use this to specify a path to a .pem file to use as\n this client's certificate. The certificate must be signed by the\n certificate in the .torrent file to be valid.
\n The set_ssl_certificate_buffer() overload takes the actual certificate,\n private key and DH params as strings, rather than paths to files.
\n cert is a path to the (signed) certificate in .pem format\n@@ -956,16 +956,16 @@\n provide a valid cert. If you don't have a cert you won't be allowed to\n connect to any peers.
\n \n [report issue]\n \n torrent_file() torrent_file_with_hashes()
\n \n-std::shared_ptr<torrent_info> torrent_file_with_hashes () const;\n std::shared_ptr<const torrent_info> torrent_file () const;\n+std::shared_ptr<torrent_info> torrent_file_with_hashes () const;\n
\n torrent_file() returns a pointer to the torrent_info object\n associated with this torrent. The torrent_info object may be a copy\n of the internal object. If the torrent doesn't have metadata, the\n pointer will not be initialized (i.e. a nullptr). The torrent may be\n in a state without metadata only if it was started without a .torrent\n file, e.g. by being added by magnet link.
\n@@ -997,42 +997,42 @@\n \n std::vector<std::vector<sha256_hash>> piece_layers () const;\n
\n returns the piece layers for all files in the torrent. If this is a\n v1 torrent (and doesn't have any piece layers) it returns an empty\n vector. This is a blocking call that will synchronize with the\n libtorrent network thread.
\n-\n-[report issue]\n-\n+\n+piece_availability() post_piece_availability()
\n \n void post_piece_availability () const;\n void piece_availability (std::vector<int>& avail) const;\n
\n The piece availability is the number of peers that we are connected\n that has advertised having a particular piece. This is the information\n that libtorrent uses in order to prefer picking rare pieces.
\n post_piece_availability() will trigger a piece_availability_alert\n to be posted.
\n piece_availability() fills the specified std::vector<int>\n with the availability for each piece in this torrent. libtorrent does\n not keep track of availability for seeds, so if the torrent is\n seeding the availability for all pieces is reported as 0.
\n-\n+\n \n-[report issue]\n-\n+\n+piece_priority() get_piece_priorities() prioritize_pieces()
\n \n download_priority_t piece_priority (piece_index_t index) const;\n-void piece_priority (piece_index_t index, download_priority_t priority) const;\n+void prioritize_pieces (std::vector<std::pair<piece_index_t, download_priority_t>> const& pieces) const;\n void prioritize_pieces (std::vector<download_priority_t> const& pieces) const;\n std::vector<download_priority_t> get_piece_priorities () const;\n-void prioritize_pieces (std::vector<std::pair<piece_index_t, download_priority_t>> const& pieces) const;\n+void piece_priority (piece_index_t index, download_priority_t priority) const;\n
\n These functions are used to set and get the priority of individual\n pieces. By default all pieces have priority 4. That means that the\n random rarest first algorithm is effectively active for all pieces.\n You may however change the priority of individual pieces. There are 8\n priority levels. 0 means not to download the piece at all. Otherwise,\n lower priority values means less likely to be picked. Piece priority\n@@ -1060,18 +1060,18 @@\n usage of file- and piece priorities.
\n \n \n [report issue]\n \n prioritize_files() file_priority() get_file_priorities()
\n \n-std::vector<download_priority_t> get_file_priorities () const;\n download_priority_t file_priority (file_index_t index) const;\n void prioritize_files (std::vector<download_priority_t> const& files) const;\n void file_priority (file_index_t index, download_priority_t priority) const;\n+std::vector<download_priority_t> get_file_priorities () const;\n
\n index must be in the range [0, number_of_files).
\n file_priority() queries or sets the priority of file index.
\n prioritize_files() takes a vector that has at as many elements as\n there are files in the torrent. Each entry is the priority of that\n file. The function sets the priorities of all the pieces in the\n torrent based on the vector.
\n@@ -1094,22 +1094,22 @@\n file_prio_alert.\n When combining file- and piece priorities, the resume file will record\n both. When loading the resume data, the file priorities will be applied\n first, then the piece priorities.
\n Moving data from a file into the part file is currently not\n supported. If a file has its priority set to 0 after it has already\n been created, it will not be moved into the partfile.
\n+\n \n-\n-[report issue]\n-\n+\n+force_reannounce() force_lsd_announce() force_dht_announce()
\n \n-void force_lsd_announce () const;\n void force_reannounce (int seconds = 0, int idx = -1, reannounce_flags_t = {}) const;\n+void force_lsd_announce () const;\n void force_dht_announce () const;\n \n force_reannounce() will force this torrent to do another tracker\n request, to receive new peers. The seconds argument specifies how\n many seconds from now to issue the tracker announces.
\n If the tracker's min_interval has not passed since the last\n announce, the forced announce will be scheduled to happen immediately\n@@ -1134,25 +1134,25 @@\n idx is >= 0, the tracker with the specified index will scraped.
\n A scrape request queries the tracker for statistics such as total\n number of incomplete peers, complete peers, number of downloads etc.
\n This request will specifically update the num_complete and\n num_incomplete fields in the torrent_status struct once it\n completes. When it completes, it will generate a scrape_reply_alert.\n If it fails, it will generate a scrape_failed_alert.
\n+\n \n \n-\n-[report issue]\n-\n+\n+upload_limit() set_download_limit() set_upload_limit() download_limit()
\n \n int download_limit () const;\n+void set_download_limit (int limit) const;\n int upload_limit () const;\n void set_upload_limit (int limit) const;\n-void set_download_limit (int limit) const;\n
\n set_upload_limit will limit the upload bandwidth used by this\n particular torrent to the limit you set. It is given as the number of\n bytes per second the torrent is allowed to upload.\n set_download_limit works the same way but for download bandwidth\n instead of upload bandwidth. Note that setting a higher limit on a\n torrent then the global limit\n@@ -1189,30 +1189,30 @@\n torrent. New peers will have to be acquired before resuming, from\n trackers, DHT or local service discovery, for example.
\n \n [report issue]\n \n max_uploads() set_max_uploads()
\n \n-void set_max_uploads (int max_uploads) const;\n int max_uploads () const;\n+void set_max_uploads (int max_uploads) const;\n
\n set_max_uploads() sets the maximum number of peers that's unchoked\n at the same time on this torrent. If you set this to -1, there will be\n no limit. This defaults to infinite. The primary setting controlling\n this is the global unchoke slots limit, set by unchoke_slots_limit in\n settings_pack.
\n max_uploads() returns the current settings.
\n \n [report issue]\n \n max_connections() set_max_connections()
\n \n-void set_max_connections (int max_connections) const;\n int max_connections () const;\n+void set_max_connections (int max_connections) const;\n
\n set_max_connections() sets the maximum number of connection this\n torrent will open. If all connections are used up, incoming\n connections may be refused or poor connections may be closed. This\n must be at least 2. The default is unlimited number of connections. If\n -1 is given to the function, it means unlimited. There is also a\n global limit of the number of connections, set by\n@@ -1275,37 +1275,37 @@\n
rename_file()
\n \n void rename_file (file_index_t index, std::string const& new_name) const;\n
\n Renames the file with the given index asynchronously. The rename\n operation is complete when either a file_renamed_alert or\n file_rename_failed_alert is posted.
\n-\n-[report issue]\n-\n+\n+info_hash() info_hashes()
\n \n info_hash_t info_hashes () const;\n sha1_hash info_hash () const;\n
\n returns the info-hash(es) of the torrent. If this handle is to a\n torrent that hasn't loaded yet (for instance by being added) by a\n URL, the returned value is undefined.\n The info_hash() returns the SHA-1 info-hash for v1 torrents and a\n truncated hash for v2 torrents. For the full v2 info-hash, use\n info_hashes() instead.
\n-\n+\n \n-[report issue]\n+[report issue]\n \n-operator==() operator<() operator!=()
\n+operator!=() operator<() operator==()
\n \n bool operator< (const torrent_handle& h) const;\n-bool operator!= (const torrent_handle& h) const;\n bool operator== (const torrent_handle& h) const;\n+bool operator!= (const torrent_handle& h) const;\n
\n comparison operators. The order of the torrents is unspecified\n but stable.
\n [report issue]\n \n id()
\n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -8,68 +8,68 @@\n o _\be_\bn_\bu_\bm_\b _\bb_\bl_\bo_\bc_\bk_\b__\bs_\bt_\ba_\bt_\be_\b__\bt\n * _\bp_\ba_\br_\bt_\bi_\ba_\bl_\b__\bp_\bi_\be_\bc_\be_\b__\bi_\bn_\bf_\bo\n * _\bt_\bo_\br_\br_\be_\bn_\bt_\b__\bh_\ba_\bn_\bd_\bl_\be\n o _\bt_\bo_\br_\br_\be_\bn_\bt_\b__\bh_\ba_\bn_\bd_\bl_\be_\b(_\b)\n o _\ba_\bd_\bd_\b__\bp_\bi_\be_\bc_\be_\b(_\b)\n o _\br_\be_\ba_\bd_\b__\bp_\bi_\be_\bc_\be_\b(_\b)\n o _\bh_\ba_\bv_\be_\b__\bp_\bi_\be_\bc_\be_\b(_\b)\n- o _\bg_\be_\bt_\b__\bp_\be_\be_\br_\b__\bi_\bn_\bf_\bo_\b(_\b)_\b _\bp_\bo_\bs_\bt_\b__\bp_\be_\be_\br_\b__\bi_\bn_\bf_\bo_\b(_\b)\n- o _\bp_\bo_\bs_\bt_\b__\bs_\bt_\ba_\bt_\bu_\bs_\b(_\b)_\b _\bs_\bt_\ba_\bt_\bu_\bs_\b(_\b)\n- o _\bp_\bo_\bs_\bt_\b__\bd_\bo_\bw_\bn_\bl_\bo_\ba_\bd_\b__\bq_\bu_\be_\bu_\be_\b(_\b)_\b _\bg_\be_\bt_\b__\bd_\bo_\bw_\bn_\bl_\bo_\ba_\bd_\b__\bq_\bu_\be_\bu_\be_\b(_\b)\n- o _\bs_\be_\bt_\b__\bp_\bi_\be_\bc_\be_\b__\bd_\be_\ba_\bd_\bl_\bi_\bn_\be_\b(_\b)_\b _\br_\be_\bs_\be_\bt_\b__\bp_\bi_\be_\bc_\be_\b__\bd_\be_\ba_\bd_\bl_\bi_\bn_\be_\b(_\b)_\b _\bc_\bl_\be_\ba_\br_\b__\bp_\bi_\be_\bc_\be_\b__\bd_\be_\ba_\bd_\bl_\bi_\bn_\be_\bs_\b(_\b)\n+ o _\bp_\bo_\bs_\bt_\b__\bp_\be_\be_\br_\b__\bi_\bn_\bf_\bo_\b(_\b)_\b _\bg_\be_\bt_\b__\bp_\be_\be_\br_\b__\bi_\bn_\bf_\bo_\b(_\b)\n+ o _\bs_\bt_\ba_\bt_\bu_\bs_\b(_\b)_\b _\bp_\bo_\bs_\bt_\b__\bs_\bt_\ba_\bt_\bu_\bs_\b(_\b)\n+ o _\bg_\be_\bt_\b__\bd_\bo_\bw_\bn_\bl_\bo_\ba_\bd_\b__\bq_\bu_\be_\bu_\be_\b(_\b)_\b _\bp_\bo_\bs_\bt_\b__\bd_\bo_\bw_\bn_\bl_\bo_\ba_\bd_\b__\bq_\bu_\be_\bu_\be_\b(_\b)\n+ o _\bc_\bl_\be_\ba_\br_\b__\bp_\bi_\be_\bc_\be_\b__\bd_\be_\ba_\bd_\bl_\bi_\bn_\be_\bs_\b(_\b)_\b _\br_\be_\bs_\be_\bt_\b__\bp_\bi_\be_\bc_\be_\b__\bd_\be_\ba_\bd_\bl_\bi_\bn_\be_\b(_\b)_\b _\bs_\be_\bt_\b__\bp_\bi_\be_\bc_\be_\b__\bd_\be_\ba_\bd_\bl_\bi_\bn_\be_\b(_\b)\n o _\bf_\bi_\bl_\be_\b__\bp_\br_\bo_\bg_\br_\be_\bs_\bs_\b(_\b)_\b _\bp_\bo_\bs_\bt_\b__\bf_\bi_\bl_\be_\b__\bp_\br_\bo_\bg_\br_\be_\bs_\bs_\b(_\b)\n o _\bf_\bi_\bl_\be_\b__\bs_\bt_\ba_\bt_\bu_\bs_\b(_\b)\n o _\bc_\bl_\be_\ba_\br_\b__\be_\br_\br_\bo_\br_\b(_\b)\n- o _\ba_\bd_\bd_\b__\bt_\br_\ba_\bc_\bk_\be_\br_\b(_\b)_\b _\br_\be_\bp_\bl_\ba_\bc_\be_\b__\bt_\br_\ba_\bc_\bk_\be_\br_\bs_\b(_\b)_\b _\bt_\br_\ba_\bc_\bk_\be_\br_\bs_\b(_\b)_\b _\bp_\bo_\bs_\bt_\b__\bt_\br_\ba_\bc_\bk_\be_\br_\bs_\b(_\b)\n- o _\bu_\br_\bl_\b__\bs_\be_\be_\bd_\bs_\b(_\b)_\b _\br_\be_\bm_\bo_\bv_\be_\b__\bu_\br_\bl_\b__\bs_\be_\be_\bd_\b(_\b)_\b _\ba_\bd_\bd_\b__\bu_\br_\bl_\b__\bs_\be_\be_\bd_\b(_\b)\n- o _\bh_\bt_\bt_\bp_\b__\bs_\be_\be_\bd_\bs_\b(_\b)_\b _\ba_\bd_\bd_\b__\bh_\bt_\bt_\bp_\b__\bs_\be_\be_\bd_\b(_\b)_\b _\br_\be_\bm_\bo_\bv_\be_\b__\bh_\bt_\bt_\bp_\b__\bs_\be_\be_\bd_\b(_\b)\n+ o _\bp_\bo_\bs_\bt_\b__\bt_\br_\ba_\bc_\bk_\be_\br_\bs_\b(_\b)_\b _\bt_\br_\ba_\bc_\bk_\be_\br_\bs_\b(_\b)_\b _\br_\be_\bp_\bl_\ba_\bc_\be_\b__\bt_\br_\ba_\bc_\bk_\be_\br_\bs_\b(_\b)_\b _\ba_\bd_\bd_\b__\bt_\br_\ba_\bc_\bk_\be_\br_\b(_\b)\n+ o _\ba_\bd_\bd_\b__\bu_\br_\bl_\b__\bs_\be_\be_\bd_\b(_\b)_\b _\br_\be_\bm_\bo_\bv_\be_\b__\bu_\br_\bl_\b__\bs_\be_\be_\bd_\b(_\b)_\b _\bu_\br_\bl_\b__\bs_\be_\be_\bd_\bs_\b(_\b)\n+ o _\bh_\bt_\bt_\bp_\b__\bs_\be_\be_\bd_\bs_\b(_\b)_\b _\br_\be_\bm_\bo_\bv_\be_\b__\bh_\bt_\bt_\bp_\b__\bs_\be_\be_\bd_\b(_\b)_\b _\ba_\bd_\bd_\b__\bh_\bt_\bt_\bp_\b__\bs_\be_\be_\bd_\b(_\b)\n o _\ba_\bd_\bd_\b__\be_\bx_\bt_\be_\bn_\bs_\bi_\bo_\bn_\b(_\b)\n o _\bs_\be_\bt_\b__\bm_\be_\bt_\ba_\bd_\ba_\bt_\ba_\b(_\b)\n o _\bi_\bs_\b__\bv_\ba_\bl_\bi_\bd_\b(_\b)\n o _\bp_\ba_\bu_\bs_\be_\b(_\b)_\b _\br_\be_\bs_\bu_\bm_\be_\b(_\b)\n- o _\bu_\bn_\bs_\be_\bt_\b__\bf_\bl_\ba_\bg_\bs_\b(_\b)_\b _\bf_\bl_\ba_\bg_\bs_\b(_\b)_\b _\bs_\be_\bt_\b__\bf_\bl_\ba_\bg_\bs_\b(_\b)\n+ o _\bf_\bl_\ba_\bg_\bs_\b(_\b)_\b _\bs_\be_\bt_\b__\bf_\bl_\ba_\bg_\bs_\b(_\b)_\b _\bu_\bn_\bs_\be_\bt_\b__\bf_\bl_\ba_\bg_\bs_\b(_\b)\n o _\bf_\bl_\bu_\bs_\bh_\b__\bc_\ba_\bc_\bh_\be_\b(_\b)\n o _\bf_\bo_\br_\bc_\be_\b__\br_\be_\bc_\bh_\be_\bc_\bk_\b(_\b)\n o _\bs_\ba_\bv_\be_\b__\br_\be_\bs_\bu_\bm_\be_\b__\bd_\ba_\bt_\ba_\b(_\b)\n o _\bn_\be_\be_\bd_\b__\bs_\ba_\bv_\be_\b__\br_\be_\bs_\bu_\bm_\be_\b__\bd_\ba_\bt_\ba_\b(_\b)\n- o _\bq_\bu_\be_\bu_\be_\b__\bp_\bo_\bs_\bi_\bt_\bi_\bo_\bn_\b__\bt_\bo_\bp_\b(_\b)_\b _\bq_\bu_\be_\bu_\be_\b__\bp_\bo_\bs_\bi_\bt_\bi_\bo_\bn_\b__\bb_\bo_\bt_\bt_\bo_\bm_\b(_\b)_\b _\bq_\bu_\be_\bu_\be_\b__\bp_\bo_\bs_\bi_\bt_\bi_\bo_\bn_\b(_\b)\n- _\bq_\bu_\be_\bu_\be_\b__\bp_\bo_\bs_\bi_\bt_\bi_\bo_\bn_\b__\bd_\bo_\bw_\bn_\b(_\b)_\b _\bq_\bu_\be_\bu_\be_\b__\bp_\bo_\bs_\bi_\bt_\bi_\bo_\bn_\b__\bu_\bp_\b(_\b)\n+ o _\bq_\bu_\be_\bu_\be_\b__\bp_\bo_\bs_\bi_\bt_\bi_\bo_\bn_\b__\bu_\bp_\b(_\b)_\b _\bq_\bu_\be_\bu_\be_\b__\bp_\bo_\bs_\bi_\bt_\bi_\bo_\bn_\b__\bd_\bo_\bw_\bn_\b(_\b)_\b _\bq_\bu_\be_\bu_\be_\b__\bp_\bo_\bs_\bi_\bt_\bi_\bo_\bn_\b__\bt_\bo_\bp_\b(_\b)\n+ _\bq_\bu_\be_\bu_\be_\b__\bp_\bo_\bs_\bi_\bt_\bi_\bo_\bn_\b__\bb_\bo_\bt_\bt_\bo_\bm_\b(_\b)_\b _\bq_\bu_\be_\bu_\be_\b__\bp_\bo_\bs_\bi_\bt_\bi_\bo_\bn_\b(_\b)\n o _\bq_\bu_\be_\bu_\be_\b__\bp_\bo_\bs_\bi_\bt_\bi_\bo_\bn_\b__\bs_\be_\bt_\b(_\b)\n- o _\bs_\be_\bt_\b__\bs_\bs_\bl_\b__\bc_\be_\br_\bt_\bi_\bf_\bi_\bc_\ba_\bt_\be_\b(_\b)_\b _\bs_\be_\bt_\b__\bs_\bs_\bl_\b__\bc_\be_\br_\bt_\bi_\bf_\bi_\bc_\ba_\bt_\be_\b__\bb_\bu_\bf_\bf_\be_\br_\b(_\b)\n+ o _\bs_\be_\bt_\b__\bs_\bs_\bl_\b__\bc_\be_\br_\bt_\bi_\bf_\bi_\bc_\ba_\bt_\be_\b__\bb_\bu_\bf_\bf_\be_\br_\b(_\b)_\b _\bs_\be_\bt_\b__\bs_\bs_\bl_\b__\bc_\be_\br_\bt_\bi_\bf_\bi_\bc_\ba_\bt_\be_\b(_\b)\n o _\bt_\bo_\br_\br_\be_\bn_\bt_\b__\bf_\bi_\bl_\be_\b(_\b)_\b _\bt_\bo_\br_\br_\be_\bn_\bt_\b__\bf_\bi_\bl_\be_\b__\bw_\bi_\bt_\bh_\b__\bh_\ba_\bs_\bh_\be_\bs_\b(_\b)\n o _\bp_\bi_\be_\bc_\be_\b__\bl_\ba_\by_\be_\br_\bs_\b(_\b)\n- o _\bp_\bo_\bs_\bt_\b__\bp_\bi_\be_\bc_\be_\b__\ba_\bv_\ba_\bi_\bl_\ba_\bb_\bi_\bl_\bi_\bt_\by_\b(_\b)_\b _\bp_\bi_\be_\bc_\be_\b__\ba_\bv_\ba_\bi_\bl_\ba_\bb_\bi_\bl_\bi_\bt_\by_\b(_\b)\n- o _\bp_\br_\bi_\bo_\br_\bi_\bt_\bi_\bz_\be_\b__\bp_\bi_\be_\bc_\be_\bs_\b(_\b)_\b _\bg_\be_\bt_\b__\bp_\bi_\be_\bc_\be_\b__\bp_\br_\bi_\bo_\br_\bi_\bt_\bi_\be_\bs_\b(_\b)_\b _\bp_\bi_\be_\bc_\be_\b__\bp_\br_\bi_\bo_\br_\bi_\bt_\by_\b(_\b)\n+ o _\bp_\bi_\be_\bc_\be_\b__\ba_\bv_\ba_\bi_\bl_\ba_\bb_\bi_\bl_\bi_\bt_\by_\b(_\b)_\b _\bp_\bo_\bs_\bt_\b__\bp_\bi_\be_\bc_\be_\b__\ba_\bv_\ba_\bi_\bl_\ba_\bb_\bi_\bl_\bi_\bt_\by_\b(_\b)\n+ o _\bp_\bi_\be_\bc_\be_\b__\bp_\br_\bi_\bo_\br_\bi_\bt_\by_\b(_\b)_\b _\bg_\be_\bt_\b__\bp_\bi_\be_\bc_\be_\b__\bp_\br_\bi_\bo_\br_\bi_\bt_\bi_\be_\bs_\b(_\b)_\b _\bp_\br_\bi_\bo_\br_\bi_\bt_\bi_\bz_\be_\b__\bp_\bi_\be_\bc_\be_\bs_\b(_\b)\n o _\bp_\br_\bi_\bo_\br_\bi_\bt_\bi_\bz_\be_\b__\bf_\bi_\bl_\be_\bs_\b(_\b)_\b _\bf_\bi_\bl_\be_\b__\bp_\br_\bi_\bo_\br_\bi_\bt_\by_\b(_\b)_\b _\bg_\be_\bt_\b__\bf_\bi_\bl_\be_\b__\bp_\br_\bi_\bo_\br_\bi_\bt_\bi_\be_\bs_\b(_\b)\n- o _\bf_\bo_\br_\bc_\be_\b__\bl_\bs_\bd_\b__\ba_\bn_\bn_\bo_\bu_\bn_\bc_\be_\b(_\b)_\b _\bf_\bo_\br_\bc_\be_\b__\bd_\bh_\bt_\b__\ba_\bn_\bn_\bo_\bu_\bn_\bc_\be_\b(_\b)_\b _\bf_\bo_\br_\bc_\be_\b__\br_\be_\ba_\bn_\bn_\bo_\bu_\bn_\bc_\be_\b(_\b)\n+ o _\bf_\bo_\br_\bc_\be_\b__\br_\be_\ba_\bn_\bn_\bo_\bu_\bn_\bc_\be_\b(_\b)_\b _\bf_\bo_\br_\bc_\be_\b__\bl_\bs_\bd_\b__\ba_\bn_\bn_\bo_\bu_\bn_\bc_\be_\b(_\b)_\b _\bf_\bo_\br_\bc_\be_\b__\bd_\bh_\bt_\b__\ba_\bn_\bn_\bo_\bu_\bn_\bc_\be_\b(_\b)\n o _\bs_\bc_\br_\ba_\bp_\be_\b__\bt_\br_\ba_\bc_\bk_\be_\br_\b(_\b)\n- o _\bs_\be_\bt_\b__\bd_\bo_\bw_\bn_\bl_\bo_\ba_\bd_\b__\bl_\bi_\bm_\bi_\bt_\b(_\b)_\b _\bs_\be_\bt_\b__\bu_\bp_\bl_\bo_\ba_\bd_\b__\bl_\bi_\bm_\bi_\bt_\b(_\b)_\b _\bu_\bp_\bl_\bo_\ba_\bd_\b__\bl_\bi_\bm_\bi_\bt_\b(_\b)\n+ o _\bu_\bp_\bl_\bo_\ba_\bd_\b__\bl_\bi_\bm_\bi_\bt_\b(_\b)_\b _\bs_\be_\bt_\b__\bd_\bo_\bw_\bn_\bl_\bo_\ba_\bd_\b__\bl_\bi_\bm_\bi_\bt_\b(_\b)_\b _\bs_\be_\bt_\b__\bu_\bp_\bl_\bo_\ba_\bd_\b__\bl_\bi_\bm_\bi_\bt_\b(_\b)\n _\bd_\bo_\bw_\bn_\bl_\bo_\ba_\bd_\b__\bl_\bi_\bm_\bi_\bt_\b(_\b)\n o _\bc_\bo_\bn_\bn_\be_\bc_\bt_\b__\bp_\be_\be_\br_\b(_\b)\n o _\bc_\bl_\be_\ba_\br_\b__\bp_\be_\be_\br_\bs_\b(_\b)\n o _\bm_\ba_\bx_\b__\bu_\bp_\bl_\bo_\ba_\bd_\bs_\b(_\b)_\b _\bs_\be_\bt_\b__\bm_\ba_\bx_\b__\bu_\bp_\bl_\bo_\ba_\bd_\bs_\b(_\b)\n o _\bm_\ba_\bx_\b__\bc_\bo_\bn_\bn_\be_\bc_\bt_\bi_\bo_\bn_\bs_\b(_\b)_\b _\bs_\be_\bt_\b__\bm_\ba_\bx_\b__\bc_\bo_\bn_\bn_\be_\bc_\bt_\bi_\bo_\bn_\bs_\b(_\b)\n o _\bm_\bo_\bv_\be_\b__\bs_\bt_\bo_\br_\ba_\bg_\be_\b(_\b)\n o _\br_\be_\bn_\ba_\bm_\be_\b__\bf_\bi_\bl_\be_\b(_\b)\n- o _\bi_\bn_\bf_\bo_\b__\bh_\ba_\bs_\bh_\be_\bs_\b(_\b)_\b _\bi_\bn_\bf_\bo_\b__\bh_\ba_\bs_\bh_\b(_\b)\n- o _\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b=_\b=_\b(_\b)_\b _\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b<_\b(_\b)_\b _\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b!_\b=_\b(_\b)\n+ o _\bi_\bn_\bf_\bo_\b__\bh_\ba_\bs_\bh_\b(_\b)_\b _\bi_\bn_\bf_\bo_\b__\bh_\ba_\bs_\bh_\be_\bs_\b(_\b)\n+ o _\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b!_\b=_\b(_\b)_\b _\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b<_\b(_\b)_\b _\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b=_\b=_\b(_\b)\n o _\bi_\bd_\b(_\b)\n o _\bn_\ba_\bt_\bi_\bv_\be_\b__\bh_\ba_\bn_\bd_\bl_\be_\b(_\b)\n o _\bu_\bs_\be_\br_\bd_\ba_\bt_\ba_\b(_\b)\n o _\bi_\bn_\b__\bs_\be_\bs_\bs_\bi_\bo_\bn_\b(_\b)\n * _\bh_\ba_\bs_\bh_\b__\bv_\ba_\bl_\bu_\be_\b(_\b)\n [_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n *\b**\b**\b**\b**\b**\b* b\bbl\blo\boc\bck\bk_\b_i\bin\bnf\bfo\bo *\b**\b**\b**\b**\b**\b*\n Declared in \"_\bl_\bi_\bb_\bt_\bo_\br_\br_\be_\bn_\bt_\b/_\bt_\bo_\br_\br_\be_\bn_\bt_\b__\bh_\ba_\bn_\bd_\bl_\be_\b._\bh_\bp_\bp\"\n holds the state of a block in a piece. Who we requested it from and how far\n along we are at downloading it.\n struct block_info\n {\n- _\bt_\bc_\bp_\b:_\b:_\be_\bn_\bd_\bp_\bo_\bi_\bn_\bt p\bpe\bee\ber\br () const;\n void s\bse\bet\bt_\b_p\bpe\bee\ber\br (tcp::endpoint const& ep);\n+ _\bt_\bc_\bp_\b:_\b:_\be_\bn_\bd_\bp_\bo_\bi_\bn_\bt p\bpe\bee\ber\br () const;\n \n enum block_state_t\n {\n none,\n requested,\n writing,\n finished,\n@@ -78,16 +78,16 @@\n unsigned bytes_progress:15;\n unsigned block_size:15;\n unsigned state:2;\n unsigned num_peers:14;\n };\n [_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n *\b**\b**\b**\b**\b* p\bpe\bee\ber\br(\b()\b) s\bse\bet\bt_\b_p\bpe\bee\ber\br(\b()\b) *\b**\b**\b**\b**\b*\n-_\bt_\bc_\bp_\b:_\b:_\be_\bn_\bd_\bp_\bo_\bi_\bn_\bt p\bpe\bee\ber\br () const;\n void s\bse\bet\bt_\b_p\bpe\bee\ber\br (tcp::endpoint const& ep);\n+_\bt_\bc_\bp_\b:_\b:_\be_\bn_\bd_\bp_\bo_\bi_\bn_\bt p\bpe\bee\ber\br () const;\n The peer is the ip address of the peer this block was downloaded from.\n [_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n *\b**\b**\b**\b**\b* e\ben\bnu\bum\bm b\bbl\blo\boc\bck\bk_\b_s\bst\bta\bat\bte\be_\b_t\bt *\b**\b**\b**\b**\b*\n Declared in \"_\bl_\bi_\bb_\bt_\bo_\br_\br_\be_\bn_\bt_\b/_\bt_\bo_\br_\br_\be_\bn_\bt_\b__\bh_\ba_\bn_\bd_\bl_\be_\b._\bh_\bp_\bp\"\n _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b \n |_\bn\bn_\ba\ba_\bm\bm_\be\be_\b _\b _\b _\b _\b _\b|_\bv\bv_\ba\ba_\bl\bl_\bu\bu_\be\be_\b|_\bd\bd_\be\be_\bs\bs_\bc\bc_\br\br_\bi\bi_\bp\bp_\bt\bt_\bi\bi_\bo\bo_\bn\bn_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n |none |0 |This block has not been downloaded or requested form any |\n@@ -183,112 +183,112 @@\n flags = {}) const;\n void a\bad\bdd\bd_\b_p\bpi\bie\bec\bce\be (piece_index_t piece, std::vector data,\n add_piece_flags_t flags = {}) const;\n void r\bre\bea\bad\bd_\b_p\bpi\bie\bec\bce\be (piece_index_t piece) const;\n bool h\bha\bav\bve\be_\b_p\bpi\bie\bec\bce\be (piece_index_t piece) const;\n void p\bpo\bos\bst\bt_\b_p\bpe\bee\ber\br_\b_i\bin\bnf\bfo\bo () const;\n void g\bge\bet\bt_\b_p\bpe\bee\ber\br_\b_i\bin\bnf\bfo\bo (std::vector& v) const;\n- torrent_status s\bst\bta\bat\btu\bus\bs (status_flags_t flags = status_flags_t::all()) const;\n void p\bpo\bos\bst\bt_\b_s\bst\bta\bat\btu\bus\bs (status_flags_t flags = status_flags_t::all()) const;\n- void p\bpo\bos\bst\bt_\b_d\bdo\bow\bwn\bnl\blo\boa\bad\bd_\b_q\bqu\bue\beu\bue\be () const;\n+ torrent_status s\bst\bta\bat\btu\bus\bs (status_flags_t flags = status_flags_t::all()) const;\n std::vector g\bge\bet\bt_\b_d\bdo\bow\bwn\bnl\blo\boa\bad\bd_\b_q\bqu\bue\beu\bue\be () const;\n+ void p\bpo\bos\bst\bt_\b_d\bdo\bow\bwn\bnl\blo\boa\bad\bd_\b_q\bqu\bue\beu\bue\be () const;\n void g\bge\bet\bt_\b_d\bdo\bow\bwn\bnl\blo\boa\bad\bd_\b_q\bqu\bue\beu\bue\be (std::vector& queue) const;\n- void c\bcl\ble\bea\bar\br_\b_p\bpi\bie\bec\bce\be_\b_d\bde\bea\bad\bdl\bli\bin\bne\bes\bs () const;\n void r\bre\bes\bse\bet\bt_\b_p\bpi\bie\bec\bce\be_\b_d\bde\bea\bad\bdl\bli\bin\bne\be (piece_index_t index) const;\n+ void c\bcl\ble\bea\bar\br_\b_p\bpi\bie\bec\bce\be_\b_d\bde\bea\bad\bdl\bli\bin\bne\bes\bs () const;\n void s\bse\bet\bt_\b_p\bpi\bie\bec\bce\be_\b_d\bde\bea\bad\bdl\bli\bin\bne\be (piece_index_t index, int deadline, deadline_flags_t\n flags = {}) const;\n- std::vector f\bfi\bil\ble\be_\b_p\bpr\bro\bog\bgr\bre\bes\bss\bs (file_progress_flags_t flags = {})\n-const;\n void f\bfi\bil\ble\be_\b_p\bpr\bro\bog\bgr\bre\bes\bss\bs (std::vector& progress,\n file_progress_flags_t flags = {}) const;\n+ std::vector f\bfi\bil\ble\be_\b_p\bpr\bro\bog\bgr\bre\bes\bss\bs (file_progress_flags_t flags = {})\n+const;\n void p\bpo\bos\bst\bt_\b_f\bfi\bil\ble\be_\b_p\bpr\bro\bog\bgr\bre\bes\bss\bs (file_progress_flags_t flags) const;\n std::vector f\bfi\bil\ble\be_\b_s\bst\bta\bat\btu\bus\bs () const;\n void c\bcl\ble\bea\bar\br_\b_e\ber\brr\bro\bor\br () const;\n- std::vector t\btr\bra\bac\bck\bke\ber\brs\bs () const;\n void p\bpo\bos\bst\bt_\b_t\btr\bra\bac\bck\bke\ber\brs\bs () const;\n- void a\bad\bdd\bd_\b_t\btr\bra\bac\bck\bke\ber\br (announce_entry const&) const;\n+ std::vector t\btr\bra\bac\bck\bke\ber\brs\bs () const;\n void r\bre\bep\bpl\bla\bac\bce\be_\b_t\btr\bra\bac\bck\bke\ber\brs\bs (std::vector const&) const;\n+ void a\bad\bdd\bd_\b_t\btr\bra\bac\bck\bke\ber\br (announce_entry const&) const;\n void a\bad\bdd\bd_\b_u\bur\brl\bl_\b_s\bse\bee\bed\bd (std::string const& url) const;\n void r\bre\bem\bmo\bov\bve\be_\b_u\bur\brl\bl_\b_s\bse\bee\bed\bd (std::string const& url) const;\n std::set u\bur\brl\bl_\b_s\bse\bee\bed\bds\bs () const;\n std::set h\bht\btt\btp\bp_\b_s\bse\bee\bed\bds\bs () const;\n void r\bre\bem\bmo\bov\bve\be_\b_h\bht\btt\btp\bp_\b_s\bse\bee\bed\bd (std::string const& url) const;\n void a\bad\bdd\bd_\b_h\bht\btt\btp\bp_\b_s\bse\bee\bed\bd (std::string const& url) const;\n void a\bad\bdd\bd_\b_e\bex\bxt\bte\ben\bns\bsi\bio\bon\bn (\n std::function(torrent_handle const&,\n client_data_t)> const& ext\n , client_data_t userdata = client_data_t{});\n bool s\bse\bet\bt_\b_m\bme\bet\bta\bad\bda\bat\bta\ba (span metadata) const;\n bool i\bis\bs_\b_v\bva\bal\bli\bid\bd () const;\n void r\bre\bes\bsu\bum\bme\be () const;\n void p\bpa\bau\bus\bse\be (pause_flags_t flags = {}) const;\n- void s\bse\bet\bt_\b_f\bfl\bla\bag\bgs\bs (torrent_flags_t flags) const;\n+ void u\bun\bns\bse\bet\bt_\b_f\bfl\bla\bag\bgs\bs (torrent_flags_t flags) const;\n void s\bse\bet\bt_\b_f\bfl\bla\bag\bgs\bs (torrent_flags_t flags, torrent_flags_t mask) const;\n+ void s\bse\bet\bt_\b_f\bfl\bla\bag\bgs\bs (torrent_flags_t flags) const;\n torrent_flags_t f\bfl\bla\bag\bgs\bs () const;\n- void u\bun\bns\bse\bet\bt_\b_f\bfl\bla\bag\bgs\bs (torrent_flags_t flags) const;\n void f\bfl\blu\bus\bsh\bh_\b_c\bca\bac\bch\bhe\be () const;\n void f\bfo\bor\brc\bce\be_\b_r\bre\bec\bch\bhe\bec\bck\bk () const;\n void s\bsa\bav\bve\be_\b_r\bre\bes\bsu\bum\bme\be_\b_d\bda\bat\bta\ba (resume_data_flags_t flags = {}) const;\n bool n\bne\bee\bed\bd_\b_s\bsa\bav\bve\be_\b_r\bre\bes\bsu\bum\bme\be_\b_d\bda\bat\bta\ba () const;\n bool n\bne\bee\bed\bd_\b_s\bsa\bav\bve\be_\b_r\bre\bes\bsu\bum\bme\be_\b_d\bda\bat\bta\ba (resume_data_flags_t flags) const;\n void q\bqu\bue\beu\bue\be_\b_p\bpo\bos\bsi\bit\bti\bio\bon\bn_\b_u\bup\bp () const;\n void q\bqu\bue\beu\bue\be_\b_p\bpo\bos\bsi\bit\bti\bio\bon\bn_\b_t\bto\bop\bp () const;\n void q\bqu\bue\beu\bue\be_\b_p\bpo\bos\bsi\bit\bti\bio\bon\bn_\b_b\bbo\bot\btt\bto\bom\bm () const;\n queue_position_t q\bqu\bue\beu\bue\be_\b_p\bpo\bos\bsi\bit\bti\bio\bon\bn () const;\n void q\bqu\bue\beu\bue\be_\b_p\bpo\bos\bsi\bit\bti\bio\bon\bn_\b_d\bdo\bow\bwn\bn () const;\n void q\bqu\bue\beu\bue\be_\b_p\bpo\bos\bsi\bit\bti\bio\bon\bn_\b_s\bse\bet\bt (queue_position_t p) const;\n+ void s\bse\bet\bt_\b_s\bss\bsl\bl_\b_c\bce\ber\brt\bti\bif\bfi\bic\bca\bat\bte\be_\b_b\bbu\buf\bff\bfe\ber\br (std::string const& certificate\n+ , std::string const& private_key\n+ , std::string const& dh_params);\n void s\bse\bet\bt_\b_s\bss\bsl\bl_\b_c\bce\ber\brt\bti\bif\bfi\bic\bca\bat\bte\be (std::string const& certificate\n , std::string const& private_key\n , std::string const& dh_params\n , std::string const& passphrase = \"\");\n- void s\bse\bet\bt_\b_s\bss\bsl\bl_\b_c\bce\ber\brt\bti\bif\bfi\bic\bca\bat\bte\be_\b_b\bbu\buf\bff\bfe\ber\br (std::string const& certificate\n- , std::string const& private_key\n- , std::string const& dh_params);\n- std::shared_ptr t\bto\bor\brr\bre\ben\bnt\bt_\b_f\bfi\bil\ble\be_\b_w\bwi\bit\bth\bh_\b_h\bha\bas\bsh\bhe\bes\bs () const;\n std::shared_ptr t\bto\bor\brr\bre\ben\bnt\bt_\b_f\bfi\bil\ble\be () const;\n+ std::shared_ptr t\bto\bor\brr\bre\ben\bnt\bt_\b_f\bfi\bil\ble\be_\b_w\bwi\bit\bth\bh_\b_h\bha\bas\bsh\bhe\bes\bs () const;\n std::vector> p\bpi\bie\bec\bce\be_\b_l\bla\bay\bye\ber\brs\bs () const;\n void p\bpo\bos\bst\bt_\b_p\bpi\bie\bec\bce\be_\b_a\bav\bva\bai\bil\bla\bab\bbi\bil\bli\bit\bty\by () const;\n void p\bpi\bie\bec\bce\be_\b_a\bav\bva\bai\bil\bla\bab\bbi\bil\bli\bit\bty\by (std::vector& avail) const;\n download_priority_t p\bpi\bie\bec\bce\be_\b_p\bpr\bri\bio\bor\bri\bit\bty\by (piece_index_t index) const;\n- void p\bpi\bie\bec\bce\be_\b_p\bpr\bri\bio\bor\bri\bit\bty\by (piece_index_t index, download_priority_t priority)\n-const;\n+ void p\bpr\bri\bio\bor\bri\bit\bti\biz\bze\be_\b_p\bpi\bie\bec\bce\bes\bs (std::vector> const& pieces) const;\n void p\bpr\bri\bio\bor\bri\bit\bti\biz\bze\be_\b_p\bpi\bie\bec\bce\bes\bs (std::vector const& pieces)\n const;\n std::vector g\bge\bet\bt_\b_p\bpi\bie\bec\bce\be_\b_p\bpr\bri\bio\bor\bri\bit\bti\bie\bes\bs () const;\n- void p\bpr\bri\bio\bor\bri\bit\bti\biz\bze\be_\b_p\bpi\bie\bec\bce\bes\bs (std::vector> const& pieces) const;\n- std::vector g\bge\bet\bt_\b_f\bfi\bil\ble\be_\b_p\bpr\bri\bio\bor\bri\bit\bti\bie\bes\bs () const;\n+ void p\bpi\bie\bec\bce\be_\b_p\bpr\bri\bio\bor\bri\bit\bty\by (piece_index_t index, download_priority_t priority)\n+const;\n download_priority_t f\bfi\bil\ble\be_\b_p\bpr\bri\bio\bor\bri\bit\bty\by (file_index_t index) const;\n void p\bpr\bri\bio\bor\bri\bit\bti\biz\bze\be_\b_f\bfi\bil\ble\bes\bs (std::vector const& files) const;\n void f\bfi\bil\ble\be_\b_p\bpr\bri\bio\bor\bri\bit\bty\by (file_index_t index, download_priority_t priority) const;\n- void f\bfo\bor\brc\bce\be_\b_l\bls\bsd\bd_\b_a\ban\bnn\bno\bou\bun\bnc\bce\be () const;\n+ std::vector g\bge\bet\bt_\b_f\bfi\bil\ble\be_\b_p\bpr\bri\bio\bor\bri\bit\bti\bie\bes\bs () const;\n void f\bfo\bor\brc\bce\be_\b_r\bre\bea\ban\bnn\bno\bou\bun\bnc\bce\be (int seconds = 0, int idx = -1, reannounce_flags_t =\n {}) const;\n+ void f\bfo\bor\brc\bce\be_\b_l\bls\bsd\bd_\b_a\ban\bnn\bno\bou\bun\bnc\bce\be () const;\n void f\bfo\bor\brc\bce\be_\b_d\bdh\bht\bt_\b_a\ban\bnn\bno\bou\bun\bnc\bce\be () const;\n void s\bsc\bcr\bra\bap\bpe\be_\b_t\btr\bra\bac\bck\bke\ber\br (int idx = -1) const;\n int d\bdo\bow\bwn\bnl\blo\boa\bad\bd_\b_l\bli\bim\bmi\bit\bt () const;\n+ void s\bse\bet\bt_\b_d\bdo\bow\bwn\bnl\blo\boa\bad\bd_\b_l\bli\bim\bmi\bit\bt (int limit) const;\n int u\bup\bpl\blo\boa\bad\bd_\b_l\bli\bim\bmi\bit\bt () const;\n void s\bse\bet\bt_\b_u\bup\bpl\blo\boa\bad\bd_\b_l\bli\bim\bmi\bit\bt (int limit) const;\n- void s\bse\bet\bt_\b_d\bdo\bow\bwn\bnl\blo\boa\bad\bd_\b_l\bli\bim\bmi\bit\bt (int limit) const;\n void c\bco\bon\bnn\bne\bec\bct\bt_\b_p\bpe\bee\ber\br (tcp::endpoint const& adr, peer_source_flags_t source = {}\n , pex_flags_t flags = pex_encryption | pex_utp | pex_holepunch) const;\n void c\bcl\ble\bea\bar\br_\b_p\bpe\bee\ber\brs\bs ();\n- void s\bse\bet\bt_\b_m\bma\bax\bx_\b_u\bup\bpl\blo\boa\bad\bds\bs (int max_uploads) const;\n int m\bma\bax\bx_\b_u\bup\bpl\blo\boa\bad\bds\bs () const;\n- void s\bse\bet\bt_\b_m\bma\bax\bx_\b_c\bco\bon\bnn\bne\bec\bct\bti\bio\bon\bns\bs (int max_connections) const;\n+ void s\bse\bet\bt_\b_m\bma\bax\bx_\b_u\bup\bpl\blo\boa\bad\bds\bs (int max_uploads) const;\n int m\bma\bax\bx_\b_c\bco\bon\bnn\bne\bec\bct\bti\bio\bon\bns\bs () const;\n+ void s\bse\bet\bt_\b_m\bma\bax\bx_\b_c\bco\bon\bnn\bne\bec\bct\bti\bio\bon\bns\bs (int max_connections) const;\n void m\bmo\bov\bve\be_\b_s\bst\bto\bor\bra\bag\bge\be (std::string const& save_path\n , move_flags_t flags = move_flags_t::always_replace_files\n ) const;\n void r\bre\ben\bna\bam\bme\be_\b_f\bfi\bil\ble\be (file_index_t index, std::string const& new_name) const;\n info_hash_t i\bin\bnf\bfo\bo_\b_h\bha\bas\bsh\bhe\bes\bs () const;\n sha1_hash i\bin\bnf\bfo\bo_\b_h\bha\bas\bsh\bh () const;\n bool o\bop\bpe\ber\bra\bat\bto\bor\br<\b< (const torrent_handle& h) const;\n- bool o\bop\bpe\ber\bra\bat\bto\bor\br!\b!=\b= (const torrent_handle& h) const;\n bool o\bop\bpe\ber\bra\bat\bto\bor\br=\b==\b= (const torrent_handle& h) const;\n+ bool o\bop\bpe\ber\bra\bat\bto\bor\br!\b!=\b= (const torrent_handle& h) const;\n std::uint32_t i\bid\bd () const;\n std::shared_ptr n\bna\bat\bti\biv\bve\be_\b_h\bha\ban\bnd\bdl\ble\be () const;\n client_data_t u\bus\bse\ber\brd\bda\bat\bta\ba () const;\n bool i\bin\bn_\b_s\bse\bes\bss\bsi\bio\bon\bn () const;\n \n static constexpr add_piece_flags_t o\bov\bve\ber\brw\bwr\bri\bit\bte\be_\b_e\bex\bxi\bis\bst\bti\bin\bng\bg = 0_bit;\n static constexpr status_flags_t q\bqu\bue\ber\bry\by_\b_d\bdi\bis\bst\btr\bri\bib\bbu\but\bte\bed\bd_\b_c\bco\bop\bpi\bie\bes\bs = 0_bit;\n@@ -354,30 +354,30 @@\n to finish in the same order as you initiated them.\n [_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n *\b**\b**\b**\b**\b* h\bha\bav\bve\be_\b_p\bpi\bie\bec\bce\be(\b()\b) *\b**\b**\b**\b**\b*\n bool h\bha\bav\bve\be_\b_p\bpi\bie\bec\bce\be (piece_index_t piece) const;\n Returns true if this piece has been completely downloaded and written to disk,\n and false otherwise.\n [_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b* g\bge\bet\bt_\b_p\bpe\bee\ber\br_\b_i\bin\bnf\bfo\bo(\b()\b) p\bpo\bos\bst\bt_\b_p\bpe\bee\ber\br_\b_i\bin\bnf\bfo\bo(\b()\b) *\b**\b**\b**\b**\b*\n+*\b**\b**\b**\b**\b* p\bpo\bos\bst\bt_\b_p\bpe\bee\ber\br_\b_i\bin\bnf\bfo\bo(\b()\b) g\bge\bet\bt_\b_p\bpe\bee\ber\br_\b_i\bin\bnf\bfo\bo(\b()\b) *\b**\b**\b**\b**\b*\n void p\bpo\bos\bst\bt_\b_p\bpe\bee\ber\br_\b_i\bin\bnf\bfo\bo () const;\n void g\bge\bet\bt_\b_p\bpe\bee\ber\br_\b_i\bin\bnf\bfo\bo (std::vector& v) const;\n Query information about connected peers for this torrent. If the _\bt_\bo_\br_\br_\be_\bn_\bt_\b__\bh_\ba_\bn_\bd_\bl_\be\n is invalid, it will throw a system_error exception.\n post_peer_info() is asynchronous and will trigger the posting of a\n _\bp_\be_\be_\br_\b__\bi_\bn_\bf_\bo_\b__\ba_\bl_\be_\br_\bt. The _\ba_\bl_\be_\br_\bt contain a list of _\bp_\be_\be_\br_\b__\bi_\bn_\bf_\bo objects, one for each\n connected peer.\n get_peer_info() is synchronous and takes a reference to a vector that will be\n cleared and filled with one _\be_\bn_\bt_\br_\by for each peer connected to this torrent,\n given the handle is valid. Each _\be_\bn_\bt_\br_\by in the vector contains information about\n that particular peer. See _\bp_\be_\be_\br_\b__\bi_\bn_\bf_\bo.\n [_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b* p\bpo\bos\bst\bt_\b_s\bst\bta\bat\btu\bus\bs(\b()\b) s\bst\bta\bat\btu\bus\bs(\b()\b) *\b**\b**\b**\b**\b*\n-torrent_status s\bst\bta\bat\btu\bus\bs (status_flags_t flags = status_flags_t::all()) const;\n+*\b**\b**\b**\b**\b* s\bst\bta\bat\btu\bus\bs(\b()\b) p\bpo\bos\bst\bt_\b_s\bst\bta\bat\btu\bus\bs(\b()\b) *\b**\b**\b**\b**\b*\n void p\bpo\bos\bst\bt_\b_s\bst\bta\bat\btu\bus\bs (status_flags_t flags = status_flags_t::all()) const;\n+torrent_status s\bst\bta\bat\btu\bus\bs (status_flags_t flags = status_flags_t::all()) const;\n status() will return a structure with information about the status of this\n torrent. If the _\bt_\bo_\br_\br_\be_\bn_\bt_\b__\bh_\ba_\bn_\bd_\bl_\be is invalid, it will throw system_error\n exception. See _\bt_\bo_\br_\br_\be_\bn_\bt_\b__\bs_\bt_\ba_\bt_\bu_\bs. The flags argument filters what information is\n returned in the _\bt_\bo_\br_\br_\be_\bn_\bt_\b__\bs_\bt_\ba_\bt_\bu_\bs. Some information in there is relatively\n expensive to calculate, and if you're not interested in it (and see performance\n issues), you can filter them out.\n The status() function will block until the internal libtorrent thread responds\n@@ -385,27 +385,27 @@\n It will trigger posting of a _\bs_\bt_\ba_\bt_\be_\b__\bu_\bp_\bd_\ba_\bt_\be_\b__\ba_\bl_\be_\br_\bt with a single _\bt_\bo_\br_\br_\be_\bn_\bt_\b__\bs_\bt_\ba_\bt_\bu_\bs\n object for this torrent.\n In order to get regular updates for torrents whose status changes, consider\n calling session::post_torrent_updates()`` instead.\n By default everything is included. The flags you can use to decide what to\n i\bin\bnc\bcl\blu\bud\bde\be are defined in this class.\n [_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b* p\bpo\bos\bst\bt_\b_d\bdo\bow\bwn\bnl\blo\boa\bad\bd_\b_q\bqu\bue\beu\bue\be(\b()\b) g\bge\bet\bt_\b_d\bdo\bow\bwn\bnl\blo\boa\bad\bd_\b_q\bqu\bue\beu\bue\be(\b()\b) *\b**\b**\b**\b**\b*\n-void p\bpo\bos\bst\bt_\b_d\bdo\bow\bwn\bnl\blo\boa\bad\bd_\b_q\bqu\bue\beu\bue\be () const;\n+*\b**\b**\b**\b**\b* g\bge\bet\bt_\b_d\bdo\bow\bwn\bnl\blo\boa\bad\bd_\b_q\bqu\bue\beu\bue\be(\b()\b) p\bpo\bos\bst\bt_\b_d\bdo\bow\bwn\bnl\blo\boa\bad\bd_\b_q\bqu\bue\beu\bue\be(\b()\b) *\b**\b**\b**\b**\b*\n std::vector g\bge\bet\bt_\b_d\bdo\bow\bwn\bnl\blo\boa\bad\bd_\b_q\bqu\bue\beu\bue\be () const;\n+void p\bpo\bos\bst\bt_\b_d\bdo\bow\bwn\bnl\blo\boa\bad\bd_\b_q\bqu\bue\beu\bue\be () const;\n void g\bge\bet\bt_\b_d\bdo\bow\bwn\bnl\blo\boa\bad\bd_\b_q\bqu\bue\beu\bue\be (std::vector& queue) const;\n post_download_queue() triggers a download_queue_alert to be posted.\n get_download_queue() is a synchronous call and returns a vector with\n information about pieces that are partially downloaded or not downloaded but\n partially requested. See _\bp_\ba_\br_\bt_\bi_\ba_\bl_\b__\bp_\bi_\be_\bc_\be_\b__\bi_\bn_\bf_\bo for the fields in the returned\n vector.\n [_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b* s\bse\bet\bt_\b_p\bpi\bie\bec\bce\be_\b_d\bde\bea\bad\bdl\bli\bin\bne\be(\b()\b) r\bre\bes\bse\bet\bt_\b_p\bpi\bie\bec\bce\be_\b_d\bde\bea\bad\bdl\bli\bin\bne\be(\b()\b) c\bcl\ble\bea\bar\br_\b_p\bpi\bie\bec\bce\be_\b_d\bde\bea\bad\bdl\bli\bin\bne\bes\bs(\b()\b) *\b**\b**\b**\b**\b*\n-void c\bcl\ble\bea\bar\br_\b_p\bpi\bie\bec\bce\be_\b_d\bde\bea\bad\bdl\bli\bin\bne\bes\bs () const;\n+*\b**\b**\b**\b**\b* c\bcl\ble\bea\bar\br_\b_p\bpi\bie\bec\bce\be_\b_d\bde\bea\bad\bdl\bli\bin\bne\bes\bs(\b()\b) r\bre\bes\bse\bet\bt_\b_p\bpi\bie\bec\bce\be_\b_d\bde\bea\bad\bdl\bli\bin\bne\be(\b()\b) s\bse\bet\bt_\b_p\bpi\bie\bec\bce\be_\b_d\bde\bea\bad\bdl\bli\bin\bne\be(\b()\b) *\b**\b**\b**\b**\b*\n void r\bre\bes\bse\bet\bt_\b_p\bpi\bie\bec\bce\be_\b_d\bde\bea\bad\bdl\bli\bin\bne\be (piece_index_t index) const;\n+void c\bcl\ble\bea\bar\br_\b_p\bpi\bie\bec\bce\be_\b_d\bde\bea\bad\bdl\bli\bin\bne\bes\bs () const;\n void s\bse\bet\bt_\b_p\bpi\bie\bec\bce\be_\b_d\bde\bea\bad\bdl\bli\bin\bne\be (piece_index_t index, int deadline, deadline_flags_t\n flags = {}) const;\n This function sets or resets the deadline associated with a specific piece\n index (index). libtorrent will attempt to download this entire piece before the\n deadline expires. This is not necessarily possible, but pieces with a more\n recent deadline will always be prioritized over pieces with a deadline further\n ahead in time. The deadline (and flags) of a piece can be changed by calling\n@@ -416,18 +416,18 @@\n deadline is the number of milliseconds until this piece should be completed.\n reset_piece_deadline removes the deadline from the piece. If it hasn't already\n been downloaded, it will no longer be considered a priority.\n clear_piece_deadlines() removes deadlines on all pieces in the torrent. As if\n _\br_\be_\bs_\be_\bt_\b__\bp_\bi_\be_\bc_\be_\b__\bd_\be_\ba_\bd_\bl_\bi_\bn_\be_\b(_\b) was called on all pieces.\n [_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n *\b**\b**\b**\b**\b* f\bfi\bil\ble\be_\b_p\bpr\bro\bog\bgr\bre\bes\bss\bs(\b()\b) p\bpo\bos\bst\bt_\b_f\bfi\bil\ble\be_\b_p\bpr\bro\bog\bgr\bre\bes\bss\bs(\b()\b) *\b**\b**\b**\b**\b*\n-std::vector f\bfi\bil\ble\be_\b_p\bpr\bro\bog\bgr\bre\bes\bss\bs (file_progress_flags_t flags = {})\n-const;\n void f\bfi\bil\ble\be_\b_p\bpr\bro\bog\bgr\bre\bes\bss\bs (std::vector& progress, file_progress_flags_t\n flags = {}) const;\n+std::vector f\bfi\bil\ble\be_\b_p\bpr\bro\bog\bgr\bre\bes\bss\bs (file_progress_flags_t flags = {})\n+const;\n void p\bpo\bos\bst\bt_\b_f\bfi\bil\ble\be_\b_p\bpr\bro\bog\bgr\bre\bes\bss\bs (file_progress_flags_t flags) const;\n This function fills in the supplied vector, or returns a vector, with the\n number of bytes downloaded of each file in this torrent. The progress values\n are ordered the same as the files in the _\bt_\bo_\br_\br_\be_\bn_\bt_\b__\bi_\bn_\bf_\bo.\n This operation is not very cheap. Its complexity is O\bO(\b(n\bn +\b+ m\bmj\bj)\b). Where n\bn is the\n number of files, m\bm is the number of currently downloading pieces and j\bj is the\n number of blocks in a piece.\n@@ -449,19 +449,19 @@\n See _\bo_\bp_\be_\bn_\b__\bf_\bi_\bl_\be_\b__\bs_\bt_\ba_\bt_\be\n [_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n *\b**\b**\b**\b**\b* c\bcl\ble\bea\bar\br_\b_e\ber\brr\bro\bor\br(\b()\b) *\b**\b**\b**\b**\b*\n void c\bcl\ble\bea\bar\br_\b_e\ber\brr\bro\bor\br () const;\n If the torrent is in an error state (i.e. torrent_status::error is non-empty),\n this will clear the error and start the torrent again.\n [_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b* a\bad\bdd\bd_\b_t\btr\bra\bac\bck\bke\ber\br(\b()\b) r\bre\bep\bpl\bla\bac\bce\be_\b_t\btr\bra\bac\bck\bke\ber\brs\bs(\b()\b) t\btr\bra\bac\bck\bke\ber\brs\bs(\b()\b) p\bpo\bos\bst\bt_\b_t\btr\bra\bac\bck\bke\ber\brs\bs(\b()\b) *\b**\b**\b**\b**\b*\n-std::vector t\btr\bra\bac\bck\bke\ber\brs\bs () const;\n+*\b**\b**\b**\b**\b* p\bpo\bos\bst\bt_\b_t\btr\bra\bac\bck\bke\ber\brs\bs(\b()\b) t\btr\bra\bac\bck\bke\ber\brs\bs(\b()\b) r\bre\bep\bpl\bla\bac\bce\be_\b_t\btr\bra\bac\bck\bke\ber\brs\bs(\b()\b) a\bad\bdd\bd_\b_t\btr\bra\bac\bck\bke\ber\br(\b()\b) *\b**\b**\b**\b**\b*\n void p\bpo\bos\bst\bt_\b_t\btr\bra\bac\bck\bke\ber\brs\bs () const;\n-void a\bad\bdd\bd_\b_t\btr\bra\bac\bck\bke\ber\br (announce_entry const&) const;\n+std::vector t\btr\bra\bac\bck\bke\ber\brs\bs () const;\n void r\bre\bep\bpl\bla\bac\bce\be_\b_t\btr\bra\bac\bck\bke\ber\brs\bs (std::vector const&) const;\n+void a\bad\bdd\bd_\b_t\btr\bra\bac\bck\bke\ber\br (announce_entry const&) const;\n trackers() returns the list of trackers for this torrent. The announce _\be_\bn_\bt_\br_\by\n contains both a string url which specify the announce url for the tracker as\n well as an _\bi_\bn_\bt tier, which is specifies the order in which this tracker is\n tried. If you want libtorrent to use another list of trackers for this torrent,\n you can use replace_trackers() which takes a list of the same form as the one\n returned from trackers() and will replace it. If you want an immediate effect,\n you have to call _\bf_\bo_\br_\bc_\be_\b__\br_\be_\ba_\bn_\bn_\bo_\bu_\bn_\bc_\be_\b(_\b). See _\ba_\bn_\bn_\bo_\bu_\bn_\bc_\be_\b__\be_\bn_\bt_\br_\by.\n@@ -470,27 +470,27 @@\n add_tracker() will look if the specified tracker is already in the set. If it\n is, it doesn't do anything. If it's not in the current set of trackers, it will\n insert it in the tier specified in the _\ba_\bn_\bn_\bo_\bu_\bn_\bc_\be_\b__\be_\bn_\bt_\br_\by.\n The updated set of trackers will be saved in the resume data, and when a\n torrent is started with resume data, the trackers from the resume data will\n replace the original ones.\n [_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b* u\bur\brl\bl_\b_s\bse\bee\bed\bds\bs(\b()\b) r\bre\bem\bmo\bov\bve\be_\b_u\bur\brl\bl_\b_s\bse\bee\bed\bd(\b()\b) a\bad\bdd\bd_\b_u\bur\brl\bl_\b_s\bse\bee\bed\bd(\b()\b) *\b**\b**\b**\b**\b*\n+*\b**\b**\b**\b**\b* a\bad\bdd\bd_\b_u\bur\brl\bl_\b_s\bse\bee\bed\bd(\b()\b) r\bre\bem\bmo\bov\bve\be_\b_u\bur\brl\bl_\b_s\bse\bee\bed\bd(\b()\b) u\bur\brl\bl_\b_s\bse\bee\bed\bds\bs(\b()\b) *\b**\b**\b**\b**\b*\n void a\bad\bdd\bd_\b_u\bur\brl\bl_\b_s\bse\bee\bed\bd (std::string const& url) const;\n void r\bre\bem\bmo\bov\bve\be_\b_u\bur\brl\bl_\b_s\bse\bee\bed\bd (std::string const& url) const;\n std::set u\bur\brl\bl_\b_s\bse\bee\bed\bds\bs () const;\n add_url_seed() adds another url to the torrent's list of url seeds. If the\n given url already exists in that list, the call has no effect. The torrent will\n connect to the server and try to download pieces from it, unless it's paused,\n queued, checking or seeding. remove_url_seed() removes the given url if it\n exists already. url_seeds() return a set of the url seeds currently in this\n torrent. Note that URLs that fails may be removed automatically from the list.\n See _\bh_\bt_\bt_\bp_\b _\bs_\be_\be_\bd_\bi_\bn_\bg for more information.\n [_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b* h\bht\btt\btp\bp_\b_s\bse\bee\bed\bds\bs(\b()\b) a\bad\bdd\bd_\b_h\bht\btt\btp\bp_\b_s\bse\bee\bed\bd(\b()\b) r\bre\bem\bmo\bov\bve\be_\b_h\bht\btt\btp\bp_\b_s\bse\bee\bed\bd(\b()\b) *\b**\b**\b**\b**\b*\n+*\b**\b**\b**\b**\b* h\bht\btt\btp\bp_\b_s\bse\bee\bed\bds\bs(\b()\b) r\bre\bem\bmo\bov\bve\be_\b_h\bht\btt\btp\bp_\b_s\bse\bee\bed\bd(\b()\b) a\bad\bdd\bd_\b_h\bht\btt\btp\bp_\b_s\bse\bee\bed\bd(\b()\b) *\b**\b**\b**\b**\b*\n std::set h\bht\btt\btp\bp_\b_s\bse\bee\bed\bds\bs () const;\n void r\bre\bem\bmo\bov\bve\be_\b_h\bht\btt\btp\bp_\b_s\bse\bee\bed\bd (std::string const& url) const;\n void a\bad\bdd\bd_\b_h\bht\btt\btp\bp_\b_s\bse\bee\bed\bd (std::string const& url) const;\n These functions are identical as the *_url_seed() variants, but they operate on\n _\bB_\bE_\bP_\b _\b1_\b7 web seeds instead of _\bB_\bE_\bP_\b _\b1_\b9.\n See _\bh_\bt_\bt_\bp_\b _\bs_\be_\be_\bd_\bi_\bn_\bg for more information.\n [_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n@@ -541,19 +541,19 @@\n for the torrent_status::paused flag.\n Note\n Torrents that are auto-managed may be automatically resumed again. It does not\n make sense to pause an auto-managed torrent without making it not auto-managed\n first. Torrents are auto-managed by default when added to the _\bs_\be_\bs_\bs_\bi_\bo_\bn. For more\n information, see _\bq_\bu_\be_\bu_\bi_\bn_\bg.\n [_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b* u\bun\bns\bse\bet\bt_\b_f\bfl\bla\bag\bgs\bs(\b()\b) f\bfl\bla\bag\bgs\bs(\b()\b) s\bse\bet\bt_\b_f\bfl\bla\bag\bgs\bs(\b()\b) *\b**\b**\b**\b**\b*\n-void s\bse\bet\bt_\b_f\bfl\bla\bag\bgs\bs (torrent_flags_t flags) const;\n+*\b**\b**\b**\b**\b* f\bfl\bla\bag\bgs\bs(\b()\b) s\bse\bet\bt_\b_f\bfl\bla\bag\bgs\bs(\b()\b) u\bun\bns\bse\bet\bt_\b_f\bfl\bla\bag\bgs\bs(\b()\b) *\b**\b**\b**\b**\b*\n+void u\bun\bns\bse\bet\bt_\b_f\bfl\bla\bag\bgs\bs (torrent_flags_t flags) const;\n void s\bse\bet\bt_\b_f\bfl\bla\bag\bgs\bs (torrent_flags_t flags, torrent_flags_t mask) const;\n+void s\bse\bet\bt_\b_f\bfl\bla\bag\bgs\bs (torrent_flags_t flags) const;\n torrent_flags_t f\bfl\bla\bag\bgs\bs () const;\n-void u\bun\bns\bse\bet\bt_\b_f\bfl\bla\bag\bgs\bs (torrent_flags_t flags) const;\n sets and gets the torrent state flags. See _\bt_\bo_\br_\br_\be_\bn_\bt_\b__\bf_\bl_\ba_\bg_\bs_\b__\bt. The set_flags\n overload that take a mask will affect all flags part of the mask, and set their\n values to what the flags argument is set to. This allows clearing and setting\n flags in a single function call. The set_flags overload that just takes flags,\n sets all the specified flags and leave any other flags unchanged. unset_flags\n clears the specified flags, while leaving any other flags unchanged.\n Theseed_modeflag is special, it can only be cleared once the torrent has been\n@@ -677,16 +677,16 @@\n thread. A way to avoid blocking is to instead call _\bs_\ba_\bv_\be_\b__\br_\be_\bs_\bu_\bm_\be_\b__\bd_\ba_\bt_\ba_\b(_\b) directly,\n specifying the conditions under which resume data should be saved.\n Note\n A torrent's resume data is considered saved as soon as the\n _\bs_\ba_\bv_\be_\b__\br_\be_\bs_\bu_\bm_\be_\b__\bd_\ba_\bt_\ba_\b__\ba_\bl_\be_\br_\bt is posted. It is important to make sure this _\ba_\bl_\be_\br_\bt is\n received and handled in order for this function to be meaningful.\n [_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b* q\bqu\bue\beu\bue\be_\b_p\bpo\bos\bsi\bit\bti\bio\bon\bn_\b_t\bto\bop\bp(\b()\b) q\bqu\bue\beu\bue\be_\b_p\bpo\bos\bsi\bit\bti\bio\bon\bn_\b_b\bbo\bot\btt\bto\bom\bm(\b()\b) q\bqu\bue\beu\bue\be_\b_p\bpo\bos\bsi\bit\bti\bio\bon\bn(\b()\b)\n-q\bqu\bue\beu\bue\be_\b_p\bpo\bos\bsi\bit\bti\bio\bon\bn_\b_d\bdo\bow\bwn\bn(\b()\b) q\bqu\bue\beu\bue\be_\b_p\bpo\bos\bsi\bit\bti\bio\bon\bn_\b_u\bup\bp(\b()\b) *\b**\b**\b**\b**\b*\n+*\b**\b**\b**\b**\b* q\bqu\bue\beu\bue\be_\b_p\bpo\bos\bsi\bit\bti\bio\bon\bn_\b_u\bup\bp(\b()\b) q\bqu\bue\beu\bue\be_\b_p\bpo\bos\bsi\bit\bti\bio\bon\bn_\b_d\bdo\bow\bwn\bn(\b()\b) q\bqu\bue\beu\bue\be_\b_p\bpo\bos\bsi\bit\bti\bio\bon\bn_\b_t\bto\bop\bp(\b()\b)\n+q\bqu\bue\beu\bue\be_\b_p\bpo\bos\bsi\bit\bti\bio\bon\bn_\b_b\bbo\bot\btt\bto\bom\bm(\b()\b) q\bqu\bue\beu\bue\be_\b_p\bpo\bos\bsi\bit\bti\bio\bon\bn(\b()\b) *\b**\b**\b**\b**\b*\n void q\bqu\bue\beu\bue\be_\b_p\bpo\bos\bsi\bit\bti\bio\bon\bn_\b_u\bup\bp () const;\n void q\bqu\bue\beu\bue\be_\b_p\bpo\bos\bsi\bit\bti\bio\bon\bn_\b_t\bto\bop\bp () const;\n void q\bqu\bue\beu\bue\be_\b_p\bpo\bos\bsi\bit\bti\bio\bon\bn_\b_b\bbo\bot\btt\bto\bom\bm () const;\n queue_position_t q\bqu\bue\beu\bue\be_\b_p\bpo\bos\bsi\bit\bti\bio\bon\bn () const;\n void q\bqu\bue\beu\bue\be_\b_p\bpo\bos\bsi\bit\bti\bio\bon\bn_\b_d\bdo\bow\bwn\bn () const;\n Every torrent that is added is assigned a queue position exactly one greater\n than the greatest queue position of all existing torrents. Torrents that are\n@@ -705,22 +705,22 @@\n [_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n *\b**\b**\b**\b**\b* q\bqu\bue\beu\bue\be_\b_p\bpo\bos\bsi\bit\bti\bio\bon\bn_\b_s\bse\bet\bt(\b()\b) *\b**\b**\b**\b**\b*\n void q\bqu\bue\beu\bue\be_\b_p\bpo\bos\bsi\bit\bti\bio\bon\bn_\b_s\bse\bet\bt (queue_position_t p) const;\n updates the position in the queue for this torrent. The relative order of all\n other torrents remain intact but their numerical queue position shifts to make\n space for this torrent's new position\n [_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b* s\bse\bet\bt_\b_s\bss\bsl\bl_\b_c\bce\ber\brt\bti\bif\bfi\bic\bca\bat\bte\be(\b()\b) s\bse\bet\bt_\b_s\bss\bsl\bl_\b_c\bce\ber\brt\bti\bif\bfi\bic\bca\bat\bte\be_\b_b\bbu\buf\bff\bfe\ber\br(\b()\b) *\b**\b**\b**\b**\b*\n+*\b**\b**\b**\b**\b* s\bse\bet\bt_\b_s\bss\bsl\bl_\b_c\bce\ber\brt\bti\bif\bfi\bic\bca\bat\bte\be_\b_b\bbu\buf\bff\bfe\ber\br(\b()\b) s\bse\bet\bt_\b_s\bss\bsl\bl_\b_c\bce\ber\brt\bti\bif\bfi\bic\bca\bat\bte\be(\b()\b) *\b**\b**\b**\b**\b*\n+void s\bse\bet\bt_\b_s\bss\bsl\bl_\b_c\bce\ber\brt\bti\bif\bfi\bic\bca\bat\bte\be_\b_b\bbu\buf\bff\bfe\ber\br (std::string const& certificate\n+ , std::string const& private_key\n+ , std::string const& dh_params);\n void s\bse\bet\bt_\b_s\bss\bsl\bl_\b_c\bce\ber\brt\bti\bif\bfi\bic\bca\bat\bte\be (std::string const& certificate\n , std::string const& private_key\n , std::string const& dh_params\n , std::string const& passphrase = \"\");\n-void s\bse\bet\bt_\b_s\bss\bsl\bl_\b_c\bce\ber\brt\bti\bif\bfi\bic\bca\bat\bte\be_\b_b\bbu\buf\bff\bfe\ber\br (std::string const& certificate\n- , std::string const& private_key\n- , std::string const& dh_params);\n For SSL torrents, use this to specify a path to a .pem file to use as this\n client's certificate. The certificate must be signed by the certificate in the\n .torrent file to be valid.\n The _\bs_\be_\bt_\b__\bs_\bs_\bl_\b__\bc_\be_\br_\bt_\bi_\bf_\bi_\bc_\ba_\bt_\be_\b__\bb_\bu_\bf_\bf_\be_\br_\b(_\b) overload takes the actual certificate, private\n key and DH params as strings, rather than paths to files.\n cert is a path to the (signed) certificate in .pem format corresponding to this\n torrent.\n@@ -735,16 +735,16 @@\n suspend connecting to any peers until it has one. It's typically desirable to\n resume the torrent after setting the SSL certificate.\n If you receive a _\bt_\bo_\br_\br_\be_\bn_\bt_\b__\bn_\be_\be_\bd_\b__\bc_\be_\br_\bt_\b__\ba_\bl_\be_\br_\bt, you need to call this to provide a\n valid cert. If you don't have a cert you won't be allowed to connect to any\n peers.\n [_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n *\b**\b**\b**\b**\b* t\bto\bor\brr\bre\ben\bnt\bt_\b_f\bfi\bil\ble\be(\b()\b) t\bto\bor\brr\bre\ben\bnt\bt_\b_f\bfi\bil\ble\be_\b_w\bwi\bit\bth\bh_\b_h\bha\bas\bsh\bhe\bes\bs(\b()\b) *\b**\b**\b**\b**\b*\n-std::shared_ptr t\bto\bor\brr\bre\ben\bnt\bt_\b_f\bfi\bil\ble\be_\b_w\bwi\bit\bth\bh_\b_h\bha\bas\bsh\bhe\bes\bs () const;\n std::shared_ptr t\bto\bor\brr\bre\ben\bnt\bt_\b_f\bfi\bil\ble\be () const;\n+std::shared_ptr t\bto\bor\brr\bre\ben\bnt\bt_\b_f\bfi\bil\ble\be_\b_w\bwi\bit\bth\bh_\b_h\bha\bas\bsh\bhe\bes\bs () const;\n _\bt_\bo_\br_\br_\be_\bn_\bt_\b__\bf_\bi_\bl_\be_\b(_\b) returns a pointer to the _\bt_\bo_\br_\br_\be_\bn_\bt_\b__\bi_\bn_\bf_\bo object associated with\n this torrent. The _\bt_\bo_\br_\br_\be_\bn_\bt_\b__\bi_\bn_\bf_\bo object may be a copy of the internal object. If\n the torrent doesn't have metadata, the pointer will not be initialized (i.e. a\n nullptr). The torrent may be in a state without metadata only if it was started\n without a .torrent file, e.g. by being added by magnet link.\n Note that the _\bt_\bo_\br_\br_\be_\bn_\bt_\b__\bi_\bn_\bf_\bo object returned here may be a different instance\n than the one added to the _\bs_\be_\bs_\bs_\bi_\bo_\bn, with different attributes like piece layers,\n@@ -770,33 +770,33 @@\n [_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n *\b**\b**\b**\b**\b* p\bpi\bie\bec\bce\be_\b_l\bla\bay\bye\ber\brs\bs(\b()\b) *\b**\b**\b**\b**\b*\n std::vector> p\bpi\bie\bec\bce\be_\b_l\bla\bay\bye\ber\brs\bs () const;\n returns the piece layers for all files in the torrent. If this is a v1 torrent\n (and doesn't have any piece layers) it returns an empty vector. This is a\n blocking call that will synchronize with the libtorrent network thread.\n [_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b* p\bpo\bos\bst\bt_\b_p\bpi\bie\bec\bce\be_\b_a\bav\bva\bai\bil\bla\bab\bbi\bil\bli\bit\bty\by(\b()\b) p\bpi\bie\bec\bce\be_\b_a\bav\bva\bai\bil\bla\bab\bbi\bil\bli\bit\bty\by(\b()\b) *\b**\b**\b**\b**\b*\n+*\b**\b**\b**\b**\b* p\bpi\bie\bec\bce\be_\b_a\bav\bva\bai\bil\bla\bab\bbi\bil\bli\bit\bty\by(\b()\b) p\bpo\bos\bst\bt_\b_p\bpi\bie\bec\bce\be_\b_a\bav\bva\bai\bil\bla\bab\bbi\bil\bli\bit\bty\by(\b()\b) *\b**\b**\b**\b**\b*\n void p\bpo\bos\bst\bt_\b_p\bpi\bie\bec\bce\be_\b_a\bav\bva\bai\bil\bla\bab\bbi\bil\bli\bit\bty\by () const;\n void p\bpi\bie\bec\bce\be_\b_a\bav\bva\bai\bil\bla\bab\bbi\bil\bli\bit\bty\by (std::vector& avail) const;\n The piece availability is the number of peers that we are connected that has\n advertised having a particular piece. This is the information that libtorrent\n uses in order to prefer picking rare pieces.\n post_piece_availability() will trigger a _\bp_\bi_\be_\bc_\be_\b__\ba_\bv_\ba_\bi_\bl_\ba_\bb_\bi_\bl_\bi_\bt_\by_\b__\ba_\bl_\be_\br_\bt to be posted.\n piece_availability() fills the specified std::vector with the availability\n for each piece in this torrent. libtorrent does not keep track of availability\n for seeds, so if the torrent is seeding the availability for all pieces is\n reported as 0.\n [_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b* p\bpr\bri\bio\bor\bri\bit\bti\biz\bze\be_\b_p\bpi\bie\bec\bce\bes\bs(\b()\b) g\bge\bet\bt_\b_p\bpi\bie\bec\bce\be_\b_p\bpr\bri\bio\bor\bri\bit\bti\bie\bes\bs(\b()\b) p\bpi\bie\bec\bce\be_\b_p\bpr\bri\bio\bor\bri\bit\bty\by(\b()\b) *\b**\b**\b**\b**\b*\n+*\b**\b**\b**\b**\b* p\bpi\bie\bec\bce\be_\b_p\bpr\bri\bio\bor\bri\bit\bty\by(\b()\b) g\bge\bet\bt_\b_p\bpi\bie\bec\bce\be_\b_p\bpr\bri\bio\bor\bri\bit\bti\bie\bes\bs(\b()\b) p\bpr\bri\bio\bor\bri\bit\bti\biz\bze\be_\b_p\bpi\bie\bec\bce\bes\bs(\b()\b) *\b**\b**\b**\b**\b*\n download_priority_t p\bpi\bie\bec\bce\be_\b_p\bpr\bri\bio\bor\bri\bit\bty\by (piece_index_t index) const;\n-void p\bpi\bie\bec\bce\be_\b_p\bpr\bri\bio\bor\bri\bit\bty\by (piece_index_t index, download_priority_t priority) const;\n-void p\bpr\bri\bio\bor\bri\bit\bti\biz\bze\be_\b_p\bpi\bie\bec\bce\bes\bs (std::vector const& pieces) const;\n-std::vector g\bge\bet\bt_\b_p\bpi\bie\bec\bce\be_\b_p\bpr\bri\bio\bor\bri\bit\bti\bie\bes\bs () const;\n void p\bpr\bri\bio\bor\bri\bit\bti\biz\bze\be_\b_p\bpi\bie\bec\bce\bes\bs (std::vector> const& pieces) const;\n+void p\bpr\bri\bio\bor\bri\bit\bti\biz\bze\be_\b_p\bpi\bie\bec\bce\bes\bs (std::vector const& pieces) const;\n+std::vector g\bge\bet\bt_\b_p\bpi\bie\bec\bce\be_\b_p\bpr\bri\bio\bor\bri\bit\bti\bie\bes\bs () const;\n+void p\bpi\bie\bec\bce\be_\b_p\bpr\bri\bio\bor\bri\bit\bty\by (piece_index_t index, download_priority_t priority) const;\n These functions are used to set and get the priority of individual pieces. By\n default all pieces have priority 4. That means that the random rarest first\n algorithm is effectively active for all pieces. You may however change the\n priority of individual pieces. There are 8 priority levels. 0 means not to\n download the piece at all. Otherwise, lower priority values means less likely\n to be picked. Piece priority takes precedence over piece availability. Every\n piece with priority 7 will be attempted to be picked before a priority 6 piece\n@@ -817,18 +817,18 @@\n get_piece_priorities returns a vector with one element for each piece in the\n torrent. Each element is the current priority of that piece.\n It's possible to cancel the effect of f\bfi\bil\ble\be priorities by setting the priorities\n for the affected pieces. Care has to be taken when mixing usage of file- and\n piece priorities.\n [_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n *\b**\b**\b**\b**\b* p\bpr\bri\bio\bor\bri\bit\bti\biz\bze\be_\b_f\bfi\bil\ble\bes\bs(\b()\b) f\bfi\bil\ble\be_\b_p\bpr\bri\bio\bor\bri\bit\bty\by(\b()\b) g\bge\bet\bt_\b_f\bfi\bil\ble\be_\b_p\bpr\bri\bio\bor\bri\bit\bti\bie\bes\bs(\b()\b) *\b**\b**\b**\b**\b*\n-std::vector g\bge\bet\bt_\b_f\bfi\bil\ble\be_\b_p\bpr\bri\bio\bor\bri\bit\bti\bie\bes\bs () const;\n download_priority_t f\bfi\bil\ble\be_\b_p\bpr\bri\bio\bor\bri\bit\bty\by (file_index_t index) const;\n void p\bpr\bri\bio\bor\bri\bit\bti\biz\bze\be_\b_f\bfi\bil\ble\bes\bs (std::vector const& files) const;\n void f\bfi\bil\ble\be_\b_p\bpr\bri\bio\bor\bri\bit\bty\by (file_index_t index, download_priority_t priority) const;\n+std::vector g\bge\bet\bt_\b_f\bfi\bil\ble\be_\b_p\bpr\bri\bio\bor\bri\bit\bti\bie\bes\bs () const;\n index must be in the range [0, number_of_files).\n file_priority() queries or sets the priority of file index.\n prioritize_files() takes a vector that has at as many elements as there are\n files in the torrent. Each _\be_\bn_\bt_\br_\by is the priority of that file. The function\n sets the priorities of all the pieces in the torrent based on the vector.\n get_file_priorities() returns a vector with the priorities of all files.\n The priority values are the same as for _\bp_\bi_\be_\bc_\be_\b__\bp_\br_\bi_\bo_\br_\bi_\bt_\by_\b(_\b). See\n@@ -847,18 +847,18 @@\n When combining file- and piece priorities, the resume file will record both.\n When loading the resume data, the file priorities will be applied first, then\n the piece priorities.\n Moving data from a file into the part file is currently not supported. If a\n file has its priority set to 0 a\baf\bft\bte\ber\br it has already been created, it will not\n be moved into the partfile.\n [_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b* f\bfo\bor\brc\bce\be_\b_l\bls\bsd\bd_\b_a\ban\bnn\bno\bou\bun\bnc\bce\be(\b()\b) f\bfo\bor\brc\bce\be_\b_d\bdh\bht\bt_\b_a\ban\bnn\bno\bou\bun\bnc\bce\be(\b()\b) f\bfo\bor\brc\bce\be_\b_r\bre\bea\ban\bnn\bno\bou\bun\bnc\bce\be(\b()\b) *\b**\b**\b**\b**\b*\n-void f\bfo\bor\brc\bce\be_\b_l\bls\bsd\bd_\b_a\ban\bnn\bno\bou\bun\bnc\bce\be () const;\n+*\b**\b**\b**\b**\b* f\bfo\bor\brc\bce\be_\b_r\bre\bea\ban\bnn\bno\bou\bun\bnc\bce\be(\b()\b) f\bfo\bor\brc\bce\be_\b_l\bls\bsd\bd_\b_a\ban\bnn\bno\bou\bun\bnc\bce\be(\b()\b) f\bfo\bor\brc\bce\be_\b_d\bdh\bht\bt_\b_a\ban\bnn\bno\bou\bun\bnc\bce\be(\b()\b) *\b**\b**\b**\b**\b*\n void f\bfo\bor\brc\bce\be_\b_r\bre\bea\ban\bnn\bno\bou\bun\bnc\bce\be (int seconds = 0, int idx = -1, reannounce_flags_t = {})\n const;\n+void f\bfo\bor\brc\bce\be_\b_l\bls\bsd\bd_\b_a\ban\bnn\bno\bou\bun\bnc\bce\be () const;\n void f\bfo\bor\brc\bce\be_\b_d\bdh\bht\bt_\b_a\ban\bnn\bno\bou\bun\bnc\bce\be () const;\n force_reannounce() will force this torrent to do another tracker request, to\n receive new peers. The seconds argument specifies how many seconds from now to\n issue the tracker announces.\n If the tracker's min_interval has not passed since the last announce, the\n forced announce will be scheduled to happen immediately as the min_interval\n expires. This is to honor trackers minimum re-announce interval settings.\n@@ -877,20 +877,20 @@\n A scrape request queries the tracker for statistics such as total number of\n incomplete peers, complete peers, number of downloads etc.\n This request will specifically update the num_complete and num_incomplete\n fields in the _\bt_\bo_\br_\br_\be_\bn_\bt_\b__\bs_\bt_\ba_\bt_\bu_\bs struct once it completes. When it completes, it\n will generate a _\bs_\bc_\br_\ba_\bp_\be_\b__\br_\be_\bp_\bl_\by_\b__\ba_\bl_\be_\br_\bt. If it fails, it will generate a\n _\bs_\bc_\br_\ba_\bp_\be_\b__\bf_\ba_\bi_\bl_\be_\bd_\b__\ba_\bl_\be_\br_\bt.\n [_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b* s\bse\bet\bt_\b_d\bdo\bow\bwn\bnl\blo\boa\bad\bd_\b_l\bli\bim\bmi\bit\bt(\b()\b) s\bse\bet\bt_\b_u\bup\bpl\blo\boa\bad\bd_\b_l\bli\bim\bmi\bit\bt(\b()\b) u\bup\bpl\blo\boa\bad\bd_\b_l\bli\bim\bmi\bit\bt(\b()\b) d\bdo\bow\bwn\bnl\blo\boa\bad\bd_\b_l\bli\bim\bmi\bit\bt(\b()\b)\n+*\b**\b**\b**\b**\b* u\bup\bpl\blo\boa\bad\bd_\b_l\bli\bim\bmi\bit\bt(\b()\b) s\bse\bet\bt_\b_d\bdo\bow\bwn\bnl\blo\boa\bad\bd_\b_l\bli\bim\bmi\bit\bt(\b()\b) s\bse\bet\bt_\b_u\bup\bpl\blo\boa\bad\bd_\b_l\bli\bim\bmi\bit\bt(\b()\b) d\bdo\bow\bwn\bnl\blo\boa\bad\bd_\b_l\bli\bim\bmi\bit\bt(\b()\b)\n *\b**\b**\b**\b**\b*\n int d\bdo\bow\bwn\bnl\blo\boa\bad\bd_\b_l\bli\bim\bmi\bit\bt () const;\n+void s\bse\bet\bt_\b_d\bdo\bow\bwn\bnl\blo\boa\bad\bd_\b_l\bli\bim\bmi\bit\bt (int limit) const;\n int u\bup\bpl\blo\boa\bad\bd_\b_l\bli\bim\bmi\bit\bt () const;\n void s\bse\bet\bt_\b_u\bup\bpl\blo\boa\bad\bd_\b_l\bli\bim\bmi\bit\bt (int limit) const;\n-void s\bse\bet\bt_\b_d\bdo\bow\bwn\bnl\blo\boa\bad\bd_\b_l\bli\bim\bmi\bit\bt (int limit) const;\n set_upload_limit will limit the upload bandwidth used by this particular\n torrent to the limit you set. It is given as the number of bytes per second the\n torrent is allowed to upload. set_download_limit works the same way but for\n download bandwidth instead of upload bandwidth. Note that setting a higher\n limit on a torrent then the global limit (settings_pack::upload_rate_limit)\n will not override the global rate limit. The torrent can never upload more than\n the global rate limit.\n@@ -914,25 +914,25 @@\n *\b**\b**\b**\b**\b* c\bcl\ble\bea\bar\br_\b_p\bpe\bee\ber\brs\bs(\b()\b) *\b**\b**\b**\b**\b*\n void c\bcl\ble\bea\bar\br_\b_p\bpe\bee\ber\brs\bs ();\n This will disconnect all peers and clear the peer list for this torrent. New\n peers will have to be acquired before resuming, from trackers, DHT or local\n service discovery, for example.\n [_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n *\b**\b**\b**\b**\b* m\bma\bax\bx_\b_u\bup\bpl\blo\boa\bad\bds\bs(\b()\b) s\bse\bet\bt_\b_m\bma\bax\bx_\b_u\bup\bpl\blo\boa\bad\bds\bs(\b()\b) *\b**\b**\b**\b**\b*\n-void s\bse\bet\bt_\b_m\bma\bax\bx_\b_u\bup\bpl\blo\boa\bad\bds\bs (int max_uploads) const;\n int m\bma\bax\bx_\b_u\bup\bpl\blo\boa\bad\bds\bs () const;\n+void s\bse\bet\bt_\b_m\bma\bax\bx_\b_u\bup\bpl\blo\boa\bad\bds\bs (int max_uploads) const;\n set_max_uploads() sets the maximum number of peers that's unchoked at the same\n time on this torrent. If you set this to -1, there will be no limit. This\n defaults to infinite. The primary setting controlling this is the global\n unchoke slots limit, set by unchoke_slots_limit in _\bs_\be_\bt_\bt_\bi_\bn_\bg_\bs_\b__\bp_\ba_\bc_\bk.\n max_uploads() returns the current settings.\n [_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n *\b**\b**\b**\b**\b* m\bma\bax\bx_\b_c\bco\bon\bnn\bne\bec\bct\bti\bio\bon\bns\bs(\b()\b) s\bse\bet\bt_\b_m\bma\bax\bx_\b_c\bco\bon\bnn\bne\bec\bct\bti\bio\bon\bns\bs(\b()\b) *\b**\b**\b**\b**\b*\n-void s\bse\bet\bt_\b_m\bma\bax\bx_\b_c\bco\bon\bnn\bne\bec\bct\bti\bio\bon\bns\bs (int max_connections) const;\n int m\bma\bax\bx_\b_c\bco\bon\bnn\bne\bec\bct\bti\bio\bon\bns\bs () const;\n+void s\bse\bet\bt_\b_m\bma\bax\bx_\b_c\bco\bon\bnn\bne\bec\bct\bti\bio\bon\bns\bs (int max_connections) const;\n set_max_connections() sets the maximum number of connection this torrent will\n open. If all connections are used up, incoming connections may be refused or\n poor connections may be closed. This must be at least 2. The default is\n unlimited number of connections. If -1 is given to the function, it means\n unlimited. There is also a global limit of the number of connections, set by\n connections_limit in _\bs_\be_\bt_\bt_\bi_\bn_\bg_\bs_\b__\bp_\ba_\bc_\bk.\n max_connections() returns the current settings.\n@@ -982,27 +982,27 @@\n [_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n *\b**\b**\b**\b**\b* r\bre\ben\bna\bam\bme\be_\b_f\bfi\bil\ble\be(\b()\b) *\b**\b**\b**\b**\b*\n void r\bre\ben\bna\bam\bme\be_\b_f\bfi\bil\ble\be (file_index_t index, std::string const& new_name) const;\n Renames the file with the given index asynchronously. The rename operation is\n complete when either a _\bf_\bi_\bl_\be_\b__\br_\be_\bn_\ba_\bm_\be_\bd_\b__\ba_\bl_\be_\br_\bt or _\bf_\bi_\bl_\be_\b__\br_\be_\bn_\ba_\bm_\be_\b__\bf_\ba_\bi_\bl_\be_\bd_\b__\ba_\bl_\be_\br_\bt is\n posted.\n [_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b* i\bin\bnf\bfo\bo_\b_h\bha\bas\bsh\bhe\bes\bs(\b()\b) i\bin\bnf\bfo\bo_\b_h\bha\bas\bsh\bh(\b()\b) *\b**\b**\b**\b**\b*\n+*\b**\b**\b**\b**\b* i\bin\bnf\bfo\bo_\b_h\bha\bas\bsh\bh(\b()\b) i\bin\bnf\bfo\bo_\b_h\bha\bas\bsh\bhe\bes\bs(\b()\b) *\b**\b**\b**\b**\b*\n info_hash_t i\bin\bnf\bfo\bo_\b_h\bha\bas\bsh\bhe\bes\bs () const;\n sha1_hash i\bin\bnf\bfo\bo_\b_h\bha\bas\bsh\bh () const;\n returns the info-hash(es) of the torrent. If this handle is to a torrent that\n hasn't loaded yet (for instance by being added) by a URL, the returned value is\n undefined. The info_hash() returns the SHA-1 info-hash for v1 torrents and a\n truncated hash for v2 torrents. For the full v2 info-hash, use info_hashes()\n instead.\n [_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b* o\bop\bpe\ber\bra\bat\bto\bor\br=\b==\b=(\b()\b) o\bop\bpe\ber\bra\bat\bto\bor\br<\b<(\b()\b) o\bop\bpe\ber\bra\bat\bto\bor\br!\b!=\b=(\b()\b) *\b**\b**\b**\b**\b*\n+*\b**\b**\b**\b**\b* o\bop\bpe\ber\bra\bat\bto\bor\br!\b!=\b=(\b()\b) o\bop\bpe\ber\bra\bat\bto\bor\br<\b<(\b()\b) o\bop\bpe\ber\bra\bat\bto\bor\br=\b==\b=(\b()\b) *\b**\b**\b**\b**\b*\n bool o\bop\bpe\ber\bra\bat\bto\bor\br<\b< (const torrent_handle& h) const;\n-bool o\bop\bpe\ber\bra\bat\bto\bor\br!\b!=\b= (const torrent_handle& h) const;\n bool o\bop\bpe\ber\bra\bat\bto\bor\br=\b==\b= (const torrent_handle& h) const;\n+bool o\bop\bpe\ber\bra\bat\bto\bor\br!\b!=\b= (const torrent_handle& h) const;\n comparison operators. The order of the torrents is unspecified but stable.\n [_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n *\b**\b**\b**\b**\b* i\bid\bd(\b()\b) *\b**\b**\b**\b**\b*\n std::uint32_t i\bid\bd () const;\n returns a unique identifier for this torrent. It's not a dense index. It's not\n preserved across sessions.\n [_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n"}]}, {"source1": "./usr/share/doc/libtorrent-rasterbar-doc/html/reference-Torrent_Info.html", "source2": "./usr/share/doc/libtorrent-rasterbar-doc/html/reference-Torrent_Info.html", "unified_diff": "@@ -41,32 +41,32 @@\n - load_torrent_limits
\n - torrent_info
\n - torrent_info()
\n - ~torrent_info()
\n - files() orig_files()
\n - rename_file()
\n - remap_files()
\n-- add_tracker() trackers() clear_trackers()
\n-- similar_torrents() collections()
\n-- set_web_seeds() add_http_seed() web_seeds() add_url_seed()
\n+- clear_trackers() trackers() add_tracker()
\n+- collections() similar_torrents()
\n+- web_seeds() add_url_seed() set_web_seeds() add_http_seed()
\n - total_size()
\n-- piece_length() num_pieces()
\n+- num_pieces() piece_length()
\n - blocks_per_piece()
\n - piece_range() last_piece() end_piece()
\n-- info_hashes() info_hash()
\n-- v2() v1()
\n+- info_hash() info_hashes()
\n+- v1() v2()
\n - num_files()
\n - map_block()
\n - map_file()
\n - ssl_cert()
\n - is_valid()
\n - priv()
\n - is_i2p()
\n - piece_size()
\n-- hash_for_piece_ptr() hash_for_piece()
\n+- hash_for_piece() hash_for_piece_ptr()
\n - name()
\n - creation_date()
\n - creator()
\n - comment()
\n - nodes()
\n - add_node()
\n - parse_info_section()
\n@@ -154,15 +154,15 @@\n \n [report issue]\n - extra_headers
\n - Any extra HTTP headers that need to be passed to the web seed
\n
\n [report issue]\n [report issue]
\n \n \n load_torrent_limits
\n Declared in "libtorrent/torrent_info.hpp"
\n this object holds configuration options for limits to use when loading\n@@ -197,69 +197,69 @@\n
\n torrent_info
\n Declared in "libtorrent/torrent_info.hpp"
\n the torrent_info class holds the information found in a .torrent file.
\n \n class torrent_info\n {\n+ explicit torrent_info (span<char const> buffer, from_span_t);\n+ torrent_info (bdecode_node const& torrent_file, load_torrent_limits const& cfg);\n+ torrent_info (span<char const> buffer, error_code& ec, from_span_t);\n torrent_info (std::string const& filename, error_code& ec);\n- torrent_info (span<char const> buffer, load_torrent_limits const& cfg, from_span_t);\n+ explicit torrent_info (info_hash_t const& info_hash);\n+ explicit torrent_info (bdecode_node const& torrent_file);\n torrent_info (torrent_info const& t);\n- torrent_info (char const* buffer, int size, error_code& ec);\n- torrent_info (span<char const> buffer, error_code& ec, from_span_t);\n- torrent_info (char const* buffer, int size);\n torrent_info (std::string const& filename, load_torrent_limits const& cfg);\n- explicit torrent_info (std::string const& filename);\n- explicit torrent_info (bdecode_node const& torrent_file);\n- torrent_info (bdecode_node const& torrent_file, load_torrent_limits const& cfg);\n- explicit torrent_info (info_hash_t const& info_hash);\n torrent_info (bdecode_node const& torrent_file, error_code& ec);\n- explicit torrent_info (span<char const> buffer, from_span_t);\n+ torrent_info (span<char const> buffer, load_torrent_limits const& cfg, from_span_t);\n+ torrent_info (char const* buffer, int size);\n+ torrent_info (char const* buffer, int size, error_code& ec);\n+ explicit torrent_info (std::string const& filename);\n ~torrent_info ();\n- file_storage const& orig_files () const;\n file_storage const& files () const;\n+ file_storage const& orig_files () const;\n void rename_file (file_index_t index, std::string const& new_filename);\n void remap_files (file_storage const& f);\n void add_tracker (std::string const& url, int tier = 0);\n void clear_trackers ();\n void add_tracker (std::string const& url, int tier\n , announce_entry::tracker_source source);\n std::vector<announce_entry> const& trackers () const;\n std::vector<std::string> collections () const;\n std::vector<sha1_hash> similar_torrents () const;\n void set_web_seeds (std::vector<web_seed_entry> seeds);\n- void add_url_seed (std::string const& url\n- , std::string const& ext_auth = std::string()\n- , web_seed_entry::headers_t const& ext_headers = web_seed_entry::headers_t());\n void add_http_seed (std::string const& url\n , std::string const& extern_auth = std::string()\n , web_seed_entry::headers_t const& extra_headers = web_seed_entry::headers_t());\n std::vector<web_seed_entry> const& web_seeds () const;\n+ void add_url_seed (std::string const& url\n+ , std::string const& ext_auth = std::string()\n+ , web_seed_entry::headers_t const& ext_headers = web_seed_entry::headers_t());\n std::int64_t total_size () const;\n- int piece_length () const;\n int num_pieces () const;\n+ int piece_length () const;\n int blocks_per_piece () const;\n piece_index_t last_piece () const;\n index_range<piece_index_t> piece_range () const;\n piece_index_t end_piece () const;\n info_hash_t const& info_hashes () const;\n sha1_hash info_hash () const noexcept;\n- bool v1 () const;\n bool v2 () const;\n+ bool v1 () const;\n int num_files () const;\n std::vector<file_slice> map_block (piece_index_t const piece\n , std::int64_t offset, int size) const;\n peer_request map_file (file_index_t const file, std::int64_t offset, int size) const;\n string_view ssl_cert () const;\n bool is_valid () const;\n bool priv () const;\n bool is_i2p () const;\n int piece_size (piece_index_t index) const;\n- sha1_hash hash_for_piece (piece_index_t index) const;\n char const* hash_for_piece_ptr (piece_index_t const index) const;\n+ sha1_hash hash_for_piece (piece_index_t index) const;\n bool is_loaded () const;\n const std::string& name () const;\n std::time_t creation_date () const;\n const std::string& creator () const;\n const std::string& comment () const;\n std::vector<std::pair<std::string, int>> const& nodes () const;\n void add_node (std::pair<std::string, int> const& node);\n@@ -269,27 +269,27 @@\n span<char const> piece_layer (file_index_t) const;\n void free_piece_layers ();\n };\n \n [report issue]\n torrent_info()
\n \n+explicit torrent_info (span<char const> buffer, from_span_t);\n+torrent_info (bdecode_node const& torrent_file, load_torrent_limits const& cfg);\n+torrent_info (span<char const> buffer, error_code& ec, from_span_t);\n torrent_info (std::string const& filename, error_code& ec);\n-torrent_info (span<char const> buffer, load_torrent_limits const& cfg, from_span_t);\n+explicit torrent_info (info_hash_t const& info_hash);\n+explicit torrent_info (bdecode_node const& torrent_file);\n torrent_info (torrent_info const& t);\n-torrent_info (char const* buffer, int size, error_code& ec);\n-torrent_info (span<char const> buffer, error_code& ec, from_span_t);\n-torrent_info (char const* buffer, int size);\n torrent_info (std::string const& filename, load_torrent_limits const& cfg);\n-explicit torrent_info (std::string const& filename);\n-explicit torrent_info (bdecode_node const& torrent_file);\n-torrent_info (bdecode_node const& torrent_file, load_torrent_limits const& cfg);\n-explicit torrent_info (info_hash_t const& info_hash);\n torrent_info (bdecode_node const& torrent_file, error_code& ec);\n-explicit torrent_info (span<char const> buffer, from_span_t);\n+torrent_info (span<char const> buffer, load_torrent_limits const& cfg, from_span_t);\n+torrent_info (char const* buffer, int size);\n+torrent_info (char const* buffer, int size, error_code& ec);\n+explicit torrent_info (std::string const& filename);\n
\n The constructor that takes an info-hash will initialize the info-hash\n to the given value, but leave all other fields empty. This is used\n internally when downloading torrents without the metadata. The\n metadata will be created by libtorrent as soon as it has been\n downloaded from the swarm.
\n The constructor that takes a bdecode_node will create a torrent_info\n@@ -323,16 +323,16 @@\n \n
frees all storage associated with this torrent_info object
\n \n [report issue]\n \n files() orig_files()
\n \n-file_storage const& orig_files () const;\n file_storage const& files () const;\n+file_storage const& orig_files () const;\n
\n The file_storage object contains the information on how to map the\n pieces to files. It is separated from the torrent_info object because\n when creating torrents a storage object needs to be created without\n having a torrent file. When renaming files in a storage, the storage\n needs to make its own copy of the file_storage in order to make its\n mapping differ from the one in the torrent file.
\n@@ -348,15 +348,15 @@\n \n void rename_file (file_index_t index, std::string const& new_filename);\n
\n Renames the file with the specified index to the new name. The new\n filename is reflected by the file_storage returned by files()\n but not by the one returned by orig_files().
\n If you want to rename the base name of the torrent (for a multi file\n-torrent), you can copy the file_storage (see files() and\n+torrent), you can copy the file_storage (see files() and\n orig_files() ), change the name, and then use remap_files().
\n The new_filename can both be a relative path, in which case the\n file name is relative to the save_path of the torrent. If the\n new_filename is an absolute path (i.e. is_complete(new_filename)\n == true), then the file is detached from the save_path of the\n torrent. In this case the file is not moved when move_storage() is\n invoked.
\n@@ -376,19 +376,19 @@\n \n Remaps the file storage to a new file layout. This can be used to, for\n instance, download all data in a torrent to a single file, or to a\n number of fixed size sector aligned files, regardless of the number\n and sizes of the files in the torrent.
\n The new specified file_storage must have the exact same size as\n the current one.
\n-\n+\n \n-[report issue]\n-\n+\n+clear_trackers() trackers() add_tracker()
\n \n void add_tracker (std::string const& url, int tier = 0);\n void clear_trackers ();\n void add_tracker (std::string const& url, int tier\n , announce_entry::tracker_source source);\n std::vector<announce_entry> const& trackers () const;\n
\n@@ -398,42 +398,42 @@\n announce_entry. Each announce entry contains a string, which is\n the tracker url, and a tier index. The tier index is the high-level\n priority. No matter which trackers that works or not, the ones with\n lower tier will always be tried before the one with higher tier\n number. For more information, see announce_entry.\n trackers() returns all entries from announce-list.
\n clear_trackers() removes all trackers from announce-list.
\n-\n-[report issue]\n-\n+\n+collections() similar_torrents()
\n \n std::vector<std::string> collections () const;\n std::vector<sha1_hash> similar_torrents () const;\n
\n These two functions are related to BEP 38 (mutable torrents). The\n vectors returned from these correspond to the "similar" and\n "collections" keys in the .torrent file. Both info-hashes and\n collections from within the info-dict and from outside of it are\n included.
\n-\n-\n \n-[report issue]\n-\n+\n+web_seeds() add_url_seed() set_web_seeds() add_http_seed()
\n \n void set_web_seeds (std::vector<web_seed_entry> seeds);\n-void add_url_seed (std::string const& url\n- , std::string const& ext_auth = std::string()\n- , web_seed_entry::headers_t const& ext_headers = web_seed_entry::headers_t());\n void add_http_seed (std::string const& url\n , std::string const& extern_auth = std::string()\n , web_seed_entry::headers_t const& extra_headers = web_seed_entry::headers_t());\n std::vector<web_seed_entry> const& web_seeds () const;\n+void add_url_seed (std::string const& url\n+ , std::string const& ext_auth = std::string()\n+ , web_seed_entry::headers_t const& ext_headers = web_seed_entry::headers_t());\n
\n web_seeds() returns all url seeds and http seeds in the torrent.\n Each entry is a web_seed_entry and may refer to either a url seed\n or http seed.
\n add_url_seed() and add_http_seed() adds one url to the list of\n url/http seeds.
\n set_web_seeds() replaces all web seeds with the ones specified in\n@@ -453,21 +453,21 @@\n std::int64_t total_size () const;\n \n
total_size() returns the total number of bytes the torrent-file\n represents. Note that this is the number of pieces times the piece\n size (modulo the last piece possibly being smaller). With pad files,\n the total size will be larger than the sum of all (regular) file\n sizes.
\n-\n-[report issue]\n-\n+\n+num_pieces() piece_length()
\n \n-int piece_length () const;\n int num_pieces () const;\n+int piece_length () const;\n
\n piece_length() and num_pieces() returns the number of byte\n for each piece and the total number of pieces, respectively. The\n difference between piece_size() and piece_length() is that\n piece_size() takes the piece index as argument and gives you the\n exact size of that piece. It will always be the same as\n piece_length() except in the case of the last piece, which may be\n@@ -492,32 +492,32 @@\n \n
last_piece() returns the index to the last piece in the torrent and\n end_piece() returns the index to the one-past-end piece in the\n torrent\n piece_range() returns an implementation-defined type that can be\n used as the container in a range-for loop. Where the values are the\n indices of all pieces in the file_storage.
\n-\n-[report issue]\n-\n+\n+info_hash() info_hashes()
\n \n info_hash_t const& info_hashes () const;\n sha1_hash info_hash () const noexcept;\n
\n returns the info-hash of the torrent. For BitTorrent v2 support, use\n info_hashes() to get an object that may hold both a v1 and v2\n info-hash
\n-\n-[report issue]\n-\n+\n+v1() v2()
\n \n-bool v1 () const;\n bool v2 () const;\n+bool v1 () const;\n
\n returns whether this torrent has v1 and/or v2 metadata, respectively.\n Hybrid torrents have both. These are shortcuts for\n info_hashes().has_v1() and info_hashes().has_v2() calls.
\n [report issue]\n \n num_files()
\n@@ -588,23 +588,23 @@\n to peers over anything other than the i2p network.\n [report issue]\n \n piece_size()
\n \n int piece_size (piece_index_t index) const;\n
\n-returns the piece size of file with index. This will be the same as piece_length(),\n+
returns the piece size of file with index. This will be the same as piece_length(),\n except for the last piece, which may be shorter.
\n-\n-[report issue]\n-\n+\n+hash_for_piece() hash_for_piece_ptr()
\n \n-sha1_hash hash_for_piece (piece_index_t index) const;\n char const* hash_for_piece_ptr (piece_index_t const index) const;\n+sha1_hash hash_for_piece (piece_index_t index) const;\n
\n hash_for_piece() takes a piece-index and returns the 20-bytes\n sha1-hash for that piece and info_hash() returns the 20-bytes\n sha1-hash for the info-section of the torrent file.\n hash_for_piece_ptr() returns a pointer to the 20 byte sha1 digest\n for the piece. Note that the string is not 0-terminated.
\n [report issue]\n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -10,32 +10,32 @@\n * _\bl_\bo_\ba_\bd_\b__\bt_\bo_\br_\br_\be_\bn_\bt_\b__\bl_\bi_\bm_\bi_\bt_\bs\n * _\bt_\bo_\br_\br_\be_\bn_\bt_\b__\bi_\bn_\bf_\bo\n o _\bt_\bo_\br_\br_\be_\bn_\bt_\b__\bi_\bn_\bf_\bo_\b(_\b)\n o _\b~_\bt_\bo_\br_\br_\be_\bn_\bt_\b__\bi_\bn_\bf_\bo_\b(_\b)\n o _\bf_\bi_\bl_\be_\bs_\b(_\b)_\b _\bo_\br_\bi_\bg_\b__\bf_\bi_\bl_\be_\bs_\b(_\b)\n o _\br_\be_\bn_\ba_\bm_\be_\b__\bf_\bi_\bl_\be_\b(_\b)\n o _\br_\be_\bm_\ba_\bp_\b__\bf_\bi_\bl_\be_\bs_\b(_\b)\n- o _\ba_\bd_\bd_\b__\bt_\br_\ba_\bc_\bk_\be_\br_\b(_\b)_\b _\bt_\br_\ba_\bc_\bk_\be_\br_\bs_\b(_\b)_\b _\bc_\bl_\be_\ba_\br_\b__\bt_\br_\ba_\bc_\bk_\be_\br_\bs_\b(_\b)\n- o _\bs_\bi_\bm_\bi_\bl_\ba_\br_\b__\bt_\bo_\br_\br_\be_\bn_\bt_\bs_\b(_\b)_\b _\bc_\bo_\bl_\bl_\be_\bc_\bt_\bi_\bo_\bn_\bs_\b(_\b)\n- o _\bs_\be_\bt_\b__\bw_\be_\bb_\b__\bs_\be_\be_\bd_\bs_\b(_\b)_\b _\ba_\bd_\bd_\b__\bh_\bt_\bt_\bp_\b__\bs_\be_\be_\bd_\b(_\b)_\b _\bw_\be_\bb_\b__\bs_\be_\be_\bd_\bs_\b(_\b)_\b _\ba_\bd_\bd_\b__\bu_\br_\bl_\b__\bs_\be_\be_\bd_\b(_\b)\n+ o _\bc_\bl_\be_\ba_\br_\b__\bt_\br_\ba_\bc_\bk_\be_\br_\bs_\b(_\b)_\b _\bt_\br_\ba_\bc_\bk_\be_\br_\bs_\b(_\b)_\b _\ba_\bd_\bd_\b__\bt_\br_\ba_\bc_\bk_\be_\br_\b(_\b)\n+ o _\bc_\bo_\bl_\bl_\be_\bc_\bt_\bi_\bo_\bn_\bs_\b(_\b)_\b _\bs_\bi_\bm_\bi_\bl_\ba_\br_\b__\bt_\bo_\br_\br_\be_\bn_\bt_\bs_\b(_\b)\n+ o _\bw_\be_\bb_\b__\bs_\be_\be_\bd_\bs_\b(_\b)_\b _\ba_\bd_\bd_\b__\bu_\br_\bl_\b__\bs_\be_\be_\bd_\b(_\b)_\b _\bs_\be_\bt_\b__\bw_\be_\bb_\b__\bs_\be_\be_\bd_\bs_\b(_\b)_\b _\ba_\bd_\bd_\b__\bh_\bt_\bt_\bp_\b__\bs_\be_\be_\bd_\b(_\b)\n o _\bt_\bo_\bt_\ba_\bl_\b__\bs_\bi_\bz_\be_\b(_\b)\n- o _\bp_\bi_\be_\bc_\be_\b__\bl_\be_\bn_\bg_\bt_\bh_\b(_\b)_\b _\bn_\bu_\bm_\b__\bp_\bi_\be_\bc_\be_\bs_\b(_\b)\n+ o _\bn_\bu_\bm_\b__\bp_\bi_\be_\bc_\be_\bs_\b(_\b)_\b _\bp_\bi_\be_\bc_\be_\b__\bl_\be_\bn_\bg_\bt_\bh_\b(_\b)\n o _\bb_\bl_\bo_\bc_\bk_\bs_\b__\bp_\be_\br_\b__\bp_\bi_\be_\bc_\be_\b(_\b)\n o _\bp_\bi_\be_\bc_\be_\b__\br_\ba_\bn_\bg_\be_\b(_\b)_\b _\bl_\ba_\bs_\bt_\b__\bp_\bi_\be_\bc_\be_\b(_\b)_\b _\be_\bn_\bd_\b__\bp_\bi_\be_\bc_\be_\b(_\b)\n- o _\bi_\bn_\bf_\bo_\b__\bh_\ba_\bs_\bh_\be_\bs_\b(_\b)_\b _\bi_\bn_\bf_\bo_\b__\bh_\ba_\bs_\bh_\b(_\b)\n- o _\bv_\b2_\b(_\b)_\b _\bv_\b1_\b(_\b)\n+ o _\bi_\bn_\bf_\bo_\b__\bh_\ba_\bs_\bh_\b(_\b)_\b _\bi_\bn_\bf_\bo_\b__\bh_\ba_\bs_\bh_\be_\bs_\b(_\b)\n+ o _\bv_\b1_\b(_\b)_\b _\bv_\b2_\b(_\b)\n o _\bn_\bu_\bm_\b__\bf_\bi_\bl_\be_\bs_\b(_\b)\n o _\bm_\ba_\bp_\b__\bb_\bl_\bo_\bc_\bk_\b(_\b)\n o _\bm_\ba_\bp_\b__\bf_\bi_\bl_\be_\b(_\b)\n o _\bs_\bs_\bl_\b__\bc_\be_\br_\bt_\b(_\b)\n o _\bi_\bs_\b__\bv_\ba_\bl_\bi_\bd_\b(_\b)\n o _\bp_\br_\bi_\bv_\b(_\b)\n o _\bi_\bs_\b__\bi_\b2_\bp_\b(_\b)\n o _\bp_\bi_\be_\bc_\be_\b__\bs_\bi_\bz_\be_\b(_\b)\n- o _\bh_\ba_\bs_\bh_\b__\bf_\bo_\br_\b__\bp_\bi_\be_\bc_\be_\b__\bp_\bt_\br_\b(_\b)_\b _\bh_\ba_\bs_\bh_\b__\bf_\bo_\br_\b__\bp_\bi_\be_\bc_\be_\b(_\b)\n+ o _\bh_\ba_\bs_\bh_\b__\bf_\bo_\br_\b__\bp_\bi_\be_\bc_\be_\b(_\b)_\b _\bh_\ba_\bs_\bh_\b__\bf_\bo_\br_\b__\bp_\bi_\be_\bc_\be_\b__\bp_\bt_\br_\b(_\b)\n o _\bn_\ba_\bm_\be_\b(_\b)\n o _\bc_\br_\be_\ba_\bt_\bi_\bo_\bn_\b__\bd_\ba_\bt_\be_\b(_\b)\n o _\bc_\br_\be_\ba_\bt_\bo_\br_\b(_\b)\n o _\bc_\bo_\bm_\bm_\be_\bn_\bt_\b(_\b)\n o _\bn_\bo_\bd_\be_\bs_\b(_\b)\n o _\ba_\bd_\bd_\b__\bn_\bo_\bd_\be_\b(_\b)\n o _\bp_\ba_\br_\bs_\be_\b__\bi_\bn_\bf_\bo_\b__\bs_\be_\bc_\bt_\bi_\bo_\bn_\b(_\b)\n@@ -120,74 +120,74 @@\n the max number of bdecode tokens\n [_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n *\b**\b**\b**\b**\b**\b* t\bto\bor\brr\bre\ben\bnt\bt_\b_i\bin\bnf\bfo\bo *\b**\b**\b**\b**\b**\b*\n Declared in \"_\bl_\bi_\bb_\bt_\bo_\br_\br_\be_\bn_\bt_\b/_\bt_\bo_\br_\br_\be_\bn_\bt_\b__\bi_\bn_\bf_\bo_\b._\bh_\bp_\bp\"\n the _\bt_\bo_\br_\br_\be_\bn_\bt_\b__\bi_\bn_\bf_\bo class holds the information found in a .torrent file.\n class torrent_info\n {\n+ explicit t\bto\bor\brr\bre\ben\bnt\bt_\b_i\bin\bnf\bfo\bo (span buffer, from_span_t);\n+ t\bto\bor\brr\bre\ben\bnt\bt_\b_i\bin\bnf\bfo\bo (bdecode_node const& torrent_file, load_torrent_limits const&\n+cfg);\n+ t\bto\bor\brr\bre\ben\bnt\bt_\b_i\bin\bnf\bfo\bo (span buffer, error_code& ec, from_span_t);\n t\bto\bor\brr\bre\ben\bnt\bt_\b_i\bin\bnf\bfo\bo (std::string const& filename, error_code& ec);\n+ explicit t\bto\bor\brr\bre\ben\bnt\bt_\b_i\bin\bnf\bfo\bo (info_hash_t const& info_hash);\n+ explicit t\bto\bor\brr\bre\ben\bnt\bt_\b_i\bin\bnf\bfo\bo (bdecode_node const& torrent_file);\n+ t\bto\bor\brr\bre\ben\bnt\bt_\b_i\bin\bnf\bfo\bo (torrent_info const& t);\n+ t\bto\bor\brr\bre\ben\bnt\bt_\b_i\bin\bnf\bfo\bo (std::string const& filename, load_torrent_limits const& cfg);\n+ t\bto\bor\brr\bre\ben\bnt\bt_\b_i\bin\bnf\bfo\bo (bdecode_node const& torrent_file, error_code& ec);\n t\bto\bor\brr\bre\ben\bnt\bt_\b_i\bin\bnf\bfo\bo (span buffer, load_torrent_limits const& cfg,\n from_span_t);\n- t\bto\bor\brr\bre\ben\bnt\bt_\b_i\bin\bnf\bfo\bo (torrent_info const& t);\n- t\bto\bor\brr\bre\ben\bnt\bt_\b_i\bin\bnf\bfo\bo (char const* buffer, int size, error_code& ec);\n- t\bto\bor\brr\bre\ben\bnt\bt_\b_i\bin\bnf\bfo\bo (span buffer, error_code& ec, from_span_t);\n t\bto\bor\brr\bre\ben\bnt\bt_\b_i\bin\bnf\bfo\bo (char const* buffer, int size);\n- t\bto\bor\brr\bre\ben\bnt\bt_\b_i\bin\bnf\bfo\bo (std::string const& filename, load_torrent_limits const& cfg);\n+ t\bto\bor\brr\bre\ben\bnt\bt_\b_i\bin\bnf\bfo\bo (char const* buffer, int size, error_code& ec);\n explicit t\bto\bor\brr\bre\ben\bnt\bt_\b_i\bin\bnf\bfo\bo (std::string const& filename);\n- explicit t\bto\bor\brr\bre\ben\bnt\bt_\b_i\bin\bnf\bfo\bo (bdecode_node const& torrent_file);\n- t\bto\bor\brr\bre\ben\bnt\bt_\b_i\bin\bnf\bfo\bo (bdecode_node const& torrent_file, load_torrent_limits const&\n-cfg);\n- explicit t\bto\bor\brr\bre\ben\bnt\bt_\b_i\bin\bnf\bfo\bo (info_hash_t const& info_hash);\n- t\bto\bor\brr\bre\ben\bnt\bt_\b_i\bin\bnf\bfo\bo (bdecode_node const& torrent_file, error_code& ec);\n- explicit t\bto\bor\brr\bre\ben\bnt\bt_\b_i\bin\bnf\bfo\bo (span buffer, from_span_t);\n ~\b~t\bto\bor\brr\bre\ben\bnt\bt_\b_i\bin\bnf\bfo\bo ();\n- file_storage const& o\bor\bri\big\bg_\b_f\bfi\bil\ble\bes\bs () const;\n file_storage const& f\bfi\bil\ble\bes\bs () const;\n+ file_storage const& o\bor\bri\big\bg_\b_f\bfi\bil\ble\bes\bs () const;\n void r\bre\ben\bna\bam\bme\be_\b_f\bfi\bil\ble\be (file_index_t index, std::string const& new_filename);\n void r\bre\bem\bma\bap\bp_\b_f\bfi\bil\ble\bes\bs (file_storage const& f);\n void a\bad\bdd\bd_\b_t\btr\bra\bac\bck\bke\ber\br (std::string const& url, int tier = 0);\n void c\bcl\ble\bea\bar\br_\b_t\btr\bra\bac\bck\bke\ber\brs\bs ();\n void a\bad\bdd\bd_\b_t\btr\bra\bac\bck\bke\ber\br (std::string const& url, int tier\n , announce_entry::tracker_source source);\n std::vector const& t\btr\bra\bac\bck\bke\ber\brs\bs () const;\n std::vector c\bco\bol\bll\ble\bec\bct\bti\bio\bon\bns\bs () const;\n std::vector s\bsi\bim\bmi\bil\bla\bar\br_\b_t\bto\bor\brr\bre\ben\bnt\bts\bs () const;\n void s\bse\bet\bt_\b_w\bwe\beb\bb_\b_s\bse\bee\bed\bds\bs (std::vector seeds);\n- void a\bad\bdd\bd_\b_u\bur\brl\bl_\b_s\bse\bee\bed\bd (std::string const& url\n- , std::string const& ext_auth = std::string()\n- , web_seed_entry::headers_t const& ext_headers = web_seed_entry::\n-headers_t());\n void a\bad\bdd\bd_\b_h\bht\btt\btp\bp_\b_s\bse\bee\bed\bd (std::string const& url\n , std::string const& extern_auth = std::string()\n , web_seed_entry::headers_t const& extra_headers = web_seed_entry::\n headers_t());\n std::vector const& w\bwe\beb\bb_\b_s\bse\bee\bed\bds\bs () const;\n+ void a\bad\bdd\bd_\b_u\bur\brl\bl_\b_s\bse\bee\bed\bd (std::string const& url\n+ , std::string const& ext_auth = std::string()\n+ , web_seed_entry::headers_t const& ext_headers = web_seed_entry::\n+headers_t());\n std::int64_t t\bto\bot\bta\bal\bl_\b_s\bsi\biz\bze\be () const;\n- int p\bpi\bie\bec\bce\be_\b_l\ble\ben\bng\bgt\bth\bh () const;\n int n\bnu\bum\bm_\b_p\bpi\bie\bec\bce\bes\bs () const;\n+ int p\bpi\bie\bec\bce\be_\b_l\ble\ben\bng\bgt\bth\bh () const;\n int b\bbl\blo\boc\bck\bks\bs_\b_p\bpe\ber\br_\b_p\bpi\bie\bec\bce\be () const;\n piece_index_t l\bla\bas\bst\bt_\b_p\bpi\bie\bec\bce\be () const;\n index_range p\bpi\bie\bec\bce\be_\b_r\bra\ban\bng\bge\be () const;\n piece_index_t e\ben\bnd\bd_\b_p\bpi\bie\bec\bce\be () const;\n info_hash_t const& i\bin\bnf\bfo\bo_\b_h\bha\bas\bsh\bhe\bes\bs () const;\n sha1_hash i\bin\bnf\bfo\bo_\b_h\bha\bas\bsh\bh () const noexcept;\n- bool v\bv1\b1 () const;\n bool v\bv2\b2 () const;\n+ bool v\bv1\b1 () const;\n int n\bnu\bum\bm_\b_f\bfi\bil\ble\bes\bs () const;\n std::vector m\bma\bap\bp_\b_b\bbl\blo\boc\bck\bk (piece_index_t const piece\n , std::int64_t offset, int size) const;\n peer_request m\bma\bap\bp_\b_f\bfi\bil\ble\be (file_index_t const file, std::int64_t offset, int\n size) const;\n string_view s\bss\bsl\bl_\b_c\bce\ber\brt\bt () const;\n bool i\bis\bs_\b_v\bva\bal\bli\bid\bd () const;\n bool p\bpr\bri\biv\bv () const;\n bool i\bis\bs_\b_i\bi2\b2p\bp () const;\n int p\bpi\bie\bec\bce\be_\b_s\bsi\biz\bze\be (piece_index_t index) const;\n- sha1_hash h\bha\bas\bsh\bh_\b_f\bfo\bor\br_\b_p\bpi\bie\bec\bce\be (piece_index_t index) const;\n char const* h\bha\bas\bsh\bh_\b_f\bfo\bor\br_\b_p\bpi\bie\bec\bce\be_\b_p\bpt\btr\br (piece_index_t const index) const;\n+ sha1_hash h\bha\bas\bsh\bh_\b_f\bfo\bor\br_\b_p\bpi\bie\bec\bce\be (piece_index_t index) const;\n bool i\bis\bs_\b_l\blo\boa\bad\bde\bed\bd () const;\n const std::string& n\bna\bam\bme\be () const;\n std::time_t c\bcr\bre\bea\bat\bti\bio\bon\bn_\b_d\bda\bat\bte\be () const;\n const std::string& c\bcr\bre\bea\bat\bto\bor\br () const;\n const std::string& c\bco\bom\bmm\bme\ben\bnt\bt () const;\n std::vector> const& n\bno\bod\bde\bes\bs () const;\n void a\bad\bdd\bd_\b_n\bno\bod\bde\be (std::pair const& node);\n@@ -196,29 +196,29 @@\n bdecode_node i\bin\bnf\bfo\bo (char const* key) const;\n span i\bin\bnf\bfo\bo_\b_s\bse\bec\bct\bti\bio\bon\bn () const;\n span p\bpi\bie\bec\bce\be_\b_l\bla\bay\bye\ber\br (file_index_t) const;\n void f\bfr\bre\bee\be_\b_p\bpi\bie\bec\bce\be_\b_l\bla\bay\bye\ber\brs\bs ();\n };\n [_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n *\b**\b**\b**\b**\b* t\bto\bor\brr\bre\ben\bnt\bt_\b_i\bin\bnf\bfo\bo(\b()\b) *\b**\b**\b**\b**\b*\n+explicit t\bto\bor\brr\bre\ben\bnt\bt_\b_i\bin\bnf\bfo\bo (span buffer, from_span_t);\n+t\bto\bor\brr\bre\ben\bnt\bt_\b_i\bin\bnf\bfo\bo (bdecode_node const& torrent_file, load_torrent_limits const&\n+cfg);\n+t\bto\bor\brr\bre\ben\bnt\bt_\b_i\bin\bnf\bfo\bo (span buffer, error_code& ec, from_span_t);\n t\bto\bor\brr\bre\ben\bnt\bt_\b_i\bin\bnf\bfo\bo (std::string const& filename, error_code& ec);\n+explicit t\bto\bor\brr\bre\ben\bnt\bt_\b_i\bin\bnf\bfo\bo (info_hash_t const& info_hash);\n+explicit t\bto\bor\brr\bre\ben\bnt\bt_\b_i\bin\bnf\bfo\bo (bdecode_node const& torrent_file);\n+t\bto\bor\brr\bre\ben\bnt\bt_\b_i\bin\bnf\bfo\bo (torrent_info const& t);\n+t\bto\bor\brr\bre\ben\bnt\bt_\b_i\bin\bnf\bfo\bo (std::string const& filename, load_torrent_limits const& cfg);\n+t\bto\bor\brr\bre\ben\bnt\bt_\b_i\bin\bnf\bfo\bo (bdecode_node const& torrent_file, error_code& ec);\n t\bto\bor\brr\bre\ben\bnt\bt_\b_i\bin\bnf\bfo\bo (span buffer, load_torrent_limits const& cfg,\n from_span_t);\n-t\bto\bor\brr\bre\ben\bnt\bt_\b_i\bin\bnf\bfo\bo (torrent_info const& t);\n-t\bto\bor\brr\bre\ben\bnt\bt_\b_i\bin\bnf\bfo\bo (char const* buffer, int size, error_code& ec);\n-t\bto\bor\brr\bre\ben\bnt\bt_\b_i\bin\bnf\bfo\bo (span buffer, error_code& ec, from_span_t);\n t\bto\bor\brr\bre\ben\bnt\bt_\b_i\bin\bnf\bfo\bo (char const* buffer, int size);\n-t\bto\bor\brr\bre\ben\bnt\bt_\b_i\bin\bnf\bfo\bo (std::string const& filename, load_torrent_limits const& cfg);\n+t\bto\bor\brr\bre\ben\bnt\bt_\b_i\bin\bnf\bfo\bo (char const* buffer, int size, error_code& ec);\n explicit t\bto\bor\brr\bre\ben\bnt\bt_\b_i\bin\bnf\bfo\bo (std::string const& filename);\n-explicit t\bto\bor\brr\bre\ben\bnt\bt_\b_i\bin\bnf\bfo\bo (bdecode_node const& torrent_file);\n-t\bto\bor\brr\bre\ben\bnt\bt_\b_i\bin\bnf\bfo\bo (bdecode_node const& torrent_file, load_torrent_limits const&\n-cfg);\n-explicit t\bto\bor\brr\bre\ben\bnt\bt_\b_i\bin\bnf\bfo\bo (info_hash_t const& info_hash);\n-t\bto\bor\brr\bre\ben\bnt\bt_\b_i\bin\bnf\bfo\bo (bdecode_node const& torrent_file, error_code& ec);\n-explicit t\bto\bor\brr\bre\ben\bnt\bt_\b_i\bin\bnf\bfo\bo (span buffer, from_span_t);\n The constructor that takes an info-hash will initialize the info-hash to the\n given value, but leave all other fields empty. This is used internally when\n downloading torrents without the metadata. The metadata will be created by\n libtorrent as soon as it has been downloaded from the swarm.\n The constructor that takes a _\bb_\bd_\be_\bc_\bo_\bd_\be_\b__\bn_\bo_\bd_\be will create a _\bt_\bo_\br_\br_\be_\bn_\bt_\b__\bi_\bn_\bf_\bo object\n from the information found in the given torrent_file. The _\bb_\bd_\be_\bc_\bo_\bd_\be_\b__\bn_\bo_\bd_\be\n represents a tree node in an bencoded file. To load an ordinary .torrent file\n@@ -242,16 +242,16 @@\n is an object in the libtorrent namespace of this type called from_span.\n [_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n *\b**\b**\b**\b**\b* ~\b~t\bto\bor\brr\bre\ben\bnt\bt_\b_i\bin\bnf\bfo\bo(\b()\b) *\b**\b**\b**\b**\b*\n ~\b~t\bto\bor\brr\bre\ben\bnt\bt_\b_i\bin\bnf\bfo\bo ();\n frees all storage associated with this _\bt_\bo_\br_\br_\be_\bn_\bt_\b__\bi_\bn_\bf_\bo object\n [_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n *\b**\b**\b**\b**\b* f\bfi\bil\ble\bes\bs(\b()\b) o\bor\bri\big\bg_\b_f\bfi\bil\ble\bes\bs(\b()\b) *\b**\b**\b**\b**\b*\n-file_storage const& o\bor\bri\big\bg_\b_f\bfi\bil\ble\bes\bs () const;\n file_storage const& f\bfi\bil\ble\bes\bs () const;\n+file_storage const& o\bor\bri\big\bg_\b_f\bfi\bil\ble\bes\bs () const;\n The _\bf_\bi_\bl_\be_\b__\bs_\bt_\bo_\br_\ba_\bg_\be object contains the information on how to map the pieces to\n files. It is separated from the _\bt_\bo_\br_\br_\be_\bn_\bt_\b__\bi_\bn_\bf_\bo object because when creating\n torrents a storage object needs to be created without having a torrent file.\n When renaming files in a storage, the storage needs to make its own copy of the\n _\bf_\bi_\bl_\be_\b__\bs_\bt_\bo_\br_\ba_\bg_\be in order to make its mapping differ from the one in the torrent\n file.\n orig_files() returns the original (unmodified) file storage for this torrent.\n@@ -284,15 +284,15 @@\n Remaps the file storage to a new file layout. This can be used to, for\n instance, download all data in a torrent to a single file, or to a number of\n fixed size sector aligned files, regardless of the number and sizes of the\n files in the torrent.\n The new specified file_storage must have the exact same size as the current\n one.\n [_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b* a\bad\bdd\bd_\b_t\btr\bra\bac\bck\bke\ber\br(\b()\b) t\btr\bra\bac\bck\bke\ber\brs\bs(\b()\b) c\bcl\ble\bea\bar\br_\b_t\btr\bra\bac\bck\bke\ber\brs\bs(\b()\b) *\b**\b**\b**\b**\b*\n+*\b**\b**\b**\b**\b* c\bcl\ble\bea\bar\br_\b_t\btr\bra\bac\bck\bke\ber\brs\bs(\b()\b) t\btr\bra\bac\bck\bke\ber\brs\bs(\b()\b) a\bad\bdd\bd_\b_t\btr\bra\bac\bck\bke\ber\br(\b()\b) *\b**\b**\b**\b**\b*\n void a\bad\bdd\bd_\b_t\btr\bra\bac\bck\bke\ber\br (std::string const& url, int tier = 0);\n void c\bcl\ble\bea\bar\br_\b_t\btr\bra\bac\bck\bke\ber\brs\bs ();\n void a\bad\bdd\bd_\b_t\btr\bra\bac\bck\bke\ber\br (std::string const& url, int tier\n , announce_entry::tracker_source source);\n std::vector const& t\btr\bra\bac\bck\bke\ber\brs\bs () const;\n add_tracker() adds a tracker to the announce-list. The tier determines the\n order in which the trackers are to be tried. The trackers() function will\n@@ -300,33 +300,33 @@\n string, which is the tracker url, and a tier index. The tier index is the high-\n level priority. No matter which trackers that works or not, the ones with lower\n tier will always be tried before the one with higher tier number. For more\n information, see _\ba_\bn_\bn_\bo_\bu_\bn_\bc_\be_\b__\be_\bn_\bt_\br_\by.\n trackers() returns all entries from announce-list.\n clear_trackers() removes all trackers from announce-list.\n [_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b* s\bsi\bim\bmi\bil\bla\bar\br_\b_t\bto\bor\brr\bre\ben\bnt\bts\bs(\b()\b) c\bco\bol\bll\ble\bec\bct\bti\bio\bon\bns\bs(\b()\b) *\b**\b**\b**\b**\b*\n+*\b**\b**\b**\b**\b* c\bco\bol\bll\ble\bec\bct\bti\bio\bon\bns\bs(\b()\b) s\bsi\bim\bmi\bil\bla\bar\br_\b_t\bto\bor\brr\bre\ben\bnt\bts\bs(\b()\b) *\b**\b**\b**\b**\b*\n std::vector c\bco\bol\bll\ble\bec\bct\bti\bio\bon\bns\bs () const;\n std::vector s\bsi\bim\bmi\bil\bla\bar\br_\b_t\bto\bor\brr\bre\ben\bnt\bts\bs () const;\n These two functions are related to _\bB_\bE_\bP_\b _\b3_\b8 (mutable torrents). The vectors\n returned from these correspond to the \"similar\" and \"collections\" keys in the\n .torrent file. Both info-hashes and collections from within the info-dict and\n from outside of it are included.\n [_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b* s\bse\bet\bt_\b_w\bwe\beb\bb_\b_s\bse\bee\bed\bds\bs(\b()\b) a\bad\bdd\bd_\b_h\bht\btt\btp\bp_\b_s\bse\bee\bed\bd(\b()\b) w\bwe\beb\bb_\b_s\bse\bee\bed\bds\bs(\b()\b) a\bad\bdd\bd_\b_u\bur\brl\bl_\b_s\bse\bee\bed\bd(\b()\b) *\b**\b**\b**\b**\b*\n+*\b**\b**\b**\b**\b* w\bwe\beb\bb_\b_s\bse\bee\bed\bds\bs(\b()\b) a\bad\bdd\bd_\b_u\bur\brl\bl_\b_s\bse\bee\bed\bd(\b()\b) s\bse\bet\bt_\b_w\bwe\beb\bb_\b_s\bse\bee\bed\bds\bs(\b()\b) a\bad\bdd\bd_\b_h\bht\btt\btp\bp_\b_s\bse\bee\bed\bd(\b()\b) *\b**\b**\b**\b**\b*\n void s\bse\bet\bt_\b_w\bwe\beb\bb_\b_s\bse\bee\bed\bds\bs (std::vector seeds);\n-void a\bad\bdd\bd_\b_u\bur\brl\bl_\b_s\bse\bee\bed\bd (std::string const& url\n- , std::string const& ext_auth = std::string()\n- , web_seed_entry::headers_t const& ext_headers = web_seed_entry::\n-headers_t());\n void a\bad\bdd\bd_\b_h\bht\btt\btp\bp_\b_s\bse\bee\bed\bd (std::string const& url\n , std::string const& extern_auth = std::string()\n , web_seed_entry::headers_t const& extra_headers = web_seed_entry::\n headers_t());\n std::vector const& w\bwe\beb\bb_\b_s\bse\bee\bed\bds\bs () const;\n+void a\bad\bdd\bd_\b_u\bur\brl\bl_\b_s\bse\bee\bed\bd (std::string const& url\n+ , std::string const& ext_auth = std::string()\n+ , web_seed_entry::headers_t const& ext_headers = web_seed_entry::\n+headers_t());\n web_seeds() returns all url seeds and http seeds in the torrent. Each _\be_\bn_\bt_\br_\by is\n a web_seed_entry and may refer to either a url seed or http seed.\n add_url_seed() and add_http_seed() adds one url to the list of url/http seeds.\n set_web_seeds() replaces all web seeds with the ones specified in the seeds\n vector.\n The extern_auth argument can be used for other authorization schemes than basic\n HTTP authorization. If set, it will override any username and password found in\n@@ -339,17 +339,17 @@\n *\b**\b**\b**\b**\b* t\bto\bot\bta\bal\bl_\b_s\bsi\biz\bze\be(\b()\b) *\b**\b**\b**\b**\b*\n std::int64_t t\bto\bot\bta\bal\bl_\b_s\bsi\biz\bze\be () const;\n total_size() returns the total number of bytes the torrent-file represents.\n Note that this is the number of pieces times the piece size (modulo the last\n piece possibly being smaller). With pad files, the total size will be larger\n than the sum of all (regular) file sizes.\n [_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b* p\bpi\bie\bec\bce\be_\b_l\ble\ben\bng\bgt\bth\bh(\b()\b) n\bnu\bum\bm_\b_p\bpi\bie\bec\bce\bes\bs(\b()\b) *\b**\b**\b**\b**\b*\n-int p\bpi\bie\bec\bce\be_\b_l\ble\ben\bng\bgt\bth\bh () const;\n+*\b**\b**\b**\b**\b* n\bnu\bum\bm_\b_p\bpi\bie\bec\bce\bes\bs(\b()\b) p\bpi\bie\bec\bce\be_\b_l\ble\ben\bng\bgt\bth\bh(\b()\b) *\b**\b**\b**\b**\b*\n int n\bnu\bum\bm_\b_p\bpi\bie\bec\bce\bes\bs () const;\n+int p\bpi\bie\bec\bce\be_\b_l\ble\ben\bng\bgt\bth\bh () const;\n piece_length() and num_pieces() returns the number of byte for each piece and\n the total number of pieces, respectively. The difference between piece_size()\n and piece_length() is that piece_size() takes the piece index as argument and\n gives you the exact size of that piece. It will always be the same as\n piece_length() except in the case of the last piece, which may be smaller.\n [_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n *\b**\b**\b**\b**\b* b\bbl\blo\boc\bck\bks\bs_\b_p\bpe\ber\br_\b_p\bpi\bie\bec\bce\be(\b()\b) *\b**\b**\b**\b**\b*\n@@ -363,23 +363,23 @@\n piece_index_t e\ben\bnd\bd_\b_p\bpi\bie\bec\bce\be () const;\n last_piece() returns the index to the last piece in the torrent and end_piece()\n returns the index to the one-past-end piece in the torrent piece_range()\n returns an implementation-defined type that can be used as the container in a\n range-for loop. Where the values are the indices of all pieces in the\n _\bf_\bi_\bl_\be_\b__\bs_\bt_\bo_\br_\ba_\bg_\be.\n [_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b* i\bin\bnf\bfo\bo_\b_h\bha\bas\bsh\bhe\bes\bs(\b()\b) i\bin\bnf\bfo\bo_\b_h\bha\bas\bsh\bh(\b()\b) *\b**\b**\b**\b**\b*\n+*\b**\b**\b**\b**\b* i\bin\bnf\bfo\bo_\b_h\bha\bas\bsh\bh(\b()\b) i\bin\bnf\bfo\bo_\b_h\bha\bas\bsh\bhe\bes\bs(\b()\b) *\b**\b**\b**\b**\b*\n info_hash_t const& i\bin\bnf\bfo\bo_\b_h\bha\bas\bsh\bhe\bes\bs () const;\n sha1_hash i\bin\bnf\bfo\bo_\b_h\bha\bas\bsh\bh () const noexcept;\n returns the info-hash of the torrent. For BitTorrent v2 support, use\n info_hashes() to get an object that may hold both a v1 and v2 info-hash\n [_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b* v\bv2\b2(\b()\b) v\bv1\b1(\b()\b) *\b**\b**\b**\b**\b*\n-bool v\bv1\b1 () const;\n+*\b**\b**\b**\b**\b* v\bv1\b1(\b()\b) v\bv2\b2(\b()\b) *\b**\b**\b**\b**\b*\n bool v\bv2\b2 () const;\n+bool v\bv1\b1 () const;\n returns whether this torrent has v1 and/or v2 metadata, respectively. Hybrid\n torrents have both. These are shortcuts for info_hashes().has_v1() and\n info_hashes().has_v2() calls.\n [_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n *\b**\b**\b**\b**\b* n\bnu\bum\bm_\b_f\bfi\bil\ble\bes\bs(\b()\b) *\b**\b**\b**\b**\b*\n int n\bnu\bum\bm_\b_f\bfi\bil\ble\bes\bs () const;\n If you need index-access to files you can use the num_files() along with the\n@@ -427,17 +427,17 @@\n than the i2p network.\n [_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n *\b**\b**\b**\b**\b* p\bpi\bie\bec\bce\be_\b_s\bsi\biz\bze\be(\b()\b) *\b**\b**\b**\b**\b*\n int p\bpi\bie\bec\bce\be_\b_s\bsi\biz\bze\be (piece_index_t index) const;\n returns the piece size of file with index. This will be the same as\n _\bp_\bi_\be_\bc_\be_\b__\bl_\be_\bn_\bg_\bt_\bh_\b(_\b), except for the last piece, which may be shorter.\n [_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b* h\bha\bas\bsh\bh_\b_f\bfo\bor\br_\b_p\bpi\bie\bec\bce\be_\b_p\bpt\btr\br(\b()\b) h\bha\bas\bsh\bh_\b_f\bfo\bor\br_\b_p\bpi\bie\bec\bce\be(\b()\b) *\b**\b**\b**\b**\b*\n-sha1_hash h\bha\bas\bsh\bh_\b_f\bfo\bor\br_\b_p\bpi\bie\bec\bce\be (piece_index_t index) const;\n+*\b**\b**\b**\b**\b* h\bha\bas\bsh\bh_\b_f\bfo\bor\br_\b_p\bpi\bie\bec\bce\be(\b()\b) h\bha\bas\bsh\bh_\b_f\bfo\bor\br_\b_p\bpi\bie\bec\bce\be_\b_p\bpt\btr\br(\b()\b) *\b**\b**\b**\b**\b*\n char const* h\bha\bas\bsh\bh_\b_f\bfo\bor\br_\b_p\bpi\bie\bec\bce\be_\b_p\bpt\btr\br (piece_index_t const index) const;\n+sha1_hash h\bha\bas\bsh\bh_\b_f\bfo\bor\br_\b_p\bpi\bie\bec\bce\be (piece_index_t index) const;\n hash_for_piece() takes a piece-index and returns the 20-bytes sha1-hash for\n that piece and info_hash() returns the 20-bytes sha1-hash for the info-section\n of the torrent file. hash_for_piece_ptr() returns a pointer to the 20 byte sha1\n digest for the piece. Note that the string is not 0-terminated.\n [_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n *\b**\b**\b**\b**\b* n\bna\bam\bme\be(\b()\b) *\b**\b**\b**\b**\b*\n const std::string& n\bna\bam\bme\be () const;\n"}]}, {"source1": "./usr/share/doc/libtorrent-rasterbar-doc/html/reference-Torrent_Status.html", "source2": "./usr/share/doc/libtorrent-rasterbar-doc/html/reference-Torrent_Status.html", "unified_diff": "@@ -426,15 +426,15 @@\n currently connected to.\n \n [report issue]\n - num_peers
\n - the number of peers this torrent currently is connected to. Peer\n connections that are in the half-open state (is attempting to connect)\n or are queued for later connection attempt do not count. Although they\n-are visible in the peer list when you call get_peer_info().
\n+are visible in the peer list when you call get_peer_info().\n
\n \n [report issue]\n - num_complete num_incomplete
\n - if the tracker sends scrape info in its announce reply, these fields\n will be set to the total number of peers that have the whole file and\n the total number of peers that are still downloading. set to -1 if the\n"}, {"source1": "./usr/share/doc/libtorrent-rasterbar-doc/html/reference-Trackers.html", "source2": "./usr/share/doc/libtorrent-rasterbar-doc/html/reference-Trackers.html", "unified_diff": "@@ -31,15 +31,15 @@\n \n \n
Table of contents
\n \n \n [report issue]\n announce_infohash
\n@@ -131,19 +131,19 @@\n announce_entry
\n Declared in "libtorrent/announce_entry.hpp"
\n this class holds information about one bittorrent tracker, as it\n relates to a specific torrent.
\n \n struct announce_entry\n {\n- explicit announce_entry (string_view u);\n- announce_entry (announce_entry const&);\n announce_entry ();\n+ announce_entry (announce_entry const&);\n announce_entry& operator= (announce_entry const&) &;\n ~announce_entry ();\n+ explicit announce_entry (string_view u);\n \n enum tracker_source\n {\n source_torrent,\n source_client,\n source_magnet_link,\n source_tex,\n@@ -154,24 +154,24 @@\n std::vector<announce_endpoint> endpoints;\n std::uint8_t tier = 0;\n std::uint8_t fail_limit = 0;\n std::uint8_t source:4;\n bool verified:1;\n };\n \n-\n+\n \n-[report issue]\n-announce_entry() ~announce_entry() operator=()
\n+[report issue]\n+operator=() ~announce_entry() announce_entry()
\n \n-explicit announce_entry (string_view u);\n-announce_entry (announce_entry const&);\n announce_entry ();\n+announce_entry (announce_entry const&);\n announce_entry& operator= (announce_entry const&) &;\n ~announce_entry ();\n+explicit announce_entry (string_view u);\n
\n constructs a tracker announce entry with u as the URL.
\n [report issue]\n \n enum tracker_source
\n Declared in "libtorrent/announce_entry.hpp"
\n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -2,15 +2,15 @@\n _\b[_\bl_\bi_\bb_\bt_\bo_\br_\br_\be_\bn_\bt_\b _\bl_\bo_\bg_\bo_\b]\n V\bVe\ber\brs\bsi\bio\bon\bn:\b: 2.0.10\n _\bh_\bo_\bm_\be\n Table of contents\n * _\ba_\bn_\bn_\bo_\bu_\bn_\bc_\be_\b__\bi_\bn_\bf_\bo_\bh_\ba_\bs_\bh\n * _\ba_\bn_\bn_\bo_\bu_\bn_\bc_\be_\b__\be_\bn_\bd_\bp_\bo_\bi_\bn_\bt\n * _\ba_\bn_\bn_\bo_\bu_\bn_\bc_\be_\b__\be_\bn_\bt_\br_\by\n- o _\ba_\bn_\bn_\bo_\bu_\bn_\bc_\be_\b__\be_\bn_\bt_\br_\by_\b(_\b)_\b _\b~_\ba_\bn_\bn_\bo_\bu_\bn_\bc_\be_\b__\be_\bn_\bt_\br_\by_\b(_\b)_\b _\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b=_\b(_\b)\n+ o _\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b=_\b(_\b)_\b _\b~_\ba_\bn_\bn_\bo_\bu_\bn_\bc_\be_\b__\be_\bn_\bt_\br_\by_\b(_\b)_\b _\ba_\bn_\bn_\bo_\bu_\bn_\bc_\be_\b__\be_\bn_\bt_\br_\by_\b(_\b)\n o _\be_\bn_\bu_\bm_\b _\bt_\br_\ba_\bc_\bk_\be_\br_\b__\bs_\bo_\bu_\br_\bc_\be\n [_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n *\b**\b**\b**\b**\b**\b* a\ban\bnn\bno\bou\bun\bnc\bce\be_\b_i\bin\bnf\bfo\boh\bha\bas\bsh\bh *\b**\b**\b**\b**\b**\b*\n Declared in \"_\bl_\bi_\bb_\bt_\bo_\br_\br_\be_\bn_\bt_\b/_\ba_\bn_\bn_\bo_\bu_\bn_\bc_\be_\b__\be_\bn_\bt_\br_\by_\b._\bh_\bp_\bp\"\n struct announce_infohash\n {\n std::string message;\n@@ -78,19 +78,19 @@\n [_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n *\b**\b**\b**\b**\b**\b* a\ban\bnn\bno\bou\bun\bnc\bce\be_\b_e\ben\bnt\btr\bry\by *\b**\b**\b**\b**\b**\b*\n Declared in \"_\bl_\bi_\bb_\bt_\bo_\br_\br_\be_\bn_\bt_\b/_\ba_\bn_\bn_\bo_\bu_\bn_\bc_\be_\b__\be_\bn_\bt_\br_\by_\b._\bh_\bp_\bp\"\n this class holds information about one bittorrent tracker, as it relates to a\n specific torrent.\n struct announce_entry\n {\n- explicit a\ban\bnn\bno\bou\bun\bnc\bce\be_\b_e\ben\bnt\btr\bry\by (string_view u);\n- a\ban\bnn\bno\bou\bun\bnc\bce\be_\b_e\ben\bnt\btr\bry\by (announce_entry const&);\n a\ban\bnn\bno\bou\bun\bnc\bce\be_\b_e\ben\bnt\btr\bry\by ();\n+ a\ban\bnn\bno\bou\bun\bnc\bce\be_\b_e\ben\bnt\btr\bry\by (announce_entry const&);\n announce_entry& o\bop\bpe\ber\bra\bat\bto\bor\br=\b= (announce_entry const&) &;\n ~\b~a\ban\bnn\bno\bou\bun\bnc\bce\be_\b_e\ben\bnt\btr\bry\by ();\n+ explicit a\ban\bnn\bno\bou\bun\bnc\bce\be_\b_e\ben\bnt\btr\bry\by (string_view u);\n \n enum tracker_source\n {\n source_torrent,\n source_client,\n source_magnet_link,\n source_tex,\n@@ -101,20 +101,20 @@\n std::vector endpoints;\n std::uint8_t t\bti\bie\ber\br = 0;\n std::uint8_t f\bfa\bai\bil\bl_\b_l\bli\bim\bmi\bit\bt = 0;\n std::uint8_t source:4;\n bool verified:1;\n };\n [_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b* a\ban\bnn\bno\bou\bun\bnc\bce\be_\b_e\ben\bnt\btr\bry\by(\b()\b) ~\b~a\ban\bnn\bno\bou\bun\bnc\bce\be_\b_e\ben\bnt\btr\bry\by(\b()\b) o\bop\bpe\ber\bra\bat\bto\bor\br=\b=(\b()\b) *\b**\b**\b**\b**\b*\n-explicit a\ban\bnn\bno\bou\bun\bnc\bce\be_\b_e\ben\bnt\btr\bry\by (string_view u);\n-a\ban\bnn\bno\bou\bun\bnc\bce\be_\b_e\ben\bnt\btr\bry\by (announce_entry const&);\n+*\b**\b**\b**\b**\b* o\bop\bpe\ber\bra\bat\bto\bor\br=\b=(\b()\b) ~\b~a\ban\bnn\bno\bou\bun\bnc\bce\be_\b_e\ben\bnt\btr\bry\by(\b()\b) a\ban\bnn\bno\bou\bun\bnc\bce\be_\b_e\ben\bnt\btr\bry\by(\b()\b) *\b**\b**\b**\b**\b*\n a\ban\bnn\bno\bou\bun\bnc\bce\be_\b_e\ben\bnt\btr\bry\by ();\n+a\ban\bnn\bno\bou\bun\bnc\bce\be_\b_e\ben\bnt\btr\bry\by (announce_entry const&);\n announce_entry& o\bop\bpe\ber\bra\bat\bto\bor\br=\b= (announce_entry const&) &;\n ~\b~a\ban\bnn\bno\bou\bun\bnc\bce\be_\b_e\ben\bnt\btr\bry\by ();\n+explicit a\ban\bnn\bno\bou\bun\bnc\bce\be_\b_e\ben\bnt\btr\bry\by (string_view u);\n constructs a tracker announce _\be_\bn_\bt_\br_\by with u as the URL.\n [_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n *\b**\b**\b**\b**\b* e\ben\bnu\bum\bm t\btr\bra\bac\bck\bke\ber\br_\b_s\bso\bou\bur\brc\bce\be *\b**\b**\b**\b**\b*\n Declared in \"_\bl_\bi_\bb_\bt_\bo_\br_\br_\be_\bn_\bt_\b/_\ba_\bn_\bn_\bo_\bu_\bn_\bc_\be_\b__\be_\bn_\bt_\br_\by_\b._\bh_\bp_\bp\"\n _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b \n |_\bn\bn_\ba\ba_\bm\bm_\be\be_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\bv\bv_\ba\ba_\bl\bl_\bu\bu_\be\be_\b|_\bd\bd_\be\be_\bs\bs_\bc\bc_\br\br_\bi\bi_\bp\bp_\bt\bt_\bi\bi_\bo\bo_\bn\bn_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n |_\bs_\bo_\bu_\br_\bc_\be_\b__\bt_\bo_\br_\br_\be_\bn_\bt_\b _\b _\b _\b _\b|_\b1_\b _\b _\b _\b _\b|_\bt_\bh_\be_\b _\bt_\br_\ba_\bc_\bk_\be_\br_\b _\bw_\ba_\bs_\b _\bp_\ba_\br_\bt_\b _\bo_\bf_\b _\bt_\bh_\be_\b _\b._\bt_\bo_\br_\br_\be_\bn_\bt_\b _\bf_\bi_\bl_\be_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n"}]}, {"source1": "./usr/share/doc/libtorrent-rasterbar-doc/html/reference-Utility.html", "source2": "./usr/share/doc/libtorrent-rasterbar-doc/html/reference-Utility.html", "unified_diff": "@@ -29,31 +29,31 @@\n \n
\n \n \n Table of contents
\n \n - hasher
\n-- hasher() operator=()
\n+- operator=() hasher()
\n - update()
\n - final()
\n - reset()
\n
\n \n - hasher256
\n-- hasher256() operator=()
\n+- operator=() hasher256()
\n - update()
\n - final()
\n - reset()
\n
\n \n - bitfield
\n - bitfield()
\n - assign()
\n-- operator[]() get_bit()
\n+- get_bit() operator[]()
\n - set_bit() clear_bit()
\n - all_set()
\n - none_set()
\n - size()
\n - num_words()
\n - num_bytes()
\n - empty()
\n@@ -83,31 +83,31 @@\n by Steve Reid and released as public domain.\n For more info, see src/sha1.cpp.\n
\n class hasher\n {\n hasher ();\n explicit hasher (span<char const> data);\n- hasher (char const* data, int len);\n hasher (hasher const&);\n hasher& operator= (hasher const&) &;\n+ hasher (char const* data, int len);\n hasher& update (span<char const> data);\n hasher& update (char const* data, int len);\n sha1_hash final ();\n void reset ();\n };\n \n-\n-[report issue]\n-hasher() operator=()
\n+\n+[report issue]\n+operator=() hasher()
\n \n explicit hasher (span<char const> data);\n-hasher (char const* data, int len);\n hasher (hasher const&);\n hasher& operator= (hasher const&) &;\n+hasher (char const* data, int len);\n
\n this is the same as default constructing followed by a call to\n update(data, len).
\n [report issue]\n \n update()
\n \n@@ -136,31 +136,31 @@\n \n hasher256
\n Declared in "libtorrent/hasher.hpp"
\n \n class hasher256\n {\n hasher256 ();\n- hasher256 (hasher256 const&);\n hasher256& operator= (hasher256 const&) &;\n+ hasher256 (hasher256 const&);\n explicit hasher256 (span<char const> data);\n hasher256 (char const* data, int len);\n hasher256& update (span<char const> data);\n hasher256& update (char const* data, int len);\n sha256_hash final ();\n void reset ();\n ~hasher256 ();\n };\n \n-\n-[report issue]\n-hasher256() operator=()
\n+\n+[report issue]\n+operator=() hasher256()
\n \n-hasher256 (hasher256 const&);\n hasher256& operator= (hasher256 const&) &;\n+hasher256 (hasher256 const&);\n explicit hasher256 (span<char const> data);\n hasher256 (char const* data, int len);\n
\n this is the same as default constructing followed by a call to\n update(data, len).
\n [report issue]\n \n@@ -192,20 +192,20 @@\n bitfield
\n Declared in "libtorrent/bitfield.hpp"
\n The bitfield type stores any number of bits as a bitfield\n in a heap allocated array.
\n \n struct bitfield\n {\n- bitfield (int bits, bool val);\n+ explicit bitfield (int bits);\n bitfield (bitfield const& rhs);\n- bitfield (char const* b, int bits);\n bitfield (bitfield&& rhs) noexcept = default;\n- explicit bitfield (int bits);\n bitfield () noexcept = default;\n+ bitfield (char const* b, int bits);\n+ bitfield (int bits, bool val);\n void assign (char const* b, int const bits);\n bool get_bit (int index) const noexcept;\n bool operator[] (int index) const noexcept;\n void set_bit (int index) noexcept;\n void clear_bit (int index) noexcept;\n bool all_set () const noexcept;\n bool none_set () const noexcept;\n@@ -221,20 +221,20 @@\n int find_last_clear () const noexcept;\n bool operator== (lt::bitfield const& rhs) const;\n };\n \n [report issue]\n bitfield()
\n \n-bitfield (int bits, bool val);\n+explicit bitfield (int bits);\n bitfield (bitfield const& rhs);\n-bitfield (char const* b, int bits);\n bitfield (bitfield&& rhs) noexcept = default;\n-explicit bitfield (int bits);\n bitfield () noexcept = default;\n+bitfield (char const* b, int bits);\n+bitfield (int bits, bool val);\n
\n constructs a new bitfield. The default constructor creates an empty\n bitfield. bits is the size of the bitfield (specified in bits).\n val is the value to initialize the bits to. If not specified\n all bits are initialized to 0.
\n The constructor taking a pointer b and bits copies a bitfield\n from the specified buffer, and bits number of bits (rounded up to\n@@ -243,18 +243,18 @@\n
\n assign()
\n \n void assign (char const* b, int const bits);\n
\n copy bitfield from buffer b of bits number of bits, rounded up to\n the nearest byte boundary.
\n-\n-[report issue]\n-\n+\n+get_bit() operator[]()
\n \n bool get_bit (int index) const noexcept;\n bool operator[] (int index) const noexcept;\n
\n query bit at index. Returns true if bit is 1, otherwise false.
\n \n [report issue]\n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,26 +1,26 @@\n >\n _\b[_\bl_\bi_\bb_\bt_\bo_\br_\br_\be_\bn_\bt_\b _\bl_\bo_\bg_\bo_\b]\n V\bVe\ber\brs\bsi\bio\bon\bn:\b: 2.0.10\n _\bh_\bo_\bm_\be\n Table of contents\n * _\bh_\ba_\bs_\bh_\be_\br\n- o _\bh_\ba_\bs_\bh_\be_\br_\b(_\b)_\b _\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b=_\b(_\b)\n+ o _\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b=_\b(_\b)_\b _\bh_\ba_\bs_\bh_\be_\br_\b(_\b)\n o _\bu_\bp_\bd_\ba_\bt_\be_\b(_\b)\n o _\bf_\bi_\bn_\ba_\bl_\b(_\b)\n o _\br_\be_\bs_\be_\bt_\b(_\b)\n * _\bh_\ba_\bs_\bh_\be_\br_\b2_\b5_\b6\n- o _\bh_\ba_\bs_\bh_\be_\br_\b2_\b5_\b6_\b(_\b)_\b _\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b=_\b(_\b)\n+ o _\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b=_\b(_\b)_\b _\bh_\ba_\bs_\bh_\be_\br_\b2_\b5_\b6_\b(_\b)\n o _\bu_\bp_\bd_\ba_\bt_\be_\b(_\b)\n o _\bf_\bi_\bn_\ba_\bl_\b(_\b)\n o _\br_\be_\bs_\be_\bt_\b(_\b)\n * _\bb_\bi_\bt_\bf_\bi_\be_\bl_\bd\n o _\bb_\bi_\bt_\bf_\bi_\be_\bl_\bd_\b(_\b)\n o _\ba_\bs_\bs_\bi_\bg_\bn_\b(_\b)\n- o _\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b[_\b]_\b(_\b)_\b _\bg_\be_\bt_\b__\bb_\bi_\bt_\b(_\b)\n+ o _\bg_\be_\bt_\b__\bb_\bi_\bt_\b(_\b)_\b _\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b[_\b]_\b(_\b)\n o _\bs_\be_\bt_\b__\bb_\bi_\bt_\b(_\b)_\b _\bc_\bl_\be_\ba_\br_\b__\bb_\bi_\bt_\b(_\b)\n o _\ba_\bl_\bl_\b__\bs_\be_\bt_\b(_\b)\n o _\bn_\bo_\bn_\be_\b__\bs_\be_\bt_\b(_\b)\n o _\bs_\bi_\bz_\be_\b(_\b)\n o _\bn_\bu_\bm_\b__\bw_\bo_\br_\bd_\bs_\b(_\b)\n o _\bn_\bu_\bm_\b__\bb_\by_\bt_\be_\bs_\b(_\b)\n o _\be_\bm_\bp_\bt_\by_\b(_\b)\n@@ -44,28 +44,28 @@\n to call reset() to reinitialize it.\n The built-in software version of sha1-algorithm was implemented by Steve Reid\n and released as public domain. For more info, see src/sha1.cpp.\n class hasher\n {\n h\bha\bas\bsh\bhe\ber\br ();\n explicit h\bha\bas\bsh\bhe\ber\br (span data);\n- h\bha\bas\bsh\bhe\ber\br (char const* data, int len);\n h\bha\bas\bsh\bhe\ber\br (hasher const&);\n hasher& o\bop\bpe\ber\bra\bat\bto\bor\br=\b= (hasher const&) &;\n+ h\bha\bas\bsh\bhe\ber\br (char const* data, int len);\n hasher& u\bup\bpd\bda\bat\bte\be (span data);\n hasher& u\bup\bpd\bda\bat\bte\be (char const* data, int len);\n sha1_hash f\bfi\bin\bna\bal\bl ();\n void r\bre\bes\bse\bet\bt ();\n };\n [_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b* h\bha\bas\bsh\bhe\ber\br(\b()\b) o\bop\bpe\ber\bra\bat\bto\bor\br=\b=(\b()\b) *\b**\b**\b**\b**\b*\n+*\b**\b**\b**\b**\b* o\bop\bpe\ber\bra\bat\bto\bor\br=\b=(\b()\b) h\bha\bas\bsh\bhe\ber\br(\b()\b) *\b**\b**\b**\b**\b*\n explicit h\bha\bas\bsh\bhe\ber\br (span data);\n-h\bha\bas\bsh\bhe\ber\br (char const* data, int len);\n h\bha\bas\bsh\bhe\ber\br (hasher const&);\n hasher& o\bop\bpe\ber\bra\bat\bto\bor\br=\b= (hasher const&) &;\n+h\bha\bas\bsh\bhe\ber\br (char const* data, int len);\n this is the same as default constructing followed by a call to update(data,\n len).\n [_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n *\b**\b**\b**\b**\b* u\bup\bpd\bda\bat\bte\be(\b()\b) *\b**\b**\b**\b**\b*\n hasher& u\bup\bpd\bda\bat\bte\be (span data);\n hasher& u\bup\bpd\bda\bat\bte\be (char const* data, int len);\n append the following bytes to what is being hashed\n@@ -81,28 +81,28 @@\n constructed.\n [_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n *\b**\b**\b**\b**\b**\b* h\bha\bas\bsh\bhe\ber\br2\b25\b56\b6 *\b**\b**\b**\b**\b**\b*\n Declared in \"_\bl_\bi_\bb_\bt_\bo_\br_\br_\be_\bn_\bt_\b/_\bh_\ba_\bs_\bh_\be_\br_\b._\bh_\bp_\bp\"\n class hasher256\n {\n h\bha\bas\bsh\bhe\ber\br2\b25\b56\b6 ();\n- h\bha\bas\bsh\bhe\ber\br2\b25\b56\b6 (hasher256 const&);\n hasher256& o\bop\bpe\ber\bra\bat\bto\bor\br=\b= (hasher256 const&) &;\n+ h\bha\bas\bsh\bhe\ber\br2\b25\b56\b6 (hasher256 const&);\n explicit h\bha\bas\bsh\bhe\ber\br2\b25\b56\b6 (span data);\n h\bha\bas\bsh\bhe\ber\br2\b25\b56\b6 (char const* data, int len);\n hasher256& u\bup\bpd\bda\bat\bte\be (span data);\n hasher256& u\bup\bpd\bda\bat\bte\be (char const* data, int len);\n sha256_hash f\bfi\bin\bna\bal\bl ();\n void r\bre\bes\bse\bet\bt ();\n ~\b~h\bha\bas\bsh\bhe\ber\br2\b25\b56\b6 ();\n };\n [_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b* h\bha\bas\bsh\bhe\ber\br2\b25\b56\b6(\b()\b) o\bop\bpe\ber\bra\bat\bto\bor\br=\b=(\b()\b) *\b**\b**\b**\b**\b*\n-h\bha\bas\bsh\bhe\ber\br2\b25\b56\b6 (hasher256 const&);\n+*\b**\b**\b**\b**\b* o\bop\bpe\ber\bra\bat\bto\bor\br=\b=(\b()\b) h\bha\bas\bsh\bhe\ber\br2\b25\b56\b6(\b()\b) *\b**\b**\b**\b**\b*\n hasher256& o\bop\bpe\ber\bra\bat\bto\bor\br=\b= (hasher256 const&) &;\n+h\bha\bas\bsh\bhe\ber\br2\b25\b56\b6 (hasher256 const&);\n explicit h\bha\bas\bsh\bhe\ber\br2\b25\b56\b6 (span data);\n h\bha\bas\bsh\bhe\ber\br2\b25\b56\b6 (char const* data, int len);\n this is the same as default constructing followed by a call to update(data,\n len).\n [_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n *\b**\b**\b**\b**\b* u\bup\bpd\bda\bat\bte\be(\b()\b) *\b**\b**\b**\b**\b*\n hasher256& u\bup\bpd\bda\bat\bte\be (span data);\n@@ -121,20 +121,20 @@\n [_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n *\b**\b**\b**\b**\b**\b* b\bbi\bit\btf\bfi\bie\bel\bld\bd *\b**\b**\b**\b**\b**\b*\n Declared in \"_\bl_\bi_\bb_\bt_\bo_\br_\br_\be_\bn_\bt_\b/_\bb_\bi_\bt_\bf_\bi_\be_\bl_\bd_\b._\bh_\bp_\bp\"\n The _\bb_\bi_\bt_\bf_\bi_\be_\bl_\bd type stores any number of bits as a _\bb_\bi_\bt_\bf_\bi_\be_\bl_\bd in a heap allocated\n array.\n struct bitfield\n {\n- b\bbi\bit\btf\bfi\bie\bel\bld\bd (int bits, bool val);\n+ explicit b\bbi\bit\btf\bfi\bie\bel\bld\bd (int bits);\n b\bbi\bit\btf\bfi\bie\bel\bld\bd (bitfield const& rhs);\n- b\bbi\bit\btf\bfi\bie\bel\bld\bd (char const* b, int bits);\n b\bbi\bit\btf\bfi\bie\bel\bld\bd (bitfield&& rhs) noexcept = default;\n- explicit b\bbi\bit\btf\bfi\bie\bel\bld\bd (int bits);\n b\bbi\bit\btf\bfi\bie\bel\bld\bd () noexcept = default;\n+ b\bbi\bit\btf\bfi\bie\bel\bld\bd (char const* b, int bits);\n+ b\bbi\bit\btf\bfi\bie\bel\bld\bd (int bits, bool val);\n void a\bas\bss\bsi\big\bgn\bn (char const* b, int const bits);\n bool g\bge\bet\bt_\b_b\bbi\bit\bt (int index) const noexcept;\n bool o\bop\bpe\ber\bra\bat\bto\bor\br[\b[]\b] (int index) const noexcept;\n void s\bse\bet\bt_\b_b\bbi\bit\bt (int index) noexcept;\n void c\bcl\ble\bea\bar\br_\b_b\bbi\bit\bt (int index) noexcept;\n bool a\bal\bll\bl_\b_s\bse\bet\bt () const noexcept;\n bool n\bno\bon\bne\be_\b_s\bse\bet\bt () const noexcept;\n@@ -148,33 +148,33 @@\n int c\bco\bou\bun\bnt\bt () const noexcept;\n int f\bfi\bin\bnd\bd_\b_f\bfi\bir\brs\bst\bt_\b_s\bse\bet\bt () const noexcept;\n int f\bfi\bin\bnd\bd_\b_l\bla\bas\bst\bt_\b_c\bcl\ble\bea\bar\br () const noexcept;\n bool o\bop\bpe\ber\bra\bat\bto\bor\br=\b==\b= (lt::bitfield const& rhs) const;\n };\n [_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n *\b**\b**\b**\b**\b* b\bbi\bit\btf\bfi\bie\bel\bld\bd(\b()\b) *\b**\b**\b**\b**\b*\n-b\bbi\bit\btf\bfi\bie\bel\bld\bd (int bits, bool val);\n+explicit b\bbi\bit\btf\bfi\bie\bel\bld\bd (int bits);\n b\bbi\bit\btf\bfi\bie\bel\bld\bd (bitfield const& rhs);\n-b\bbi\bit\btf\bfi\bie\bel\bld\bd (char const* b, int bits);\n b\bbi\bit\btf\bfi\bie\bel\bld\bd (bitfield&& rhs) noexcept = default;\n-explicit b\bbi\bit\btf\bfi\bie\bel\bld\bd (int bits);\n b\bbi\bit\btf\bfi\bie\bel\bld\bd () noexcept = default;\n+b\bbi\bit\btf\bfi\bie\bel\bld\bd (char const* b, int bits);\n+b\bbi\bit\btf\bfi\bie\bel\bld\bd (int bits, bool val);\n constructs a new _\bb_\bi_\bt_\bf_\bi_\be_\bl_\bd. The default constructor creates an empty _\bb_\bi_\bt_\bf_\bi_\be_\bl_\bd.\n bits is the size of the _\bb_\bi_\bt_\bf_\bi_\be_\bl_\bd (specified in bits). val is the value to\n initialize the bits to. If not specified all bits are initialized to 0.\n The constructor taking a pointer b and bits copies a _\bb_\bi_\bt_\bf_\bi_\be_\bl_\bd from the\n specified buffer, and bits number of bits (rounded up to the nearest byte\n boundary).\n [_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n *\b**\b**\b**\b**\b* a\bas\bss\bsi\big\bgn\bn(\b()\b) *\b**\b**\b**\b**\b*\n void a\bas\bss\bsi\big\bgn\bn (char const* b, int const bits);\n copy _\bb_\bi_\bt_\bf_\bi_\be_\bl_\bd from buffer b of bits number of bits, rounded up to the nearest\n byte boundary.\n [_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b* o\bop\bpe\ber\bra\bat\bto\bor\br[\b[]\b](\b()\b) g\bge\bet\bt_\b_b\bbi\bit\bt(\b()\b) *\b**\b**\b**\b**\b*\n+*\b**\b**\b**\b**\b* g\bge\bet\bt_\b_b\bbi\bit\bt(\b()\b) o\bop\bpe\ber\bra\bat\bto\bor\br[\b[]\b](\b()\b) *\b**\b**\b**\b**\b*\n bool g\bge\bet\bt_\b_b\bbi\bit\bt (int index) const noexcept;\n bool o\bop\bpe\ber\bra\bat\bto\bor\br[\b[]\b] (int index) const noexcept;\n query bit at index. Returns true if bit is 1, otherwise false.\n [_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n *\b**\b**\b**\b**\b* s\bse\bet\bt_\b_b\bbi\bit\bt(\b()\b) c\bcl\ble\bea\bar\br_\b_b\bbi\bit\bt(\b()\b) *\b**\b**\b**\b**\b*\n void s\bse\bet\bt_\b_b\bbi\bit\bt (int index) noexcept;\n void c\bcl\ble\bea\bar\br_\b_b\bbi\bit\bt (int index) noexcept;\n"}]}, {"source1": "./usr/share/doc/libtorrent-rasterbar-doc/html/reference.html", "source2": "./usr/share/doc/libtorrent-rasterbar-doc/html/reference.html", "comments": ["Ordering differences only"], "unified_diff": "@@ -27,129 +27,135 @@\n \n-Torrent Info
\n-\n-Torrent Status
\n+Settings
\n \n-\n+\n+\n+\n+\n+\n+\n+\n+\n \n Session
\n \n \n \n-\n \n+\n \n-\n \n-\n-Add Torrent
\n-\n Core
\n \n-\n \n \n+\n \n \n-\n-\n-\n-\n \n+\n+\n \n+\n+\n \n+\n+\n \n+\n \n \n-\n-\n-\n+\n \n \n \n-\n \n \n \n+Torrent Info
\n+\n Trackers
\n \n-Settings
\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n Torrent Handle
\n \n+Torrent Status
\n+\n+\n+\n+Add Torrent
\n+\n+\n+\n+\n DHT
\n \n-\n \n \n+\n \n \n \n \n Resume Data
\n \n \n \n+Bdecoding
\n+\n Error Codes
\n \n \n+\n+\n \n \n-\n \n-\n \n-\n \n+\n \n-\n-\n-\n \n \n+\n+\n \n \n+\n \n Create Torrents
\n \n \n \n \n \n@@ -162,65 +168,59 @@\n \n \n Filter
\n \n \n \n \n-Bdecoding
\n-\n \n \n-Utility
\n-\n Custom Storage
\n \n \n-\n+\n \n \n-\n+\n \n \n \n \n \n+Utility
\n+\n Storage
\n \n \n \n \n-\n+\n \n+\n \n-\n \n \n \n \n Plugins
\n \n \n-\n-\n \n \n \n \n+\n+\n \n-\n \n+\n \n PeerClass
\n \n ed25519
\n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -4,159 +4,159 @@\n _\bs_\bi_\bn_\bg_\bl_\be_\b-_\bp_\ba_\bg_\be_\b _\bv_\be_\br_\bs_\bi_\bo_\bn\n Stats\n _\bc_\bo_\bu_\bn_\bt_\be_\br_\bs\n _\bs_\bt_\ba_\bt_\bs_\b__\bm_\be_\bt_\br_\bi_\bc\n _\bs_\be_\bs_\bs_\bi_\bo_\bn_\b__\bs_\bt_\ba_\bt_\bs_\b__\bm_\be_\bt_\br_\bi_\bc_\bs_\b(_\b)\n _\bf_\bi_\bn_\bd_\b__\bm_\be_\bt_\br_\bi_\bc_\b__\bi_\bd_\bx_\b(_\b)\n _\bm_\be_\bt_\br_\bi_\bc_\b__\bt_\by_\bp_\be_\b__\bt\n-Torrent Info\n-_\bw_\be_\bb_\b__\bs_\be_\be_\bd_\b__\be_\bn_\bt_\br_\by\n-_\bl_\bo_\ba_\bd_\b__\bt_\bo_\br_\br_\be_\bn_\bt_\b__\bl_\bi_\bm_\bi_\bt_\bs\n-_\bt_\bo_\br_\br_\be_\bn_\bt_\b__\bi_\bn_\bf_\bo\n-Torrent Status\n-_\bt_\bo_\br_\br_\be_\bn_\bt_\b__\bs_\bt_\ba_\bt_\bu_\bs\n+Settings\n+_\bo_\bv_\be_\br_\bv_\bi_\be_\bw\n+_\bs_\be_\bt_\bt_\bi_\bn_\bg_\bs_\b__\bp_\ba_\bc_\bk\n+_\bn_\ba_\bm_\be_\b__\bf_\bo_\br_\b__\bs_\be_\bt_\bt_\bi_\bn_\bg_\b(_\b)\n+_\bs_\be_\bt_\bt_\bi_\bn_\bg_\b__\bb_\by_\b__\bn_\ba_\bm_\be_\b(_\b)\n+_\bd_\be_\bf_\ba_\bu_\bl_\bt_\b__\bs_\be_\bt_\bt_\bi_\bn_\bg_\bs_\b(_\b)\n+_\bm_\bi_\bn_\b__\bm_\be_\bm_\bo_\br_\by_\b__\bu_\bs_\ba_\bg_\be_\b(_\b)\n+_\bh_\bi_\bg_\bh_\b__\bp_\be_\br_\bf_\bo_\br_\bm_\ba_\bn_\bc_\be_\b__\bs_\be_\be_\bd_\b(_\b)\n+_\bg_\be_\bn_\be_\br_\ba_\bt_\be_\b__\bf_\bi_\bn_\bg_\be_\br_\bp_\br_\bi_\bn_\bt_\b(_\b)\n Session\n _\bs_\be_\bs_\bs_\bi_\bo_\bn_\b__\bp_\br_\bo_\bx_\by\n _\bs_\be_\bs_\bs_\bi_\bo_\bn\n-_\bs_\be_\bs_\bs_\bi_\bo_\bn_\b__\bh_\ba_\bn_\bd_\bl_\be\n _\bs_\be_\bs_\bs_\bi_\bo_\bn_\b__\bp_\ba_\br_\ba_\bm_\bs\n+_\bs_\be_\bs_\bs_\bi_\bo_\bn_\b__\bh_\ba_\bn_\bd_\bl_\be\n _\bw_\br_\bi_\bt_\be_\b__\bs_\be_\bs_\bs_\bi_\bo_\bn_\b__\bp_\ba_\br_\ba_\bm_\bs_\b(_\b)\n-_\br_\be_\ba_\bd_\b__\bs_\be_\bs_\bs_\bi_\bo_\bn_\b__\bp_\ba_\br_\ba_\bm_\bs_\b(_\b)\n _\bw_\br_\bi_\bt_\be_\b__\bs_\be_\bs_\bs_\bi_\bo_\bn_\b__\bp_\ba_\br_\ba_\bm_\bs_\b__\bb_\bu_\bf_\b(_\b)\n-Add Torrent\n-_\ba_\bd_\bd_\b__\bt_\bo_\br_\br_\be_\bn_\bt_\b__\bp_\ba_\br_\ba_\bm_\bs\n-_\bc_\bl_\bi_\be_\bn_\bt_\b__\bd_\ba_\bt_\ba_\b__\bt\n+_\br_\be_\ba_\bd_\b__\bs_\be_\bs_\bs_\bi_\bo_\bn_\b__\bp_\ba_\br_\ba_\bm_\bs_\b(_\b)\n Core\n-_\bp_\be_\be_\br_\b__\br_\be_\bq_\bu_\be_\bs_\bt\n _\bp_\be_\be_\br_\b__\bi_\bn_\bf_\bo\n _\bi_\bn_\bf_\bo_\b__\bh_\ba_\bs_\bh_\b__\bt\n+_\bp_\be_\be_\br_\b__\br_\be_\bq_\bu_\be_\bs_\bt\n _\bp_\bi_\be_\bc_\be_\b__\bb_\bl_\bo_\bc_\bk\n _\bt_\br_\bu_\bn_\bc_\ba_\bt_\be_\b__\bf_\bi_\bl_\be_\bs_\b(_\b)\n-_\bm_\ba_\bk_\be_\b__\bm_\ba_\bg_\bn_\be_\bt_\b__\bu_\br_\bi_\b(_\b)\n-_\bp_\ba_\br_\bs_\be_\b__\bm_\ba_\bg_\bn_\be_\bt_\b__\bu_\br_\bi_\b(_\b)\n-_\bl_\bo_\ba_\bd_\b__\bt_\bo_\br_\br_\be_\bn_\bt_\b__\bp_\ba_\br_\bs_\be_\bd_\b(_\b)\n-_\bl_\bo_\ba_\bd_\b__\bt_\bo_\br_\br_\be_\bn_\bt_\b__\bf_\bi_\bl_\be_\b(_\b)\n _\bl_\bo_\ba_\bd_\b__\bt_\bo_\br_\br_\be_\bn_\bt_\b__\bb_\bu_\bf_\bf_\be_\br_\b(_\b)\n+_\bl_\bo_\ba_\bd_\b__\bt_\bo_\br_\br_\be_\bn_\bt_\b__\bf_\bi_\bl_\be_\b(_\b)\n+_\bl_\bo_\ba_\bd_\b__\bt_\bo_\br_\br_\be_\bn_\bt_\b__\bp_\ba_\br_\bs_\be_\bd_\b(_\b)\n _\bt_\bo_\br_\br_\be_\bn_\bt_\b__\bp_\be_\be_\br_\b__\be_\bq_\bu_\ba_\bl_\b(_\b)\n+_\bm_\ba_\bk_\be_\b__\bm_\ba_\bg_\bn_\be_\bt_\b__\bu_\br_\bi_\b(_\b)\n+_\bp_\ba_\br_\bs_\be_\b__\bm_\ba_\bg_\bn_\be_\bt_\b__\bu_\br_\bi_\b(_\b)\n _\bv_\be_\br_\bs_\bi_\bo_\bn_\b(_\b)\n+_\bp_\br_\bo_\bt_\bo_\bc_\bo_\bl_\b__\bv_\be_\br_\bs_\bi_\bo_\bn\n+_\bc_\bo_\bn_\bn_\be_\bc_\bt_\bi_\bo_\bn_\b__\bt_\by_\bp_\be\n _\bs_\bo_\bc_\bk_\be_\bt_\b__\bt_\by_\bp_\be_\b__\bt\n+_\be_\bv_\be_\bn_\bt_\b__\bt\n _\bp_\bo_\br_\bt_\bm_\ba_\bp_\b__\bt_\br_\ba_\bn_\bs_\bp_\bo_\br_\bt\n _\bp_\bo_\br_\bt_\bm_\ba_\bp_\b__\bp_\br_\bo_\bt_\bo_\bc_\bo_\bl\n-_\bp_\br_\bo_\bt_\bo_\bc_\bo_\bl_\b__\bv_\be_\br_\bs_\bi_\bo_\bn\n-_\be_\bv_\be_\bn_\bt_\b__\bt\n-_\bc_\bo_\bn_\bn_\be_\bc_\bt_\bi_\bo_\bn_\b__\bt_\by_\bp_\be\n+_\bp_\be_\bx_\b__\bf_\bl_\ba_\bg_\bs_\b__\bt\n _\bt_\bo_\br_\br_\be_\bn_\bt_\b__\bf_\bl_\ba_\bg_\bs_\b__\bt\n _\bi_\bn_\bt\n _\bd_\bo_\bw_\bn_\bl_\bo_\ba_\bd_\b__\bp_\br_\bi_\bo_\br_\bi_\bt_\by_\b__\bt\n-_\bp_\be_\bx_\b__\bf_\bl_\ba_\bg_\bs_\b__\bt\n _\bc_\bh_\ba_\br_\b _\bc_\bo_\bn_\bs_\bt_\b*\n _\bs_\bt_\bd_\b:_\b:_\bu_\bi_\bn_\bt_\b6_\b4_\b__\bt\n+Torrent Info\n+_\bw_\be_\bb_\b__\bs_\be_\be_\bd_\b__\be_\bn_\bt_\br_\by\n+_\bl_\bo_\ba_\bd_\b__\bt_\bo_\br_\br_\be_\bn_\bt_\b__\bl_\bi_\bm_\bi_\bt_\bs\n+_\bt_\bo_\br_\br_\be_\bn_\bt_\b__\bi_\bn_\bf_\bo\n Trackers\n _\ba_\bn_\bn_\bo_\bu_\bn_\bc_\be_\b__\bi_\bn_\bf_\bo_\bh_\ba_\bs_\bh\n _\ba_\bn_\bn_\bo_\bu_\bn_\bc_\be_\b__\be_\bn_\bd_\bp_\bo_\bi_\bn_\bt\n _\ba_\bn_\bn_\bo_\bu_\bn_\bc_\be_\b__\be_\bn_\bt_\br_\by\n-Settings\n-_\bo_\bv_\be_\br_\bv_\bi_\be_\bw\n-_\bs_\be_\bt_\bt_\bi_\bn_\bg_\bs_\b__\bp_\ba_\bc_\bk\n-_\bm_\bi_\bn_\b__\bm_\be_\bm_\bo_\br_\by_\b__\bu_\bs_\ba_\bg_\be_\b(_\b)\n-_\bh_\bi_\bg_\bh_\b__\bp_\be_\br_\bf_\bo_\br_\bm_\ba_\bn_\bc_\be_\b__\bs_\be_\be_\bd_\b(_\b)\n-_\bs_\be_\bt_\bt_\bi_\bn_\bg_\b__\bb_\by_\b__\bn_\ba_\bm_\be_\b(_\b)\n-_\bn_\ba_\bm_\be_\b__\bf_\bo_\br_\b__\bs_\be_\bt_\bt_\bi_\bn_\bg_\b(_\b)\n-_\bd_\be_\bf_\ba_\bu_\bl_\bt_\b__\bs_\be_\bt_\bt_\bi_\bn_\bg_\bs_\b(_\b)\n-_\bg_\be_\bn_\be_\br_\ba_\bt_\be_\b__\bf_\bi_\bn_\bg_\be_\br_\bp_\br_\bi_\bn_\bt_\b(_\b)\n Torrent Handle\n _\bb_\bl_\bo_\bc_\bk_\b__\bi_\bn_\bf_\bo\n _\bp_\ba_\br_\bt_\bi_\ba_\bl_\b__\bp_\bi_\be_\bc_\be_\b__\bi_\bn_\bf_\bo\n _\bt_\bo_\br_\br_\be_\bn_\bt_\b__\bh_\ba_\bn_\bd_\bl_\be\n _\bh_\ba_\bs_\bh_\b__\bv_\ba_\bl_\bu_\be_\b(_\b)\n+Torrent Status\n+_\bt_\bo_\br_\br_\be_\bn_\bt_\b__\bs_\bt_\ba_\bt_\bu_\bs\n+Add Torrent\n+_\ba_\bd_\bd_\b__\bt_\bo_\br_\br_\be_\bn_\bt_\b__\bp_\ba_\br_\ba_\bm_\bs\n+_\bc_\bl_\bi_\be_\bn_\bt_\b__\bd_\ba_\bt_\ba_\b__\bt\n DHT\n-_\bd_\bh_\bt_\b__\bs_\bt_\ba_\bt_\be\n _\bd_\bh_\bt_\b__\bs_\bt_\bo_\br_\ba_\bg_\be_\b__\bc_\bo_\bu_\bn_\bt_\be_\br_\bs\n _\bd_\bh_\bt_\b__\bs_\bt_\bo_\br_\ba_\bg_\be_\b__\bi_\bn_\bt_\be_\br_\bf_\ba_\bc_\be\n+_\bd_\bh_\bt_\b__\bs_\bt_\ba_\bt_\be\n _\bd_\bh_\bt_\b__\bd_\be_\bf_\ba_\bu_\bl_\bt_\b__\bs_\bt_\bo_\br_\ba_\bg_\be_\b__\bc_\bo_\bn_\bs_\bt_\br_\bu_\bc_\bt_\bo_\br_\b(_\b)\n _\bs_\bi_\bg_\bn_\b__\bm_\bu_\bt_\ba_\bb_\bl_\be_\b__\bi_\bt_\be_\bm_\b(_\b)\n _\ba_\bn_\bn_\bo_\bu_\bn_\bc_\be_\b__\bf_\bl_\ba_\bg_\bs_\b__\bt\n Resume Data\n-_\br_\be_\ba_\bd_\b__\br_\be_\bs_\bu_\bm_\be_\b__\bd_\ba_\bt_\ba_\b(_\b)\n-_\bw_\br_\bi_\bt_\be_\b__\br_\be_\bs_\bu_\bm_\be_\b__\bd_\ba_\bt_\ba_\b__\bb_\bu_\bf_\b(_\b)\n _\bw_\br_\bi_\bt_\be_\b__\br_\be_\bs_\bu_\bm_\be_\b__\bd_\ba_\bt_\ba_\b(_\b)\n+_\bw_\br_\bi_\bt_\be_\b__\br_\be_\bs_\bu_\bm_\be_\b__\bd_\ba_\bt_\ba_\b__\bb_\bu_\bf_\b(_\b)\n _\bw_\br_\bi_\bt_\be_\b__\bt_\bo_\br_\br_\be_\bn_\bt_\b__\bf_\bi_\bl_\be_\b__\bb_\bu_\bf_\b(_\b)\n _\bw_\br_\bi_\bt_\be_\b__\bt_\bo_\br_\br_\be_\bn_\bt_\b__\bf_\bi_\bl_\be_\b(_\b)\n+_\br_\be_\ba_\bd_\b__\br_\be_\bs_\bu_\bm_\be_\b__\bd_\ba_\bt_\ba_\b(_\b)\n _\bw_\br_\bi_\bt_\be_\b__\bt_\bo_\br_\br_\be_\bn_\bt_\b__\bf_\bl_\ba_\bg_\bs_\b__\bt\n+Bdecoding\n+_\bb_\bd_\be_\bc_\bo_\bd_\be_\b__\bn_\bo_\bd_\be\n+_\bp_\br_\bi_\bn_\bt_\b__\be_\bn_\bt_\br_\by_\b(_\b)\n+_\bb_\bd_\be_\bc_\bo_\bd_\be_\b(_\b)\n Error Codes\n _\bs_\bt_\bo_\br_\ba_\bg_\be_\b__\be_\br_\br_\bo_\br\n+_\bb_\bd_\be_\bc_\bo_\bd_\be_\b__\bc_\ba_\bt_\be_\bg_\bo_\br_\by_\b(_\b)\n+_\bg_\bz_\bi_\bp_\b__\bc_\ba_\bt_\be_\bg_\bo_\br_\by_\b(_\b)\n _\bl_\bi_\bb_\bt_\bo_\br_\br_\be_\bn_\bt_\b__\bc_\ba_\bt_\be_\bg_\bo_\br_\by_\b(_\b)\n _\bh_\bt_\bt_\bp_\b__\bc_\ba_\bt_\be_\bg_\bo_\br_\by_\b(_\b)\n-_\bp_\bc_\bp_\b__\bc_\ba_\bt_\be_\bg_\bo_\br_\by_\b(_\b)\n _\bs_\bo_\bc_\bk_\bs_\b__\bc_\ba_\bt_\be_\bg_\bo_\br_\by_\b(_\b)\n-_\bg_\bz_\bi_\bp_\b__\bc_\ba_\bt_\be_\bg_\bo_\br_\by_\b(_\b)\n _\bu_\bp_\bn_\bp_\b__\bc_\ba_\bt_\be_\bg_\bo_\br_\by_\b(_\b)\n-_\bb_\bd_\be_\bc_\bo_\bd_\be_\b__\bc_\ba_\bt_\be_\bg_\bo_\br_\by_\b(_\b)\n _\bi_\b2_\bp_\b__\bc_\ba_\bt_\be_\bg_\bo_\br_\by_\b(_\b)\n+_\bp_\bc_\bp_\b__\bc_\ba_\bt_\be_\bg_\bo_\br_\by_\b(_\b)\n _\be_\br_\br_\bo_\br_\b__\bc_\bo_\bd_\be_\b__\be_\bn_\bu_\bm\n-_\bh_\bt_\bt_\bp_\b__\be_\br_\br_\bo_\br_\bs\n-_\bp_\bc_\bp_\b__\be_\br_\br_\bo_\br_\bs\n-_\bs_\bo_\bc_\bk_\bs_\b__\be_\br_\br_\bo_\br_\b__\bc_\bo_\bd_\be\n _\be_\br_\br_\bo_\br_\b__\bc_\bo_\bd_\be_\b__\be_\bn_\bu_\bm\n _\be_\br_\br_\bo_\br_\b__\bc_\bo_\bd_\be_\b__\be_\bn_\bu_\bm\n+_\bh_\bt_\bt_\bp_\b__\be_\br_\br_\bo_\br_\bs\n+_\bs_\bo_\bc_\bk_\bs_\b__\be_\br_\br_\bo_\br_\b__\bc_\bo_\bd_\be\n _\be_\br_\br_\bo_\br_\b__\bc_\bo_\bd_\be_\b__\be_\bn_\bu_\bm\n _\bi_\b2_\bp_\b__\be_\br_\br_\bo_\br_\b__\bc_\bo_\bd_\be\n+_\bp_\bc_\bp_\b__\be_\br_\br_\bo_\br_\bs\n Create Torrents\n _\bo_\bv_\be_\br_\bv_\bi_\be_\bw\n _\bc_\br_\be_\ba_\bt_\be_\b__\bt_\bo_\br_\br_\be_\bn_\bt\n _\ba_\bd_\bd_\b__\bf_\bi_\bl_\be_\bs_\b(_\b)\n _\bs_\be_\bt_\b__\bp_\bi_\be_\bc_\be_\b__\bh_\ba_\bs_\bh_\be_\bs_\b(_\b)\n Bencoding\n _\bo_\bv_\be_\br_\bv_\bi_\be_\bw\n _\be_\bn_\bt_\br_\by\n _\bb_\be_\bn_\bc_\bo_\bd_\be_\b(_\b)\n _\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b<_\b<_\b(_\b)\n Filter\n _\bi_\bp_\b__\bf_\bi_\bl_\bt_\be_\br\n _\bp_\bo_\br_\bt_\b__\bf_\bi_\bl_\bt_\be_\br\n-Bdecoding\n-_\bb_\bd_\be_\bc_\bo_\bd_\be_\b__\bn_\bo_\bd_\be\n-_\bp_\br_\bi_\bn_\bt_\b__\be_\bn_\bt_\br_\by_\b(_\b)\n-_\bb_\bd_\be_\bc_\bo_\bd_\be_\b(_\b)\n-Utility\n-_\bh_\ba_\bs_\bh_\be_\br\n-_\bh_\ba_\bs_\bh_\be_\br_\b2_\b5_\b6\n-_\bb_\bi_\bt_\bf_\bi_\be_\bl_\bd\n Custom Storage\n _\bo_\bv_\be_\br_\bv_\bi_\be_\bw\n-_\bd_\bi_\bs_\bk_\b__\bo_\bb_\bs_\be_\br_\bv_\be_\br\n+_\bs_\be_\bt_\bt_\bi_\bn_\bg_\bs_\b__\bi_\bn_\bt_\be_\br_\bf_\ba_\bc_\be\n _\bb_\bu_\bf_\bf_\be_\br_\b__\ba_\bl_\bl_\bo_\bc_\ba_\bt_\bo_\br_\b__\bi_\bn_\bt_\be_\br_\bf_\ba_\bc_\be\n _\bd_\bi_\bs_\bk_\b__\bb_\bu_\bf_\bf_\be_\br_\b__\bh_\bo_\bl_\bd_\be_\br\n-_\bs_\be_\bt_\bt_\bi_\bn_\bg_\bs_\b__\bi_\bn_\bt_\be_\br_\bf_\ba_\bc_\be\n+_\bd_\bi_\bs_\bk_\b__\bo_\bb_\bs_\be_\br_\bv_\be_\br\n _\bo_\bp_\be_\bn_\b__\bf_\bi_\bl_\be_\b__\bs_\bt_\ba_\bt_\be\n _\bd_\bi_\bs_\bk_\b__\bi_\bn_\bt_\be_\br_\bf_\ba_\bc_\be\n _\bs_\bt_\bo_\br_\ba_\bg_\be_\b__\bh_\bo_\bl_\bd_\be_\br\n _\bf_\bi_\bl_\be_\b__\bo_\bp_\be_\bn_\b__\bm_\bo_\bd_\be_\b__\bt\n+Utility\n+_\bh_\ba_\bs_\bh_\be_\br\n+_\bh_\ba_\bs_\bh_\be_\br_\b2_\b5_\b6\n+_\bb_\bi_\bt_\bf_\bi_\be_\bl_\bd\n Storage\n _\bf_\bi_\bl_\be_\b__\bs_\bl_\bi_\bc_\be\n _\bf_\bi_\bl_\be_\b__\bs_\bt_\bo_\br_\ba_\bg_\be\n _\bs_\bt_\bo_\br_\ba_\bg_\be_\b__\bp_\ba_\br_\ba_\bm_\bs\n-_\bm_\bm_\ba_\bp_\b__\bd_\bi_\bs_\bk_\b__\bi_\bo_\b__\bc_\bo_\bn_\bs_\bt_\br_\bu_\bc_\bt_\bo_\br_\b(_\b)\n+_\bp_\bo_\bs_\bi_\bx_\b__\bd_\bi_\bs_\bk_\b__\bi_\bo_\b__\bc_\bo_\bn_\bs_\bt_\br_\bu_\bc_\bt_\bo_\br_\b(_\b)\n _\bd_\be_\bf_\ba_\bu_\bl_\bt_\b__\bd_\bi_\bs_\bk_\b__\bi_\bo_\b__\bc_\bo_\bn_\bs_\bt_\br_\bu_\bc_\bt_\bo_\br_\b(_\b)\n+_\bm_\bm_\ba_\bp_\b__\bd_\bi_\bs_\bk_\b__\bi_\bo_\b__\bc_\bo_\bn_\bs_\bt_\br_\bu_\bc_\bt_\bo_\br_\b(_\b)\n _\bd_\bi_\bs_\ba_\bb_\bl_\be_\bd_\b__\bd_\bi_\bs_\bk_\b__\bi_\bo_\b__\bc_\bo_\bn_\bs_\bt_\br_\bu_\bc_\bt_\bo_\br_\b(_\b)\n-_\bp_\bo_\bs_\bi_\bx_\b__\bd_\bi_\bs_\bk_\b__\bi_\bo_\b__\bc_\bo_\bn_\bs_\bt_\br_\bu_\bc_\bt_\bo_\br_\b(_\b)\n _\bs_\bt_\bo_\br_\ba_\bg_\be_\b__\bm_\bo_\bd_\be_\b__\bt\n _\bs_\bt_\ba_\bt_\bu_\bs_\b__\bt\n _\bm_\bo_\bv_\be_\b__\bf_\bl_\ba_\bg_\bs_\b__\bt\n Plugins\n _\bo_\bv_\be_\br_\bv_\bi_\be_\bw\n-_\bp_\be_\be_\br_\b__\bc_\bo_\bn_\bn_\be_\bc_\bt_\bi_\bo_\bn_\b__\bh_\ba_\bn_\bd_\bl_\be\n-_\bb_\bt_\b__\bp_\be_\be_\br_\b__\bc_\bo_\bn_\bn_\be_\bc_\bt_\bi_\bo_\bn_\b__\bh_\ba_\bn_\bd_\bl_\be\n _\bp_\bl_\bu_\bg_\bi_\bn\n _\bt_\bo_\br_\br_\be_\bn_\bt_\b__\bp_\bl_\bu_\bg_\bi_\bn\n _\bp_\be_\be_\br_\b__\bp_\bl_\bu_\bg_\bi_\bn\n _\bc_\br_\by_\bp_\bt_\bo_\b__\bp_\bl_\bu_\bg_\bi_\bn\n+_\bp_\be_\be_\br_\b__\bc_\bo_\bn_\bn_\be_\bc_\bt_\bi_\bo_\bn_\b__\bh_\ba_\bn_\bd_\bl_\be\n+_\bb_\bt_\b__\bp_\be_\be_\br_\b__\bc_\bo_\bn_\bn_\be_\bc_\bt_\bi_\bo_\bn_\b__\bh_\ba_\bn_\bd_\bl_\be\n _\bc_\br_\be_\ba_\bt_\be_\b__\bu_\bt_\b__\bp_\be_\bx_\b__\bp_\bl_\bu_\bg_\bi_\bn_\b(_\b)\n-_\bc_\br_\be_\ba_\bt_\be_\b__\bu_\bt_\b__\bm_\be_\bt_\ba_\bd_\ba_\bt_\ba_\b__\bp_\bl_\bu_\bg_\bi_\bn_\b(_\b)\n _\bc_\br_\be_\ba_\bt_\be_\b__\bs_\bm_\ba_\br_\bt_\b__\bb_\ba_\bn_\b__\bp_\bl_\bu_\bg_\bi_\bn_\b(_\b)\n+_\bc_\br_\be_\ba_\bt_\be_\b__\bu_\bt_\b__\bm_\be_\bt_\ba_\bd_\ba_\bt_\ba_\b__\bp_\bl_\bu_\bg_\bi_\bn_\b(_\b)\n PeerClass\n _\bp_\be_\be_\br_\b__\bc_\bl_\ba_\bs_\bs_\b__\bt_\by_\bp_\be_\b__\bf_\bi_\bl_\bt_\be_\br\n _\bp_\be_\be_\br_\b__\bc_\bl_\ba_\bs_\bs_\b__\bi_\bn_\bf_\bo\n ed25519\n _\be_\bd_\b2_\b5_\b5_\b1_\b9_\b__\bc_\br_\be_\ba_\bt_\be_\b__\bs_\be_\be_\bd_\b(_\b)\n _\be_\bd_\b2_\b5_\b5_\b1_\b9_\b__\bc_\br_\be_\ba_\bt_\be_\b__\bk_\be_\by_\bp_\ba_\bi_\br_\b(_\b)\n _\be_\bd_\b2_\b5_\b5_\b1_\b9_\b__\bs_\bi_\bg_\bn_\b(_\b)\n"}]}, {"source1": "./usr/share/doc/libtorrent-rasterbar-doc/html/single-page-ref.html", "source2": "./usr/share/doc/libtorrent-rasterbar-doc/html/single-page-ref.html", "unified_diff": "@@ -28,18548 +28,17765 @@\n 2.0.10 \n \n
\n \n \n Table of contents
\n \n-- storage_error
\n-- bool()
\n-- file()
\n+- counters\n
\n-- libtorrent_category()
\n-- http_category()
\n-- pcp_category()
\n-- socks_category()
\n-- gzip_category()
\n-- upnp_category()
\n-- bdecode_category()
\n-- i2p_category()
\n-- enum error_code_enum
\n-- enum http_errors
\n-- enum pcp_errors
\n-- enum socks_error_code
\n-- enum error_code_enum
\n-- enum error_code_enum
\n-- enum error_code_enum
\n-- enum i2p_error_code
\n-- hasher
\n-- operator=() hasher()
\n-- update()
\n-- final()
\n-- reset()
\n+- stats_metric
\n+- session_stats_metrics()
\n+- find_metric_idx()
\n+- enum metric_type_t
\n+- settings_interface
\n+- buffer_allocator_interface
\n+- disk_buffer_holder
\n+- disk_buffer_holder()
\n+- disk_buffer_holder()
\n+- ~disk_buffer_holder()
\n+- data()
\n+- reset()
\n+- swap()
\n+- is_mutable()
\n+- bool()
\n
\n \n-- hasher256
\n-- operator=() hasher256()
\n-- update()
\n-- final()
\n-- reset()
\n+- disk_observer
\n+- on_disk()
\n
\n \n-- bitfield
\n-- bitfield()
\n-- assign()
\n-- get_bit() operator[]()
\n-- clear_bit() set_bit()
\n-- all_set()
\n-- none_set()
\n-- size()
\n-- num_words()
\n-- num_bytes()
\n-- empty()
\n-- data()
\n-- swap()
\n-- count()
\n-- find_first_set()
\n-- find_last_clear()
\n+- open_file_state
\n+- disk_interface
\n+- new_torrent()
\n+- remove_torrent()
\n+- async_read() async_write()
\n+- async_hash()
\n+- async_hash2()
\n+- async_move_storage()
\n+- async_release_files()
\n+- async_check_files()
\n+- async_stop_torrent()
\n+- async_rename_file()
\n+- async_delete_files()
\n+- async_set_file_priority()
\n+- async_clear_piece()
\n+- update_stats_counters()
\n+- get_status()
\n+- abort()
\n+- submit_jobs()
\n+- settings_updated()
\n
\n \n-- counters
\n-- operator[]() inc_stats_counter()
\n+- storage_holder
\n+- file_open_mode_t
\n+- settings_pack
\n+- set_str() set_int() set_bool()
\n+- has_val()
\n+- clear()
\n+- clear()
\n+- get_bool() get_str() get_int()
\n+- enum type_bases
\n+- enum mmap_write_mode_t
\n+- enum suggest_mode_t
\n+- enum choking_algorithm_t
\n+- enum seed_choking_algorithm_t
\n+- enum io_buffer_mode_t
\n+- enum bandwidth_mixed_algo_t
\n+- enum enc_policy
\n+- enum enc_level
\n+- enum proxy_type_t
\n
\n \n-- stats_metric
\n-- session_stats_metrics()
\n-- find_metric_idx()
\n-- enum metric_type_t
\n-- create_torrent
\n-- create_torrent()
\n-- generate() generate_buf()
\n-- files()
\n-- set_comment()
\n-- set_creator()
\n-- set_creation_date()
\n-- set_hash()
\n-- set_hash2()
\n-- add_http_seed() add_url_seed()
\n-- add_node()
\n-- add_tracker()
\n-- set_root_cert()
\n-- set_priv() priv()
\n-- num_pieces()
\n-- piece_range()
\n-- file_range()
\n-- file_piece_range()
\n-- total_size()
\n-- piece_size() piece_length()
\n-- add_similar_torrent() add_collection()
\n+- name_for_setting() setting_by_name()
\n+- default_settings()
\n+- high_performance_seed() min_memory_usage()
\n+- generate_fingerprint()
\n+- bdecode_node
\n+- bdecode_node()
\n+- bdecode_node() operator=()
\n+- type()
\n+- bool()
\n+- non_owning()
\n+- data_offset() data_section()
\n+- list_at() list_string_value_at() list_size() list_int_value_at()
\n+- dict_size() dict_find_dict() dict_at() dict_find_int() dict_find() dict_find_list() dict_find_int_value() dict_find_string() dict_at_node() dict_find_string_value()
\n+- int_value()
\n+- string_length() string_ptr() string_offset() string_value()
\n+- clear()
\n+- swap()
\n+- reserve()
\n+- switch_underlying_buffer()
\n+- has_soft_error()
\n+- enum type_t
\n
\n \n-- add_files()
\n-- set_piece_hashes()
\n-- web_seed_entry
\n-- operator==()
\n-- operator<()
\n-- enum type_t
\n+- print_entry()
\n+- bdecode()
\n+- session_proxy\n
\n-- load_torrent_limits
\n-- torrent_info
\n-- torrent_info()
\n-- ~torrent_info()
\n-- orig_files() files()
\n-- rename_file()
\n-- remap_files()
\n-- add_tracker() trackers() clear_trackers()
\n-- collections() similar_torrents()
\n-- set_web_seeds() web_seeds() add_http_seed() add_url_seed()
\n-- total_size()
\n-- piece_length() num_pieces()
\n-- blocks_per_piece()
\n-- last_piece() end_piece() piece_range()
\n-- info_hash() info_hashes()
\n-- v1() v2()
\n-- num_files()
\n-- map_block()
\n-- map_file()
\n-- ssl_cert()
\n-- is_valid()
\n-- priv()
\n-- is_i2p()
\n-- piece_size()
\n-- hash_for_piece() hash_for_piece_ptr()
\n-- name()
\n-- creation_date()
\n-- creator()
\n-- comment()
\n-- nodes()
\n-- add_node()
\n-- parse_info_section()
\n-- info()
\n-- info_section()
\n-- piece_layer()
\n-- free_piece_layers()
\n+- session
\n+- session()
\n+- session()
\n+- ~session()
\n+- abort()
\n
\n \n-- entry
\n-- type()
\n-- entry()
\n-- entry()
\n-- entry()
\n-- operator=()
\n-- string() integer() list() preformatted() dict()
\n-- swap()
\n-- operator[]()
\n-- find_key()
\n-- to_string()
\n-- enum data_type
\n+- session_params
\n+- session_params()
\n+- session_params()
\n
\n \n-- bencode()
\n-- operator<<()
\n-- dht_routing_bucket
\n-- torrent_alert
\n-- message()
\n+- session_handle
\n+- is_valid()
\n+- session_state()
\n+- refresh_torrent_status() get_torrent_status()
\n+- post_torrent_updates()
\n+- post_session_stats()
\n+- post_dht_stats()
\n+- set_dht_state()
\n+- get_torrents() find_torrent()
\n+- async_add_torrent() add_torrent()
\n+- is_paused() resume() pause()
\n+- is_dht_running()
\n+- set_dht_storage()
\n+- add_dht_node()
\n+- dht_get_item()
\n+- dht_get_item()
\n+- dht_put_item()
\n+- dht_put_item()
\n+- dht_get_peers() dht_announce()
\n+- dht_live_nodes()
\n+- dht_sample_infohashes()
\n+- dht_direct_request()
\n+- add_extension()
\n+- set_ip_filter() get_ip_filter()
\n+- set_port_filter()
\n+- is_listening() listen_port() ssl_listen_port()
\n+- set_peer_class_filter() get_peer_class_filter()
\n+- set_peer_class_type_filter() get_peer_class_type_filter()
\n+- create_peer_class()
\n+- delete_peer_class()
\n+- get_peer_class() set_peer_class()
\n+- remove_torrent()
\n+- get_settings() apply_settings()
\n+- pop_alerts() set_alert_notify() wait_for_alert()
\n+- add_port_mapping() delete_port_mapping()
\n+- reopen_network_sockets()
\n+- native_handle()
\n
\n \n-- peer_alert
\n-- tracker_alert
\n-- tracker_url()
\n+- read_session_params() write_session_params_buf() write_session_params()
\n+- peer_info
\n+- i2p_destination()
\n
\n \n-- torrent_removed_alert
\n-- read_piece_alert
\n-- file_completed_alert
\n-- file_renamed_alert
\n-- new_name() old_name()
\n+- info_hash_t
\n+- info_hash_t()
\n+- has_v2() has() has_v1()
\n+- get()
\n+- get_best()
\n+- for_each()
\n
\n \n-- file_rename_failed_alert
\n-- performance_alert
\n-- enum performance_warning_t
\n+- peer_request
\n+- operator==()
\n
\n \n-- state_changed_alert
\n-- tracker_error_alert
\n-- failure_reason()
\n+- piece_block
\n+- truncate_files()
\n+- load_torrent_parsed() load_torrent_file() load_torrent_buffer()
\n+- torrent_peer_equal()
\n+- make_magnet_uri()
\n+- parse_magnet_uri()
\n+- version()
\n+- enum protocol_version
\n+- enum connection_type
\n+- enum socket_type_t
\n+- enum event_t
\n+- enum portmap_transport
\n+- enum portmap_protocol
\n+- pex_flags_t
\n+- torrent_flags_t
\n+- int
\n+- download_priority_t
\n+- char const*
\n+- std::uint64_t
\n+- hasher
\n+- hasher() operator=()
\n+- update()
\n+- final()
\n+- reset()
\n
\n \n-- tracker_warning_alert
\n-- warning_message()
\n+- hasher256
\n+- operator=() hasher256()
\n+- update()
\n+- final()
\n+- reset()
\n
\n \n-- scrape_reply_alert
\n-- scrape_failed_alert
\n-- error_message()
\n+- bitfield
\n+- bitfield()
\n+- assign()
\n+- get_bit() operator[]()
\n+- set_bit() clear_bit()
\n+- all_set()
\n+- none_set()
\n+- size()
\n+- num_words()
\n+- num_bytes()
\n+- empty()
\n+- data()
\n+- swap()
\n+- count()
\n+- find_first_set()
\n+- find_last_clear()
\n
\n \n-- tracker_reply_alert
\n-- dht_reply_alert
\n-- tracker_announce_alert
\n-- hash_failed_alert
\n-- peer_ban_alert
\n-- peer_unsnubbed_alert
\n-- peer_snubbed_alert
\n-- peer_error_alert
\n-- peer_connect_alert
\n-- enum direction_t
\n+- storage_error\n
\n-- peer_disconnected_alert
\n-- invalid_request_alert
\n-- torrent_finished_alert
\n-- piece_finished_alert
\n-- request_dropped_alert
\n-- block_timeout_alert
\n-- block_finished_alert
\n-- block_downloading_alert
\n-- unwanted_block_alert
\n-- storage_moved_alert
\n-- storage_path() old_path()
\n+- bdecode_category()
\n+- gzip_category()
\n+- libtorrent_category()
\n+- http_category()
\n+- socks_category()
\n+- upnp_category()
\n+- i2p_category()
\n+- pcp_category()
\n+- enum error_code_enum
\n+- enum error_code_enum
\n+- enum error_code_enum
\n+- enum http_errors
\n+- enum socks_error_code
\n+- enum error_code_enum
\n+- enum i2p_error_code
\n+- enum pcp_errors
\n+- file_slice
\n+- file_storage
\n+- is_valid()
\n+- reserve()
\n+- add_file() add_file_borrow()
\n+- rename_file()
\n+- map_block()
\n+- map_file()
\n+- num_files()
\n+- end_file()
\n+- file_range()
\n+- total_size()
\n+- num_pieces() set_num_pieces()
\n+- end_piece()
\n+- last_piece()
\n+- piece_range()
\n+- piece_length() set_piece_length()
\n+- piece_size()
\n+- piece_size2()
\n+- blocks_in_piece2()
\n+- blocks_per_piece()
\n+- name() set_name()
\n+- swap()
\n+- canonicalize()
\n+- pad_file_at() mtime() file_name() file_offset() hash() symlink() file_path() file_size() root() root_ptr()
\n+- file_num_pieces() file_num_blocks() file_piece_range()
\n+- file_first_block_node() file_first_piece_node()
\n+- file_path_hash()
\n+- all_path_hashes()
\n+- file_flags()
\n+- file_absolute_path()
\n+- file_index_at_offset() file_index_at_piece()
\n+- file_index_for_root()
\n+- piece_index_at_file()
\n+- sanitize_symlinks()
\n+- v2()
\n
\n \n-- storage_moved_failed_alert
\n-- file_path()
\n+- storage_params
\n+- posix_disk_io_constructor()
\n+- default_disk_io_constructor()
\n+- mmap_disk_io_constructor()
\n+- disabled_disk_io_constructor()
\n+- enum storage_mode_t
\n+- enum status_t
\n+- enum move_flags_t
\n+- web_seed_entry
\n+- operator==()
\n+- operator<()
\n+- enum type_t
\n
\n \n-- torrent_deleted_alert
\n-- torrent_delete_failed_alert
\n-- save_resume_data_alert
\n-- save_resume_data_failed_alert
\n-- torrent_paused_alert
\n-- torrent_resumed_alert
\n-- torrent_checked_alert
\n-- url_seed_alert
\n-- server_url()
\n-- error_message()
\n+- load_torrent_limits
\n+- torrent_info
\n+- torrent_info()
\n+- ~torrent_info()
\n+- orig_files() files()
\n+- rename_file()
\n+- remap_files()
\n+- add_tracker() clear_trackers() trackers()
\n+- similar_torrents() collections()
\n+- add_url_seed() set_web_seeds() web_seeds() add_http_seed()
\n+- total_size()
\n+- piece_length() num_pieces()
\n+- blocks_per_piece()
\n+- end_piece() piece_range() last_piece()
\n+- info_hashes() info_hash()
\n+- v2() v1()
\n+- num_files()
\n+- map_block()
\n+- map_file()
\n+- ssl_cert()
\n+- is_valid()
\n+- priv()
\n+- is_i2p()
\n+- piece_size()
\n+- hash_for_piece() hash_for_piece_ptr()
\n+- name()
\n+- creation_date()
\n+- creator()
\n+- comment()
\n+- nodes()
\n+- add_node()
\n+- parse_info_section()
\n+- info()
\n+- info_section()
\n+- piece_layer()
\n+- free_piece_layers()
\n
\n \n-- file_error_alert
\n-- filename()
\n+- announce_infohash
\n+- announce_endpoint
\n+- announce_entry\n
\n-- metadata_failed_alert
\n-- metadata_received_alert
\n-- udp_error_alert
\n-- external_ip_alert
\n-- listen_failed_alert
\n-- listen_interface()
\n+- a word of caution
\n+- plugin-interface
\n+- custom alerts
\n+- plugin\n
\n-- listen_succeeded_alert
\n-- portmap_error_alert
\n-- portmap_alert
\n-- portmap_log_alert
\n-- log_message()
\n+- torrent_plugin\n
\n-- fastresume_rejected_alert
\n-- file_path()
\n+- peer_plugin
\n+- type()
\n+- add_handshake()
\n+- on_disconnect()
\n+- on_connected()
\n+- on_handshake()
\n+- on_extension_handshake()
\n+- on_bitfield() on_request() on_have_all() on_choke() on_interested() on_dont_have() on_have_none() on_allowed_fast() on_have() on_not_interested() on_unchoke()
\n+- on_piece()
\n+- sent_unchoke() sent_have() sent_interested() sent_not_interested() sent_piece()
\n+- sent_payload()
\n+- can_disconnect()
\n+- on_extended()
\n+- on_unknown_message()
\n+- on_piece_pass() on_piece_failed()
\n+- tick()
\n+- write_request()
\n
\n \n-- peer_blocked_alert
\n-- enum reason_t
\n+- crypto_plugin
\n+- decrypt()
\n
\n \n-- dht_announce_alert
\n-- dht_get_peers_alert
\n-- cache_flushed_alert
\n-- lsd_peer_alert
\n-- trackerid_alert
\n-- tracker_id()
\n+- peer_connection_handle
\n+- bt_peer_connection_handle
\n+- create_ut_pex_plugin()
\n+- create_smart_ban_plugin()
\n+- create_ut_metadata_plugin()
\n+- create_torrent
\n+- create_torrent()
\n+- generate() generate_buf()
\n+- files()
\n+- set_comment()
\n+- set_creator()
\n+- set_creation_date()
\n+- set_hash()
\n+- set_hash2()
\n+- add_url_seed() add_http_seed()
\n+- add_node()
\n+- add_tracker()
\n+- set_root_cert()
\n+- priv() set_priv()
\n+- num_pieces()
\n+- piece_range()
\n+- file_range()
\n+- file_piece_range()
\n+- total_size()
\n+- piece_length() piece_size()
\n+- add_similar_torrent() add_collection()
\n
\n \n-- dht_bootstrap_alert
\n-- torrent_error_alert
\n-- filename()
\n+- add_files()
\n+- set_piece_hashes()
\n+- entry
\n+- type()
\n+- entry()
\n+- entry()
\n+- entry()
\n+- operator=()
\n+- dict() preformatted() integer() string() list()
\n+- swap()
\n+- operator[]()
\n+- find_key()
\n+- to_string()
\n+- enum data_type
\n
\n \n-- torrent_need_cert_alert
\n-- incoming_connection_alert
\n-- add_torrent_alert
\n-- state_update_alert
\n-- session_stats_alert
\n-- counters()
\n+- bencode()
\n+- operator<<()
\n+- peer_class_type_filter\n
\n-- dht_error_alert
\n-- dht_immutable_item_alert
\n-- dht_mutable_item_alert
\n-- dht_put_alert
\n-- i2p_alert
\n-- dht_outgoing_get_peers_alert
\n-- log_alert
\n-- log_message()
\n+- peer_class_info
\n+- dht_routing_bucket
\n+- torrent_alert
\n+- message()
\n
\n \n-- torrent_log_alert
\n-- log_message()
\n+- peer_alert
\n+- tracker_alert
\n+- tracker_url()
\n
\n \n-- peer_log_alert
\n-- log_message()
\n-- enum direction_t
\n+- torrent_removed_alert
\n+- read_piece_alert
\n+- file_completed_alert
\n+- file_renamed_alert\n
\n-- lsd_error_alert
\n-- dht_lookup
\n-- dht_stats_alert
\n-- incoming_request_alert
\n-- dht_log_alert
\n-- log_message()
\n-- enum dht_module_t
\n+- file_rename_failed_alert
\n+- performance_alert\n
\n-- dht_pkt_alert
\n-- pkt_buf()
\n-- enum direction_t
\n+- state_changed_alert
\n+- tracker_error_alert
\n+- failure_reason()
\n
\n \n-- dht_get_peers_reply_alert
\n-- dht_direct_response_alert
\n-- picker_log_alert
\n-- session_error_alert
\n-- dht_live_nodes_alert
\n-- num_nodes() nodes()
\n+- tracker_warning_alert
\n+- warning_message()
\n
\n \n-- session_stats_header_alert
\n-- dht_sample_infohashes_alert
\n-- num_samples() samples()
\n-- num_nodes()
\n-- nodes()
\n+- scrape_reply_alert
\n+- scrape_failed_alert
\n+- error_message()
\n
\n \n-- block_uploaded_alert
\n-- alerts_dropped_alert
\n-- socks5_alert
\n-- file_prio_alert
\n-- oversized_file_alert
\n-- torrent_conflict_alert
\n-- peer_info_alert
\n-- file_progress_alert
\n-- piece_info_alert
\n-- piece_availability_alert
\n-- tracker_list_alert
\n-- alert
\n-- timestamp()
\n-- type()
\n-- what()
\n-- message()
\n-- category()
\n+- tracker_reply_alert
\n+- dht_reply_alert
\n+- tracker_announce_alert
\n+- hash_failed_alert
\n+- peer_ban_alert
\n+- peer_unsnubbed_alert
\n+- peer_snubbed_alert
\n+- peer_error_alert
\n+- peer_connect_alert
\n+- enum direction_t
\n
\n \n-- operation_name()
\n-- alert_cast()
\n-- enum operation_t
\n-- int
\n-- alert_category_t
\n-- torrent_status
\n-- operator==()
\n-- enum state_t
\n+- peer_disconnected_alert
\n+- invalid_request_alert
\n+- torrent_finished_alert
\n+- piece_finished_alert
\n+- request_dropped_alert
\n+- block_timeout_alert
\n+- block_finished_alert
\n+- block_downloading_alert
\n+- unwanted_block_alert
\n+- storage_moved_alert\n
\n-- session_proxy
\n-- operator=() ~session_proxy() session_proxy()
\n+- storage_moved_failed_alert
\n+- file_path()
\n
\n \n-- session
\n-- session()
\n-- session()
\n-- ~session()
\n-- abort()
\n+- torrent_deleted_alert
\n+- torrent_delete_failed_alert
\n+- save_resume_data_alert
\n+- save_resume_data_failed_alert
\n+- torrent_paused_alert
\n+- torrent_resumed_alert
\n+- torrent_checked_alert
\n+- url_seed_alert
\n+- server_url()
\n+- error_message()
\n
\n \n-- session_handle
\n-- is_valid()
\n-- session_state()
\n-- refresh_torrent_status() get_torrent_status()
\n-- post_torrent_updates()
\n-- post_session_stats()
\n-- post_dht_stats()
\n-- set_dht_state()
\n-- find_torrent() get_torrents()
\n-- add_torrent() async_add_torrent()
\n-- pause() is_paused() resume()
\n-- is_dht_running()
\n-- set_dht_storage()
\n-- add_dht_node()
\n-- dht_get_item()
\n-- dht_get_item()
\n-- dht_put_item()
\n-- dht_put_item()
\n-- dht_get_peers() dht_announce()
\n-- dht_live_nodes()
\n-- dht_sample_infohashes()
\n-- dht_direct_request()
\n-- add_extension()
\n-- set_ip_filter() get_ip_filter()
\n-- set_port_filter()
\n-- listen_port() is_listening() ssl_listen_port()
\n-- set_peer_class_filter() get_peer_class_filter()
\n-- get_peer_class_type_filter() set_peer_class_type_filter()
\n-- create_peer_class()
\n-- delete_peer_class()
\n-- get_peer_class() set_peer_class()
\n-- remove_torrent()
\n-- get_settings() apply_settings()
\n-- wait_for_alert() set_alert_notify() pop_alerts()
\n-- delete_port_mapping() add_port_mapping()
\n-- reopen_network_sockets()
\n-- native_handle()
\n+- file_error_alert
\n+- filename()
\n
\n \n-- session_params
\n-- session_params()
\n-- session_params()
\n+- metadata_failed_alert
\n+- metadata_received_alert
\n+- udp_error_alert
\n+- external_ip_alert
\n+- listen_failed_alert
\n+- listen_interface()
\n
\n \n-- write_session_params_buf() write_session_params() read_session_params()
\n-- disk_observer
\n-- on_disk()
\n+- listen_succeeded_alert
\n+- portmap_error_alert
\n+- portmap_alert
\n+- portmap_log_alert
\n+- log_message()
\n
\n \n-- buffer_allocator_interface
\n-- disk_buffer_holder
\n-- disk_buffer_holder()
\n-- disk_buffer_holder()
\n-- ~disk_buffer_holder()
\n-- data()
\n-- reset()
\n-- swap()
\n-- is_mutable()
\n-- bool()
\n+- fastresume_rejected_alert
\n+- file_path()
\n
\n \n-- settings_interface
\n-- open_file_state
\n-- disk_interface
\n-- new_torrent()
\n-- remove_torrent()
\n-- async_write() async_read()
\n-- async_hash()
\n-- async_hash2()
\n-- async_move_storage()
\n-- async_release_files()
\n-- async_check_files()
\n-- async_stop_torrent()
\n-- async_rename_file()
\n-- async_delete_files()
\n-- async_set_file_priority()
\n-- async_clear_piece()
\n-- update_stats_counters()
\n-- get_status()
\n-- abort()
\n-- submit_jobs()
\n-- settings_updated()
\n+- peer_blocked_alert
\n+- enum reason_t
\n
\n \n-- storage_holder
\n-- file_open_mode_t
\n-- add_torrent_params
\n-- client_data_t
\n-- client_data_t()
\n-- operator=() void*() const*()
\n+- dht_announce_alert
\n+- dht_get_peers_alert
\n+- cache_flushed_alert
\n+- lsd_peer_alert
\n+- trackerid_alert
\n+- tracker_id()
\n
\n \n-- file_slice
\n-- file_storage
\n-- is_valid()
\n-- reserve()
\n-- add_file_borrow() add_file()
\n-- rename_file()
\n-- map_block()
\n-- map_file()
\n-- num_files()
\n-- end_file()
\n-- file_range()
\n-- total_size()
\n-- set_num_pieces() num_pieces()
\n-- end_piece()
\n-- last_piece()
\n-- piece_range()
\n-- piece_length() set_piece_length()
\n-- piece_size()
\n-- piece_size2()
\n-- blocks_in_piece2()
\n-- blocks_per_piece()
\n-- name() set_name()
\n-- swap()
\n-- canonicalize()
\n-- hash() root() file_path() file_name() pad_file_at() file_offset() mtime() symlink() root_ptr() file_size()
\n-- file_num_pieces() file_piece_range() file_num_blocks()
\n-- file_first_block_node() file_first_piece_node()
\n-- file_path_hash()
\n-- all_path_hashes()
\n-- file_flags()
\n-- file_absolute_path()
\n-- file_index_at_piece() file_index_at_offset()
\n-- file_index_for_root()
\n-- piece_index_at_file()
\n-- sanitize_symlinks()
\n-- v2()
\n+- dht_bootstrap_alert
\n+- torrent_error_alert
\n+- filename()
\n
\n \n-- storage_params
\n-- mmap_disk_io_constructor()
\n-- default_disk_io_constructor()
\n-- disabled_disk_io_constructor()
\n-- posix_disk_io_constructor()
\n-- enum storage_mode_t
\n-- enum status_t
\n-- enum move_flags_t
\n-- peer_request
\n-- operator==()
\n+- torrent_need_cert_alert
\n+- incoming_connection_alert
\n+- add_torrent_alert
\n+- state_update_alert
\n+- session_stats_alert
\n+- counters()
\n
\n \n-- peer_info
\n-- i2p_destination()
\n+- dht_error_alert
\n+- dht_immutable_item_alert
\n+- dht_mutable_item_alert
\n+- dht_put_alert
\n+- i2p_alert
\n+- dht_outgoing_get_peers_alert
\n+- log_alert
\n+- log_message()
\n
\n \n-- info_hash_t
\n-- info_hash_t()
\n-- has() has_v2() has_v1()
\n-- get()
\n-- get_best()
\n-- for_each()
\n+- torrent_log_alert
\n+- log_message()
\n
\n \n-- piece_block
\n-- truncate_files()
\n-- make_magnet_uri()
\n-- parse_magnet_uri()
\n-- load_torrent_file() load_torrent_parsed() load_torrent_buffer()
\n-- torrent_peer_equal()
\n-- version()
\n-- enum socket_type_t
\n-- enum portmap_transport
\n-- enum portmap_protocol
\n-- enum protocol_version
\n-- enum event_t
\n-- enum connection_type
\n-- torrent_flags_t
\n-- int
\n-- download_priority_t
\n-- pex_flags_t
\n-- char const*
\n-- std::uint64_t
\n-- a word of caution
\n-- plugin-interface
\n-- custom alerts
\n-- peer_connection_handle
\n-- bt_peer_connection_handle
\n-- plugin
\n-- implemented_features()
\n-- new_torrent()
\n-- added()
\n-- abort()
\n-- on_dht_request()
\n-- on_alert()
\n-- on_unknown_torrent()
\n-- on_tick()
\n-- get_unchoke_priority()
\n-- load_state()
\n+- peer_log_alert
\n+- log_message()
\n+- enum direction_t
\n
\n \n-- torrent_plugin
\n-- new_connection()
\n-- on_piece_failed() on_piece_pass()
\n-- tick()
\n-- on_pause() on_resume()
\n-- on_files_checked()
\n-- on_state()
\n-- on_add_peer()
\n+- lsd_error_alert
\n+- dht_lookup
\n+- dht_stats_alert
\n+- incoming_request_alert
\n+- dht_log_alert
\n+- log_message()
\n+- enum dht_module_t
\n
\n \n-- peer_plugin
\n-- type()
\n-- add_handshake()
\n-- on_disconnect()
\n-- on_connected()
\n-- on_handshake()
\n-- on_extension_handshake()
\n-- on_request() on_interested() on_allowed_fast() on_have_all() on_choke() on_unchoke() on_have_none() on_have() on_bitfield() on_dont_have() on_not_interested()
\n-- on_piece()
\n-- sent_interested() sent_unchoke() sent_not_interested() sent_piece() sent_have()
\n-- sent_payload()
\n-- can_disconnect()
\n-- on_extended()
\n-- on_unknown_message()
\n-- on_piece_failed() on_piece_pass()
\n-- tick()
\n-- write_request()
\n+- dht_pkt_alert
\n+- pkt_buf()
\n+- enum direction_t
\n
\n \n-- crypto_plugin
\n-- decrypt()
\n+- dht_get_peers_reply_alert
\n+- dht_direct_response_alert
\n+- picker_log_alert
\n+- session_error_alert
\n+- dht_live_nodes_alert
\n+- num_nodes() nodes()
\n
\n \n-- create_ut_pex_plugin()
\n-- create_ut_metadata_plugin()
\n-- create_smart_ban_plugin()
\n-- announce_infohash
\n-- announce_endpoint
\n-- announce_entry
\n-- announce_entry() ~announce_entry() operator=()
\n-- enum tracker_source
\n+- session_stats_header_alert
\n+- dht_sample_infohashes_alert
\n+- samples() num_samples()
\n+- num_nodes()
\n+- nodes()
\n
\n \n-- settings_pack
\n-- set_str() set_int() set_bool()
\n-- has_val()
\n-- clear()
\n-- clear()
\n-- get_bool() get_str() get_int()
\n-- enum type_bases
\n-- enum mmap_write_mode_t
\n-- enum suggest_mode_t
\n-- enum choking_algorithm_t
\n-- enum seed_choking_algorithm_t
\n-- enum io_buffer_mode_t
\n-- enum bandwidth_mixed_algo_t
\n-- enum enc_policy
\n-- enum enc_level
\n-- enum proxy_type_t
\n+- block_uploaded_alert
\n+- alerts_dropped_alert
\n+- socks5_alert
\n+- file_prio_alert
\n+- oversized_file_alert
\n+- torrent_conflict_alert
\n+- peer_info_alert
\n+- file_progress_alert
\n+- piece_info_alert
\n+- piece_availability_alert
\n+- tracker_list_alert
\n+- alert
\n+- timestamp()
\n+- type()
\n+- what()
\n+- message()
\n+- category()
\n
\n \n-- min_memory_usage() high_performance_seed()
\n-- setting_by_name() name_for_setting()
\n-- default_settings()
\n-- generate_fingerprint()
\n-- ip_filter
\n-- empty()
\n-- add_rule()
\n-- access()
\n-- export_filter()
\n-- enum access_flags
\n+- operation_name()
\n+- alert_cast()
\n+- enum operation_t
\n+- int
\n+- alert_category_t
\n+- block_info\n
\n-- port_filter
\n-- add_rule()
\n-- access()
\n-- enum access_flags
\n+- partial_piece_info
\n+- torrent_handle
\n+- torrent_handle()
\n+- add_piece()
\n+- read_piece()
\n+- have_piece()
\n+- get_peer_info() post_peer_info()
\n+- status() post_status()
\n+- post_download_queue() get_download_queue()
\n+- clear_piece_deadlines() set_piece_deadline() reset_piece_deadline()
\n+- post_file_progress() file_progress()
\n+- file_status()
\n+- clear_error()
\n+- post_trackers() replace_trackers() trackers() add_tracker()
\n+- remove_url_seed() add_url_seed() url_seeds()
\n+- add_http_seed() remove_http_seed() http_seeds()
\n+- add_extension()
\n+- set_metadata()
\n+- is_valid()
\n+- resume() pause()
\n+- unset_flags() set_flags() flags()
\n+- flush_cache()
\n+- force_recheck()
\n+- save_resume_data()
\n+- need_save_resume_data()
\n+- queue_position_top() queue_position_down() queue_position_bottom() queue_position() queue_position_up()
\n+- queue_position_set()
\n+- set_ssl_certificate_buffer() set_ssl_certificate()
\n+- torrent_file_with_hashes() torrent_file()
\n+- piece_layers()
\n+- piece_availability() post_piece_availability()
\n+- get_piece_priorities() prioritize_pieces() piece_priority()
\n+- file_priority() get_file_priorities() prioritize_files()
\n+- force_reannounce() force_dht_announce() force_lsd_announce()
\n+- scrape_tracker()
\n+- set_upload_limit() upload_limit() set_download_limit() download_limit()
\n+- connect_peer()
\n+- clear_peers()
\n+- set_max_uploads() max_uploads()
\n+- max_connections() set_max_connections()
\n+- move_storage()
\n+- rename_file()
\n+- info_hashes() info_hash()
\n+- operator==() operator<() operator!=()
\n+- id()
\n+- native_handle()
\n+- userdata()
\n+- in_session()
\n
\n \n-- peer_class_type_filter
\n-- remove() add()
\n-- disallow() allow()
\n-- apply()
\n-- enum socket_type_t
\n+- hash_value()
\n+- torrent_status
\n+- operator==()
\n+- enum state_t
\n
\n \n-- peer_class_info
\n-- block_info
\n-- set_peer() peer()
\n-- enum block_state_t
\n+- ip_filter
\n+- empty()
\n+- add_rule()
\n+- access()
\n+- export_filter()
\n+- enum access_flags
\n
\n \n-- partial_piece_info
\n-- torrent_handle
\n-- torrent_handle()
\n-- add_piece()
\n-- read_piece()
\n-- have_piece()
\n-- post_peer_info() get_peer_info()
\n-- post_status() status()
\n-- post_download_queue() get_download_queue()
\n-- reset_piece_deadline() set_piece_deadline() clear_piece_deadlines()
\n-- file_progress() post_file_progress()
\n-- file_status()
\n-- clear_error()
\n-- add_tracker() trackers() replace_trackers() post_trackers()
\n-- url_seeds() remove_url_seed() add_url_seed()
\n-- add_http_seed() http_seeds() remove_http_seed()
\n-- add_extension()
\n-- set_metadata()
\n-- is_valid()
\n-- pause() resume()
\n-- flags() set_flags() unset_flags()
\n-- flush_cache()
\n-- force_recheck()
\n-- save_resume_data()
\n-- need_save_resume_data()
\n-- queue_position_bottom() queue_position() queue_position_up() queue_position_top() queue_position_down()
\n-- queue_position_set()
\n-- set_ssl_certificate_buffer() set_ssl_certificate()
\n-- torrent_file_with_hashes() torrent_file()
\n-- piece_layers()
\n-- piece_availability() post_piece_availability()
\n-- get_piece_priorities() piece_priority() prioritize_pieces()
\n-- file_priority() get_file_priorities() prioritize_files()
\n-- force_reannounce() force_lsd_announce() force_dht_announce()
\n-- scrape_tracker()
\n-- download_limit() upload_limit() set_download_limit() set_upload_limit()
\n-- connect_peer()
\n-- clear_peers()
\n-- set_max_uploads() max_uploads()
\n-- max_connections() set_max_connections()
\n-- move_storage()
\n-- rename_file()
\n-- info_hash() info_hashes()
\n-- operator==() operator!=() operator<()
\n-- id()
\n-- native_handle()
\n-- userdata()
\n-- in_session()
\n+- port_filter
\n+- add_rule()
\n+- access()
\n+- enum access_flags
\n
\n \n-- hash_value()
\n-- bdecode_node
\n-- bdecode_node()
\n-- operator=() bdecode_node()
\n-- type()
\n-- bool()
\n-- non_owning()
\n-- data_section() data_offset()
\n-- list_int_value_at() list_string_value_at() list_size() list_at()
\n-- dict_size() dict_find_int() dict_find_list() dict_at() dict_find_dict() dict_find_int_value() dict_find_string() dict_find() dict_find_string_value() dict_at_node()
\n-- int_value()
\n-- string_ptr() string_offset() string_value() string_length()
\n-- clear()
\n-- swap()
\n-- reserve()
\n-- switch_underlying_buffer()
\n-- has_soft_error()
\n-- enum type_t
\n+- add_torrent_params
\n+- client_data_t\n
\n-- print_entry()
\n-- bdecode()
\n-- dht_state
\n-- dht_storage_counters
\n-- reset()
\n+- dht_storage_counters
\n+- reset()
\n
\n \n-- dht_storage_interface
\n-- update_node_ids()
\n-- get_peers()
\n-- announce_peer()
\n-- get_immutable_item()
\n-- put_immutable_item()
\n-- get_mutable_item_seq()
\n-- get_mutable_item()
\n-- put_mutable_item()
\n-- get_infohashes_sample()
\n-- tick()
\n-- counters()
\n+- dht_storage_interface\n
\n+- dht_state
\n - dht_default_storage_constructor()
\n - sign_mutable_item()
\n - announce_flags_t
\n-- read_resume_data()
\n-- write_resume_data() write_resume_data_buf()
\n-- write_torrent_file() write_torrent_file_buf()
\n+- write_resume_data() write_resume_data_buf()
\n+- write_torrent_file() write_torrent_file_buf()
\n+- read_resume_data()
\n - write_torrent_flags_t
\n - ed25519_create_seed()
\n - ed25519_create_keypair()
\n - ed25519_sign()
\n - ed25519_verify()
\n - ed25519_add_scalar()
\n - ed25519_key_exchange()
\n
\n
\n-[report issue]\n-storage_error
\n-Declared in "libtorrent/error_code.hpp"
\n-used by storage to return errors\n-also includes which underlying file the\n-error happened on
\n+[report issue]\n+counters
\n+Declared in "libtorrent/performance_counters.hpp"
\n \n-struct storage_error\n+struct counters\n {\n- explicit operator bool () const;\n- void file (file_index_t f);\n- file_index_t file () const;\n+ counters () ;\n+ counters& operator= (counters const&) & ;\n+ counters (counters const&) ;\n+ std::int64_t inc_stats_counter (int c, std::int64_t value = 1) ;\n+ std::int64_t operator[] (int i) const ;\n+ void blend_stats_counter (int c, std::int64_t value, int ratio) ;\n+ void set_value (int c, std::int64_t value) ;\n+};\n+\n+\n+[report issue]\n+inc_stats_counter() operator[]()
\n+\n+std::int64_t inc_stats_counter (int c, std::int64_t value = 1) ;\n+std::int64_t operator[] (int i) const ;\n+
\n+returns the new value
\n+[report issue]\n+\n+\n+stats_metric
\n+Declared in "libtorrent/session_stats.hpp"
\n+describes one statistics metric from the session. For more information,\n+see the session statistics section.
\n+\n+struct stats_metric\n+{\n+ char const* name;\n+ int value_index;\n+ metric_type_t type;\n+};\n+\n+[report issue]\n+- name
\n+- the name of the counter or gauge
\n+
\n+\n+[report issue]\n+- value_index type
\n+- the index into the session stats array, where the underlying value of\n+this counter or gauge is found. The session stats array is part of the\n+session_stats_alert object.
\n+
\n+[report issue]\n+\n+session_stats_metrics()
\n+Declared in "libtorrent/session_stats.hpp"
\n+\n+std::vector<stats_metric> session_stats_metrics ();\n+
\n+This free function returns the list of available metrics exposed by\n+libtorrent's statistics API. Each metric has a name and a value index.\n+The value index is the index into the array in session_stats_alert where\n+this metric's value can be found when the session stats is sampled (by\n+calling post_session_stats()).
\n+[report issue]\n+\n+find_metric_idx()
\n+Declared in "libtorrent/session_stats.hpp"
\n+\n+int find_metric_idx (string_view name);\n+
\n+given a name of a metric, this function returns the counter index of it,\n+or -1 if it could not be found. The counter index is the index into the\n+values array returned by session_stats_alert.
\n+[report issue]\n+\n+enum metric_type_t
\n+Declared in "libtorrent/session_stats.hpp"
\n+\n+\n+ \n+\n+name \n+value \n+description \n+counter \n+0 \n+ \n+gauge \n+1 \n+ \n+
\n+The disk I/O can be customized in libtorrent. In previous versions, the\n+customization was at the level of each torrent. Now, the customization point\n+is at the session level. All torrents added to a session will use the same\n+disk I/O subsystem, as determined by the disk_io_constructor (in\n+session_params).
\n+This allows the disk subsystem to also customize threading and disk job\n+management.
\n+To customize the disk subsystem, implement disk_interface and provide a\n+factory function to the session constructor (via session_params).
\n+Example use:
\n+\n+struct temp_storage\n+{\n+ explicit temp_storage(lt::file_storage const& fs) : m_files(fs) {}\n \n- error_code ec;\n- operation_t operation;\n+ lt::span<char const> readv(lt::peer_request const r, lt::storage_error& ec) const\n+ {\n+ auto const i = m_file_data.find(r.piece);\n+ if (i == m_file_data.end())\n+ {\n+ ec.operation = lt::operation_t::file_read;\n+ ec.ec = boost::asio::error::eof;\n+ return {};\n+ }\n+ if (int(i->second.size()) <= r.start)\n+ {\n+ ec.operation = lt::operation_t::file_read;\n+ ec.ec = boost::asio::error::eof;\n+ return {};\n+ }\n+ return { i->second.data() + r.start, std::min(r.length, int(i->second.size()) - r.start) };\n+ }\n+ void writev(lt::span<char const> const b, lt::piece_index_t const piece, int const offset)\n+ {\n+ auto& data = m_file_data[piece];\n+ if (data.empty())\n+ {\n+ // allocate the whole piece, otherwise we'll invalidate the pointers\n+ // we have returned back to libtorrent\n+ int const size = piece_size(piece);\n+ data.resize(std::size_t(size));\n+ }\n+ TORRENT_ASSERT(offset + b.size() <= int(data.size()));\n+ std::memcpy(data.data() + offset, b.data(), std::size_t(b.size()));\n+ }\n+ lt::sha1_hash hash(lt::piece_index_t const piece\n+ , lt::span<lt::sha256_hash> const block_hashes, lt::storage_error& ec) const\n+ {\n+ auto const i = m_file_data.find(piece);\n+ if (i == m_file_data.end())\n+ {\n+ ec.operation = lt::operation_t::file_read;\n+ ec.ec = boost::asio::error::eof;\n+ return {};\n+ }\n+ if (!block_hashes.empty())\n+ {\n+ int const piece_size2 = m_files.piece_size2(piece);\n+ int const blocks_in_piece2 = m_files.blocks_in_piece2(piece);\n+ char const* buf = i->second.data();\n+ std::int64_t offset = 0;\n+ for (int k = 0; k < blocks_in_piece2; ++k)\n+ {\n+ lt::hasher256 h2;\n+ std::ptrdiff_t const len2 = std::min(lt::default_block_size, int(piece_size2 - offset));\n+ h2.update({ buf, len2 });\n+ buf += len2;\n+ offset += len2;\n+ block_hashes[k] = h2.final();\n+ }\n+ }\n+ return lt::hasher(i->second).final();\n+ }\n+ lt::sha256_hash hash2(lt::piece_index_t const piece, int const offset, lt::storage_error& ec)\n+ {\n+ auto const i = m_file_data.find(piece);\n+ if (i == m_file_data.end())\n+ {\n+ ec.operation = lt::operation_t::file_read;\n+ ec.ec = boost::asio::error::eof;\n+ return {};\n+ }\n+\n+ int const piece_size = m_files.piece_size2(piece);\n+\n+ std::ptrdiff_t const len = std::min(lt::default_block_size, piece_size - offset);\n+\n+ lt::span<char const> b = {i->second.data() + offset, len};\n+ return lt::hasher256(b).final();\n+ }\n+\n+private:\n+ int piece_size(lt::piece_index_t piece) const\n+ {\n+ int const num_pieces = static_cast<int>((m_files.total_size() + m_files.piece_length() - 1) / m_files.piece_length());\n+ return static_cast<int>(piece) < num_pieces - 1\n+ ? m_files.piece_length() : static_cast<int>(m_files.total_size() - std::int64_t(num_pieces - 1) * m_files.piece_length());\n+ }\n+\n+ lt::file_storage const& m_files;\n+ std::map<lt::piece_index_t, std::vector<char>> m_file_data;\n+};\n+\n+lt::storage_index_t pop(std::vector<lt::storage_index_t>& q)\n+{\n+ TORRENT_ASSERT(!q.empty());\n+ lt::storage_index_t const ret = q.back();\n+ q.pop_back();\n+ return ret;\n+}\n+\n+struct temp_disk_io final : lt::disk_interface\n+ , lt::buffer_allocator_interface\n+{\n+ explicit temp_disk_io(lt::io_context& ioc): m_ioc(ioc) {}\n+\n+ void settings_updated() override {}\n+\n+ lt::storage_holder new_torrent(lt::storage_params const& params\n+ , std::shared_ptr<void> const&) override\n+ {\n+ lt::storage_index_t const idx = m_free_slots.empty()\n+ ? m_torrents.end_index()\n+ : pop(m_free_slots);\n+ auto storage = std::make_unique<temp_storage>(params.files);\n+ if (idx == m_torrents.end_index()) m_torrents.emplace_back(std::move(storage));\n+ else m_torrents[idx] = std::move(storage);\n+ return lt::storage_holder(idx, *this);\n+ }\n+\n+ void remove_torrent(lt::storage_index_t const idx) override\n+ {\n+ m_torrents[idx].reset();\n+ m_free_slots.push_back(idx);\n+ }\n+\n+ void abort(bool) override {}\n+\n+ void async_read(lt::storage_index_t storage, lt::peer_request const& r\n+ , std::function<void(lt::disk_buffer_holder block, lt::storage_error const& se)> handler\n+ , lt::disk_job_flags_t) override\n+ {\n+ // this buffer is owned by the storage. It will remain valid for as\n+ // long as the torrent remains in the session. We don't need any lifetime\n+ // management of it.\n+ lt::storage_error error;\n+ lt::span<char const> b = m_torrents[storage]->readv(r, error);\n+\n+ post(m_ioc, [handler, error, b, this]\n+ { handler(lt::disk_buffer_holder(*this, const_cast<char*>(b.data()), int(b.size())), error); });\n+ }\n+\n+ bool async_write(lt::storage_index_t storage, lt::peer_request const& r\n+ , char const* buf, std::shared_ptr<lt::disk_observer>\n+ , std::function<void(lt::storage_error const&)> handler\n+ , lt::disk_job_flags_t) override\n+ {\n+ lt::span<char const> const b = { buf, r.length };\n+\n+ m_torrents[storage]->writev(b, r.piece, r.start);\n+\n+ post(m_ioc, [=]{ handler(lt::storage_error()); });\n+ return false;\n+ }\n+\n+ void async_hash(lt::storage_index_t storage, lt::piece_index_t const piece\n+ , lt::span<lt::sha256_hash> block_hashes, lt::disk_job_flags_t\n+ , std::function<void(lt::piece_index_t, lt::sha1_hash const&, lt::storage_error const&)> handler) override\n+ {\n+ lt::storage_error error;\n+ lt::sha1_hash const hash = m_torrents[storage]->hash(piece, block_hashes, error);\n+ post(m_ioc, [=]{ handler(piece, hash, error); });\n+ }\n+\n+ void async_hash2(lt::storage_index_t storage, lt::piece_index_t const piece\n+ , int const offset, lt::disk_job_flags_t\n+ , std::function<void(lt::piece_index_t, lt::sha256_hash const&, lt::storage_error const&)> handler) override\n+ {\n+ lt::storage_error error;\n+ lt::sha256_hash const hash = m_torrents[storage]->hash2(piece, offset, error);\n+ post(m_ioc, [=]{ handler(piece, hash, error); });\n+ }\n+\n+ void async_move_storage(lt::storage_index_t, std::string p, lt::move_flags_t\n+ , std::function<void(lt::status_t, std::string const&, lt::storage_error const&)> handler) override\n+ {\n+ post(m_ioc, [=]{\n+ handler(lt::status_t::fatal_disk_error, p\n+ , lt::storage_error(lt::error_code(boost::system::errc::operation_not_supported, lt::system_category())));\n+ });\n+ }\n+\n+ void async_release_files(lt::storage_index_t, std::function<void()>) override {}\n+\n+ void async_delete_files(lt::storage_index_t, lt::remove_flags_t\n+ , std::function<void(lt::storage_error const&)> handler) override\n+ {\n+ post(m_ioc, [=]{ handler(lt::storage_error()); });\n+ }\n+\n+ void async_check_files(lt::storage_index_t\n+ , lt::add_torrent_params const*\n+ , lt::aux::vector<std::string, lt::file_index_t>\n+ , std::function<void(lt::status_t, lt::storage_error const&)> handler) override\n+ {\n+ post(m_ioc, [=]{ handler(lt::status_t::no_error, lt::storage_error()); });\n+ }\n+\n+ void async_rename_file(lt::storage_index_t\n+ , lt::file_index_t const idx\n+ , std::string const name\n+ , std::function<void(std::string const&, lt::file_index_t, lt::storage_error const&)> handler) override\n+ {\n+ post(m_ioc, [=]{ handler(name, idx, lt::storage_error()); });\n+ }\n+\n+ void async_stop_torrent(lt::storage_index_t, std::function<void()> handler) override\n+ {\n+ post(m_ioc, handler);\n+ }\n+\n+ void async_set_file_priority(lt::storage_index_t\n+ , lt::aux::vector<lt::download_priority_t, lt::file_index_t> prio\n+ , std::function<void(lt::storage_error const&\n+ , lt::aux::vector<lt::download_priority_t, lt::file_index_t>)> handler) override\n+ {\n+ post(m_ioc, [=]{\n+ handler(lt::storage_error(lt::error_code(\n+ boost::system::errc::operation_not_supported, lt::system_category())), std::move(prio));\n+ });\n+ }\n+\n+ void async_clear_piece(lt::storage_index_t, lt::piece_index_t index\n+ , std::function<void(lt::piece_index_t)> handler) override\n+ {\n+ post(m_ioc, [=]{ handler(index); });\n+ }\n+\n+ // implements buffer_allocator_interface\n+ void free_disk_buffer(char*) override\n+ {\n+ // never free any buffer. We only return buffers owned by the storage\n+ // object\n+ }\n+\n+ void update_stats_counters(lt::counters&) const override {}\n+\n+ std::vector<lt::open_file_state> get_status(lt::storage_index_t) const override\n+ { return {}; }\n+\n+ void submit_jobs() override {}\n+\n+private:\n+\n+ lt::aux::vector<std::shared_ptr<temp_storage>, lt::storage_index_t> m_torrents;\n+\n+ // slots that are unused in the m_torrents vector\n+ std::vector<lt::storage_index_t> m_free_slots;\n+\n+ // callbacks are posted on this\n+ lt::io_context& m_ioc;\n+};\n+\n+std::unique_ptr<lt::disk_interface> temp_disk_constructor(\n+ lt::io_context& ioc, lt::settings_interface const&, lt::counters&)\n+{\n+ return std::make_unique<temp_disk_io>(ioc);\n+}\n+
\n+[report issue]\n+\n+settings_interface
\n+Declared in "libtorrent/settings_pack.hpp"
\n+the common interface to settings_pack and the internal representation of\n+settings.
\n+\n+struct settings_interface\n+{\n+ virtual void set_bool (int name, bool val) = 0;\n+ virtual bool has_val (int name) const = 0;\n+ virtual void set_int (int name, int val) = 0;\n+ virtual void set_str (int name, std::string val) = 0;\n+ virtual bool get_bool (int name) const = 0;\n+ virtual int get_int (int name) const = 0;\n+ virtual std::string const& get_str (int name) const = 0;\n+};\n+\n+[report issue]\n+\n+buffer_allocator_interface
\n+Declared in "libtorrent/disk_buffer_holder.hpp"
\n+the interface for freeing disk buffers, used by the disk_buffer_holder.\n+when implementing disk_interface, this must also be implemented in order\n+to return disk buffers back to libtorrent
\n+\n+struct buffer_allocator_interface\n+{\n+ virtual void free_disk_buffer (char* b) = 0;\n+};\n+\n+[report issue]\n+\n+disk_buffer_holder
\n+Declared in "libtorrent/disk_buffer_holder.hpp"
\n+The disk buffer holder acts like a unique_ptr that frees a disk buffer\n+when it's destructed
\n+If this buffer holder is moved-from, default constructed or reset,\n+data() will return nullptr.
\n+\n+struct disk_buffer_holder\n+{\n+ disk_buffer_holder& operator= (disk_buffer_holder&&) & noexcept;\n+ disk_buffer_holder (disk_buffer_holder&&) noexcept;\n+ disk_buffer_holder& operator= (disk_buffer_holder const&) = delete;\n+ disk_buffer_holder (disk_buffer_holder const&) = delete;\n+ disk_buffer_holder (buffer_allocator_interface& alloc\n+ , char* buf, int sz) noexcept;\n+ disk_buffer_holder () noexcept = default;\n+ ~disk_buffer_holder ();\n+ char* data () const noexcept;\n+ void reset ();\n+ void swap (disk_buffer_holder& h) noexcept;\n+ bool is_mutable () const noexcept;\n+ explicit operator bool () const noexcept;\n+ std::ptrdiff_t size () const;\n };\n \n-[report issue]\n+[report issue]\n+disk_buffer_holder()
\n+\n+disk_buffer_holder (buffer_allocator_interface& alloc\n+ , char* buf, int sz) noexcept;\n+
\n+construct a buffer holder that will free the held buffer\n+using a disk buffer pool directly (there's only one\n+disk_buffer_pool per session)
\n+[report issue]\n+\n+disk_buffer_holder()
\n+\n+disk_buffer_holder () noexcept = default;\n+
\n+default construct a holder that does not own any buffer
\n+[report issue]\n+\n+~disk_buffer_holder()
\n+\n+~disk_buffer_holder ();\n+
\n+frees disk buffer held by this object
\n+[report issue]\n+\n+data()
\n+\n+char* data () const noexcept;\n+
\n+return a pointer to the held buffer, if any. Otherwise returns nullptr.
\n+[report issue]\n+\n+reset()
\n+\n+void reset ();\n+
\n+free the held disk buffer, if any, and clear the holder. This sets the\n+holder object to a default-constructed state
\n+[report issue]\n+\n+swap()
\n+\n+void swap (disk_buffer_holder& h) noexcept;\n+
\n+swap pointers of two disk buffer holders.
\n+[report issue]\n+\n+is_mutable()
\n+\n+bool is_mutable () const noexcept;\n+
\n+if this returns true, the buffer may not be modified in place
\n+[report issue]\n+\n bool()
\n \n-explicit operator bool () const;\n+explicit operator bool () const noexcept;\n
\n-explicitly converts to true if this object represents an error, and\n-false if it does not.
\n-[report issue]\n-\n-file()
\n+implicitly convertible to true if the object is currently holding a\n+buffer
\n+[report issue]\n+\n+\n+disk_observer
\n+Declared in "libtorrent/disk_observer.hpp"
\n \n-void file (file_index_t f);\n-file_index_t file () const;\n+struct disk_observer\n+{\n+ virtual void on_disk () = 0;\n+};\n \n-set and query the index (in the torrent) of the file this error\n-occurred on. This may also have special values defined in\n-torrent_status.
\n-[report issue]\n-- ec
\n-- the error that occurred
\n+[report issue]\n+on_disk()
\n+\n+virtual void on_disk () = 0;\n+
\n+called when the disk cache size has dropped\n+below the low watermark again and we can\n+resume downloading from peers
\n+[report issue]\n+
\n+\n+open_file_state
\n+Declared in "libtorrent/disk_interface.hpp"
\n+this contains information about a file that's currently open by the\n+libtorrent disk I/O subsystem. It's associated with a single torrent.
\n+\n+struct open_file_state\n+{\n+ file_index_t file_index;\n+ file_open_mode_t open_mode;\n+ time_point last_use;\n+};\n+\n+[report issue]\n+- file_index
\n+- the index of the file this entry refers to into the file_storage\n+file list of this torrent. This starts indexing at 0.
\n
\n-[report issue]\n-- operation
\n-- A code from operation_t enum, indicating what\n-kind of operation failed.
\n+[report issue]\n+- open_mode
\n+open_mode is a bitmask of the file flags this file is currently\n+opened with. For possible flags, see file_open_mode_t.
\n+Note that the read/write mode is not a bitmask. The two least significant bits are used\n+to represent the read/write mode. Those bits can be masked out using the rw_mask constant.
\n+
\n-[report issue]
\n-\n-\n-libtorrent_category()
\n-Declared in "libtorrent/error_code.hpp"
\n+[report issue]\n+- last_use
\n+- a (high precision) timestamp of when the file was last used.
\n+
\n+[report issue]\n+\n+disk_interface
\n+Declared in "libtorrent/disk_interface.hpp"
\n+The disk_interface is the customization point for disk I/O in libtorrent.\n+implement this interface and provide a factory function to the session constructor\n+use custom disk I/O. All functions on the disk subsystem (implementing\n+disk_interface) are called from within libtorrent's network thread. For\n+disk I/O to be performed in a separate thread, the disk subsystem has to\n+manage that itself.
\n+Although the functions are called async_*, they do not technically\n+have to be asynchronous, but they support being asynchronous, by\n+expecting the result passed back into a callback. The callbacks must be\n+posted back onto the network thread via the io_context object passed into\n+the constructor. The callbacks will be run in the network thread.
\n \n-boost::system::error_category& libtorrent_category ();\n+struct disk_interface\n+{\n+ virtual storage_holder new_torrent (storage_params const& p\n+ , std::shared_ptr<void> const& torrent) = 0;\n+ virtual void remove_torrent (storage_index_t) = 0;\n+ virtual void async_read (storage_index_t storage, peer_request const& r\n+ , std::function<void(disk_buffer_holder, storage_error const&)> handler\n+ , disk_job_flags_t flags = {}) = 0;\n+ virtual bool async_write (storage_index_t storage, peer_request const& r\n+ , char const* buf, std::shared_ptr<disk_observer> o\n+ , std::function<void(storage_error const&)> handler\n+ , disk_job_flags_t flags = {}) = 0;\n+ virtual void async_hash (storage_index_t storage, piece_index_t piece, span<sha256_hash> v2\n+ , disk_job_flags_t flags\n+ , std::function<void(piece_index_t, sha1_hash const&, storage_error const&)> handler) = 0;\n+ virtual void async_hash2 (storage_index_t storage, piece_index_t piece, int offset, disk_job_flags_t flags\n+ , std::function<void(piece_index_t, sha256_hash const&, storage_error const&)> handler) = 0;\n+ virtual void async_move_storage (storage_index_t storage, std::string p, move_flags_t flags\n+ , std::function<void(status_t, std::string const&, storage_error const&)> handler) = 0;\n+ virtual void async_release_files (storage_index_t storage\n+ , std::function<void()> handler = std::function<void()>()) = 0;\n+ virtual void async_check_files (storage_index_t storage\n+ , add_torrent_params const* resume_data\n+ , aux::vector<std::string, file_index_t> links\n+ , std::function<void(status_t, storage_error const&)> handler) = 0;\n+ virtual void async_stop_torrent (storage_index_t storage\n+ , std::function<void()> handler = std::function<void()>()) = 0;\n+ virtual void async_rename_file (storage_index_t storage\n+ , file_index_t index, std::string name\n+ , std::function<void(std::string const&, file_index_t, storage_error const&)> handler) = 0;\n+ virtual void async_delete_files (storage_index_t storage, remove_flags_t options\n+ , std::function<void(storage_error const&)> handler) = 0;\n+ virtual void async_set_file_priority (storage_index_t storage\n+ , aux::vector<download_priority_t, file_index_t> prio\n+ , std::function<void(storage_error const&\n+ , aux::vector<download_priority_t, file_index_t>)> handler) = 0;\n+ virtual void async_clear_piece (storage_index_t storage, piece_index_t index\n+ , std::function<void(piece_index_t)> handler) = 0;\n+ virtual void update_stats_counters (counters& c) const = 0;\n+ virtual std::vector<open_file_state> get_status (storage_index_t) const = 0;\n+ virtual void abort (bool wait) = 0;\n+ virtual void submit_jobs () = 0;\n+ virtual void settings_updated () = 0;\n+\n+ static constexpr disk_job_flags_t force_copy = 0_bit;\n+ static constexpr disk_job_flags_t sequential_access = 3_bit;\n+ static constexpr disk_job_flags_t volatile_read = 4_bit;\n+ static constexpr disk_job_flags_t v1_hash = 5_bit;\n+ static constexpr disk_job_flags_t flush_piece = 7_bit;\n+};\n \n-return the instance of the libtorrent_error_category which\n-maps libtorrent error codes to human readable error messages.
\n-[report issue]\n-\n-http_category()
\n-Declared in "libtorrent/error_code.hpp"
\n+[report issue]\n+new_torrent()
\n \n-boost::system::error_category& http_category ();\n+virtual storage_holder new_torrent (storage_params const& p\n+ , std::shared_ptr<void> const& torrent) = 0;\n
\n-returns the error_category for HTTP errors
\n-[report issue]\n-\n-pcp_category()
\n-Declared in "libtorrent/natpmp.hpp"
\n+this is called when a new torrent is added. The shared_ptr can be\n+used to hold the internal torrent object alive as long as there are\n+outstanding disk operations on the storage.\n+The returned storage_holder is an owning reference to the underlying\n+storage that was just created. It is fundamentally a storage_index_t
\n+[report issue]\n+\n+remove_torrent()
\n \n-boost::system::error_category& pcp_category ();\n+virtual void remove_torrent (storage_index_t) = 0;\n
\n-[report issue]\n-\n-socks_category()
\n-Declared in "libtorrent/socks5_stream.hpp"
\n+remove the storage with the specified index. This is not expected to\n+delete any files from disk, just to clean up any resources associated\n+with the specified storage.
\n+\n+[report issue]\n+\n+async_read() async_write()
\n \n-boost::system::error_category& socks_category ();\n+virtual void async_read (storage_index_t storage, peer_request const& r\n+ , std::function<void(disk_buffer_holder, storage_error const&)> handler\n+ , disk_job_flags_t flags = {}) = 0;\n+virtual bool async_write (storage_index_t storage, peer_request const& r\n+ , char const* buf, std::shared_ptr<disk_observer> o\n+ , std::function<void(storage_error const&)> handler\n+ , disk_job_flags_t flags = {}) = 0;\n \n-returns the error_category for SOCKS5 errors
\n-[report issue]\n-\n-gzip_category()
\n-Declared in "libtorrent/gzip.hpp"
\n+perform a read or write operation from/to the specified storage\n+index and the specified request. When the operation completes, call\n+handler possibly with a disk_buffer_holder, holding the buffer with\n+the result. Flags may be set to affect the read operation. See\n+disk_job_flags_t.
\n+The disk_observer is a callback to indicate that\n+the store buffer/disk write queue is below the watermark to let peers\n+start writing buffers to disk again. When async_write() returns\n+true, indicating the write queue is full, the peer will stop\n+further writes and wait for the passed-in disk_observer to be\n+notified before resuming.
\n+Note that for async_read, the peer_request (r) is not\n+necessarily aligned to blocks (but it is most of the time). However,\n+all writes (passed to async_write) are guaranteed to be block\n+aligned.
\n+[report issue]\n+\n+async_hash()
\n \n-boost::system::error_category& gzip_category ();\n+virtual void async_hash (storage_index_t storage, piece_index_t piece, span<sha256_hash> v2\n+ , disk_job_flags_t flags\n+ , std::function<void(piece_index_t, sha1_hash const&, storage_error const&)> handler) = 0;\n
\n-get the error_category for zip errors
\n-[report issue]\n-\n-upnp_category()
\n-Declared in "libtorrent/upnp.hpp"
\n+Compute hash(es) for the specified piece. Unless the v1_hash flag is\n+set (in flags), the SHA-1 hash of the whole piece does not need\n+to be computed.
\n+The v2 span is optional and can be empty, which means v2 hashes\n+should not be computed. If v2 is non-empty it must be at least large\n+enough to hold all v2 blocks in the piece, and this function will\n+fill in the span with the SHA-256 block hashes of the piece.
\n+[report issue]\n+\n+async_hash2()
\n \n-boost::system::error_category& upnp_category ();\n+virtual void async_hash2 (storage_index_t storage, piece_index_t piece, int offset, disk_job_flags_t flags\n+ , std::function<void(piece_index_t, sha256_hash const&, storage_error const&)> handler) = 0;\n
\n-the boost.system error category for UPnP errors
\n-[report issue]\n-\n-bdecode_category()
\n-Declared in "libtorrent/bdecode.hpp"
\n+computes the v2 hash (SHA-256) of a single block. The block at\n+offset in piece piece.
\n+[report issue]\n+\n+async_move_storage()
\n \n-boost::system::error_category& bdecode_category ();\n+virtual void async_move_storage (storage_index_t storage, std::string p, move_flags_t flags\n+ , std::function<void(status_t, std::string const&, storage_error const&)> handler) = 0;\n
\n-[report issue]\n-\n-i2p_category()
\n-Declared in "libtorrent/i2p_stream.hpp"
\n+called to request the files for the specified storage/torrent be\n+moved to a new location. It is the disk I/O object's responsibility\n+to synchronize this with any currently outstanding disk operations to\n+the storage. Whether files are replaced at the destination path or\n+not is controlled by flags (see move_flags_t).
\n+[report issue]\n+\n+async_release_files()
\n \n-boost::system::error_category& i2p_category ();\n+virtual void async_release_files (storage_index_t storage\n+ , std::function<void()> handler = std::function<void()>()) = 0;\n
\n-returns the error category for I2P errors
\n-[report issue]\n-\n-enum error_code_enum
\n-Declared in "libtorrent/error_code.hpp"
\n-\n+This is called on disk I/O objects to request they close all open\n+files for the specified storage/torrent. If file handles are not\n+pooled/cached, it can be a no-op. For truly asynchronous disk I/O,\n+this should provide at least one point in time when all files are\n+closed. It is possible that later asynchronous operations will\n+re-open some of the files, by the time this completion handler is\n+called, that's fine.
\n+[report issue]\n+\n+async_check_files()
\n+\n+virtual void async_check_files (storage_index_t storage\n+ , add_torrent_params const* resume_data\n+ , aux::vector<std::string, file_index_t> links\n+ , std::function<void(status_t, storage_error const&)> handler) = 0;\n+
\n+this is called when torrents are added to validate their resume data\n+against the files on disk. This function is expected to do a few things:
\n+if links is non-empty, it contains a string for each file in the\n+torrent. The string being a path to an existing identical file. The\n+default behavior is to create hard links of those files into the\n+storage of the new torrent (specified by storage). An empty\n+string indicates that there is no known identical file. This is part\n+of the "mutable torrent" feature, where files can be reused from\n+other torrents.
\n+The resume_data points the resume data passed in by the client.
\n+If the resume_data->flags field has the seed_mode flag set, all\n+files/pieces are expected to be on disk already. This should be\n+verified. Not just the existence of the file, but also that it has\n+the correct size.
\n+Any file with a piece set in the resume_data->have_pieces bitmask\n+should exist on disk, this should be verified. Pad files and files\n+with zero priority may be skipped.
\n+[report issue]\n+\n+async_stop_torrent()
\n+\n+virtual void async_stop_torrent (storage_index_t storage\n+ , std::function<void()> handler = std::function<void()>()) = 0;\n+
\n+This is called when a torrent is stopped. It gives the disk I/O\n+object an opportunity to flush any data to disk that's currently kept\n+cached. This function should at least do the same thing as\n+async_release_files().
\n+[report issue]\n+\n+async_rename_file()
\n+\n+virtual void async_rename_file (storage_index_t storage\n+ , file_index_t index, std::string name\n+ , std::function<void(std::string const&, file_index_t, storage_error const&)> handler) = 0;\n+
\n+This function is called when the name of a file in the specified\n+storage has been requested to be renamed. The disk I/O object is\n+responsible for renaming the file without racing with other\n+potentially outstanding operations against the file (such as read,\n+write, move, etc.).
\n+[report issue]\n+\n+async_delete_files()
\n+\n+virtual void async_delete_files (storage_index_t storage, remove_flags_t options\n+ , std::function<void(storage_error const&)> handler) = 0;\n+
\n+This function is called when some file(s) on disk have been requested\n+to be removed by the client. storage indicates which torrent is\n+referred to. See session_handle for remove_flags_t flags\n+indicating which files are to be removed.\n+e.g. session_handle::delete_files - delete all files\n+session_handle::delete_partfile - only delete part file.
\n+[report issue]\n+\n+async_set_file_priority()
\n+\n+virtual void async_set_file_priority (storage_index_t storage\n+ , aux::vector<download_priority_t, file_index_t> prio\n+ , std::function<void(storage_error const&\n+ , aux::vector<download_priority_t, file_index_t>)> handler) = 0;\n+
\n+This is called to set the priority of some or all files. Changing the\n+priority from or to 0 may involve moving data to and from the\n+partfile. The disk I/O object is responsible for correctly\n+synchronizing this work to not race with any potentially outstanding\n+asynchronous operations affecting these files.
\n+prio is a vector of the file priority for all files. If it's\n+shorter than the total number of files in the torrent, they are\n+assumed to be set to the default priority.
\n+[report issue]\n+\n+async_clear_piece()
\n+\n+virtual void async_clear_piece (storage_index_t storage, piece_index_t index\n+ , std::function<void(piece_index_t)> handler) = 0;\n+
\n+This is called when a piece fails the hash check, to ensure there are\n+no outstanding disk operations to the piece before blocks are\n+re-requested from peers to overwrite the existing blocks. The disk I/O\n+object does not need to perform any action other than synchronize\n+with all outstanding disk operations to the specified piece before\n+posting the result back.
\n+[report issue]\n+\n+update_stats_counters()
\n+\n+virtual void update_stats_counters (counters& c) const = 0;\n+
\n+update_stats_counters() is called to give the disk storage an\n+opportunity to update gauges in the c stats counters, that aren't\n+updated continuously as operations are performed. This is called\n+before a snapshot of the counters are passed to the client.
\n+[report issue]\n+\n+get_status()
\n+\n+virtual std::vector<open_file_state> get_status (storage_index_t) const = 0;\n+
\n+Return a list of all the files that are currently open for the\n+specified storage/torrent. This is is just used for the client to\n+query the currently open files, and which modes those files are open\n+in.
\n+[report issue]\n+\n+abort()
\n+\n+virtual void abort (bool wait) = 0;\n+
\n+this is called when the session is starting to shut down. The disk\n+I/O object is expected to flush any outstanding write jobs, cancel\n+hash jobs and initiate tearing down of any internal threads. If\n+wait is true, this should be asynchronous. i.e. this call should\n+not return until all threads have stopped and all jobs have either\n+been aborted or completed and the disk I/O object is ready to be\n+destructed.
\n+[report issue]\n+\n+submit_jobs()
\n+\n+virtual void submit_jobs () = 0;\n+
\n+This will be called after a batch of disk jobs has been issues (via\n+the async_* ). It gives the disk I/O object an opportunity to\n+notify any potential condition variables to wake up the disk\n+thread(s). The async_* calls can of course also notify condition\n+variables, but doing it in this call allows for batching jobs, by\n+issuing the notification once for a collection of jobs.
\n+[report issue]\n+\n+settings_updated()
\n+\n+virtual void settings_updated () = 0;\n+
\n+This is called to notify the disk I/O object that the settings have\n+been updated. In the disk io constructor, a settings_interface\n+reference is passed in. Whenever these settings are updated, this\n+function is called to allow the disk I/O object to react to any\n+changed settings relevant to its operations.
\n+[report issue]\n+- force_copy
\n+- force making a copy of the cached block, rather than getting a\n+reference to a block already in the cache. This is used the block is\n+expected to be overwritten very soon, by async_write()`, and we need\n+access to the previous content.
\n+
\n+[report issue]\n+- sequential_access
\n+- hint that there may be more disk operations with sequential access to\n+the file
\n+
\n+[report issue]\n+- volatile_read
\n+- don't keep the read block in cache. This is a hint that this block is\n+unlikely to be read again anytime soon, and caching it would be\n+wasteful.
\n+
\n+[report issue]\n+- v1_hash
\n+- compute a v1 piece hash. This is only used by the async_hash() call.\n+If this flag is not set in the async_hash() call, the SHA-1 piece\n+hash does not need to be computed.
\n+
\n+[report issue]\n+- flush_piece
\n+- this flag instructs a hash job that we just completed this piece, and\n+it should be flushed to disk
\n+
\n+[report issue]\n+\n+\n+storage_holder
\n+Declared in "libtorrent/disk_interface.hpp"
\n+a unique, owning, reference to the storage of a torrent in a disk io\n+subsystem (class that implements disk_interface). This is held by the\n+internal libtorrent torrent object to tie the storage object allocated\n+for a torrent to the lifetime of the internal torrent object. When a\n+torrent is removed from the session, this holder is destructed and will\n+inform the disk object.
\n+\n+struct storage_holder\n+{\n+ ~storage_holder ();\n+ storage_holder (storage_index_t idx, disk_interface& disk_io);\n+ storage_holder () = default;\n+ explicit operator bool () const;\n+ operator storage_index_t () const;\n+ void reset ();\n+ storage_holder (storage_holder const&) = delete;\n+ storage_holder& operator= (storage_holder const&) = delete;\n+ storage_holder (storage_holder&& rhs) noexcept;\n+ storage_holder& operator= (storage_holder&& rhs) noexcept;\n+};\n+\n+[report issue]\n+\n+file_open_mode_t
\n+Declared in "libtorrent/disk_interface.hpp"
\n+\n+- read_only
\n+- open the file for reading only
\n+
\n+\n+- write_only
\n+- open the file for writing only
\n+
\n+\n+- read_write
\n+- open the file for reading and writing
\n+
\n+\n+- rw_mask
\n+- the mask for the bits determining read or write mode
\n+
\n+\n+- sparse
\n+- open the file in sparse mode (if supported by the\n+filesystem).
\n+
\n+\n+- no_atime
\n+- don't update the access timestamps on the file (if\n+supported by the operating system and filesystem).\n+this generally improves disk performance.
\n+
\n+\n+- random_access
\n+- open the file for random access. This disables read-ahead\n+logic
\n+
\n+\n+- mmapped
\n+- the file is memory mapped
\n+
\n+You have some control over session configuration through the session::apply_settings()\n+member function. To change one or more configuration options, create a settings_pack\n+object and fill it with the settings to be set and pass it in to session::apply_settings().
\n+The settings_pack object is a collection of settings updates that are applied\n+to the session when passed to session::apply_settings(). It's empty when\n+constructed.
\n+You have control over proxy and authorization settings and also the user-agent\n+that will be sent to the tracker. The user-agent will also be used to identify the\n+client with other peers.
\n+Each configuration option is named with an enum value inside the\n+settings_pack class. These are the available settings:
\n+[report issue]\n+\n+settings_pack
\n+Declared in "libtorrent/settings_pack.hpp"
\n+The settings_pack struct, contains the names of all settings as\n+enum values. These values are passed in to the set_str(),\n+set_int(), set_bool() functions, to specify the setting to\n+change.
\n+The settings_pack only stores values for settings that have been\n+explicitly set on this object. However, it can still be queried for\n+settings that have not been set and returns the default value for those\n+settings.
\n+\n \n- \n \n name \n-value \n-description \n+type \n+default \n no_error \n-0 \n-Not an error \n-file_collision \n-1 \n-Two torrents has files which end up overwriting each other \n-failed_hash_check \n-2 \n-A piece did not match its piece hash \n-torrent_is_no_dict \n-3 \n-The .torrent file does not contain a bencoded dictionary at\n-its top level \n-torrent_missing_info \n-4 \n-The .torrent file does not have an info dictionary \n-torrent_info_no_dict \n-5 \n-The .torrent file's info entry is not a dictionary \n-torrent_missing_piece_length \n-6 \n-The .torrent file does not have a piece length entry \n-torrent_missing_name \n-7 \n-The .torrent file does not have a name entry \n-torrent_invalid_name \n-8 \n-The .torrent file's name entry is invalid \n-torrent_invalid_length \n-9 \n-The length of a file, or of the whole .torrent file is invalid.\n-Either negative or not an integer \n-torrent_file_parse_failed \n-10 \n-Failed to parse a file entry in the .torrent \n-torrent_missing_pieces \n-11 \n-The pieces field is missing or invalid in the .torrent file \n-torrent_invalid_hashes \n-12 \n-The pieces string has incorrect length \n-too_many_pieces_in_torrent \n-13 \n-The .torrent file has more pieces than is supported by libtorrent \n-invalid_swarm_metadata \n-14 \n-The metadata (.torrent file) that was received from the swarm\n-matched the info-hash, but failed to be parsed \n-invalid_bencoding \n-15 \n-The file or buffer is not correctly bencoded \n-no_files_in_torrent \n-16 \n-The .torrent file does not contain any files \n-invalid_escaped_string \n-17 \n-The string was not properly url-encoded as expected \n-session_is_closing \n-18 \n-Operation is not permitted since the session is shutting down \n-duplicate_torrent \n-19 \n-There's already a torrent with that info-hash added to the\n-session \n-invalid_torrent_handle \n-20 \n-The supplied torrent_handle is not referring to a valid torrent \n-invalid_entry_type \n-21 \n-The type requested from the entry did not match its type \n-missing_info_hash_in_uri \n-22 \n-The specified URI does not contain a valid info-hash \n-file_too_short \n-23 \n-One of the files in the torrent was unexpectedly small. This\n-might be caused by files being changed by an external process \n-unsupported_url_protocol \n-24 \n-The URL used an unknown protocol. Currently http and\n-https (if built with openssl support) are recognized. For\n-trackers udp is recognized as well. \n-url_parse_error \n-25 \n-The URL did not conform to URL syntax and failed to be parsed \n-peer_sent_empty_piece \n-26 \n-The peer sent a piece message of length 0 \n-parse_failed \n-27 \n-A bencoded structure was corrupt and failed to be parsed \n-invalid_file_tag \n-28 \n-The fast resume file was missing or had an invalid file version\n-tag \n-missing_info_hash \n-29 \n-The fast resume file was missing or had an invalid info-hash \n-mismatching_info_hash \n-30 \n-The info-hash did not match the torrent \n-invalid_hostname \n-31 \n-The URL contained an invalid hostname \n-invalid_port \n-32 \n-The URL had an invalid port \n-port_blocked \n-33 \n-The port is blocked by the port-filter, and prevented the\n-connection \n-expected_close_bracket_in_address \n-34 \n-The IPv6 address was expected to end with "]" \n-destructing_torrent \n-35 \n-The torrent is being destructed, preventing the operation to\n-succeed \n-timed_out \n-36 \n-The connection timed out \n-upload_upload_connection \n-37 \n-The peer is upload only, and we are upload only. There's no point\n-in keeping the connection \n-uninteresting_upload_peer \n-38 \n-The peer is upload only, and we're not interested in it. There's\n-no point in keeping the connection \n-invalid_info_hash \n-39 \n-The peer sent an unknown info-hash \n-torrent_paused \n-40 \n-The torrent is paused, preventing the operation from succeeding \n-invalid_have \n-41 \n-The peer sent an invalid have message, either wrong size or\n-referring to a piece that doesn't exist in the torrent \n-invalid_bitfield_size \n-42 \n-The bitfield message had the incorrect size \n-too_many_requests_when_choked \n-43 \n-The peer kept requesting pieces after it was choked, possible\n-abuse attempt. \n-invalid_piece \n-44 \n-The peer sent a piece message that does not correspond to a\n-piece request sent by the client \n+user_agent \n+string \n+libtorrent/ \n no_memory \n-45 \n-memory allocation failed \n+
\n+this is the client identification to the tracker. The recommended\n+format of this string is: "client-name/client-version\n+libtorrent/libtorrent-version". This name will not only be used when\n+making HTTP requests, but also when sending extended headers to\n+peers that support that extension. It may not contain r or n
\n+\n+\n+ \n+\n+name \n+type \n+default \n torrent_aborted \n-46 \n-The torrent is aborted, preventing the operation to succeed \n+announce_ip \n+string \n+nullptr \n self_connection \n-47 \n-The peer is a connection to ourself, no point in keeping it \n+
\n+announce_ip is the ip address passed along to trackers as the\n+&ip= parameter. If left as the default, that parameter is\n+omitted.
\n+\n+Note
\n+This setting is only meant for very special cases where a seed is\n+running on the same host as the tracker, and the tracker accepts\n+the IP parameter (which normal trackers don't). Do not set this\n+option unless you also control the tracker.
\n+\n+\n+\n+ \n+\n+name \n+type \n+default \n invalid_piece_size \n-48 \n-The peer sent a piece message with invalid size, either negative\n-or greater than one block \n+handshake_client_version \n+string \n+nullptr \n timed_out_no_interest \n-49 \n-The peer has not been interesting or interested in us for too\n-long, no point in keeping it around \n+
\n+this is the client name and version identifier sent to peers in the\n+handshake message. If this is an empty string, the user_agent is\n+used instead. This string must be a UTF-8 encoded unicode string.
\n+\n+\n+ \n+\n+name \n+type \n+default \n timed_out_inactivity \n-50 \n-The peer has not said anything in a long time, possibly dead \n+outgoing_interfaces \n+string \n+ \n timed_out_no_handshake \n-51 \n-The peer did not send a handshake within a reasonable amount of\n-time, it might not be a bittorrent peer \n+
\n+This controls which IP address outgoing TCP peer connections are bound\n+to, in addition to controlling whether such connections are also\n+bound to a specific network interface/adapter (bind-to-device).
\n+This string is a comma-separated list of IP addresses and\n+interface names. An empty string will not bind TCP sockets to a\n+device, and let the network stack assign the local address.
\n+A list of names will be used to bind outgoing TCP sockets in a\n+round-robin fashion. An IP address will simply be used to bind()\n+the socket. An interface name will attempt to bind the socket to\n+that interface. If that fails, or is unsupported, one of the IP\n+addresses configured for that interface is used to bind() the\n+socket to. If the interface or adapter doesn't exist, the\n+outgoing peer connection will fail with an error message suggesting\n+the device cannot be found. Adapter names on Unix systems are of\n+the form "eth0", "eth1", "tun0", etc. This may be useful for\n+clients that are multi-homed. Binding an outgoing connection to a\n+local IP does not necessarily make the connection via the\n+associated NIC/Adapter.
\n+When outgoing interfaces are specified, incoming connections or\n+packets sent to a local interface or IP that's not in this list\n+will be rejected with a peer_blocked_alert with\n+invalid_local_interface as the reason.
\n+Note that these are just interface/adapter names or IP addresses.\n+There are no ports specified in this list. IPv6 addresses without\n+port should be specified without enclosing [, ].
\n+\n+\n+ \n+\n+name \n+type \n+default \n timed_out_no_request \n-52 \n-The peer has been unchoked for too long without requesting any\n-data. It might be lying about its interest in us \n+listen_interfaces \n+string \n+0.0.0.0:6881,[::]:6881 \n invalid_choke \n-53 \n-The peer sent an invalid choke message \n+
\n+a comma-separated list of (IP or device name, port) pairs. These are\n+the listen ports that will be opened for accepting incoming uTP and\n+TCP peer connections. These are also used for outgoing uTP and UDP\n+tracker connections and DHT nodes.
\n+It is possible to listen on multiple interfaces and\n+multiple ports. Binding to port 0 will make the operating system\n+pick the port.
\n+\n+Note
\n+There are reasons to stick to the same port across sessions,\n+which would mean only using port 0 on the first start, and\n+recording the port that was picked for subsequent startups.\n+Trackers, the DHT and other peers will remember the port they see\n+you use and hand that port out to other peers trying to connect\n+to you, as well as trying to connect to you themselves.
\n+\n+A port that has an "s" suffix will accept SSL peer connections. (note\n+that SSL sockets are only available in builds with SSL support)
\n+A port that has an "l" suffix will be considered a local network.\n+i.e. it's assumed to only be able to reach hosts in the same local\n+network as the IP address (based on the netmask associated with the\n+IP, queried from the operating system).
\n+if binding fails, the listen_failed_alert is posted. Once a\n+socket binding succeeds (if it does), the listen_succeeded_alert\n+is posted. There may be multiple failures before a success.
\n+If a device name that does not exist is configured, no listen\n+socket will be opened for that interface. If this is the only\n+interface configured, it will be as if no listen ports are\n+configured.
\n+If no listen ports are configured (e.g. listen_interfaces is an\n+empty string), networking will be disabled. No DHT will start, no\n+outgoing uTP or tracker connections will be made. No incoming TCP\n+or uTP connections will be accepted. (outgoing TCP connections\n+will still be possible, depending on\n+settings_pack::outgoing_interfaces).
\n+For example:\n+[::1]:8888 - will only accept connections on the IPv6 loopback\n+address on port 8888.
\n+eth0:4444,eth1:4444 - will accept connections on port 4444 on\n+any IP address bound to device eth0 or eth1.
\n+[::]:0s - will accept SSL connections on a port chosen by the\n+OS. And not accept non-SSL connections at all.
\n+0.0.0.0:6881,[::]:6881 - binds to all interfaces on port 6881.
\n+10.0.1.13:6881l - binds to the local IP address, port 6881, but\n+only allow talking to peers on the same local network. The netmask\n+is queried from the operating system. Interfaces marked l are\n+not announced to trackers, unless the tracker is also on the same\n+local network.
\n+Windows OS network adapter device name must be specified with GUID.\n+It can be obtained from "netsh lan show interfaces" command output.\n+GUID must be uppercased string embraced in curly brackets.\n+{E4F0B674-0DFC-48BB-98A5-2AA730BDB6D6}:7777 - will accept\n+connections on port 7777 on adapter with this GUID.
\n+For more information, see the Multi-homed hosts section.
\n+\n+\n+ \n+\n+name \n+type \n+default \n invalid_unchoke \n-54 \n-The peer send an invalid unchoke message \n+proxy_hostname \n+string \n+ \n invalid_interested \n-55 \n-The peer sent an invalid interested message \n+
\n+when using a proxy, this is the hostname where the proxy is running\n+see proxy_type. Note that when using a proxy, the\n+settings_pack::listen_interfaces setting is overridden and only a\n+single interface is created, just to contact the proxy. This\n+means a proxy cannot be combined with SSL torrents or multiple\n+listen interfaces. This proxy listen interface will not accept\n+incoming TCP connections, will not map ports with any gateway and\n+will not enable local service discovery. All traffic is supposed\n+to be channeled through the proxy.
\n+\n+\n+\n+ \n+\n+name \n+type \n+default \n invalid_not_interested \n-56 \n-The peer sent an invalid not-interested message \n+proxy_username \n+string \n+ \n invalid_request \n-57 \n-The peer sent an invalid piece request message \n+proxy_password \n+string \n+ \n invalid_hash_list \n-58 \n-The peer sent an invalid hash-list message (this is part of the\n-merkle-torrent extension) \n+
\n+when using a proxy, these are the credentials (if any) to use when\n+connecting to it. see proxy_type
\n+\n+\n+ \n+\n+name \n+type \n+default \n invalid_hash_piece \n-59 \n-The peer sent an invalid hash-piece message (this is part of the\n-merkle-torrent extension) \n+i2p_hostname \n+string \n+ \n invalid_cancel \n-60 \n-The peer sent an invalid cancel message \n+
\n+sets the i2p SAM bridge to connect to. set the port with the\n+i2p_port setting. Unless this is set, i2p torrents are not\n+supported. This setting is separate from the other proxy settings\n+since i2p torrents and their peers are orthogonal. You can have\n+i2p peers as well as regular peers via a proxy.
\n+\n+\n+ \n+\n+name \n+type \n+default \n invalid_dht_port \n-61 \n-The peer sent an invalid DHT port-message \n+peer_fingerprint \n+string \n+-LT20A0- \n invalid_suggest \n-62 \n-The peer sent an invalid suggest piece-message \n+
\n+this is the fingerprint for the client. It will be used as the\n+prefix to the peer_id. If this is 20 bytes (or longer) it will be\n+truncated to 20 bytes and used as the entire peer-id
\n+There is a utility function, generate_fingerprint() that can be used\n+to generate a standard client peer ID fingerprint prefix.
\n+\n+\n+ \n+\n+name \n+type \n+default \n invalid_have_all \n-63 \n-The peer sent an invalid have all-message \n+dht_bootstrap_nodes \n+string \n+dht.libtorrent.org:25401 \n invalid_have_none \n-64 \n-The peer sent an invalid have none-message \n+
\n+This is a comma-separated list of IP port-pairs. They will be added\n+to the DHT node (if it's enabled) as back-up nodes in case we don't\n+know of any.
\n+Changing these after the DHT has been started may not have any\n+effect until the DHT is restarted.
\n+\n+\n+ \n+\n+name \n+type \n+default \n invalid_reject \n-65 \n-The peer sent an invalid reject message \n+allow_multiple_connections_per_ip \n+bool \n+false \n invalid_allow_fast \n-66 \n-The peer sent an invalid allow fast-message \n+
\n+determines if connections from the same IP address as existing\n+connections should be rejected or not. Rejecting multiple connections\n+from the same IP address will prevent abusive\n+behavior by peers. The logic for determining whether connections are\n+to the same peer is more complicated with this enabled, and more\n+likely to fail in some edge cases. It is not recommended to enable\n+this feature.
\n+\n+\n+ \n+\n+name \n+type \n+default \n invalid_extended \n-67 \n-The peer sent an invalid extension message ID \n+send_redundant_have \n+bool \n+true \n invalid_message \n-68 \n-The peer sent an invalid message ID \n+
\n+send_redundant_have controls if have messages will be sent to\n+peers that already have the piece. This is typically not necessary,\n+but it might be necessary for collecting statistics in some cases.
\n+\n+\n+ \n+\n+name \n+type \n+default \n sync_hash_not_found \n-69 \n-The synchronization hash was not found in the encrypted handshake \n+use_dht_as_fallback \n+bool \n+false \n invalid_encryption_constant \n-70 \n-The encryption constant in the handshake is invalid \n+
\n+use_dht_as_fallback determines how the DHT is used. If this is\n+true, the DHT will only be used for torrents where all trackers in\n+its tracker list has failed. Either by an explicit error message or\n+a time out. If this is false, the DHT is used regardless of if the\n+trackers fail or not.
\n+\n+\n+ \n+\n+name \n+type \n+default \n no_plaintext_mode \n-71 \n-The peer does not support plain text, which is the selected mode \n+upnp_ignore_nonrouters \n+bool \n+false \n no_rc4_mode \n-72 \n-The peer does not support RC4, which is the selected mode \n+
\n+upnp_ignore_nonrouters indicates whether or not the UPnP\n+implementation should ignore any broadcast response from a device\n+whose address is not on our subnet. i.e.\n+it's a way to not talk to other people's routers by mistake.
\n+\n+\n+ \n+\n+name \n+type \n+default \n unsupported_encryption_mode \n-73 \n-The peer does not support any of the encryption modes that the\n-client supports \n+use_parole_mode \n+bool \n+true \n unsupported_encryption_mode_selected \n-74 \n-The peer selected an encryption mode that the client did not\n-advertise and does not support \n+
\n+use_parole_mode specifies if parole mode should be used. Parole\n+mode means that peers that participate in pieces that fail the hash\n+check are put in a mode where they are only allowed to download\n+whole pieces. If the whole piece a peer in parole mode fails the\n+hash check, it is banned. If a peer participates in a piece that\n+passes the hash check, it is taken out of parole mode.
\n+\n+\n+ \n+\n+name \n+type \n+default \n invalid_pad_size \n-75 \n-The pad size used in the encryption handshake is of invalid size \n+auto_manage_prefer_seeds \n+bool \n+false \n invalid_encrypt_handshake \n-76 \n-The encryption handshake is invalid \n+
\n+if true, prefer seeding torrents when determining which torrents to give\n+active slots to. If false, give preference to downloading torrents
\n+\n+\n+ \n+\n+name \n+type \n+default \n no_incoming_encrypted \n-77 \n-The client is set to not support incoming encrypted connections\n-and this is an encrypted connection \n+dont_count_slow_torrents \n+bool \n+true \n no_incoming_regular \n-78 \n-The client is set to not support incoming regular bittorrent\n-connections, and this is a regular connection \n+
\n+if dont_count_slow_torrents is true, torrents without any\n+payload transfers are not subject to the active_seeds and\n+active_downloads limits. This is intended to make it more\n+likely to utilize all available bandwidth, and avoid having\n+torrents that don't transfer anything block the active slots.
\n+\n+\n+ \n+\n+name \n+type \n+default \n duplicate_peer_id \n-79 \n-The client is already connected to this peer-ID \n+close_redundant_connections \n+bool \n+true \n torrent_removed \n-80 \n-Torrent was removed \n+
\n+close_redundant_connections specifies whether libtorrent should\n+close connections where both ends have no utility in keeping the\n+connection open. For instance if both ends have completed their\n+downloads, there's no point in keeping it open.
\n+\n+\n+ \n+\n+name \n+type \n+default \n packet_too_large \n-81 \n-The packet size exceeded the upper sanity check-limit \n+prioritize_partial_pieces \n+bool \n+false \n reserved \n-82 \n- \n+
\n+If prioritize_partial_pieces is true, partial pieces are picked\n+before pieces that are more rare. If false, rare pieces are always\n+prioritized, unless the number of partial pieces is growing out of\n+proportion.
\n+\n+\n+ \n+\n+name \n+type \n+default \n http_error \n-83 \n-The web server responded with an error \n+rate_limit_ip_overhead \n+bool \n+true \n missing_location \n-84 \n-The web server response is missing a location header \n+
\n+if set to true, the estimated TCP/IP overhead is drained from the\n+rate limiters, to avoid exceeding the limits with the total traffic
\n+\n+\n+\n+ \n+\n+name \n+type \n+default \n invalid_redirection \n-85 \n-The web seed redirected to a path that no longer matches the\n-.torrent directory structure \n+announce_to_all_tiers \n+bool \n+false \n redirecting \n-86 \n-The connection was closed because it redirected to a different\n-URL \n+announce_to_all_trackers \n+bool \n+false \n invalid_range \n-87 \n-The HTTP range header is invalid \n+
\n+announce_to_all_trackers controls how multi tracker torrents\n+are treated. If this is set to true, all trackers in the same tier\n+are announced to in parallel. If all trackers in tier 0 fails, all\n+trackers in tier 1 are announced as well. If it's set to false, the\n+behavior is as defined by the multi tracker specification.
\n+announce_to_all_tiers also controls how multi tracker torrents\n+are treated. When this is set to true, one tracker from each tier\n+is announced to. This is the uTorrent behavior. To be compliant\n+with the Multi-tracker specification, set it to false.
\n+\n+\n+ \n+\n+name \n+type \n+default \n no_content_length \n-88 \n-The HTTP response did not have a content length \n+prefer_udp_trackers \n+bool \n+true \n banned_by_ip_filter \n-89 \n-The IP is blocked by the IP filter \n+
\n+prefer_udp_trackers: true means that trackers\n+may be rearranged in a way that udp trackers are always tried\n+before http trackers for the same hostname. Setting this to false\n+means that the tracker's tier is respected and there's no\n+preference of one protocol over another.
\n+\n+\n+ \n+\n+name \n+type \n+default \n too_many_connections \n-90 \n-At the connection limit \n+disable_hash_checks \n+bool \n+false \n peer_banned \n-91 \n-The peer is marked as banned \n+
\n+when set to true, all data downloaded from peers will be assumed to\n+be correct, and not tested to match the hashes in the torrent this\n+is only useful for simulation and testing purposes (typically\n+combined with disabled_storage)
\n+\n+\n+ \n+\n+name \n+type \n+default \n stopping_torrent \n-92 \n-The torrent is stopping, causing the operation to fail \n+allow_i2p_mixed \n+bool \n+false \n too_many_corrupt_pieces \n-93 \n-The peer has sent too many corrupt pieces and is banned \n+
\n+if this is true, i2p torrents are allowed to also get peers from\n+other sources than the tracker, and connect to regular IPs, not\n+providing any anonymization. This may be useful if the user is not\n+interested in the anonymization of i2p, but still wants to be able\n+to connect to i2p peers.
\n+\n+\n+ \n+\n+name \n+type \n+default \n torrent_not_ready \n-94 \n-The torrent is not ready to receive peers \n+no_atime_storage \n+bool \n+true \n peer_not_constructed \n-95 \n-The peer is not completely constructed yet \n+
\n+no_atime_storage this is a Linux-only option and passes in the\n+O_NOATIME to open() when opening files. This may lead to\n+some disk performance improvements.
\n+\n+\n+ \n+\n+name \n+type \n+default \n session_closing \n-96 \n-The session is closing, causing the operation to fail \n+incoming_starts_queued_torrents \n+bool \n+false \n optimistic_disconnect \n-97 \n-The peer was disconnected in order to leave room for a\n-potentially better peer \n+
\n+incoming_starts_queued_torrents. If a torrent\n+has been paused by the auto managed feature in libtorrent, i.e. the\n+torrent is paused and auto managed, this feature affects whether or\n+not it is automatically started on an incoming connection. The main\n+reason to queue torrents, is not to make them unavailable, but to\n+save on the overhead of announcing to the trackers, the DHT and to\n+avoid spreading one's unchoke slots too thin. If a peer managed to\n+find us, even though we're no in the torrent anymore, this setting\n+can make us start the torrent and serve it.
\n+\n+\n+ \n+\n+name \n+type \n+default \n torrent_finished \n-98 \n-The torrent is finished \n+report_true_downloaded \n+bool \n+false \n no_router \n-99 \n-No UPnP router found \n+
\n+when set to true, the downloaded counter sent to trackers will\n+include the actual number of payload bytes downloaded including\n+redundant bytes. If set to false, it will not include any redundancy\n+bytes
\n+\n+\n+ \n+\n+name \n+type \n+default \n metadata_too_large \n-100 \n-The metadata message says the metadata exceeds the limit \n+strict_end_game_mode \n+bool \n+true \n invalid_metadata_request \n-101 \n-The peer sent an invalid metadata request message \n+
\n+strict_end_game_mode controls when a\n+block may be requested twice. If this is true, a block may only\n+be requested twice when there's at least one request to every piece\n+that's left to download in the torrent. This may slow down progress\n+on some pieces sometimes, but it may also avoid downloading a lot\n+of redundant bytes. If this is false, libtorrent attempts to\n+use each peer connection to its max, by always requesting\n+something, even if it means requesting something that has been\n+requested from another peer already.
\n+\n+\n+\n+\n+\n+ \n+\n+name \n+type \n+default \n invalid_metadata_size \n-102 \n-The peer advertised an invalid metadata size \n+enable_outgoing_utp \n+bool \n+true \n invalid_metadata_offset \n-103 \n-The peer sent a message with an invalid metadata offset \n+enable_incoming_utp \n+bool \n+true \n invalid_metadata_message \n-104 \n-The peer sent an invalid metadata message \n+enable_outgoing_tcp \n+bool \n+true \n pex_message_too_large \n-105 \n-The peer sent a peer exchange message that was too large \n+enable_incoming_tcp \n+bool \n+true \n invalid_pex_message \n-106 \n-The peer sent an invalid peer exchange message \n+
\n+Enables incoming and outgoing, TCP and uTP peer connections.\n+false is disabled and true is enabled. When outgoing\n+connections are disabled, libtorrent will simply not make\n+outgoing peer connections with the specific transport protocol.\n+Disabled incoming peer connections will simply be rejected.\n+These options only apply to peer connections, not tracker- or any\n+other kinds of connections.
\n+\n+\n+ \n+\n+name \n+type \n+default \n invalid_lt_tracker_message \n-107 \n-The peer sent an invalid tracker exchange message \n+no_recheck_incomplete_resume \n+bool \n+false \n too_frequent_pex \n-108 \n-The peer sent an pex messages too often. This is a possible\n-attempt of and attack \n+
\n+no_recheck_incomplete_resume determines if the storage should\n+check the whole files when resume data is incomplete or missing or\n+whether it should simply assume we don't have any of the data. If\n+false, any existing files will be checked.\n+By setting this setting to true, the files won't be checked, but\n+will go straight to download mode.
\n+\n+\n+ \n+\n+name \n+type \n+default \n no_metadata \n-109 \n-The operation failed because it requires the torrent to have\n-the metadata (.torrent file) and it doesn't have it yet.\n-This happens for magnet links before they have downloaded the\n-metadata, and also torrents added by URL. \n+anonymous_mode \n+bool \n+false \n invalid_dont_have \n-110 \n-The peer sent an invalid dont_have message. The don't have\n-message is an extension to allow peers to advertise that the\n-no longer has a piece they previously had. \n+
\n+anonymous_mode: When set to true, the client tries to hide\n+its identity to a certain degree.
\n+\n+- A generic user-agent will be\n+used for trackers (except for private torrents).
\n+- Your local IPv4 and IPv6 address won't be sent as query string\n+parameters to private trackers.
\n+- If announce_ip is configured, it will not be sent to trackers
\n+- The client version will not be sent to peers in the extension\n+handshake.
\n+
\n+\n+\n+ \n+\n+name \n+type \n+default \n requires_ssl_connection \n-111 \n-The peer tried to connect to an SSL torrent without connecting\n-over SSL. \n+report_web_seed_downloads \n+bool \n+true \n invalid_ssl_cert \n-112 \n-The peer tried to connect to a torrent with a certificate\n-for a different torrent. \n+
\n+specifies whether downloads from web seeds is reported to the\n+tracker or not. Turning it off also excludes web\n+seed traffic from other stats and download rate reporting via the\n+libtorrent API.
\n+\n+\n+ \n+\n+name \n+type \n+default \n not_an_ssl_torrent \n-113 \n-the torrent is not an SSL torrent, and the operation requires\n-an SSL torrent \n+seeding_outgoing_connections \n+bool \n+true \n banned_by_port_filter \n-114 \n-peer was banned because its listen port is within a banned port\n-range, as specified by the port_filter. \n+
\n+seeding_outgoing_connections determines if seeding (and\n+finished) torrents should attempt to make outgoing connections or\n+not. It may be set to false in very\n+specific applications where the cost of making outgoing connections\n+is high, and there are no or small benefits of doing so. For\n+instance, if no nodes are behind a firewall or a NAT, seeds don't\n+need to make outgoing connections.
\n+\n+\n+ \n+\n+name \n+type \n+default \n invalid_session_handle \n-115 \n-The session_handle is not referring to a valid session_impl \n+no_connect_privileged_ports \n+bool \n+false \n invalid_listen_socket \n-116 \n-the listen socket associated with this request was closed \n+
\n+when this is true, libtorrent will not attempt to make outgoing\n+connections to peers whose port is < 1024. This is a safety\n+precaution to avoid being part of a DDoS attack
\n+\n+\n+ \n+\n+name \n+type \n+default \n invalid_hash_request \n-117 \n- \n+smooth_connects \n+bool \n+true \n invalid_hashes \n-118 \n- \n+
\n+smooth_connects means the number of\n+connection attempts per second may be limited to below the\n+connection_speed, in case we're close to bump up against the\n+limit of number of connections. The intention of this setting is to\n+more evenly distribute our connection attempts over time, instead\n+of attempting to connect in batches, and timing them out in\n+batches.
\n+\n+\n+ \n+\n+name \n+type \n+default \n invalid_hash_reject \n-119 \n- \n+always_send_user_agent \n+bool \n+false \n deprecated_120 \n-120 \n- \n+
\n+always send user-agent in every web seed request. If false, only\n+the first request per http connection will include the user agent
\n+\n+\n+ \n+\n+name \n+type \n+default \n deprecated_121 \n-121 \n- \n+apply_ip_filter_to_trackers \n+bool \n+true \n deprecated_122 \n-122 \n- \n+
\n+apply_ip_filter_to_trackers determines\n+whether the IP filter applies to trackers as well as peers. If this\n+is set to false, trackers are exempt from the IP filter (if there\n+is one). If no IP filter is set, this setting is irrelevant.
\n+\n+\n+ \n+\n+name \n+type \n+default \n deprecated_123 \n-123 \n- \n+ban_web_seeds \n+bool \n+true \n deprecated_124 \n-124 \n- \n+
\n+when true, web seeds sending bad data will be banned
\n+\n+\n+ \n+\n+name \n+type \n+default \n missing_file_sizes \n-130 \n-The resume data file is missing the file sizes entry \n+support_share_mode \n+bool \n+true \n no_files_in_resume_data \n-131 \n-The resume data file file sizes entry is empty \n+
\n+if false, prevents libtorrent to advertise share-mode support
\n+\n+\n+ \n+\n+name \n+type \n+default \n missing_pieces \n-132 \n-The resume data file is missing the pieces and slots entry \n+report_redundant_bytes \n+bool \n+true \n mismatching_number_of_files \n-133 \n-The number of files in the resume data does not match the number\n-of files in the torrent \n+
\n+if this is true, the number of redundant bytes is sent to the\n+tracker
\n+\n+\n+ \n+\n+name \n+type \n+default \n mismatching_file_size \n-134 \n-One of the files on disk has a different size than in the fast\n-resume file \n+listen_system_port_fallback \n+bool \n+true \n mismatching_file_timestamp \n-135 \n-One of the files on disk has a different timestamp than in the\n-fast resume file \n+
\n+if this is true, libtorrent will fall back to listening on a port\n+chosen by the operating system (i.e. binding to port 0). If a\n+failure is preferred, set this to false.
\n+\n+\n+ \n+\n+name \n+type \n+default \n not_a_dictionary \n-136 \n-The resume data file is not a dictionary \n+announce_crypto_support \n+bool \n+true \n invalid_blocks_per_piece \n-137 \n-The blocks per piece entry is invalid in the resume data file \n+
\n+when this is true, and incoming encrypted connections are enabled,\n+&supportcrypt=1 is included in http tracker announces
\n+\n+\n+ \n+\n+name \n+type \n+default \n missing_slots \n-138 \n-The resume file is missing the slots entry, which is required\n-for torrents with compact allocation. DEPRECATED \n+enable_upnp \n+bool \n+true \n too_many_slots \n-139 \n-The resume file contains more slots than the torrent \n+
\n+Starts and stops the UPnP service. When started, the listen port\n+and the DHT port are attempted to be forwarded on local UPnP router\n+devices.
\n+The upnp object returned by start_upnp() can be used to add and\n+remove arbitrary port mappings. Mapping status is returned through\n+the portmap_alert and the portmap_error_alert. The object will be\n+valid until stop_upnp() is called. See upnp and nat pmp.
\n+\n+\n+ \n+\n+name \n+type \n+default \n invalid_slot_list \n-140 \n-The slot entry is invalid in the resume data \n+enable_natpmp \n+bool \n+true \n invalid_piece_index \n-141 \n-One index in the slot list is invalid \n+
\n+Starts and stops the NAT-PMP service. When started, the listen port\n+and the DHT port are attempted to be forwarded on the router\n+through NAT-PMP.
\n+The natpmp object returned by start_natpmp() can be used to add\n+and remove arbitrary port mappings. Mapping status is returned\n+through the portmap_alert and the portmap_error_alert. The object\n+will be valid until stop_natpmp() is called. See\n+upnp and nat pmp.
\n+\n+\n+ \n+\n+name \n+type \n+default \n pieces_need_reorder \n-142 \n-The pieces on disk needs to be re-ordered for the specified\n-allocation mode. This happens if you specify sparse allocation\n-and the files on disk are using compact storage. The pieces needs\n-to be moved to their right position. DEPRECATED \n+enable_lsd \n+bool \n+true \n resume_data_not_modified \n-143 \n-this error is returned when asking to save resume data and\n-specifying the flag to only save when there's anything new to save\n-(torrent_handle::only_if_modified) and there wasn't anything changed. \n+
\n+Starts and stops Local Service Discovery. This service will\n+broadcast the info-hashes of all the non-private torrents on the\n+local network to look for peers on the same swarm within multicast\n+reach.
\n+\n+\n+ \n+\n+name \n+type \n+default \n http_parse_error \n-150 \n-The HTTP header was not correctly formatted \n+enable_dht \n+bool \n+true \n http_missing_location \n-151 \n-The HTTP response was in the 300-399 range but lacked a location\n-header \n+
\n+starts the dht node and makes the trackerless service available to\n+torrents.
\n+\n+\n+ \n+\n+name \n+type \n+default \n http_failed_decompress \n-152 \n-The HTTP response was encoded with gzip or deflate but\n-decompressing it failed \n+prefer_rc4 \n+bool \n+false \n no_i2p_router \n-160 \n-The URL specified an i2p address, but no i2p router is configured \n+
\n+if the allowed encryption level is both, setting this to true will\n+prefer RC4 if both methods are offered, plain text otherwise
\n+\n+\n+ \n+\n+name \n+type \n+default \n no_i2p_endpoint \n-161 \n-i2p acceptor is not available yet, can't announce without endpoint \n+proxy_hostnames \n+bool \n+true \n scrape_not_available \n-170 \n-The tracker URL doesn't support transforming it into a scrape\n-URL. i.e. it doesn't contain "announce. \n+
\n+if true, hostname lookups are done via the configured proxy (if\n+any). This is only supported by SOCKS5 and HTTP.
\n+\n+\n+ \n+\n+name \n+type \n+default \n invalid_tracker_response \n-171 \n-invalid tracker response \n+proxy_peer_connections \n+bool \n+true \n invalid_peer_dict \n-172 \n-invalid peer dictionary entry. Not a dictionary \n+
\n+if true, peer connections are made (and accepted) over the\n+configured proxy, if any. Web seeds as well as regular bittorrent\n+peer connections are considered "peer connections". Anything\n+transporting actual torrent payload (trackers and DHT traffic are\n+not considered peer connections).
\n+\n+\n+ \n+\n+name \n+type \n+default \n tracker_failure \n-173 \n-tracker sent a failure message \n+auto_sequential \n+bool \n+true \n invalid_files_entry \n-174 \n-missing or invalid files entry \n+
\n+if this setting is true, torrents with a very high availability of\n+pieces (and seeds) are downloaded sequentially. This is more\n+efficient for the disk I/O. With many seeds, the download order is\n+unlikely to matter anyway
\n+\n+\n+ \n+\n+name \n+type \n+default \n invalid_hash_entry \n-175 \n-missing or invalid hash entry \n+proxy_tracker_connections \n+bool \n+true \n invalid_peers_entry \n-176 \n-missing or invalid peers and peers6 entry \n+
\n+if true, tracker connections are made over the configured proxy, if\n+any.
\n+\n+\n+ \n+\n+name \n+type \n+default \n invalid_tracker_response_length \n-177 \n-UDP tracker response packet has invalid size \n+enable_ip_notifier \n+bool \n+true \n invalid_tracker_transaction_id \n-178 \n-invalid transaction id in UDP tracker response \n+
\n+Starts and stops the internal IP table route changes notifier.
\n+The current implementation supports multiple platforms, and it is\n+recommended to have it enable, but you may want to disable it if\n+it's supported but unreliable, or if you have a better way to\n+detect the changes. In the later case, you should manually call\n+session_handle::reopen_network_sockets to ensure network\n+changes are taken in consideration.
\n+\n+\n+ \n+\n+name \n+type \n+default \n invalid_tracker_action \n-179 \n-invalid action field in UDP tracker response \n+dht_prefer_verified_node_ids \n+bool \n+true \n announce_skipped \n-180 \n-skipped announce (because it's assumed to be unreachable over the\n-given source network interface) \n+
\n+when this is true, nodes whose IDs are derived from their source\n+IP according to BEP 42 are preferred in the routing table.
\n+\n+\n+ \n+\n+name \n+type \n+default \n no_entropy \n-200 \n-random number generation failed \n+dht_restrict_routing_ips \n+bool \n+true \n ssrf_mitigation \n-201 \n-blocked by SSRF mitigation \n+
\n+determines if the routing table entries should restrict entries to one\n+per IP. This defaults to true, which helps mitigate some attacks on\n+the DHT. It prevents adding multiple nodes with IPs with a very close\n+CIDR distance.
\n+when set, nodes whose IP address that's in the same /24 (or /64 for\n+IPv6) range in the same routing table bucket. This is an attempt to\n+mitigate node ID spoofing attacks also restrict any IP to only have a\n+single entry in the whole routing table
\n+\n+\n+ \n+\n+name \n+type \n+default \n blocked_by_idna \n-202 \n-blocked because IDNA host names are banned \n+dht_restrict_search_ips \n+bool \n+true \n torrent_unknown_version \n-210 \n-the torrent file has an unknown meta version \n+
\n+determines if DHT searches should prevent adding nodes with IPs with\n+very close CIDR distance. This also defaults to true and helps\n+mitigate certain attacks on the DHT.
\n+\n+\n+ \n+\n+name \n+type \n+default \n torrent_missing_file_tree \n-211 \n-the v2 torrent file has no file tree \n+dht_extended_routing_table \n+bool \n+true \n torrent_missing_meta_version \n-212 \n-the torrent contains v2 keys but does not specify meta version 2 \n+
\n+makes the first buckets in the DHT routing table fit 128, 64, 32 and\n+16 nodes respectively, as opposed to the standard size of 8. All other\n+buckets have size 8 still.
\n+\n+\n+ \n+\n+name \n+type \n+default \n torrent_inconsistent_files \n-213 \n-the v1 and v2 file metadata does not match \n+dht_aggressive_lookups \n+bool \n+true \n torrent_missing_piece_layer \n-214 \n-one or more files are missing piece layer hashes \n+
\n+slightly changes the lookup behavior in terms of how many outstanding\n+requests we keep. Instead of having branch factor be a hard limit, we\n+always keep branch factor outstanding requests to the closest nodes.\n+i.e. every time we get results back with closer nodes, we query them\n+right away. It lowers the lookup times at the cost of more outstanding\n+queries.
\n+\n+\n+ \n+\n+name \n+type \n+default \n torrent_invalid_piece_layer \n-215 \n-a piece layer has the wrong size or failed hash check \n+dht_privacy_lookups \n+bool \n+false \n torrent_missing_pieces_root \n-216 \n-a v2 file entry has no root hash \n+
\n+when set, perform lookups in a way that is slightly more expensive,\n+but which minimizes the amount of information leaked about you.
\n+\n+\n+ \n+\n+name \n+type \n+default \n torrent_inconsistent_hashes \n-217 \n-the v1 and v2 hashes do not describe the same data \n+dht_enforce_node_id \n+bool \n+false \n torrent_invalid_pad_file \n-218 \n-a file in the v2 metadata has the pad attribute set \n+
\n+when set, node's whose IDs that are not correctly generated based on\n+its external IP are ignored. When a query arrives from such node, an\n+error message is returned with a message saying "invalid node ID".
\n+\n+\n+ \n+\n+name \n+type \n+default \n error_code_max \n-219 \n-the number of error codes \n+dht_ignore_dark_internet \n+bool \n+true \n
\n-[report issue]\n-\n-enum http_errors
\n-Declared in "libtorrent/error_code.hpp"
\n-\n+ignore DHT messages from parts of the internet we wouldn't expect to\n+see any traffic from
\n+\n \n- \n \n name \n-value \n-description \n+type \n+default \n cont \n-100 \n- \n-ok \n-200 \n- \n-created \n-201 \n- \n-accepted \n-202 \n- \n-no_content \n-204 \n- \n+dht_read_only \n+bool \n+false \n multiple_choices \n-300 \n- \n+
\n+when set, the other nodes won't keep this node in their routing\n+tables, it's meant for low-power and/or ephemeral devices that\n+cannot support the DHT, it is also useful for mobile devices which\n+are sensitive to network traffic and battery life.\n+this node no longer responds to 'query' messages, and will place a\n+'ro' key (value = 1) in the top-level message dictionary of outgoing\n+query messages.
\n+\n+\n+ \n+\n+name \n+type \n+default \n moved_permanently \n-301 \n- \n+piece_extent_affinity \n+bool \n+false \n moved_temporarily \n-302 \n- \n+
\n+when this is true, create an affinity for downloading 4 MiB extents\n+of adjacent pieces. This is an attempt to achieve better disk I/O\n+throughput by downloading larger extents of bytes, for torrents with\n+small piece sizes
\n+\n+\n+ \n+\n+name \n+type \n+default \n not_modified \n-304 \n- \n+validate_https_trackers \n+bool \n+true \n bad_request \n-400 \n- \n+
\n+when set to true, the certificate of HTTPS trackers and HTTPS web\n+seeds will be validated against the system's certificate store\n+(as defined by OpenSSL). If the system does not have a\n+certificate store, this option may have to be disabled in order\n+to get trackers and web seeds to work).
\n+\n+\n+ \n+\n+name \n+type \n+default \n unauthorized \n-401 \n- \n+ssrf_mitigation \n+bool \n+true \n forbidden \n-403 \n- \n+
\n+when enabled, tracker and web seed requests are subject to\n+certain restrictions.
\n+An HTTP(s) tracker requests to localhost (loopback)\n+must have the request path start with "/announce". This is the\n+conventional bittorrent tracker request. Any other HTTP(S)\n+tracker request to loopback will be rejected. This applies to\n+trackers that redirect to loopback as well.
\n+Web seeds that end up on the client's local network (i.e. in a\n+private IP address range) may not include query string arguments.\n+This applies to web seeds redirecting to the local network as\n+well.
\n+Web seeds on global IPs (i.e. not local network) may not redirect\n+to a local network address
\n+\n+\n+ \n+\n+name \n+type \n+default \n not_found \n-404 \n- \n+allow_idna \n+bool \n+false \n internal_server_error \n-500 \n- \n+
\n+when disabled, any tracker or web seed with an IDNA hostname\n+(internationalized domain name) is ignored. This is a security\n+precaution to avoid various unicode encoding attacks that might\n+happen at the application level.
\n+\n+\n+ \n+\n+name \n+type \n+default \n not_implemented \n-501 \n- \n+enable_set_file_valid_data \n+bool \n+false \n bad_gateway \n-502 \n- \n+
\n+when set to true, enables the attempt to use SetFileValidData()\n+to pre-allocate disk space. This system call will only work when\n+running with Administrator privileges on Windows, and so this\n+setting is only relevant in that scenario. Using\n+SetFileValidData() poses a security risk, as it may reveal\n+previously deleted information from the disk.
\n+\n+\n+ \n+\n+name \n+type \n+default \n service_unavailable \n-503 \n- \n+socks5_udp_send_local_ep \n+bool \n+false \n
\n-[report issue]\n-\n-enum pcp_errors
\n-Declared in "libtorrent/natpmp.hpp"
\n-\n+When using a SOCKS5 proxy, UDP traffic is routed through the\n+proxy by sending a UDP ASSOCIATE command. If this option is true,\n+the UDP ASSOCIATE command will include the IP address and\n+listen port to the local UDP socket. This indicates to the proxy\n+which source endpoint to expect our packets from. The benefit is\n+that incoming packets can be forwarded correctly, before any\n+outgoing packets are sent. The risk is that if there's a NAT\n+between the client and the proxy, the IP address specified in the\n+protocol may not be valid from the proxy's point of view.
\n+\n \n- \n \n name \n-value \n-description \n+type \n+default \n pcp_success \n-0 \n- \n-pcp_unsupp_version \n-1 \n- \n+tracker_completion_timeout \n+int \n+30 \n pcp_not_authorized \n-2 \n- \n+
\n+tracker_completion_timeout is the number of seconds the tracker\n+connection will wait from when it sent the request until it\n+considers the tracker to have timed-out.
\n+\n+\n+ \n+\n+name \n+type \n+default \n pcp_malformed_request \n-3 \n- \n+tracker_receive_timeout \n+int \n+10 \n pcp_unsupp_opcode \n-4 \n- \n+
\n+tracker_receive_timeout is the number of seconds to wait to\n+receive any data from the tracker. If no data is received for this\n+number of seconds, the tracker will be considered as having timed\n+out. If a tracker is down, this is the kind of timeout that will\n+occur.
\n+\n+\n+ \n+\n+name \n+type \n+default \n pcp_unsupp_option \n+stop_tracker_timeout \n+int \n 5 \n- \n pcp_malformed_option \n-6 \n- \n+
\n+stop_tracker_timeout is the number of seconds to wait when\n+sending a stopped message before considering a tracker to have\n+timed out. This is usually shorter, to make the client quit faster.\n+If the value is set to 0, the connections to trackers with the\n+stopped event are suppressed.
\n+\n+\n+ \n+\n+name \n+type \n+default \n pcp_network_failure \n-7 \n- \n+tracker_maximum_response_length \n+int \n+1024*1024 \n pcp_no_resources \n-8 \n- \n+
\n+this is the maximum number of bytes in a tracker response. If a\n+response size passes this number of bytes it will be rejected and\n+the connection will be closed. On gzipped responses this size is\n+measured on the uncompressed data. So, if you get 20 bytes of gzip\n+response that'll expand to 2 megabytes, it will be interrupted\n+before the entire response has been uncompressed (assuming the\n+limit is lower than 2 MiB).
\n+\n+\n+ \n+\n+name \n+type \n+default \n pcp_unsupp_protocol \n-9 \n- \n+piece_timeout \n+int \n+20 \n pcp_user_ex_quota \n-10 \n- \n+
\n+the number of seconds from a request is sent until it times out if\n+no piece response is returned.
\n+\n+\n+ \n+\n+name \n+type \n+default \n pcp_cannot_provide_external \n-11 \n- \n+request_timeout \n+int \n+60 \n pcp_address_mismatch \n-12 \n- \n+
\n+the number of seconds one block (16 kiB) is expected to be received\n+within. If it's not, the block is requested from a different peer
\n+\n+\n+ \n+\n+name \n+type \n+default \n pcp_excessive_remote_peers \n-13 \n- \n+request_queue_time \n+int \n+3 \n
\n-[report issue]\n-\n-enum socks_error_code
\n-Declared in "libtorrent/socks5_stream.hpp"
\n-\n+the length of the request queue given in the number of seconds it\n+should take for the other end to send all the pieces. i.e. the\n+actual number of requests depends on the download rate and this\n+number.
\n+\n \n- \n \n name \n-value \n-description \n+type \n+default \n no_error \n-0 \n- \n-unsupported_version \n-1 \n- \n-unsupported_authentication_method \n-2 \n- \n+max_allowed_in_request_queue \n+int \n+2000 \n unsupported_authentication_version \n-3 \n- \n+
\n+the number of outstanding block requests a peer is allowed to queue\n+up in the client. If a peer sends more requests than this (before\n+the first one has been sent) the last request will be dropped. the\n+higher this is, the faster upload speeds the client can get to a\n+single peer.
\n+\n+\n+ \n+\n+name \n+type \n+default \n authentication_error \n-4 \n- \n+max_out_request_queue \n+int \n+500 \n username_required \n-5 \n- \n+
\n+max_out_request_queue is the maximum number of outstanding\n+requests to send to a peer. This limit takes precedence over\n+request_queue_time. i.e. no matter the download speed, the\n+number of outstanding requests will never exceed this limit.
\n+\n+\n+ \n+\n+name \n+type \n+default \n general_failure \n-6 \n- \n+whole_pieces_threshold \n+int \n+20 \n command_not_supported \n-7 \n- \n+
\n+if a whole piece can be downloaded in this number of seconds, or\n+less, the peer_connection will prefer to request whole pieces at a\n+time from this peer. The benefit of this is to better utilize disk\n+caches by doing localized accesses and also to make it easier to\n+identify bad peers if a piece fails the hash check.
\n+\n+\n+ \n+\n+name \n+type \n+default \n no_identd \n-8 \n- \n+peer_timeout \n+int \n+120 \n identd_error \n-9 \n- \n+
\n+peer_timeout is the number of seconds the peer connection\n+should wait (for any activity on the peer connection) before\n+closing it due to time out. 120 seconds is\n+specified in the protocol specification. After half\n+the time out, a keep alive message is sent.
\n+\n+\n+ \n+\n+name \n+type \n+default \n num_errors \n-10 \n- \n+urlseed_timeout \n+int \n+20 \n
\n-[report issue]\n-\n-enum error_code_enum
\n-Declared in "libtorrent/gzip.hpp"
\n-\n+same as peer_timeout, but only applies to url-seeds. this is\n+usually set lower, because web servers are expected to be more\n+reliable.
\n+\n \n- \n \n name \n-value \n-description \n+type \n+default \n no_error \n-0 \n-Not an error \n-invalid_gzip_header \n-1 \n-the supplied gzip buffer has invalid header \n-inflated_data_too_large \n-2 \n-the gzip buffer would inflate to more bytes than the specified\n-maximum size, and was rejected. \n-data_did_not_terminate \n-3 \n-available inflate data did not terminate \n-space_exhausted \n-4 \n-output space exhausted before completing inflate \n-invalid_block_type \n+urlseed_pipeline_size \n+int \n 5 \n-invalid block type (type == 3) \n invalid_stored_block_length \n-6 \n-stored block length did not match one's complement \n+
\n+controls the pipelining size of url and http seeds. i.e. the number of HTTP\n+request to keep outstanding before waiting for the first one to\n+complete. It's common for web servers to limit this to a relatively\n+low number, like 5
\n+\n+\n+ \n+\n+name \n+type \n+default \n too_many_length_or_distance_codes \n-7 \n-dynamic block code description: too many length or distance codes \n+urlseed_wait_retry \n+int \n+30 \n code_lengths_codes_incomplete \n-8 \n-dynamic block code description: code lengths codes incomplete \n+
\n+number of seconds until a new retry of a url-seed takes place.\n+Default retry value for http-seeds that don't provide\n+a valid retry-after header.
\n+\n+\n+ \n+\n+name \n+type \n+default \n repeat_lengths_with_no_first_length \n-9 \n-dynamic block code description: repeat lengths with no first length \n+file_pool_size \n+int \n+40 \n repeat_more_than_specified_lengths \n-10 \n-dynamic block code description: repeat more than specified lengths \n+
\n+sets the upper limit on the total number of files this session will\n+keep open. The reason why files are left open at all is that some\n+anti virus software hooks on every file close, and scans the file\n+for viruses. deferring the closing of the files will be the\n+difference between a usable system and a completely hogged down\n+system. Most operating systems also has a limit on the total number\n+of file descriptors a process may have open.
\n+\n+\n+ \n+\n+name \n+type \n+default \n invalid_literal_length_code_lengths \n-11 \n-dynamic block code description: invalid literal/length code lengths \n+max_failcount \n+int \n+3 \n invalid_distance_code_lengths \n-12 \n-dynamic block code description: invalid distance code lengths \n+
\n+max_failcount is the maximum times we try to\n+connect to a peer before stop connecting again. If a\n+peer succeeds, the failure counter is reset. If a\n+peer is retrieved from a peer source (other than DHT)\n+the failcount is decremented by one, allowing another\n+try.
\n+\n+\n+ \n+\n+name \n+type \n+default \n invalid_literal_code_in_block \n-13 \n-invalid literal/length or distance code in fixed or dynamic block \n+min_reconnect_time \n+int \n+60 \n distance_too_far_back_in_block \n-14 \n-distance is too far back in fixed or dynamic block \n+
\n+the number of seconds to wait to reconnect to a peer. this time is\n+multiplied with the failcount.
\n+\n+\n+ \n+\n+name \n+type \n+default \n unknown_gzip_error \n+peer_connect_timeout \n+int \n 15 \n-an unknown error occurred during gzip inflation \n-error_code_max \n-16 \n-the number of error codes \n
\n-[report issue]\n-\n-enum error_code_enum
\n-Declared in "libtorrent/upnp.hpp"
\n-\n+peer_connect_timeout the number of seconds to wait after a\n+connection attempt is initiated to a peer until it is considered as\n+having timed out. This setting is especially important in case the\n+number of half-open connections are limited, since stale half-open\n+connection may delay the connection of other peers considerably.
\n+\n \n- \n \n name \n-value \n-description \n+type \n+default \n no_error \n-0 \n-No error \n-invalid_argument \n-402 \n-One of the arguments in the request is invalid \n-action_failed \n-501 \n-The request failed \n-value_not_in_array \n-714 \n-The specified value does not exist in the array \n-source_ip_cannot_be_wildcarded \n-715 \n-The source IP address cannot be wild-carded, but\n-must be fully specified \n-external_port_cannot_be_wildcarded \n-716 \n-The external port cannot be a wildcard, but must\n-be specified \n-port_mapping_conflict \n-718 \n-The port mapping entry specified conflicts with a\n-mapping assigned previously to another client \n-internal_port_must_match_external \n-724 \n-Internal and external port value must be the same \n-only_permanent_leases_supported \n-725 \n-The NAT implementation only supports permanent\n-lease times on port mappings \n+connection_speed \n+int \n+30 \n remote_host_must_be_wildcard \n-726 \n-RemoteHost must be a wildcard and cannot be a\n-specific IP address or DNS name \n+
\n+connection_speed is the number of connection attempts that are\n+made per second. If a number < 0 is specified, it will default to\n+200 connections per second. If 0 is specified, it means don't make\n+outgoing connections at all.
\n+\n+\n+ \n+\n+name \n+type \n+default \n external_port_must_be_wildcard \n-727 \n-ExternalPort must be a wildcard and cannot be a\n-specific port \n+inactivity_timeout \n+int \n+600 \n
\n-[report issue]\n-\n-enum error_code_enum
\n-Declared in "libtorrent/bdecode.hpp"
\n-\n+if a peer is uninteresting and uninterested for longer than this\n+number of seconds, it will be disconnected.
\n+\n \n+ \n \n name \n-value \n-description \n+type \n+default \n no_error \n-0 \n-Not an error \n+unchoke_interval \n+int \n+15 \n expected_digit \n-1 \n-expected digit in bencoded string \n+
\n+unchoke_interval is the number of seconds between\n+chokes/unchokes. On this interval, peers are re-evaluated for being\n+choked/unchoked. This is defined as 30 seconds in the protocol, and\n+it should be significantly longer than what it takes for TCP to\n+ramp up to it's max rate.
\n+\n+\n+ \n+\n+name \n+type \n+default \n expected_colon \n-2 \n-expected colon in bencoded string \n+optimistic_unchoke_interval \n+int \n+30 \n unexpected_eof \n-3 \n-unexpected end of file in bencoded string \n+
\n+optimistic_unchoke_interval is the number of seconds between\n+each optimistic unchoke. On this timer, the currently\n+optimistically unchoked peer will change.
\n+\n+\n+ \n+\n+name \n+type \n+default \n expected_value \n-4 \n-expected value (list, dict, int or string) in bencoded string \n+num_want \n+int \n+200 \n depth_exceeded \n-5 \n-bencoded recursion depth limit exceeded \n+
\n+num_want is the number of peers we want from each tracker\n+request. It defines what is sent as the &num_want= parameter to\n+the tracker.
\n+\n+\n+ \n+\n+name \n+type \n+default \n limit_exceeded \n-6 \n-bencoded item count limit exceeded \n+initial_picker_threshold \n+int \n+4 \n overflow \n-7 \n-integer overflow \n+
\n+initial_picker_threshold specifies the number of pieces we need\n+before we switch to rarest first picking. The first\n+initial_picker_threshold pieces in any torrent are picked at random\n+, the following pieces are picked in rarest first order.
\n+\n+\n+ \n+\n+name \n+type \n+default \n error_code_max \n-8 \n-the number of error codes \n+allowed_fast_set_size \n+int \n+5 \n
\n-[report issue]\n-\n-enum i2p_error_code
\n-Declared in "libtorrent/i2p_stream.hpp"
\n-\n+the number of allowed pieces to send to peers that supports the\n+fast extensions
\n+\n \n- \n \n name \n-value \n-description \n+type \n+default \n no_error \n-0 \n- \n-parse_failed \n-1 \n- \n+suggest_mode \n+int \n+settings_pack::no_piece_suggestions \n cant_reach_peer \n-2 \n- \n+
\n+suggest_mode controls whether or not libtorrent will send out\n+suggest messages to create a bias of its peers to request certain\n+pieces. The modes are:
\n+\n+- no_piece_suggestions which will not send out suggest messages.
\n+- suggest_read_cache which will send out suggest messages for\n+the most recent pieces that are in the read cache.
\n+
\n+\n+\n+ \n+\n+name \n+type \n+default \n i2p_error \n-3 \n- \n+max_queued_disk_bytes \n+int \n+1024 * 1024 \n invalid_key \n-4 \n- \n+
\n+max_queued_disk_bytes is the maximum number of bytes, to\n+be written to disk, that can wait in the disk I/O thread queue.\n+This queue is only for waiting for the disk I/O thread to receive\n+the job and either write it to disk or insert it in the write\n+cache. When this limit is reached, the peer connections will stop\n+reading data from their sockets, until the disk thread catches up.\n+Setting this too low will severely limit your download rate.
\n+\n+\n+ \n+\n+name \n+type \n+default \n invalid_id \n-5 \n- \n+handshake_timeout \n+int \n+10 \n timeout \n-6 \n- \n+
\n+the number of seconds to wait for a handshake response from a peer.\n+If no response is received within this time, the peer is\n+disconnected.
\n+\n+\n+\n+\n+ \n+\n+name \n+type \n+default \n key_not_found \n-7 \n- \n+send_buffer_low_watermark \n+int \n+10 * 1024 \n duplicated_id \n-8 \n- \n+send_buffer_watermark \n+int \n+500 * 1024 \n num_errors \n-9 \n- \n+send_buffer_watermark_factor \n+int \n+50 \n
\n-[report issue]\n-\n-hasher
\n-Declared in "libtorrent/hasher.hpp"
\n-this is a SHA-1 hash class.
\n-You use it by first instantiating it, then call update() to feed it\n-with data. i.e. you don't have to keep the entire buffer of which you want to\n-create the hash in memory. You can feed the hasher parts of it at a time. When\n-You have fed the hasher with all the data, you call final() and it\n-will return the sha1-hash of the data.
\n-The constructor that takes a char const* and an integer will construct the\n-sha1 context and feed it the data passed in.
\n-If you want to reuse the hasher object once you have created a hash, you have to\n-call reset() to reinitialize it.
\n-The built-in software version of sha1-algorithm was implemented\n-by Steve Reid and released as public domain.\n-For more info, see src/sha1.cpp.
\n-\n-class hasher\n-{\n- hasher ();\n- hasher (hasher const&);\n- explicit hasher (span<char const> data);\n- hasher (char const* data, int len);\n- hasher& operator= (hasher const&) &;\n- hasher& update (char const* data, int len);\n- hasher& update (span<char const> data);\n- sha1_hash final ();\n- void reset ();\n-};\n-\n-\n-[report issue]\n-operator=() hasher()
\n-\n-hasher (hasher const&);\n-explicit hasher (span<char const> data);\n-hasher (char const* data, int len);\n-hasher& operator= (hasher const&) &;\n-
\n-this is the same as default constructing followed by a call to\n-update(data, len).
\n-[report issue]\n-\n-update()
\n-\n-hasher& update (char const* data, int len);\n-hasher& update (span<char const> data);\n-
\n-append the following bytes to what is being hashed
\n-[report issue]\n-\n-final()
\n-\n-sha1_hash final ();\n-
\n-returns the SHA-1 digest of the buffers previously passed to\n-update() and the hasher constructor.
\n-[report issue]\n-\n-reset()
\n-\n-void reset ();\n-
\n-restore the hasher state to be as if the hasher has just been\n-default constructed.
\n-[report issue]\n+send_buffer_low_watermark the minimum send buffer target size\n+(send buffer includes bytes pending being read from disk). For good\n+and snappy seeding performance, set this fairly high, to at least\n+fit a few blocks. This is essentially the initial window size which\n+will determine how fast we can ramp up the send rate
\n+if the send buffer has fewer bytes than send_buffer_watermark,\n+we'll read another 16 kiB block onto it. If set too small, upload\n+rate capacity will suffer. If set too high, memory will be wasted.\n+The actual watermark may be lower than this in case the upload rate\n+is low, this is the upper limit.
\n+the current upload rate to a peer is multiplied by this factor to\n+get the send buffer watermark. The factor is specified as a\n+percentage. i.e. 50 -> 0.5 This product is clamped to the\n+send_buffer_watermark setting to not exceed the max. For high\n+speed upload, this should be set to a greater value than 100. For\n+high capacity connections, setting this higher can improve upload\n+performance and disk throughput. Setting it too high may waste RAM\n+and create a bias towards read jobs over write jobs.
\n+\n+\n+\n+ \n+\n+name \n+type \n+default \n+choking_algorithm \n+int \n+settings_pack::fixed_slots_choker \n+seed_choking_algorithm \n+int \n+settings_pack::round_robin \n+
\n+choking_algorithm specifies which algorithm to use to determine\n+how many peers to unchoke. The unchoking algorithm for\n+downloading torrents is always "tit-for-tat", i.e. the peers we\n+download the fastest from are unchoked.
\n+The options for choking algorithms are defined in the\n+choking_algorithm_t enum.
\n+seed_choking_algorithm controls the seeding unchoke behavior.\n+i.e. How we select which peers to unchoke for seeding torrents.\n+Since a seeding torrent isn't downloading anything, the\n+tit-for-tat mechanism cannot be used. The available options are\n+defined in the seed_choking_algorithm_t enum.
\n+\n+\n+\n+ \n+\n+name \n+type \n+default \n+disk_io_write_mode \n+int \n+DISK_WRITE_MODE \n+disk_io_read_mode \n+int \n+settings_pack::enable_os_cache \n+
\n+determines how files are opened when they're in read only mode\n+versus read and write mode. The options are:
\n+\n+- enable_os_cache
\n+- Files are opened normally, with the OS caching reads and writes.
\n+- disable_os_cache
\n+- This opens all files in no-cache mode. This corresponds to the\n+OS not letting blocks for the files linger in the cache. This\n+makes sense in order to avoid the bittorrent client to\n+potentially evict all other processes' cache by simply handling\n+high throughput and large files. If libtorrent's read cache is\n+disabled, enabling this may reduce performance.
\n+- write_through
\n+- flush pieces to disk as they complete validation.
\n+
\n+One reason to disable caching is that it may help the operating\n+system from growing its file cache indefinitely.
\n+\n+\n+\n+ \n+\n+name \n+type \n+default \n+outgoing_port \n+int \n+0 \n+num_outgoing_ports \n+int \n+0 \n+
\n+this is the first port to use for binding outgoing connections to.\n+This is useful for users that have routers that allow QoS settings\n+based on local port. when binding outgoing connections to specific\n+ports, num_outgoing_ports is the size of the range. It should\n+be more than a few
\n+\n+Warning
\n+setting outgoing ports will limit the ability to keep\n+multiple connections to the same client, even for different\n+torrents. It is not recommended to change this setting. Its main\n+purpose is to use as an escape hatch for cheap routers with QoS\n+capability but can only classify flows based on port numbers.
\n \n-\n-hasher256
\n-Declared in "libtorrent/hasher.hpp"
\n+It is a range instead of a single port because of the problems with\n+failing to reconnect to peers if a previous socket to that peer and\n+port is in TIME_WAIT state.
\n+\n+\n+ \n+\n+name \n+type \n+default \n+peer_dscp \n+int \n+0x04 \n+
\n+peer_dscp determines the DSCP field in the IP header of every\n+packet sent to peers (including web seeds). 0x0 means no marking,\n+0x04 represents Lower Effort. For more details see RFC 8622.
\n+peer_tos is the backwards compatible name for this setting.
\n+\n+\n+\n+\n+\n+\n+\n+\n+ \n+\n+name \n+type \n+default \n+active_downloads \n+int \n+3 \n+active_seeds \n+int \n+5 \n+active_checking \n+int \n+1 \n+active_dht_limit \n+int \n+88 \n+active_tracker_limit \n+int \n+1600 \n+active_lsd_limit \n+int \n+60 \n+active_limit \n+int \n+500 \n+
\n+for auto managed torrents, these are the limits they are subject\n+to. If there are too many torrents some of the auto managed ones\n+will be paused until some slots free up. active_downloads and\n+active_seeds controls how many active seeding and downloading\n+torrents the queuing mechanism allows. The target number of active\n+torrents is min(active_downloads + active_seeds, active_limit).\n+active_downloads and active_seeds are upper limits on the\n+number of downloading torrents and seeding torrents respectively.\n+Setting the value to -1 means unlimited.
\n+For example if there are 10 seeding torrents and 10 downloading\n+torrents, and active_downloads is 4 and active_seeds is 4,\n+there will be 4 seeds active and 4 downloading torrents. If the\n+settings are active_downloads = 2 and active_seeds = 4,\n+then there will be 2 downloading torrents and 4 seeding torrents\n+active. Torrents that are not auto managed are not counted against\n+these limits.
\n+active_checking is the limit of number of simultaneous checking\n+torrents.
\n+active_limit is a hard limit on the number of active (auto\n+managed) torrents. This limit also applies to slow torrents.
\n+active_dht_limit is the max number of torrents to announce to\n+the DHT.
\n+active_tracker_limit is the max number of torrents to announce\n+to their trackers.
\n+active_lsd_limit is the max number of torrents to announce to\n+the local network over the local service discovery protocol.
\n+You can have more torrents active, even though they are not\n+announced to the DHT, lsd or their tracker. If some peer knows\n+about you for any reason and tries to connect, it will still be\n+accepted, unless the torrent is paused, which means it won't accept\n+any connections.
\n+\n+\n+ \n+\n+name \n+type \n+default \n+auto_manage_interval \n+int \n+30 \n+
\n+auto_manage_interval is the number of seconds between the\n+torrent queue is updated, and rotated.
\n+\n+\n+ \n+\n+name \n+type \n+default \n+seed_time_limit \n+int \n+24 * 60 * 60 \n+
\n+this is the limit on the time a torrent has been an active seed\n+(specified in seconds) before it is considered having met the seed\n+limit criteria. See queuing.
\n+\n+\n+\n+ \n+\n+name \n+type \n+default \n+auto_scrape_interval \n+int \n+1800 \n+auto_scrape_min_interval \n+int \n+300 \n+
\n+auto_scrape_interval is the number of seconds between scrapes\n+of queued torrents (auto managed and paused torrents). Auto managed\n+torrents that are paused, are scraped regularly in order to keep\n+track of their downloader/seed ratio. This ratio is used to\n+determine which torrents to seed and which to pause.
\n+auto_scrape_min_interval is the minimum number of seconds\n+between any automatic scrape (regardless of torrent). In case there\n+are a large number of paused auto managed torrents, this puts a\n+limit on how often a scrape request is sent.
\n+\n+\n+\n+ \n+\n+name \n+type \n+default \n+max_peerlist_size \n+int \n+3000 \n+max_paused_peerlist_size \n+int \n+1000 \n+
\n+max_peerlist_size is the maximum number of peers in the list of\n+known peers. These peers are not necessarily connected, so this\n+number should be much greater than the maximum number of connected\n+peers. Peers are evicted from the cache when the list grows passed\n+90% of this limit, and once the size hits the limit, peers are no\n+longer added to the list. If this limit is set to 0, there is no\n+limit on how many peers we'll keep in the peer list.
\n+max_paused_peerlist_size is the max peer list size used for\n+torrents that are paused. This can be used to save memory for paused\n+torrents, since it's not as important for them to keep a large peer\n+list.
\n+\n+\n+ \n+\n+name \n+type \n+default \n+min_announce_interval \n+int \n+5 * 60 \n+
\n+this is the minimum allowed announce interval for a tracker. This\n+is specified in seconds and is used as a sanity check on what is\n+returned from a tracker. It mitigates hammering mis-configured\n+trackers.
\n+\n+\n+ \n+\n+name \n+type \n+default \n+auto_manage_startup \n+int \n+60 \n+
\n+this is the number of seconds a torrent is considered active after\n+it was started, regardless of upload and download speed. This is so\n+that newly started torrents are not considered inactive until they\n+have a fair chance to start downloading.
\n+\n+\n+ \n+\n+name \n+type \n+default \n+seeding_piece_quota \n+int \n+20 \n+
\n+seeding_piece_quota is the number of pieces to send to a peer,\n+when seeding, before rotating in another peer to the unchoke set.
\n+\n+\n+ \n+\n+name \n+type \n+default \n+max_rejects \n+int \n+50 \n+
\n+max_rejects is the number of piece requests we will reject in a\n+row while a peer is choked before the peer is considered abusive\n+and is disconnected.
\n+\n+\n+\n+ \n+\n+name \n+type \n+default \n+recv_socket_buffer_size \n+int \n+0 \n+send_socket_buffer_size \n+int \n+0 \n+
\n+specifies the buffer sizes set on peer sockets. 0 means the OS\n+default (i.e. don't change the buffer sizes).\n+The socket buffer sizes are changed using setsockopt() with\n+SOL_SOCKET/SO_RCVBUF and SO_SNDBUFFER.
\n+Note that uTP peers share a single UDP socket buffer for each of the\n+listen_interfaces, along with DHT and UDP tracker traffic.\n+If the buffer size is too small for the combined traffic through the\n+socket, packets may be dropped.
\n+\n+\n+ \n+\n+name \n+type \n+default \n+max_peer_recv_buffer_size \n+int \n+2 * 1024 * 1024 \n+
\n+the max number of bytes a single peer connection's receive buffer is\n+allowed to grow to.
\n+\n+\n+ \n+\n+name \n+type \n+default \n+optimistic_disk_retry \n+int \n+10 * 60 \n+
\n+optimistic_disk_retry is the number of seconds from a disk\n+write errors occur on a torrent until libtorrent will take it out\n+of the upload mode, to test if the error condition has been fixed.
\n+libtorrent will only do this automatically for auto managed\n+torrents.
\n+You can explicitly take a torrent out of upload only mode using\n+set_upload_mode().
\n+\n+\n+ \n+\n+name \n+type \n+default \n+max_suggest_pieces \n+int \n+16 \n+
\n+max_suggest_pieces is the max number of suggested piece indices\n+received from a peer that's remembered. If a peer floods suggest\n+messages, this limit prevents libtorrent from using too much RAM.
\n+\n+\n+ \n+\n+name \n+type \n+default \n+local_service_announce_interval \n+int \n+5 * 60 \n+
\n+local_service_announce_interval is the time between local\n+network announces for a torrent.\n+This interval is specified in seconds.
\n+\n+\n+ \n+\n+name \n+type \n+default \n+dht_announce_interval \n+int \n+15 * 60 \n+
\n+dht_announce_interval is the number of seconds between\n+announcing torrents to the distributed hash table (DHT).
\n+\n+\n+ \n+\n+name \n+type \n+default \n+udp_tracker_token_expiry \n+int \n+60 \n+
\n+udp_tracker_token_expiry is the number of seconds libtorrent\n+will keep UDP tracker connection tokens around for. This is\n+specified to be 60 seconds. The higher this\n+value is, the fewer packets have to be sent to the UDP tracker. In\n+order for higher values to work, the tracker needs to be configured\n+to match the expiration time for tokens.
\n+\n+\n+ \n+\n+name \n+type \n+default \n+num_optimistic_unchoke_slots \n+int \n+0 \n+
\n+num_optimistic_unchoke_slots is the number of optimistic\n+unchoke slots to use.\n+Having a higher number of optimistic unchoke slots mean you will\n+find the good peers faster but with the trade-off to use up more\n+bandwidth. 0 means automatic, where libtorrent opens up 20% of your\n+allowed upload slots as optimistic unchoke slots.
\n+\n+\n+ \n+\n+name \n+type \n+default \n+max_pex_peers \n+int \n+50 \n+
\n+the max number of peers we accept from pex messages from a single\n+peer. this limits the number of concurrent peers any of our peers\n+claims to be connected to. If they claim to be connected to more\n+than this, we'll ignore any peer that exceeds this limit
\n+\n+\n+ \n+\n+name \n+type \n+default \n+tick_interval \n+int \n+500 \n+
\n+tick_interval specifies the number of milliseconds between\n+internal ticks. This is the frequency with which bandwidth quota is\n+distributed to peers. It should not be more than one second (i.e.\n+1000 ms). Setting this to a low value (around 100) means higher\n+resolution bandwidth quota distribution, setting it to a higher\n+value saves CPU cycles.
\n+\n+\n+ \n+\n+name \n+type \n+default \n+share_mode_target \n+int \n+3 \n+
\n+share_mode_target specifies the target share ratio for share\n+mode torrents. If set to 3, we'll try to upload 3\n+times as much as we download. Setting this very high, will make it\n+very conservative and you might end up not downloading anything\n+ever (and not affecting your share ratio). It does not make any\n+sense to set this any lower than 2. For instance, if only 3 peers\n+need to download the rarest piece, it's impossible to download a\n+single piece and upload it more than 3 times. If the\n+share_mode_target is set to more than 3, nothing is downloaded.
\n+\n+\n+\n+ \n+\n+name \n+type \n+default \n+upload_rate_limit \n+int \n+0 \n+download_rate_limit \n+int \n+0 \n+
\n+upload_rate_limit and download_rate_limit sets\n+the session-global limits of upload and download rate limits, in\n+bytes per second. By default peers on the local network are not rate\n+limited.
\n+A value of 0 means unlimited.
\n+For fine grained control over rate limits, including making them apply\n+to local peers, see peer classes.
\n+\n+\n+ \n+\n+name \n+type \n+default \n+dht_upload_rate_limit \n+int \n+8000 \n+
\n+the number of bytes per second (on average) the DHT is allowed to send.\n+If the incoming requests causes to many bytes to be sent in responses,\n+incoming requests will be dropped until the quota has been replenished.
\n+\n+\n+ \n+\n+name \n+type \n+default \n+unchoke_slots_limit \n+int \n+8 \n+
\n+unchoke_slots_limit is the max number of unchoked peers in the\n+session. The number of unchoke slots may be ignored depending on\n+what choking_algorithm is set to. Setting this limit to -1\n+means unlimited, i.e. all peers will always be unchoked.
\n+\n+\n+ \n+\n+name \n+type \n+default \n+connections_limit \n+int \n+200 \n+
\n+connections_limit sets a global limit on the number of\n+connections opened. The number of connections is set to a hard\n+minimum of at least two per torrent, so if you set a too low\n+connections limit, and open too many torrents, the limit will not\n+be met.
\n+\n+\n+ \n+\n+name \n+type \n+default \n+connections_slack \n+int \n+10 \n+
\n+connections_slack is the number of incoming connections\n+exceeding the connection limit to accept in order to potentially\n+replace existing ones.
\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+ \n+\n+name \n+type \n+default \n+utp_target_delay \n+int \n+100 \n+utp_gain_factor \n+int \n+3000 \n+utp_min_timeout \n+int \n+500 \n+utp_syn_resends \n+int \n+2 \n+utp_fin_resends \n+int \n+2 \n+utp_num_resends \n+int \n+3 \n+utp_connect_timeout \n+int \n+3000 \n+utp_loss_multiplier \n+int \n+50 \n+
\n+utp_target_delay is the target delay for uTP sockets in\n+milliseconds. A high value will make uTP connections more\n+aggressive and cause longer queues in the upload bottleneck. It\n+cannot be too low, since the noise in the measurements would cause\n+it to send too slow.\n+utp_gain_factor is the number of bytes the uTP congestion\n+window can increase at the most in one RTT.\n+If this is set too high, the congestion controller reacts\n+too hard to noise and will not be stable, if it's set too low, it\n+will react slow to congestion and not back off as fast.
\n+utp_min_timeout is the shortest allowed uTP socket timeout,\n+specified in milliseconds. The\n+timeout depends on the RTT of the connection, but is never smaller\n+than this value. A connection times out when every packet in a\n+window is lost, or when a packet is lost twice in a row (i.e. the\n+resent packet is lost as well).
\n+The shorter the timeout is, the faster the connection will recover\n+from this situation, assuming the RTT is low enough.\n+utp_syn_resends is the number of SYN packets that are sent (and\n+timed out) before giving up and closing the socket.\n+utp_num_resends is the number of times a packet is sent (and\n+lost or timed out) before giving up and closing the connection.\n+utp_connect_timeout is the number of milliseconds of timeout\n+for the initial SYN packet for uTP connections. For each timed out\n+packet (in a row), the timeout is doubled. utp_loss_multiplier\n+controls how the congestion window is changed when a packet loss is\n+experienced. It's specified as a percentage multiplier for\n+cwnd. Do not change this value unless you know what you're doing.\n+Never set it higher than 100.
\n+\n+\n+ \n+\n+name \n+type \n+default \n+mixed_mode_algorithm \n+int \n+settings_pack::peer_proportional \n+
\n+The mixed_mode_algorithm determines how to treat TCP\n+connections when there are uTP connections. Since uTP is designed\n+to yield to TCP, there's an inherent problem when using swarms that\n+have both TCP and uTP connections. If nothing is done, uTP\n+connections would often be starved out for bandwidth by the TCP\n+connections. This mode is prefer_tcp. The peer_proportional\n+mode simply looks at the current throughput and rate limits all TCP\n+connections to their proportional share based on how many of the\n+connections are TCP. This works best if uTP connections are not\n+rate limited by the global rate limiter (which they aren't by\n+default).
\n+\n+\n+ \n+\n+name \n+type \n+default \n+listen_queue_size \n+int \n+5 \n+
\n+listen_queue_size is the value passed in to listen() for the\n+listen socket. It is the number of outstanding incoming connections\n+to queue up while we're not actively waiting for a connection to be\n+accepted. 5 should be sufficient for any\n+normal client. If this is a high performance server which expects\n+to receive a lot of connections, or used in a simulator or test, it\n+might make sense to raise this number. It will not take affect\n+until the listen_interfaces settings is updated.
\n+\n+\n+ \n+\n+name \n+type \n+default \n+torrent_connect_boost \n+int \n+30 \n+
\n+torrent_connect_boost is the number of peers to try to connect\n+to immediately when the first tracker response is received for a\n+torrent. This is a boost to given to new torrents to accelerate\n+them starting up. The normal connect scheduler is run once every\n+second, this allows peers to be connected immediately instead of\n+waiting for the session tick to trigger connections.\n+This may not be set higher than 255.
\n+\n+\n+ \n+\n+name \n+type \n+default \n+alert_queue_size \n+int \n+2000 \n+
\n+alert_queue_size is the maximum number of alerts queued up\n+internally. If alerts are not popped, the queue will eventually\n+fill up to this level. Once the alert queue is full, additional\n+alerts will be dropped, and not delivered to the client. Once the\n+client drains the queue, new alerts may be delivered again. In order\n+to know that alerts have been dropped, see\n+session_handle::dropped_alerts().
\n+\n+\n+ \n+\n+name \n+type \n+default \n+max_metadata_size \n+int \n+3 * 1024 * 10240 \n+
\n+max_metadata_size is the maximum allowed size (in bytes) to be\n+received by the metadata extension, i.e. magnet links.
\n+\n+\n+ \n+\n+name \n+type \n+default \n+hashing_threads \n+int \n+1 \n+
\n+hashing_threads is the number of disk I/O threads to use for\n+piece hash verification. These threads are in addition to the\n+regular disk I/O threads specified by settings_pack::aio_threads.\n+These threads are only used for full checking of torrents. The\n+hash checking done while downloading are done by the regular disk\n+I/O threads.\n+The hasher threads do not only compute hashes, but also perform\n+the read from disk. On storage optimal for sequential access,\n+such as hard drives, this setting should be set to 1, which is\n+also the default.
\n+\n+\n+ \n+\n+name \n+type \n+default \n+checking_mem_usage \n+int \n+256 \n+
\n+the number of blocks to keep outstanding at any given time when\n+checking torrents. Higher numbers give faster re-checks but uses\n+more memory. Specified in number of 16 kiB blocks
\n+\n+\n+ \n+\n+name \n+type \n+default \n+predictive_piece_announce \n+int \n+0 \n+
\n+if set to > 0, pieces will be announced to other peers before they\n+are fully downloaded (and before they are hash checked). The\n+intention is to gain 1.5 potential round trip times per downloaded\n+piece. When non-zero, this indicates how many milliseconds in\n+advance pieces should be announced, before they are expected to be\n+completed.
\n+\n+\n+ \n+\n+name \n+type \n+default \n+aio_threads \n+int \n+10 \n+
\n+for some aio back-ends, aio_threads specifies the number of\n+io-threads to use.
\n+\n+\n+ \n+\n+name \n+type \n+default \n+tracker_backoff \n+int \n+250 \n+
\n+tracker_backoff determines how aggressively to back off from\n+retrying failing trackers. This value determines x in the\n+following formula, determining the number of seconds to wait until\n+the next retry:
\n+\n+delay = 5 + 5 * x / 100 * fails^2
\n+This setting may be useful to make libtorrent more or less\n+aggressive in hitting trackers.
\n+\n+\n+\n+ \n+\n+name \n+type \n+default \n+share_ratio_limit \n+int \n+200 \n+seed_time_ratio_limit \n+int \n+700 \n+
\n+when a seeding torrent reaches either the share ratio (bytes up /\n+bytes down) or the seed time ratio (seconds as seed / seconds as\n+downloader) or the seed time limit (seconds as seed) it is\n+considered done, and it will leave room for other torrents. These\n+are specified as percentages. Torrents that are considered done will\n+still be allowed to be seeded, they just won't have priority anymore.\n+For more, see queuing.
\n+\n+\n+\n+\n+ \n+\n+name \n+type \n+default \n+peer_turnover \n+int \n+4 \n+peer_turnover_cutoff \n+int \n+90 \n+peer_turnover_interval \n+int \n+300 \n+
\n+peer_turnover is the percentage of peers to disconnect every\n+turnover peer_turnover_interval (if we're at the peer limit), this\n+is specified in percent when we are connected to more than limit *\n+peer_turnover_cutoff peers disconnect peer_turnover fraction of the\n+peers. It is specified in percent peer_turnover_interval is the\n+interval (in seconds) between optimistic disconnects if the\n+disconnects happen and how many peers are disconnected is\n+controlled by peer_turnover and peer_turnover_cutoff
\n+\n+\n+ \n+\n+name \n+type \n+default \n+connect_seed_every_n_download \n+int \n+10 \n+
\n+this setting controls the priority of downloading torrents over\n+seeding or finished torrents when it comes to making peer\n+connections. Peer connections are throttled by the connection_speed\n+and the half-open connection limit. This makes peer connections a\n+limited resource. Torrents that still have pieces to download are\n+prioritized by default, to avoid having many seeding torrents use\n+most of the connection attempts and only give one peer every now\n+and then to the downloading torrent. libtorrent will loop over the\n+downloading torrents to connect a peer each, and every n:th\n+connection attempt, a finished torrent is picked to be allowed to\n+connect to a peer. This setting controls n.
\n+\n+\n+ \n+\n+name \n+type \n+default \n+max_http_recv_buffer_size \n+int \n+4*1024*204 \n+
\n+the max number of bytes to allow an HTTP response to be when\n+announcing to trackers or downloading .torrent files via the\n+url provided in add_torrent_params.
\n+\n+\n+ \n+\n+name \n+type \n+default \n+max_retry_port_bind \n+int \n+10 \n+
\n+if binding to a specific port fails, should the port be incremented\n+by one and tried again? This setting specifies how many times to\n+retry a failed port bind
\n+\n+\n+ \n+\n+name \n+type \n+default \n+alert_mask \n+int \n+int \n+
\n+a bitmask combining flags from alert_category_t defining which\n+kinds of alerts to receive
\n+\n+\n+\n+ \n+\n+name \n+type \n+default \n+out_enc_policy \n+int \n+settings_pack::pe_enabled \n+in_enc_policy \n+int \n+settings_pack::pe_enabled \n+
\n+control the settings for incoming and outgoing connections\n+respectively. see enc_policy enum for the available options.\n+Keep in mind that protocol encryption degrades performance in\n+several respects:
\n+\n+- It prevents "zero copy" disk buffers being sent to peers, since\n+each peer needs to mutate the data (i.e. encrypt it) the data\n+must be copied per peer connection rather than sending the same\n+buffer to multiple peers.
\n+- The encryption itself requires more CPU than plain bittorrent\n+protocol. The highest cost is the Diffie Hellman exchange on\n+connection setup.
\n+- The encryption handshake adds several round-trips to the\n+connection setup, and delays transferring data.
\n+
\n+\n+\n+ \n+\n+name \n+type \n+default \n+allowed_enc_level \n+int \n+settings_pack::pe_both \n+
\n+determines the encryption level of the connections. This setting\n+will adjust which encryption scheme is offered to the other peer,\n+as well as which encryption scheme is selected by the client. See\n+enc_level enum for options.
\n+\n+\n+\n+ \n+\n+name \n+type \n+default \n+inactive_down_rate \n+int \n+2048 \n+inactive_up_rate \n+int \n+2048 \n+
\n+the download and upload rate limits for a torrent to be considered\n+active by the queuing mechanism. A torrent whose download rate is\n+less than inactive_down_rate and whose upload rate is less than\n+inactive_up_rate for auto_manage_startup seconds, is\n+considered inactive, and another queued torrent may be started.\n+This logic is disabled if dont_count_slow_torrents is false.
\n+\n+\n+ \n+\n+name \n+type \n+default \n+proxy_type \n+int \n+settings_pack::none \n+
\n+proxy to use. see proxy_type_t.
\n+\n+\n+ \n+\n+name \n+type \n+default \n+proxy_port \n+int \n+0 \n+
\n+the port of the proxy server
\n+\n+\n+ \n+\n+name \n+type \n+default \n+i2p_port \n+int \n+0 \n+
\n+sets the i2p SAM bridge port to connect to. set the hostname with\n+the i2p_hostname setting.
\n+\n+\n+ \n+\n+name \n+type \n+default \n+urlseed_max_request_bytes \n+int \n+16 * 1024 * 1024 \n+
\n+The maximum request range of an url seed in bytes. This value\n+defines the largest possible sequential web seed request. Lower values\n+are possible but will be ignored if they are lower then piece size.\n+This value should be related to your download speed to prevent\n+libtorrent from creating too many expensive http requests per\n+second. You can select a value as high as you want but keep in mind\n+that libtorrent can't create parallel requests if the first request\n+did already select the whole file.\n+If you combine bittorrent seeds with web seeds and pick strategies\n+like rarest first you may find your web seed requests split into\n+smaller parts because we don't download already picked pieces\n+twice.
\n+\n+\n+ \n+\n+name \n+type \n+default \n+web_seed_name_lookup_retry \n+int \n+1800 \n+
\n+time to wait until a new retry of a web seed name lookup
\n+\n+\n+ \n+\n+name \n+type \n+default \n+close_file_interval \n+int \n+CLOSE_FILE_INTERVAL \n+
\n+the number of seconds between closing the file opened the longest\n+ago. 0 means to disable the feature. The purpose of this is to\n+periodically close files to trigger the operating system flushing\n+disk cache. Specifically it has been observed to be required on\n+windows to not have the disk cache grow indefinitely.\n+This defaults to 240 seconds on windows, and disabled on other\n+systems.
\n+\n+\n+ \n+\n+name \n+type \n+default \n+utp_cwnd_reduce_timer \n+int \n+100 \n+
\n+When uTP experiences packet loss, it will reduce the congestion\n+window, and not reduce it again for this many milliseconds, even if\n+experiencing another lost packet.
\n+\n+\n+ \n+\n+name \n+type \n+default \n+max_web_seed_connections \n+int \n+3 \n+
\n+the max number of web seeds to have connected per torrent at any\n+given time.
\n+\n+\n+ \n+\n+name \n+type \n+default \n+resolver_cache_timeout \n+int \n+1200 \n+
\n+the number of seconds before the internal host name resolver\n+considers a cache value timed out, negative values are interpreted\n+as zero.
\n+\n+\n+ \n+\n+name \n+type \n+default \n+send_not_sent_low_watermark \n+int \n+16384 \n+
\n+specify the not-sent low watermark for socket send buffers. This\n+corresponds to the, Linux-specific, TCP_NOTSENT_LOWAT TCP socket\n+option.
\n+\n+\n+ \n+\n+name \n+type \n+default \n+rate_choker_initial_threshold \n+int \n+1024 \n+
\n+the rate based choker compares the upload rate to peers against a\n+threshold that increases proportionally by its size for every\n+peer it visits, visiting peers in decreasing upload rate. The\n+number of upload slots is determined by the number of peers whose\n+upload rate exceeds the threshold. This option sets the start\n+value for this threshold. A higher value leads to fewer unchoke\n+slots, a lower value leads to more.
\n+\n+\n+ \n+\n+name \n+type \n+default \n+upnp_lease_duration \n+int \n+3600 \n+
\n+The expiration time of UPnP port-mappings, specified in seconds. 0\n+means permanent lease. Some routers do not support expiration times\n+on port-maps (nor correctly returning an error indicating lack of\n+support). In those cases, set this to 0. Otherwise, don't set it any\n+lower than 5 minutes.
\n+\n+\n+ \n+\n+name \n+type \n+default \n+max_concurrent_http_announces \n+int \n+50 \n+
\n+limits the number of concurrent HTTP tracker announces. Once the\n+limit is hit, tracker requests are queued and issued when an\n+outstanding announce completes.
\n+\n+\n+ \n+\n+name \n+type \n+default \n+dht_max_peers_reply \n+int \n+100 \n+
\n+the maximum number of peers to send in a reply to get_peers
\n+\n+\n+ \n+\n+name \n+type \n+default \n+dht_search_branching \n+int \n+5 \n+
\n+the number of concurrent search request the node will send when\n+announcing and refreshing the routing table. This parameter is called\n+alpha in the kademlia paper
\n+\n+\n+ \n+\n+name \n+type \n+default \n+dht_max_fail_count \n+int \n+20 \n+
\n+the maximum number of failed tries to contact a node before it is\n+removed from the routing table. If there are known working nodes that\n+are ready to replace a failing node, it will be replaced immediately,\n+this limit is only used to clear out nodes that don't have any node\n+that can replace them.
\n+\n+\n+ \n+\n+name \n+type \n+default \n+dht_max_torrents \n+int \n+2000 \n+
\n+the total number of torrents to track from the DHT. This is simply an\n+upper limit to make sure malicious DHT nodes cannot make us allocate\n+an unbounded amount of memory.
\n+\n+\n+ \n+\n+name \n+type \n+default \n+dht_max_dht_items \n+int \n+700 \n+
\n+max number of items the DHT will store
\n+\n+\n+ \n+\n+name \n+type \n+default \n+dht_max_peers \n+int \n+500 \n+
\n+the max number of peers to store per torrent (for the DHT)
\n+\n+\n+ \n+\n+name \n+type \n+default \n+dht_max_torrent_search_reply \n+int \n+20 \n+
\n+the max number of torrents to return in a torrent search query to the\n+DHT
\n+\n+\n+ \n+\n+name \n+type \n+default \n+dht_block_timeout \n+int \n+5 * 60 \n+
\n+the number of seconds a DHT node is banned if it exceeds the rate\n+limit. The rate limit is averaged over 10 seconds to allow for bursts\n+above the limit.
\n+\n+\n+ \n+\n+name \n+type \n+default \n+dht_block_ratelimit \n+int \n+5 \n+
\n+the max number of packets per second a DHT node is allowed to send\n+without getting banned.
\n+\n+\n+ \n+\n+name \n+type \n+default \n+dht_item_lifetime \n+int \n+0 \n+
\n+the number of seconds a immutable/mutable item will be expired.\n+default is 0, means never expires.
\n+\n+\n+ \n+\n+name \n+type \n+default \n+dht_sample_infohashes_interval \n+int \n+21600 \n+
\n+the info-hashes sample recomputation interval (in seconds).\n+The node will precompute a subset of the tracked info-hashes and return\n+that instead of calculating it upon each request. The permissible range\n+is between 0 and 21600 seconds (inclusive).
\n+\n+\n+ \n+\n+name \n+type \n+default \n+dht_max_infohashes_sample_count \n+int \n+20 \n+
\n+the maximum number of elements in the sampled subset of info-hashes.\n+If this number is too big, expect the DHT storage implementations\n+to clamp it in order to allow UDP packets go through
\n+\n+\n+ \n+\n+name \n+type \n+default \n+max_piece_count \n+int \n+0x200000 \n+
\n+max_piece_count is the maximum allowed number of pieces in\n+metadata received via magnet links. Loading large torrents (with\n+more pieces than the default limit) may also require passing in\n+a higher limit to read_resume_data() and\n+torrent_info::parse_info_section(), if those are used.
\n+\n+\n+ \n+\n+name \n+type \n+default \n+metadata_token_limit \n+int \n+2500000 \n+
\n+when receiving metadata (torrent file) from peers, this is the\n+max number of bencoded tokens we're willing to parse. This limit\n+is meant to prevent DoS attacks on peers. For very large\n+torrents, this limit may have to be raised.
\n+\n+\n+ \n+\n+name \n+type \n+default \n+disk_write_mode \n+int \n+settings_pack::mmap_write_mode_t::auto_mmap_write \n+
\n+controls whether disk writes will be made through a memory mapped\n+file or via normal write calls. This only affects the\n+mmap_disk_io. When saving to a non-local drive (network share,\n+NFS or NAS) using memory mapped files is most likely inferior.\n+When writing to a local SSD (especially in DAX mode) using memory\n+mapped files likely gives the best performance.\n+The values for this setting are specified as mmap_write_mode_t.
\n+\n+\n+ \n+\n+name \n+type \n+default \n+mmap_file_size_cutoff \n+int \n+40 \n+
\n+when using mmap_disk_io, files smaller than this number of blocks\n+will not be memory mapped, but will use normal pread/pwrite\n+operations. This file size limit is specified in 16 kiB blocks.
\n+\n+\n+\n+\n+\n+ \n+\n+name \n+type \n+default \n+i2p_inbound_quantity \n+int \n+3 \n+i2p_outbound_quantity \n+int \n+3 \n+i2p_inbound_length \n+int \n+3 \n+i2p_outbound_length \n+int \n+3 \n+
\n+Configures the SAM session\n+quantity of I2P inbound and outbound tunnels [1..16].\n+number of hops for I2P inbound and outbound tunnels [0..7]\n+Changing these will not trigger a reconnect to the SAM bridge,\n+they will take effect the next time the SAM connection is\n+re-established (by restarting or changing i2p_hostname or\n+i2p_port).
\n \n-class hasher256\n+struct settings_pack final : settings_interface\n {\n- hasher256 ();\n- hasher256 (char const* data, int len);\n- explicit hasher256 (span<char const> data);\n- hasher256 (hasher256 const&);\n- hasher256& operator= (hasher256 const&) &;\n- hasher256& update (char const* data, int len);\n- hasher256& update (span<char const> data);\n- sha256_hash final ();\n- void reset ();\n- ~hasher256 ();\n+ friend void apply_pack_impl (settings_pack const*\n+ , aux::session_settings_single_thread&\n+ , std::vector<void(aux::session_impl::*)()>*);\n+ void set_bool (int name, bool val) override;\n+ void set_int (int name, flags::bitfield_flag<Type, Tag> const val);\n+ void set_int (int name, int val) override;\n+ void set_str (int name, std::string val) override;\n+ bool has_val (int name) const override;\n+ void clear ();\n+ void clear (int name);\n+ std::string const& get_str (int name) const override;\n+ int get_int (int name) const override;\n+ bool get_bool (int name) const override;\n+ void for_each (Fun&& f) const;\n+\n+ enum type_bases\n+ {\n+ string_type_base,\n+ int_type_base,\n+ bool_type_base,\n+ type_mask,\n+ index_mask,\n+ };\n+\n+ enum mmap_write_mode_t\n+ {\n+ always_pwrite,\n+ always_mmap_write,\n+ auto_mmap_write,\n+ };\n+\n+ enum suggest_mode_t\n+ {\n+ no_piece_suggestions,\n+ suggest_read_cache,\n+ };\n+\n+ enum choking_algorithm_t\n+ {\n+ fixed_slots_choker,\n+ rate_based_choker,\n+ deprecated_bittyrant_choker,\n+ };\n+\n+ enum seed_choking_algorithm_t\n+ {\n+ round_robin,\n+ fastest_upload,\n+ anti_leech,\n+ };\n+\n+ enum io_buffer_mode_t\n+ {\n+ enable_os_cache,\n+ deprecated_disable_os_cache_for_aligned_files,\n+ disable_os_cache,\n+ write_through,\n+ };\n+\n+ enum bandwidth_mixed_algo_t\n+ {\n+ prefer_tcp,\n+ peer_proportional,\n+ };\n+\n+ enum enc_policy\n+ {\n+ pe_forced,\n+ pe_enabled,\n+ pe_disabled,\n+ };\n+\n+ enum enc_level\n+ {\n+ pe_plaintext,\n+ pe_rc4,\n+ pe_both,\n+ };\n+\n+ enum proxy_type_t\n+ {\n+ none,\n+ socks4,\n+ socks5,\n+ socks5_pw,\n+ http,\n+ http_pw,\n+ };\n };\n \n-\n-[report issue]\n-operator=() hasher256()
\n+\n+\n+[report issue]\n+set_str() set_int() set_bool()
\n \n-hasher256 (char const* data, int len);\n-explicit hasher256 (span<char const> data);\n-hasher256 (hasher256 const&);\n-hasher256& operator= (hasher256 const&) &;\n+void set_bool (int name, bool val) override;\n+void set_int (int name, flags::bitfield_flag<Type, Tag> const val);\n+void set_int (int name, int val) override;\n+void set_str (int name, std::string val) override;\n
\n-this is the same as default constructing followed by a call to\n-update(data, len).
\n-[report issue]\n-\n-update()
\n+set a configuration option in the settings_pack. name is one of\n+the enum values from string_types, int_types or bool_types. They must\n+match the respective type of the set_* function.
\n+[report issue]\n+\n+has_val()
\n \n-hasher256& update (char const* data, int len);\n-hasher256& update (span<char const> data);\n+bool has_val (int name) const override;\n
\n-append the following bytes to what is being hashed
\n-[report issue]\n-\n-final()
\n+queries whether the specified configuration option has a value set in\n+this pack. name can be any enumeration value from string_types,\n+int_types or bool_types.
\n+[report issue]\n+\n+clear()
\n \n-sha256_hash final ();\n+void clear ();\n
\n-returns the SHA-1 digest of the buffers previously passed to\n-update() and the hasher constructor.
\n-[report issue]\n-\n+\n+clear()
\n \n-void reset ();\n+void clear (int name);\n
\n-restore the hasher state to be as if the hasher has just been\n-default constructed.
\n-[report issue]\n-\n-\n-bitfield
\n-Declared in "libtorrent/bitfield.hpp"
\n-The bitfield type stores any number of bits as a bitfield\n-in a heap allocated array.
\n+clear a specific setting from the pack
\n+\n+\n+[report issue]\n+\n+get_bool() get_str() get_int()
\n \n-struct bitfield\n-{\n- bitfield (bitfield const& rhs);\n- bitfield (bitfield&& rhs) noexcept = default;\n- bitfield () noexcept = default;\n- bitfield (int bits, bool val);\n- bitfield (char const* b, int bits);\n- explicit bitfield (int bits);\n- void assign (char const* b, int const bits);\n- bool get_bit (int index) const noexcept;\n- bool operator[] (int index) const noexcept;\n- void clear_bit (int index) noexcept;\n- void set_bit (int index) noexcept;\n- bool all_set () const noexcept;\n- bool none_set () const noexcept;\n- int size () const noexcept;\n- int num_words () const noexcept;\n- int num_bytes () const noexcept;\n- bool empty () const noexcept;\n- char const* data () const noexcept;\n- char* data () noexcept;\n- void swap (bitfield& rhs) noexcept;\n- int count () const noexcept;\n- int find_first_set () const noexcept;\n- int find_last_clear () const noexcept;\n- bool operator== (lt::bitfield const& rhs) const;\n-};\n+std::string const& get_str (int name) const override;\n+int get_int (int name) const override;\n+bool get_bool (int name) const override;\n \n-[report issue]\n-bitfield()
\n+queries the current configuration option from the settings_pack.\n+name is one of the enumeration values from string_types, int_types\n+or bool_types. The enum value must match the type of the get_*\n+function. If the specified setting field has not been set, the default\n+value is returned.
\n+[report issue]\n+\n+enum type_bases
\n+Declared in "libtorrent/settings_pack.hpp"
\n+\n+\n+ \n+\n+name \n+value \n+description \n+string_type_base \n+0 \n+ \n+int_type_base \n+16384 \n+ \n+bool_type_base \n+32768 \n+ \n+type_mask \n+49152 \n+ \n+index_mask \n+16383 \n+ \n+
\n+[report issue]\n+\n+enum mmap_write_mode_t
\n+Declared in "libtorrent/settings_pack.hpp"
\n+\n+\n+ \n+\n+name \n+value \n+description \n+always_pwrite \n+0 \n+disable writing to disk via mmap, always use normal write calls \n+always_mmap_write \n+1 \n+prefer using memory mapped files for disk writes (at least for\n+large files where it might make sense) \n+auto_mmap_write \n+2 \n+determine whether to use pwrite or memory mapped files for disk\n+writes depending on the kind of storage behind the save path \n+
\n+[report issue]\n+\n+enum suggest_mode_t
\n+Declared in "libtorrent/settings_pack.hpp"
\n+\n+\n+ \n+\n+name \n+value \n+description \n+no_piece_suggestions \n+0 \n+ \n+suggest_read_cache \n+1 \n+ \n+
\n+[report issue]\n+\n+enum choking_algorithm_t
\n+Declared in "libtorrent/settings_pack.hpp"
\n+\n+\n+ \n+\n+name \n+value \n+description \n+fixed_slots_choker \n+0 \n+This is the traditional choker with a fixed number of unchoke\n+slots (as specified by settings_pack::unchoke_slots_limit). \n+rate_based_choker \n+2 \n+This opens up unchoke slots based on the upload rate achieved to\n+peers. The more slots that are opened, the marginal upload rate\n+required to open up another slot increases. Configure the initial\n+threshold with settings_pack::rate_choker_initial_threshold.
\n+For more information, see rate based choking.
\n+deprecated_bittyrant_choker \n+3 \n+ \n+
\n+[report issue]\n+\n+enum seed_choking_algorithm_t
\n+Declared in "libtorrent/settings_pack.hpp"
\n+\n+\n+ \n+\n+name \n+value \n+description \n+round_robin \n+0 \n+which round-robins the peers that are unchoked\n+when seeding. This distributes the upload bandwidth uniformly and\n+fairly. It minimizes the ability for a peer to download everything\n+without redistributing it. \n+fastest_upload \n+1 \n+unchokes the peers we can send to the fastest. This might be a\n+bit more reliable in utilizing all available capacity. \n+anti_leech \n+2 \n+prioritizes peers who have just started or are\n+just about to finish the download. The intention is to force\n+peers in the middle of the download to trade with each other.\n+This does not just take into account the pieces a peer is\n+reporting having downloaded, but also the pieces we have sent\n+to it. \n+
\n+[report issue]\n+\n+enum io_buffer_mode_t
\n+Declared in "libtorrent/settings_pack.hpp"
\n+\n+\n+ \n+\n+name \n+value \n+description \n+enable_os_cache \n+0 \n+ \n+deprecated_disable_os_cache_for_aligned_files \n+1 \n+ \n+disable_os_cache \n+2 \n+ \n+write_through \n+3 \n+ \n+
\n+[report issue]\n+\n+enum bandwidth_mixed_algo_t
\n+Declared in "libtorrent/settings_pack.hpp"
\n+\n+\n+ \n+\n+name \n+value \n+description \n+prefer_tcp \n+0 \n+disables the mixed mode bandwidth balancing \n+peer_proportional \n+1 \n+does not throttle uTP, throttles TCP to the same proportion\n+of throughput as there are TCP connections \n+
\n+[report issue]\n+\n+enum enc_policy
\n+Declared in "libtorrent/settings_pack.hpp"
\n+\n+\n+ \n+\n+name \n+value \n+description \n+pe_forced \n+0 \n+Only encrypted connections are allowed. Incoming connections that\n+are not encrypted are closed and if the encrypted outgoing\n+connection fails, a non-encrypted retry will not be made. \n+pe_enabled \n+1 \n+encrypted connections are enabled, but non-encrypted connections\n+are allowed. An incoming non-encrypted connection will be accepted,\n+and if an outgoing encrypted connection fails, a non- encrypted\n+connection will be tried. \n+pe_disabled \n+2 \n+only non-encrypted connections are allowed. \n+
\n+[report issue]\n+\n+enum enc_level
\n+Declared in "libtorrent/settings_pack.hpp"
\n+\n+\n+ \n+\n+name \n+value \n+description \n+pe_plaintext \n+1 \n+use only plain text encryption \n+pe_rc4 \n+2 \n+use only RC4 encryption \n+pe_both \n+3 \n+allow both \n+
\n+[report issue]\n+\n+enum proxy_type_t
\n+Declared in "libtorrent/settings_pack.hpp"
\n+\n+\n+ \n+\n+name \n+value \n+description \n+none \n+0 \n+No proxy server is used and all other fields are ignored. \n+socks4 \n+1 \n+The server is assumed to be a SOCKS4 server that requires a\n+username. \n+socks5 \n+2 \n+The server is assumed to be a SOCKS5 server (RFC 1928) that does\n+not require any authentication. The username and password are\n+ignored. \n+socks5_pw \n+3 \n+The server is assumed to be a SOCKS5 server that supports plain\n+text username and password authentication (RFC 1929). The\n+username and password specified may be sent to the proxy if it\n+requires. \n+http \n+4 \n+The server is assumed to be an HTTP proxy. If the transport used\n+for the connection is non-HTTP, the server is assumed to support\n+the CONNECT method. i.e. for web seeds and HTTP trackers, a plain\n+proxy will suffice. The proxy is assumed to not require\n+authorization. The username and password will not be used. \n+http_pw \n+5 \n+The server is assumed to be an HTTP proxy that requires user\n+authorization. The username and password will be sent to the proxy. \n+
\n+\n+[report issue]\n+\n+\n+name_for_setting() setting_by_name()
\n+Declared in "libtorrent/settings_pack.hpp"
\n \n-bitfield (bitfield const& rhs);\n-bitfield (bitfield&& rhs) noexcept = default;\n-bitfield () noexcept = default;\n-bitfield (int bits, bool val);\n-bitfield (char const* b, int bits);\n-explicit bitfield (int bits);\n+int setting_by_name (string_view name);\n+char const* name_for_setting (int s);\n
\n-constructs a new bitfield. The default constructor creates an empty\n-bitfield. bits is the size of the bitfield (specified in bits).\n-val is the value to initialize the bits to. If not specified\n-all bits are initialized to 0.
\n-The constructor taking a pointer b and bits copies a bitfield\n-from the specified buffer, and bits number of bits (rounded up to\n-the nearest byte boundary).
\n-[report issue]\n-\n-assign()
\n+converts a setting integer (from the enums string_types, int_types or\n+bool_types) to a string, and vice versa.
\n+[report issue]\n+\n+default_settings()
\n+Declared in "libtorrent/settings_pack.hpp"
\n \n-void assign (char const* b, int const bits);\n+settings_pack default_settings ();\n
\n-copy bitfield from buffer b of bits number of bits, rounded up to\n-the nearest byte boundary.
\n-\n-[report issue]\n-\n-get_bit() operator[]()
\n+returns a settings_pack with every setting set to its default value
\n+\n+[report issue]\n+\n+high_performance_seed() min_memory_usage()
\n+Declared in "libtorrent/session.hpp"
\n \n-bool get_bit (int index) const noexcept;\n-bool operator[] (int index) const noexcept;\n+settings_pack min_memory_usage ();\n+settings_pack high_performance_seed ();\n
\n-query bit at index. Returns true if bit is 1, otherwise false.
\n-\n-[report issue]\n-\n-clear_bit() set_bit()
\n+The default values of the session settings are set for a regular\n+bittorrent client running on a desktop system. There are functions that\n+can set the session settings to pre set settings for other environments.\n+These can be used for the basis, and should be tweaked to fit your needs\n+better.
\n+min_memory_usage returns settings that will use the minimal amount of\n+RAM, at the potential expense of upload and download performance. It\n+adjusts the socket buffer sizes, disables the disk cache, lowers the send\n+buffer watermarks so that each connection only has at most one block in\n+use at any one time. It lowers the outstanding blocks send to the disk\n+I/O thread so that connections only have one block waiting to be flushed\n+to disk at any given time. It lowers the max number of peers in the peer\n+list for torrents. It performs multiple smaller reads when it hashes\n+pieces, instead of reading it all into memory before hashing.
\n+This configuration is intended to be the starting point for embedded\n+devices. It will significantly reduce memory usage.
\n+high_performance_seed returns settings optimized for a seed box,\n+serving many peers and that doesn't do any downloading. It has a 128 MB\n+disk cache and has a limit of 400 files in its file pool. It support fast\n+upload rates by allowing large send buffers.
\n+[report issue]\n+\n+generate_fingerprint()
\n+Declared in "libtorrent/fingerprint.hpp"
\n \n-void clear_bit (int index) noexcept;\n-void set_bit (int index) noexcept;\n+std::string generate_fingerprint (std::string name\n+ , int major, int minor = 0, int revision = 0, int tag = 0);\n
\n-set bit at index to 0 (clear_bit) or 1 (set_bit).
\n-[report issue]\n-\n-all_set()
\n+This is a utility function to produce a client ID fingerprint formatted to\n+the most common convention. The fingerprint can be set via the\n+peer_fingerprint setting, in settings_pack.
\n+The name string should contain exactly two characters. These are the\n+characters unique to your client, used to identify it. Make sure not to\n+clash with anybody else. Here are some taken id's:
\n+\n+\n+ \n+\n+id chars \n+client \n+LT \n+libtorrent (default) \n+UT \n+uTorrent \n+UM \n+uTorrent Mac \n+qB \n+qBittorrent \n+BP \n+BitTorrent Pro \n+BT \n+BitTorrent \n+DE \n+Deluge \n+AZ \n+Azureus \n+TL \n+Tribler \n+
\n+There's an informal directory of client id's here.
\n+The major, minor, revision and tag parameters are used to\n+identify the version of your client.
\n+[report issue]\n+\n+bdecode_node
\n+Declared in "libtorrent/bdecode.hpp"
\n+Sometimes it's important to get a non-owning reference to the root node (\n+to be able to copy it as a reference for instance). For that, use the\n+non_owning() member function.
\n+There are 5 different types of nodes, see type_t.
\n \n-bool all_set () const noexcept;\n+struct bdecode_node\n+{\n+ bdecode_node () = default;\n+ bdecode_node& operator= (bdecode_node&&) & = default;\n+ bdecode_node (bdecode_node&&) noexcept;\n+ bdecode_node& operator= (bdecode_node const&) &;\n+ bdecode_node (bdecode_node const&);\n+ type_t type () const noexcept;\n+ explicit operator bool () const noexcept;\n+ bdecode_node non_owning () const;\n+ std::ptrdiff_t data_offset () const noexcept;\n+ span<char const> data_section () const noexcept;\n+ std::int64_t list_int_value_at (int i\n+ , std::int64_t default_val = 0) const;\n+ bdecode_node list_at (int i) const;\n+ int list_size () const;\n+ string_view list_string_value_at (int i\n+ , string_view default_val = string_view()) const;\n+ bdecode_node dict_find_dict (string_view key) const;\n+ bdecode_node dict_find_int (string_view key) const;\n+ int dict_size () const;\n+ bdecode_node dict_find_list (string_view key) const;\n+ string_view dict_find_string_value (string_view key\n+ , string_view default_value = string_view()) const;\n+ std::int64_t dict_find_int_value (string_view key\n+ , std::int64_t default_val = 0) const;\n+ bdecode_node dict_find_string (string_view key) const;\n+ bdecode_node dict_find (string_view key) const;\n+ std::pair<string_view, bdecode_node> dict_at (int i) const;\n+ std::pair<bdecode_node, bdecode_node> dict_at_node (int i) const;\n+ std::int64_t int_value () const;\n+ char const* string_ptr () const;\n+ string_view string_value () const;\n+ std::ptrdiff_t string_offset () const;\n+ int string_length () const;\n+ void clear ();\n+ void swap (bdecode_node& n);\n+ void reserve (int tokens);\n+ void switch_underlying_buffer (char const* buf) noexcept;\n+ bool has_soft_error (span<char> error) const;\n+\n+ enum type_t\n+ {\n+ none_t,\n+ dict_t,\n+ list_t,\n+ string_t,\n+ int_t,\n+ };\n+};\n \n-returns true if all bits in the bitfield are set
\n-[report issue]\n-\n-none_set()
\n+[report issue]\n+bdecode_node()
\n \n-bool none_set () const noexcept;\n+bdecode_node () = default;\n
\n-returns true if no bit in the bitfield is set
\n-[report issue]\n-\n+\n+bdecode_node() operator=()
\n \n-int size () const noexcept;\n+bdecode_node& operator= (bdecode_node&&) & = default;\n+bdecode_node (bdecode_node&&) noexcept;\n+bdecode_node& operator= (bdecode_node const&) &;\n+bdecode_node (bdecode_node const&);\n
\n-returns the size of the bitfield in bits.
\n-[report issue]\n-\n-num_words()
\n+For owning nodes, the copy will create a copy of the tree, but the\n+underlying buffer remains the same.
\n+[report issue]\n+\n+type()
\n \n-int num_words () const noexcept;\n+type_t type () const noexcept;\n
\n-returns the number of 32 bit words are needed to represent all bits in\n-this bitfield.
\n-[report issue]\n-\n+\n+bool()
\n \n-int num_bytes () const noexcept;\n+explicit operator bool () const noexcept;\n
\n-returns the number of bytes needed to represent all bits in this\n-bitfield
\n-[report issue]\n-\n+\n+non_owning()
\n \n-bool empty () const noexcept;\n+bdecode_node non_owning () const;\n
\n-returns true if the bitfield has zero size.
\n-[report issue]\n-\n-data()
\n+return a non-owning reference to this node. This is useful to refer to\n+the root node without copying it in assignments.
\n+\n+[report issue]\n+\n+data_offset() data_section()
\n \n-char const* data () const noexcept;\n-char* data () noexcept;\n+std::ptrdiff_t data_offset () const noexcept;\n+span<char const> data_section () const noexcept;\n
\n-returns a pointer to the internal buffer of the bitfield, or\n-nullptr if it's empty.
\n-[report issue]\n-\n-swap()
\n+returns the buffer and length of the section in the original bencoded\n+buffer where this node is defined. For a dictionary for instance, this\n+starts with d and ends with e, and has all the content of the\n+dictionary in between.\n+the data_offset() function returns the byte-offset to this node in,\n+starting from the beginning of the buffer that was parsed.
\n+\n+\n+\n+[report issue]\n+\n+list_at() list_string_value_at() list_size() list_int_value_at()
\n \n-void swap (bitfield& rhs) noexcept;\n+std::int64_t list_int_value_at (int i\n+ , std::int64_t default_val = 0) const;\n+bdecode_node list_at (int i) const;\n+int list_size () const;\n+string_view list_string_value_at (int i\n+ , string_view default_val = string_view()) const;\n
\n-swaps the bit-fields two variables refer to
\n-[report issue]\n-\n-count()
\n+functions with the list_ prefix operate on lists. These functions are\n+only valid if type() == list_t. list_at() returns the item\n+in the list at index i. i may not be greater than or equal to the\n+size of the list. size() returns the size of the list.
\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+[report issue]\n+\n+dict_size() dict_find_dict() dict_at() dict_find_int() dict_find() dict_find_list() dict_find_int_value() dict_find_string() dict_at_node() dict_find_string_value()
\n \n-int count () const noexcept;\n+bdecode_node dict_find_dict (string_view key) const;\n+bdecode_node dict_find_int (string_view key) const;\n+int dict_size () const;\n+bdecode_node dict_find_list (string_view key) const;\n+string_view dict_find_string_value (string_view key\n+ , string_view default_value = string_view()) const;\n+std::int64_t dict_find_int_value (string_view key\n+ , std::int64_t default_val = 0) const;\n+bdecode_node dict_find_string (string_view key) const;\n+bdecode_node dict_find (string_view key) const;\n+std::pair<string_view, bdecode_node> dict_at (int i) const;\n+std::pair<bdecode_node, bdecode_node> dict_at_node (int i) const;\n
\n-count the number of bits in the bitfield that are set to 1.
\n-[report issue]\n-\n-find_first_set()
\n+Functions with the dict_ prefix operates on dictionaries. They are\n+only valid if type() == dict_t. In case a key you're looking up\n+contains a 0 byte, you cannot use the 0-terminated string overloads,\n+but have to use string_view instead. dict_find_list will return a\n+valid bdecode_node if the key is found _and_ it is a list. Otherwise\n+it will return a default-constructed bdecode_node.
\n+Functions with the _value suffix return the value of the node\n+directly, rather than the nodes. In case the node is not found, or it has\n+a different type, a default value is returned (which can be specified).
\n+dict_at() returns the (key, value)-pair at the specified index in a\n+dictionary. Keys are only allowed to be strings. dict_at_node() also\n+returns the (key, value)-pair, but the key is returned as a\n+bdecode_node (and it will always be a string).
\n+[report issue]\n+\n+int_value()
\n \n-int find_first_set () const noexcept;\n+std::int64_t int_value () const;\n
\n-returns the index of the first set bit in the bitfield, i.e. 1 bit.
\n-[report issue]\n-\n-find_last_clear()
\n+this function is only valid if type() == int_t. It returns the\n+value of the integer.
\n+\n+\n+\n+[report issue]\n+\n+string_length() string_ptr() string_offset() string_value()
\n \n-int find_last_clear () const noexcept;\n+char const* string_ptr () const;\n+string_view string_value () const;\n+std::ptrdiff_t string_offset () const;\n+int string_length () const;\n
\n-returns the index to the last cleared bit in the bitfield, i.e. 0 bit.
\n-[report issue]\n-\n-\n-counters
\n-Declared in "libtorrent/performance_counters.hpp"
\n+these functions are only valid if type() == string_t. They return\n+the string values. Note that string_ptr() is not 0-terminated.\n+string_length() returns the number of bytes in the string.\n+string_offset() returns the byte offset from the start of the parsed\n+bencoded buffer this string can be found.
\n+[report issue]\n+\n+clear()
\n \n-struct counters\n-{\n- counters () ;\n- counters& operator= (counters const&) & ;\n- counters (counters const&) ;\n- std::int64_t inc_stats_counter (int c, std::int64_t value = 1) ;\n- std::int64_t operator[] (int i) const ;\n- void set_value (int c, std::int64_t value) ;\n- void blend_stats_counter (int c, std::int64_t value, int ratio) ;\n-};\n+void clear ();\n \n-\n-[report issue]\n-operator[]() inc_stats_counter()
\n+resets the bdecoded_node to a default constructed state. If this is\n+an owning node, the tree is freed and all child nodes are invalidated.
\n+[report issue]\n+\n+swap()
\n \n-std::int64_t inc_stats_counter (int c, std::int64_t value = 1) ;\n-std::int64_t operator[] (int i) const ;\n+void swap (bdecode_node& n);\n
\n-returns the new value
\n-[report issue]\n-\n-\n-stats_metric
\n-Declared in "libtorrent/session_stats.hpp"
\n-describes one statistics metric from the session. For more information,\n-see the session statistics section.
\n+Swap contents.
\n+[report issue]\n+\n+reserve()
\n \n-struct stats_metric\n-{\n- char const* name;\n- int value_index;\n- metric_type_t type;\n-};\n+void reserve (int tokens);\n \n-[report issue]\n-- name
\n-- the name of the counter or gauge
\n-
\n-\n-[report issue]\n-- value_index type
\n-- the index into the session stats array, where the underlying value of\n-this counter or gauge is found. The session stats array is part of the\n-session_stats_alert object.
\n-
\n-[report issue]\n-\n-session_stats_metrics()
\n-Declared in "libtorrent/session_stats.hpp"
\n+preallocate memory for the specified numbers of tokens. This is\n+useful if you know approximately how many tokens are in the file\n+you are about to parse. Doing so will save realloc operations\n+while parsing. You should only call this on the root node, before\n+passing it in to bdecode().
\n+[report issue]\n+\n+switch_underlying_buffer()
\n \n-std::vector<stats_metric> session_stats_metrics ();\n+void switch_underlying_buffer (char const* buf) noexcept;\n
\n-This free function returns the list of available metrics exposed by\n-libtorrent's statistics API. Each metric has a name and a value index.\n-The value index is the index into the array in session_stats_alert where\n-this metric's value can be found when the session stats is sampled (by\n-calling post_session_stats()).
\n-[report issue]\n-\n-find_metric_idx()
\n-Declared in "libtorrent/session_stats.hpp"
\n+this buffer MUST be identical to the one originally parsed. This\n+operation is only defined on owning root nodes, i.e. the one passed in to\n+decode().
\n+[report issue]\n+\n+has_soft_error()
\n \n-int find_metric_idx (string_view name);\n+bool has_soft_error (span<char> error) const;\n
\n-given a name of a metric, this function returns the counter index of it,\n-or -1 if it could not be found. The counter index is the index into the\n-values array returned by session_stats_alert.
\n-[report issue]\n-\n-enum metric_type_t
\n-Declared in "libtorrent/session_stats.hpp"
\n+returns true if there is a non-fatal error in the bencoding of this node\n+or its children
\n+[report issue]\n+\n+enum type_t
\n+Declared in "libtorrent/bdecode.hpp"
\n \n \n- \n \n name \n value \n description \n counter \n+none_t \n 0 \n- \n+uninitialized or default constructed. This is also used\n+to indicate that a node was not found in some cases. \n gauge \n+dict_t \n 1 \n- \n+a dictionary node. The dict_find_ functions are valid. \n+list_t \n+2 \n+a list node. The list_ functions are valid. \n+string_t \n+3 \n+a string node, the string_ functions are valid. \n+int_t \n+4 \n+an integer node. The int_ functions are valid. \n
\n-This section describes the functions and classes that are used\n-to create torrent files. It is a layered API with low level classes\n-and higher level convenience functions. A torrent is created in 4\n-steps:
\n-\n-- first the files that will be part of the torrent are determined.
\n-- the torrent properties are set, such as tracker url, web seeds,\n-DHT nodes etc.
\n-- Read through all the files in the torrent, SHA-1 all the data\n-and set the piece hashes.
\n-- The torrent is bencoded into a file or buffer.
\n-
\n-If there are a lot of files and or deep directory hierarchies to\n-traverse, step one can be time consuming.
\n-Typically step 3 is by far the most time consuming step, since it\n-requires to read all the bytes from all the files in the torrent.
\n-All of these classes and functions are declared by including\n-libtorrent/create_torrent.hpp.
\n-example:
\n-\n-file_storage fs;\n-\n-// recursively adds files in directories\n-add_files(fs, "./my_torrent");\n-\n-create_torrent t(fs);\n-t.add_tracker("http://my.tracker.com/announce");\n-t.set_creator("libtorrent example");\n-\n-// reads the files and calculates the hashes\n-set_piece_hashes(t, ".");\n-\n-ofstream out("my_torrent.torrent", std::ios_base::binary);\n-std::vector<char> buf = t.generate_buf();\n-out.write(buf.data(), buf.size());\n-\n-// alternatively, generate an entry and encode it directly to an ostream\n-// iterator\n-bencode(std::ostream_iterator<char>(out), t.generate());\n+[report issue]
\n+\n+\n+print_entry()
\n+Declared in "libtorrent/bdecode.hpp"
\n+\n+std::string print_entry (bdecode_node const& e\n+ , bool single_line = false, int indent = 0);\n
\n-[report issue]\n-\n-create_torrent
\n-Declared in "libtorrent/create_torrent.hpp"
\n-This class holds state for creating a torrent. After having added\n-all information to it, call create_torrent::generate() to generate\n-the torrent. The entry that's returned can then be bencoded into a\n-.torrent file using bencode().
\n+print the bencoded structure in a human-readable format to a string\n+that's returned.
\n+[report issue]\n+\n+bdecode()
\n+Declared in "libtorrent/bdecode.hpp"
\n \n-struct create_torrent\n+int bdecode (char const* start, char const* end, bdecode_node& ret\n+ , error_code& ec, int* error_pos = nullptr, int depth_limit = 100\n+ , int token_limit = 2000000);\n+bdecode_node bdecode (span<char const> buffer\n+ , error_code& ec, int* error_pos = nullptr, int depth_limit = 100\n+ , int token_limit = 2000000);\n+bdecode_node bdecode (span<char const> buffer\n+ , int depth_limit = 100, int token_limit = 2000000);\n+
\n+This function decodes/parses bdecoded data (for example a .torrent file).\n+The data structure is returned in the ret argument. the buffer to parse\n+is specified by the start of the buffer as well as the end, i.e. one\n+byte past the end. If the buffer fails to parse, the function returns a\n+non-zero value and fills in ec with the error code. The optional\n+argument error_pos, if set to non-nullptr, will be set to the byte offset\n+into the buffer where the parse failure occurred.
\n+depth_limit specifies the max number of nested lists or dictionaries are\n+allowed in the data structure. (This affects the stack usage of the\n+function, be careful not to set it too high).
\n+token_limit is the max number of tokens allowed to be parsed from the\n+buffer. This is simply a sanity check to not have unbounded memory usage.
\n+The resulting bdecode_node is an owning node. That means it will\n+be holding the whole parsed tree. When iterating lists and dictionaries,\n+those bdecode_node objects will simply have references to the root or\n+owning bdecode_node. If the root node is destructed, all other nodes\n+that refer to anything in that tree become invalid.
\n+However, the underlying buffer passed in to this function (start, end)\n+must also remain valid while the bdecoded tree is used. The parsed tree\n+produced by this function does not copy any data out of the buffer, but\n+simply produces references back into it.
\n+[report issue]\n+\n+session_proxy
\n+Declared in "libtorrent/session.hpp"
\n+this is a holder for the internal session implementation object. Once the\n+session destruction is explicitly initiated, this holder is used to\n+synchronize the completion of the shutdown. The lifetime of this object\n+may outlive session, causing the session destructor to not block. The\n+session_proxy destructor will block however, until the underlying session\n+is done shutting down.
\n+\n+struct session_proxy\n {\n- explicit create_torrent (torrent_info const& ti);\n- explicit create_torrent (file_storage& fs, int piece_size = 0\n- , create_flags_t flags = {});\n- entry generate () const;\n- std::vector<char> generate_buf () const;\n- file_storage const& files () const;\n- void set_comment (char const* str);\n- void set_creator (char const* str);\n- void set_creation_date (std::time_t timestamp);\n- void set_hash (piece_index_t index, sha1_hash const& h);\n- void set_hash2 (file_index_t file, piece_index_t::diff_type piece, sha256_hash const& h);\n- void add_url_seed (string_view url);\n- void add_http_seed (string_view url);\n- void add_node (std::pair<std::string, int> node);\n- void add_tracker (string_view url, int tier = 0);\n- void set_root_cert (string_view cert);\n- void set_priv (bool p);\n- bool priv () const;\n- bool is_v2_only () const;\n- bool is_v1_only () const;\n- int num_pieces () const;\n- piece_index_t end_piece () const;\n- index_range<piece_index_t> piece_range () const noexcept;\n- file_index_t end_file () const;\n- index_range<file_index_t> file_range () const noexcept;\n- index_range<piece_index_t::diff_type> file_piece_range (file_index_t f);\n- std::int64_t total_size () const;\n- int piece_size (piece_index_t i) const;\n- int piece_length () const;\n- void add_collection (string_view c);\n- void add_similar_torrent (sha1_hash ih);\n-\n- static constexpr create_flags_t modification_time = 2_bit;\n- static constexpr create_flags_t symlinks = 3_bit;\n- static constexpr create_flags_t v2_only = 5_bit;\n- static constexpr create_flags_t v1_only = 6_bit;\n- static constexpr create_flags_t canonical_files = 7_bit;\n- static constexpr create_flags_t no_attributes = 8_bit;\n- static constexpr create_flags_t canonical_files_no_tail_padding = 9_bit;\n+ ~session_proxy ();\n+ session_proxy (session_proxy const&);\n+ session_proxy (session_proxy&&) noexcept;\n+ session_proxy& operator= (session_proxy const&) &;\n+ session_proxy& operator= (session_proxy&&) & noexcept;\n+ session_proxy ();\n };\n \n-[report issue]\n-create_torrent()
\n+\n+\n+[report issue]\n+~session_proxy() session_proxy() operator=()
\n \n-explicit create_torrent (torrent_info const& ti);\n-explicit create_torrent (file_storage& fs, int piece_size = 0\n- , create_flags_t flags = {});\n+~session_proxy ();\n+session_proxy (session_proxy const&);\n+session_proxy (session_proxy&&) noexcept;\n+session_proxy& operator= (session_proxy const&) &;\n+session_proxy& operator= (session_proxy&&) & noexcept;\n+session_proxy ();\n \n-The piece_size is the size of each piece in bytes. It must be a\n-power of 2 and a minimum of 16 kiB. If a piece size of 0 is\n-specified, a piece_size will be set automatically.
\n-The flags arguments specifies options for the torrent creation. It can\n-be any combination of the flags defined by create_flags_t.
\n-The file_storage (fs) parameter defines the files, sizes and\n-their properties for the torrent to be created. Set this up first,\n-before passing it to the create_torrent constructor.
\n-The overload that takes a torrent_info object will make a verbatim\n-copy of its info dictionary (to preserve the info-hash). The copy of\n-the info dictionary will be used by create_torrent::generate(). This means\n-that none of the member functions of create_torrent that affects\n-the content of the info dictionary (such as set_hash()), will\n-have any affect. Instead of using this overload, consider using\n-write_torrent_file() instead.
\n-\n-Warning
\n-The file_storage and torrent_info objects must stay alive for the\n-entire duration of the create_torrent object.
\n+default constructor, does not refer to any session\n+implementation object.
\n+[report issue]\n \n-\n-[report issue]\n-\n-generate() generate_buf()
\n+\n+session
\n+Declared in "libtorrent/session.hpp"
\n+The session holds all state that spans multiple torrents. Among other\n+things it runs the network loop and manages all torrents. Once it's\n+created, the session object will spawn the main thread that will do all\n+the work. The main thread will be idle as long it doesn't have any\n+torrents to participate in.
\n+You have some control over session configuration through the\n+session_handle::apply_settings() member function. To change one or more\n+configuration options, create a settings_pack. object and fill it with\n+the settings to be set and pass it in to session::apply_settings().
\n+see apply_settings().
\n \n-entry generate () const;\n-std::vector<char> generate_buf () const;\n+struct session : session_handle\n+{\n+ session ();\n+ explicit session (session_params&& params);\n+ session (session_params const& params, session_flags_t flags);\n+ session (session_params&& params, session_flags_t flags);\n+ explicit session (session_params const& params);\n+ session (session_params&& params, io_context& ios);\n+ session (session_params const& params, io_context& ios, session_flags_t);\n+ session (session_params const& params, io_context& ios);\n+ session (session_params&& params, io_context& ios, session_flags_t);\n+ ~session ();\n+ session_proxy abort ();\n+};\n \n-This function will generate the .torrent file as a bencode tree, or a\n-bencoded into a buffer.\n-In order to encode the entry into a flat file, use the bencode() function.
\n-The function returning an entry may be useful to add custom entries\n-to the torrent file before bencoding it and saving it to disk.
\n-Whether the resulting torrent object is v1, v2 or hybrid depends on\n-whether any of the v1_only or v2_only flags were set on the\n-constructor. If neither were set, the resulting torrent depends on\n-which hashes were set. If both v1 and v2 hashes were set, a hybrid\n-torrent is created.
\n-Any failure will cause this function to throw system_error, with an\n-appropriate error message. These are the reasons this call may throw:
\n-\n-- the file storage has 0 files
\n-- the total size of the file storage is 0 bytes (i.e. it only has\n-empty files)
\n-- not all v1 hashes (set_hash()) and not all v2 hashes (set_hash2())\n-were set
\n-- for v2 torrents, you may not have a directory with the same name as\n-a file. If that's encountered in the file storage, generate()\n-fails.
\n-
\n-[report issue]\n-\n-files()
\n+[report issue]\n+session()
\n \n-file_storage const& files () const;\n+session ();\n+explicit session (session_params&& params);\n+session (session_params const& params, session_flags_t flags);\n+session (session_params&& params, session_flags_t flags);\n+explicit session (session_params const& params);\n
\n-returns an immutable reference to the file_storage used to create\n-the torrent from.
\n-[report issue]\n-\n-set_comment()
\n+Constructs the session objects which acts as the container of torrents.\n+In order to avoid a race condition between starting the session and\n+configuring it, you can pass in a session_params object. Its settings\n+will take effect before the session starts up.
\n+The overloads taking flags can be used to start a session in\n+paused mode (by passing in session::paused). Note that\n+add_default_plugins do not have an affect on constructors that\n+take a session_params object. It already contains the plugins to use.
\n+[report issue]\n+\n+session()
\n \n-void set_comment (char const* str);\n+session (session_params&& params, io_context& ios);\n+session (session_params const& params, io_context& ios, session_flags_t);\n+session (session_params const& params, io_context& ios);\n+session (session_params&& params, io_context& ios, session_flags_t);\n
\n-Sets the comment for the torrent. The string str should be utf-8 encoded.\n-The comment in a torrent file is optional.
\n-[report issue]\n-\n-set_creator()
\n+Overload of the constructor that takes an external io_context to run\n+the session object on. This is primarily useful for tests that may want\n+to run multiple sessions on a single io_context, or low resource\n+systems where additional threads are expensive and sharing an\n+io_context with other events is fine.
\n+\n+Warning
\n+The session object does not cleanly terminate with an external\n+io_context. The io_context::run() call must have returned\n+before it's safe to destruct the session. Which means you MUST\n+call session::abort() and save the session_proxy first, then\n+destruct the session object, then sync with the io_context, then\n+destruct the session_proxy object.
\n+\n+[report issue]\n+\n+~session()
\n \n-void set_creator (char const* str);\n+~session ();\n
\n-Sets the creator of the torrent. The string str should be utf-8 encoded.\n-This is optional.
\n-[report issue]\n-\n-set_creation_date()
\n+The destructor of session will notify all trackers that our torrents\n+have been shut down. If some trackers are down, they will time out.\n+All this before the destructor of session returns. So, it's advised\n+that any kind of interface (such as windows) are closed before\n+destructing the session object. Because it can take a few second for\n+it to finish. The timeout can be set with apply_settings().
\n+[report issue]\n+\n+abort()
\n \n-void set_creation_date (std::time_t timestamp);\n+session_proxy abort ();\n
\n-sets the "creation time" field. Defaults to the system clock at the\n-time of construction of the create_torrent object. The timestamp is\n-specified in seconds, posix time. If the creation date is set to 0,\n-the "creation date" field will be omitted from the generated torrent.
\n-[report issue]\n-\n-set_hash()
\n+In case you want to destruct the session asynchronously, you can\n+request a session destruction proxy. If you don't do this, the\n+destructor of the session object will block while the trackers are\n+contacted. If you keep one session_proxy to the session when\n+destructing it, the destructor will not block, but start to close down\n+the session, the destructor of the proxy will then synchronize the\n+threads. So, the destruction of the session is performed from the\n+session destructor call until the session_proxy destructor\n+call. The session_proxy does not have any operations on it (since\n+the session is being closed down, no operations are allowed on it).\n+The only valid operation is calling the destructor:
\n \n-void set_hash (piece_index_t index, sha1_hash const& h);\n+struct session_proxy {};\n \n-This sets the SHA-1 hash for the specified piece (index). You are required\n-to set the hash for every piece in the torrent before generating it. If you have\n-the files on disk, you can use the high level convenience function to do this.\n-See set_piece_hashes().\n-A SHA-1 hash of all zeros is internally used to indicate a hash that\n-has not been set. Setting such hash will not be considered set when\n-calling generate().\n-This function will throw std::system_error if it is called on an\n-object constructed with the v2_only flag.
\n-[report issue]\n-\n+\n+\n+session_params
\n+Declared in "libtorrent/session_params.hpp"
\n+The session_params is a parameters pack for configuring the session\n+before it's started.
\n \n-void set_hash2 (file_index_t file, piece_index_t::diff_type piece, sha256_hash const& h);\n+struct session_params\n+{\n+ session_params ();\n+ session_params (settings_pack const& sp);\n+ session_params (settings_pack&& sp);\n+ session_params (settings_pack const& sp\n+ , std::vector<std::shared_ptr<plugin>> exts);\n+ session_params (settings_pack&& sp\n+ , std::vector<std::shared_ptr<plugin>> exts);\n+\n+ settings_pack settings;\n+ std::vector<std::shared_ptr<plugin>> extensions;\n+ dht::dht_state dht_state;\n+ dht::dht_storage_constructor_type dht_storage_constructor;\n+ disk_io_constructor_type disk_io_constructor;\n+ std::map<std::string, std::string> ext_state;\n+ libtorrent::ip_filter ip_filter;\n+};\n \n-sets the bittorrent v2 hash for file file of the piece piece.\n-piece is relative to the first piece of the file, starting at 0. The\n-first piece in the file can be computed with\n-file_storage::file_index_at_piece().\n-The hash, h, is the root of the merkle tree formed by the piece's\n-16 kiB blocks. Note that piece sizes must be powers-of-2, so all\n-per-piece merkle trees are complete.\n-A SHA-256 hash of all zeros is internally used to indicate a hash\n-that has not been set. Setting such hash will not be considered set\n-when calling generate().\n-This function will throw std::system_error if it is called on an\n-object constructed with the v1_only flag.
\n-\n-[report issue]\n-\n-add_http_seed() add_url_seed()
\n+[report issue]\n+session_params()
\n \n-void add_url_seed (string_view url);\n-void add_http_seed (string_view url);\n+session_params ();\n+session_params (settings_pack const& sp);\n+session_params (settings_pack&& sp);\n
\n-This adds a url seed to the torrent. You can have any number of url seeds. For a\n-single file torrent, this should be an HTTP url, pointing to a file with identical\n-content as the file of the torrent. For a multi-file torrent, it should point to\n-a directory containing a directory with the same name as this torrent, and all the\n-files of the torrent in it.
\n-The second function, add_http_seed() adds an HTTP seed instead.
\n-[report issue]\n-\n-add_node()
\n+This constructor can be used to start with the default plugins\n+(ut_metadata, ut_pex and smart_ban). Pass a settings_pack to set the\n+initial settings when the session starts.
\n+[report issue]\n+\n+session_params()
\n \n-void add_node (std::pair<std::string, int> node);\n+session_params (settings_pack const& sp\n+ , std::vector<std::shared_ptr<plugin>> exts);\n+session_params (settings_pack&& sp\n+ , std::vector<std::shared_ptr<plugin>> exts);\n
\n-This adds a DHT node to the torrent. This especially useful if you're creating a\n-tracker less torrent. It can be used by clients to bootstrap their DHT node from.\n-The node is a hostname and a port number where there is a DHT node running.\n-You can have any number of DHT nodes in a torrent.
\n-[report issue]\n-\n-add_tracker()
\n+This constructor helps to configure the set of initial plugins\n+to be added to the session before it's started.
\n+[report issue]\n+- settings
\n+- The settings to configure the session with
\n+
\n+[report issue]\n+- extensions
\n+- the plugins to add to the session as it is constructed
\n+
\n+[report issue]\n+- dht_state
\n+- DHT node ID and node addresses to bootstrap the DHT with.
\n+
\n+[report issue]\n+- dht_storage_constructor
\n+- function object to construct the storage object for DHT items.
\n+
\n+[report issue]\n+- disk_io_constructor
\n+- function object to create the disk I/O subsystem. Defaults to\n+default_disk_io_constructor.
\n+
\n+[report issue]\n+- ext_state
\n+- this container can be used by extensions/plugins to store settings. It's\n+primarily here to make it convenient to save and restore state across\n+sessions, using read_session_params() and write_session_params().
\n+
\n+[report issue]\n+- ip_filter
\n+- the IP filter to use for the session. This restricts which peers are allowed\n+to connect. As if passed to set_ip_filter().
\n+
\n+[report issue]\n+\n+\n+session_handle
\n+Declared in "libtorrent/session_handle.hpp"
\n+this class provides a non-owning handle to a session and a subset of the\n+interface of the session class. If the underlying session is destructed\n+any handle to it will no longer be valid. is_valid() will return false and\n+any operation on it will throw a system_error exception, with error code\n+invalid_session_handle.
\n \n-void add_tracker (string_view url, int tier = 0);\n+struct session_handle\n+{\n+ bool is_valid () const;\n+ session_params session_state (save_state_flags_t flags = save_state_flags_t::all()) const;\n+ std::vector<torrent_status> get_torrent_status (\n+ std::function<bool(torrent_status const&)> const& pred\n+ , status_flags_t flags = {}) const;\n+ void refresh_torrent_status (std::vector<torrent_status>* ret\n+ , status_flags_t flags = {}) const;\n+ void post_torrent_updates (status_flags_t flags = status_flags_t::all());\n+ void post_session_stats ();\n+ void post_dht_stats ();\n+ void set_dht_state (dht::dht_state&& st);\n+ void set_dht_state (dht::dht_state const& st);\n+ std::vector<torrent_handle> get_torrents () const;\n+ torrent_handle find_torrent (sha1_hash const& info_hash) const;\n+ torrent_handle add_torrent (add_torrent_params const& params, error_code& ec);\n+ void async_add_torrent (add_torrent_params const& params);\n+ torrent_handle add_torrent (add_torrent_params&& params, error_code& ec);\n+ torrent_handle add_torrent (add_torrent_params&& params);\n+ torrent_handle add_torrent (add_torrent_params const& params);\n+ void async_add_torrent (add_torrent_params&& params);\n+ bool is_paused () const;\n+ void resume ();\n+ void pause ();\n+ bool is_dht_running () const;\n+ void set_dht_storage (dht::dht_storage_constructor_type sc);\n+ void add_dht_node (std::pair<std::string, int> const& node);\n+ void dht_get_item (sha1_hash const& target);\n+ void dht_get_item (std::array<char, 32> key\n+ , std::string salt = std::string());\n+ sha1_hash dht_put_item (entry data);\n+ void dht_put_item (std::array<char, 32> key\n+ , std::function<void(entry&, std::array<char, 64>&\n+ , std::int64_t&, std::string const&)> cb\n+ , std::string salt = std::string());\n+ void dht_announce (sha1_hash const& info_hash, int port = 0, dht::announce_flags_t flags = {});\n+ void dht_get_peers (sha1_hash const& info_hash);\n+ void dht_live_nodes (sha1_hash const& nid);\n+ void dht_sample_infohashes (udp::endpoint const& ep, sha1_hash const& target);\n+ void dht_direct_request (udp::endpoint const& ep, entry const& e, client_data_t userdata = {});\n+ void add_extension (std::shared_ptr<plugin> ext);\n+ void add_extension (std::function<std::shared_ptr<torrent_plugin>(\n+ torrent_handle const&, client_data_t)> ext);\n+ void set_ip_filter (ip_filter f);\n+ ip_filter get_ip_filter () const;\n+ void set_port_filter (port_filter const& f);\n+ unsigned short ssl_listen_port () const;\n+ bool is_listening () const;\n+ unsigned short listen_port () const;\n+ void set_peer_class_filter (ip_filter const& f);\n+ ip_filter get_peer_class_filter () const;\n+ void set_peer_class_type_filter (peer_class_type_filter const& f);\n+ peer_class_type_filter get_peer_class_type_filter () const;\n+ peer_class_t create_peer_class (char const* name);\n+ void delete_peer_class (peer_class_t cid);\n+ void set_peer_class (peer_class_t cid, peer_class_info const& pci);\n+ peer_class_info get_peer_class (peer_class_t cid) const;\n+ void remove_torrent (const torrent_handle&, remove_flags_t = {});\n+ void apply_settings (settings_pack&&);\n+ void apply_settings (settings_pack const&);\n+ settings_pack get_settings () const;\n+ alert* wait_for_alert (time_duration max_wait);\n+ void pop_alerts (std::vector<alert*>* alerts);\n+ void set_alert_notify (std::function<void()> const& fun);\n+ std::vector<port_mapping_t> add_port_mapping (portmap_protocol t, int external_port, int local_port);\n+ void delete_port_mapping (port_mapping_t handle);\n+ void reopen_network_sockets (reopen_network_flags_t options = reopen_map_ports);\n+ std::shared_ptr<aux::session_impl> native_handle () const;\n+\n+ static constexpr save_state_flags_t save_settings = 0_bit;\n+ static constexpr save_state_flags_t save_dht_state = 2_bit;\n+ static constexpr save_state_flags_t save_extension_state = 11_bit;\n+ static constexpr save_state_flags_t save_ip_filter = 12_bit;\n+ static constexpr peer_class_t global_peer_class_id {0};\n+ static constexpr peer_class_t tcp_peer_class_id {1};\n+ static constexpr peer_class_t local_peer_class_id {2};\n+ static constexpr remove_flags_t delete_files = 0_bit;\n+ static constexpr remove_flags_t delete_partfile = 1_bit;\n+ static constexpr session_flags_t paused = 2_bit;\n+ static constexpr portmap_protocol udp = portmap_protocol::udp;\n+ static constexpr portmap_protocol tcp = portmap_protocol::tcp;\n+ static constexpr reopen_network_flags_t reopen_map_ports = 0_bit;\n+};\n \n-Adds a tracker to the torrent. This is not strictly required, but most torrents\n-use a tracker as their main source of peers. The url should be an http:// or udp://\n-url to a machine running a bittorrent tracker that accepts announces for this torrent's\n-info-hash. The tier is the fallback priority of the tracker. All trackers with tier 0 are\n-tried first (in any order). If all fail, trackers with tier 1 are tried. If all of those\n-fail, trackers with tier 2 are tried, and so on.
\n-[report issue]\n-\n-set_root_cert()
\n+[report issue]\n+is_valid()
\n \n-void set_root_cert (string_view cert);\n+bool is_valid () const;\n
\n-This function sets an X.509 certificate in PEM format to the torrent. This makes the\n-torrent an SSL torrent. An SSL torrent requires that each peer has a valid certificate\n-signed by this root certificate. For SSL torrents, all peers are connecting over SSL\n-connections. For more information, see the section on ssl torrents.
\n-The string is not the path to the cert, it's the actual content of the\n-certificate.
\n-\n-[report issue]\n-\n-set_priv() priv()
\n+returns true if this handle refers to a valid session object. If the\n+session has been destroyed, all session_handle objects will expire and\n+not be valid.
\n+[report issue]\n+\n+session_state()
\n \n-void set_priv (bool p);\n-bool priv () const;\n+session_params session_state (save_state_flags_t flags = save_state_flags_t::all()) const;\n
\n-Sets and queries the private flag of the torrent.\n-Torrents with the private flag set ask the client to not use any other\n-sources than the tracker for peers, and to not use DHT to advertise itself publicly,\n-only the tracker.
\n-[report issue]\n-\n-num_pieces()
\n+returns the current session state. This can be passed to\n+write_session_params() to save the state to disk and restored using\n+read_session_params() when constructing a new session. The kind of\n+state that's included is all settings, the DHT routing table, possibly\n+plugin-specific state.\n+the flags parameter can be used to only save certain parts of the\n+session state
\n+\n+[report issue]\n+\n+refresh_torrent_status() get_torrent_status()
\n \n-int num_pieces () const;\n+std::vector<torrent_status> get_torrent_status (\n+ std::function<bool(torrent_status const&)> const& pred\n+ , status_flags_t flags = {}) const;\n+void refresh_torrent_status (std::vector<torrent_status>* ret\n+ , status_flags_t flags = {}) const;\n \n-returns the number of pieces in the associated file_storage object.
\n-[report issue]\n-\n-piece_range()
\n+\n+Note
\n+these calls are potentially expensive and won't scale well with\n+lots of torrents. If you're concerned about performance, consider\n+using post_torrent_updates() instead.
\n+\n+get_torrent_status returns a vector of the torrent_status for\n+every torrent which satisfies pred, which is a predicate function\n+which determines if a torrent should be included in the returned set\n+or not. Returning true means it should be included and false means\n+excluded. The flags argument is the same as to\n+torrent_handle::status(). Since pred is guaranteed to be\n+called for every torrent, it may be used to count the number of\n+torrents of different categories as well.
\n+refresh_torrent_status takes a vector of torrent_status structs\n+(for instance the same vector that was returned by\n+get_torrent_status() ) and refreshes the status based on the\n+handle member. It is possible to use this function by first\n+setting up a vector of default constructed torrent_status objects,\n+only initializing the handle member, in order to request the\n+torrent status for multiple torrents in a single call. This can save a\n+significant amount of time if you have a lot of torrents.
\n+Any torrent_status object whose handle member is not referring to\n+a valid torrent are ignored.
\n+The intended use of these functions is to start off by calling\n+get_torrent_status() to get a list of all torrents that match your\n+criteria. Then call refresh_torrent_status() on that list. This\n+will only refresh the status for the torrents in your list, and thus\n+ignore all other torrents you might be running. This may save a\n+significant amount of time, especially if the number of torrents you're\n+interested in is small. In order to keep your list of interested\n+torrents up to date, you can either call get_torrent_status() from\n+time to time, to include torrents you might have become interested in\n+since the last time. In order to stop refreshing a certain torrent,\n+simply remove it from the list.
\n+[report issue]\n+\n+post_torrent_updates()
\n \n-index_range<piece_index_t> piece_range () const noexcept;\n+void post_torrent_updates (status_flags_t flags = status_flags_t::all());\n
\n-all piece indices in the torrent to be created
\n-[report issue]\n-\n-file_range()
\n+This functions instructs the session to post the state_update_alert,\n+containing the status of all torrents whose state changed since the\n+last time this function was called.
\n+Only torrents who has the state subscription flag set will be\n+included. This flag is on by default. See add_torrent_params.\n+the flags argument is the same as for torrent_handle::status().\n+see status_flags_t in torrent_handle.
\n+[report issue]\n+\n+post_session_stats()
\n \n-index_range<file_index_t> file_range () const noexcept;\n+void post_session_stats ();\n
\n-all file indices in the torrent to be created
\n-[report issue]\n-\n-file_piece_range()
\n+This function will post a session_stats_alert object, containing a\n+snapshot of the performance counters from the internals of libtorrent.\n+To interpret these counters, query the session via\n+session_stats_metrics().
\n+For more information, see the session statistics section.
\n+[report issue]\n+\n+post_dht_stats()
\n \n-index_range<piece_index_t::diff_type> file_piece_range (file_index_t f);\n+void post_dht_stats ();\n
\n-for v2 and hybrid torrents only, the pieces in the\n-specified file, specified as delta from the first piece in the file.\n-i.e. the first index is 0.
\n-[report issue]\n-\n+\n+set_dht_state()
\n \n-std::int64_t total_size () const;\n+void set_dht_state (dht::dht_state&& st);\n+void set_dht_state (dht::dht_state const& st);\n
\n-the total number of bytes of all files and pad files
\n-\n-[report issue]\n-\n-piece_size() piece_length()
\n+set the DHT state for the session. This will be taken into account the\n+next time the DHT is started, as if it had been passed in via the\n+session_params on startup.
\n+\n+[report issue]\n+\n+get_torrents() find_torrent()
\n \n-int piece_size (piece_index_t i) const;\n-int piece_length () const;\n+std::vector<torrent_handle> get_torrents () const;\n+torrent_handle find_torrent (sha1_hash const& info_hash) const;\n
\n-piece_length() returns the piece size of all pieces but the\n-last one. piece_size() returns the size of the specified piece.\n-these functions are just forwarding to the associated file_storage.
\n-\n-[report issue]\n-\n-add_similar_torrent() add_collection()
\n+find_torrent() looks for a torrent with the given info-hash. In\n+case there is such a torrent in the session, a torrent_handle to that\n+torrent is returned. In case the torrent cannot be found, an invalid\n+torrent_handle is returned.
\n+See torrent_handle::is_valid() to know if the torrent was found or\n+not.
\n+get_torrents() returns a vector of torrent_handles to all the\n+torrents currently in the session.
\n+\n+[report issue]\n+\n+async_add_torrent() add_torrent()
\n \n-void add_collection (string_view c);\n-void add_similar_torrent (sha1_hash ih);\n+torrent_handle add_torrent (add_torrent_params const& params, error_code& ec);\n+void async_add_torrent (add_torrent_params const& params);\n+torrent_handle add_torrent (add_torrent_params&& params, error_code& ec);\n+torrent_handle add_torrent (add_torrent_params&& params);\n+torrent_handle add_torrent (add_torrent_params const& params);\n+void async_add_torrent (add_torrent_params&& params);\n
\n-Add similar torrents (by info-hash) or collections of similar torrents.\n-Similar torrents are expected to share some files with this torrent.\n-Torrents sharing a collection name with this torrent are also expected\n-to share files with this torrent. A torrent may have more than one\n-collection and more than one similar torrents. For more information,\n-see BEP 38.
\n-[report issue]\n-- modification_time
\n-- This will include the file modification time as part of the torrent.\n-This is not enabled by default, as it might cause problems when you\n-create a torrent from separate files with the same content, hoping to\n-yield the same info-hash. If the files have different modification times,\n-with this option enabled, you would get different info-hashes for the\n-files.
\n-
\n-[report issue]\n-- symlinks
\n-- If this flag is set, files that are symlinks get a symlink attribute\n-set on them and their data will not be included in the torrent. This\n-is useful if you need to reconstruct a file hierarchy which contains\n-symlinks.
\n-
\n-[report issue]\n-- v2_only
\n-- Do not generate v1 metadata. The resulting torrent will only be usable by\n-clients which support v2. This requires setting all v2 hashes, with\n-set_hash2() before calling generate(). Setting v1 hashes (with\n-set_hash()) is an error with this flag set.
\n-
\n-[report issue]\n-- v1_only
\n-- do not generate v2 metadata or enforce v2 alignment and padding rules\n-this is mainly for tests, not recommended for production use. This\n-requires setting all v1 hashes, with set_hash(), before calling\n-generate(). Setting v2 hashes (with set_hash2()) is an error with\n-this flag set.
\n-
\n-[report issue]\n-- canonical_files
\n-- This flag only affects v1-only torrents, and is only relevant\n-together with the v1_only_flag. This flag will force the\n-same file order and padding as a v2 (or hybrid) torrent would have.\n-It has the effect of ordering files and inserting pad files to align\n-them with piece boundaries.
\n-
\n-[report issue]\n-- no_attributes
\n-- passing this flag to add_files() will ignore file attributes (such as\n-executable or hidden) when adding the files to the file storage.\n-Since not all filesystems and operating systems support all file\n-attributes the resulting torrent may differ depending on where it's\n-created. If it's important for torrents to be created consistently\n-across systems, this flag should be set.
\n-
\n-[report issue]\n-- canonical_files_no_tail_padding
\n-- this flag enforces the file layout to be canonical according to the\n-bittorrent v2 specification (just like the canonical_files flag)\n-with the one exception that tail padding is not added to the last\n-file.\n-This behavior deviates from the specification but was the way\n-libtorrent created torrents in version up to and including 2.0.7.\n-This flag is here for backwards compatibility.
\n-
\n-[report issue]\n-\n-\n-add_files()
\n-Declared in "libtorrent/create_torrent.hpp"
\n+You add torrents through the add_torrent() function where you give an\n+object with all the parameters. The add_torrent() overloads will block\n+until the torrent has been added (or failed to be added) and returns\n+an error code and a torrent_handle. In order to add torrents more\n+efficiently, consider using async_add_torrent() which returns\n+immediately, without waiting for the torrent to add. Notification of\n+the torrent being added is sent as add_torrent_alert.
\n+The overload that does not take an error_code throws an exception on\n+error and is not available when building without exception support.\n+The torrent_handle returned by add_torrent() can be used to retrieve\n+information about the torrent's progress, its peers etc. It is also\n+used to abort a torrent.
\n+If the torrent you are trying to add already exists in the session (is\n+either queued for checking, being checked or downloading)\n+add_torrent() will throw system_error which derives from\n+std::exception unless duplicate_is_error is set to false. In that\n+case, add_torrent() will return the handle to the existing torrent.
\n+The add_torrent_params class has a flags field. It can be used to\n+control what state the new torrent will be added in. Common flags to\n+want to control are torrent_flags::paused and\n+torrent_flags::auto_managed. In order to add a magnet link that will\n+just download the metadata, but no payload, set the\n+torrent_flags::upload_mode flag.
\n+Special consideration has to be taken when adding hybrid torrents\n+(i.e. torrents that are BitTorrent v2 torrents that are backwards\n+compatible with v1). For more details, see BitTorrent v2 torrents.
\n+\n+\n+[report issue]\n+\n+is_paused() resume() pause()
\n \n-void add_files (file_storage& fs, std::string const& file\n- , std::function<bool(std::string)> p, create_flags_t flags = {});\n-void add_files (file_storage& fs, std::string const& file\n- , create_flags_t flags = {});\n-\n-Adds the file specified by path to the file_storage object. In case path\n-refers to a directory, files will be added recursively from the directory.
\n-If specified, the predicate p is called once for every file and directory that\n-is encountered. Files for which p returns true are added, and directories for\n-which p returns true are traversed. p must have the following signature:
\n-\n-bool Pred(std::string const& p);\n+bool is_paused () const;\n+void resume ();\n+void pause ();\n
\n-The path that is passed in to the predicate is the full path of the file or\n-directory. If no predicate is specified, all files are added, and all directories\n-are traversed.
\n-The ".." directory is never traversed.
\n-The flags argument should be the same as the flags passed to the create_torrent\n-constructor.
\n-[report issue]\n-\n-set_piece_hashes()
\n-Declared in "libtorrent/create_torrent.hpp"
\n+Pausing the session has the same effect as pausing every torrent in\n+it, except that torrents will not be resumed by the auto-manage\n+mechanism. Resuming will restore the torrents to their previous paused\n+state. i.e. the session pause state is separate from the torrent pause\n+state. A torrent is inactive if it is paused or if the session is\n+paused.
\n+[report issue]\n+\n+is_dht_running()
\n \n-void set_piece_hashes (create_torrent& t, std::string const& p\n- , settings_interface const& settings, disk_io_constructor_type disk_io\n- , std::function<void(piece_index_t)> const& f, error_code& ec);\n-void set_piece_hashes (create_torrent& t, std::string const& p\n- , settings_interface const& settings\n- , std::function<void(piece_index_t)> const& f, error_code& ec);\n-inline void set_piece_hashes (create_torrent& t, std::string const& p, error_code& ec);\n-inline void set_piece_hashes (create_torrent& t, std::string const& p);\n-inline void set_piece_hashes (create_torrent& t, std::string const& p\n- , std::function<void(piece_index_t)> const& f);\n-void set_piece_hashes (create_torrent& t, std::string const& p\n- , std::function<void(piece_index_t)> const& f, error_code& ec);\n-inline void set_piece_hashes (create_torrent& t, std::string const& p\n- , settings_interface const& settings\n- , std::function<void(piece_index_t)> const& f);\n-
\n-This function will assume that the files added to the torrent file exists at path\n-p, read those files and hash the content and set the hashes in the create_torrent\n-object. The optional function f is called in between every hash that is set. f\n-must have the following signature:
\n-\n-void Fun(piece_index_t);\n+bool is_dht_running () const;\n
\n-The overloads taking a settings_pack may be used to configure the\n-underlying disk access. Such as settings_pack::aio_threads.
\n-The overloads that don't take an error_code& may throw an exception in case of a\n-file error, the other overloads sets the error code to reflect the error, if any.
\n-[report issue]\n-\n-web_seed_entry
\n-Declared in "libtorrent/torrent_info.hpp"
\n-the web_seed_entry holds information about a web seed (also known\n-as URL seed or HTTP seed). It is essentially a URL with some state\n-associated with it. For more information, see BEP 17 and BEP 19.
\n+is_dht_running() returns true if the DHT support has been started\n+and false otherwise.
\n+[report issue]\n+\n+set_dht_storage()
\n \n-struct web_seed_entry\n-{\n- bool operator== (web_seed_entry const& e) const;\n- bool operator< (web_seed_entry const& e) const;\n-\n- enum type_t\n- {\n- url_seed,\n- http_seed,\n- };\n-\n- std::string url;\n- std::string auth;\n- headers_t extra_headers;\n- std::uint8_t type;\n-};\n+void set_dht_storage (dht::dht_storage_constructor_type sc);\n \n-[report issue]\n-operator==()
\n+set_dht_storage set a dht custom storage constructor function\n+to be used internally when the dht is created.
\n+Since the dht storage is a critical component for the dht behavior,\n+this function will only be effective the next time the dht is started.\n+If you never touch this feature, a default map-memory based storage\n+is used.
\n+If you want to make sure the dht is initially created with your\n+custom storage, create a session with the setting\n+settings_pack::enable_dht to false, set your constructor function\n+and call apply_settings with settings_pack::enable_dht to true.
\n+[report issue]\n+\n+add_dht_node()
\n \n-bool operator== (web_seed_entry const& e) const;\n+void add_dht_node (std::pair<std::string, int> const& node);\n
\n-URL and type comparison
\n-[report issue]\n-\n-operator<()
\n-\n-bool operator< (web_seed_entry const& e) const;\n-
\n-URL and type less-than comparison
\n-[report issue]\n-\n-enum type_t
\n-Declared in "libtorrent/torrent_info.hpp"
\n-\n-\n- \n-\n-name \n-value \n-description \n-url_seed \n-0 \n- \n-http_seed \n-1 \n- \n-
\n-[report issue]\n-- url
\n-- The URL of the web seed
\n-
\n-[report issue]\n-- auth
\n-- Optional authentication. If this is set, it's passed\n-in as HTTP basic auth to the web seed. The format is:\n-username:password.
\n-
\n-[report issue]\n-- extra_headers
\n-- Any extra HTTP headers that need to be passed to the web seed
\n-
\n-[report issue]\n-- type
\n-- The type of web seed (see type_t)
\n-
\n-[report issue]\n-\n-\n-load_torrent_limits
\n-Declared in "libtorrent/torrent_info.hpp"
\n-this object holds configuration options for limits to use when loading\n-torrents. They are meant to prevent loading potentially malicious torrents\n-that cause excessive memory allocations.
\n+add_dht_node takes a host name and port pair. That endpoint will be\n+pinged, and if a valid DHT reply is received, the node will be added to\n+the routing table.
\n+[report issue]\n+\n+dht_get_item()
\n \n-struct load_torrent_limits\n-{\n- int max_buffer_size = 10000000;\n- int max_pieces = 0x200000;\n- int max_decode_depth = 100;\n- int max_decode_tokens = 3000000;\n-};\n+void dht_get_item (sha1_hash const& target);\n \n-[report issue]\n-- max_buffer_size
\n-- the max size of a .torrent file to load into RAM
\n-
\n-[report issue]\n-- max_pieces
\n-- the max number of pieces allowed in the torrent
\n-
\n-[report issue]\n-- max_decode_depth
\n-- the max recursion depth in the bdecoded structure
\n-
\n-[report issue]\n-- max_decode_tokens
\n-- the max number of bdecode tokens
\n-
\n-[report issue]\n-\n-torrent_info
\n-Declared in "libtorrent/torrent_info.hpp"
\n-the torrent_info class holds the information found in a .torrent file.
\n+query the DHT for an immutable item at the target hash.\n+the result is posted as a dht_immutable_item_alert.
\n+[report issue]\n+\n+dht_get_item()
\n \n-class torrent_info\n-{\n- explicit torrent_info (span<char const> buffer, from_span_t);\n- torrent_info (std::string const& filename, load_torrent_limits const& cfg);\n- torrent_info (char const* buffer, int size, error_code& ec);\n- explicit torrent_info (bdecode_node const& torrent_file);\n- torrent_info (span<char const> buffer, error_code& ec, from_span_t);\n- torrent_info (std::string const& filename, error_code& ec);\n- torrent_info (char const* buffer, int size);\n- torrent_info (bdecode_node const& torrent_file, load_torrent_limits const& cfg);\n- explicit torrent_info (info_hash_t const& info_hash);\n- explicit torrent_info (std::string const& filename);\n- torrent_info (torrent_info const& t);\n- torrent_info (bdecode_node const& torrent_file, error_code& ec);\n- torrent_info (span<char const> buffer, load_torrent_limits const& cfg, from_span_t);\n- ~torrent_info ();\n- file_storage const& files () const;\n- file_storage const& orig_files () const;\n- void rename_file (file_index_t index, std::string const& new_filename);\n- void remap_files (file_storage const& f);\n- void clear_trackers ();\n- void add_tracker (std::string const& url, int tier\n- , announce_entry::tracker_source source);\n- std::vector<announce_entry> const& trackers () const;\n- void add_tracker (std::string const& url, int tier = 0);\n- std::vector<sha1_hash> similar_torrents () const;\n- std::vector<std::string> collections () const;\n- void add_http_seed (std::string const& url\n- , std::string const& extern_auth = std::string()\n- , web_seed_entry::headers_t const& extra_headers = web_seed_entry::headers_t());\n- void set_web_seeds (std::vector<web_seed_entry> seeds);\n- void add_url_seed (std::string const& url\n- , std::string const& ext_auth = std::string()\n- , web_seed_entry::headers_t const& ext_headers = web_seed_entry::headers_t());\n- std::vector<web_seed_entry> const& web_seeds () const;\n- std::int64_t total_size () const;\n- int num_pieces () const;\n- int piece_length () const;\n- int blocks_per_piece () const;\n- piece_index_t end_piece () const;\n- index_range<piece_index_t> piece_range () const;\n- piece_index_t last_piece () const;\n- sha1_hash info_hash () const noexcept;\n- info_hash_t const& info_hashes () const;\n- bool v2 () const;\n- bool v1 () const;\n- int num_files () const;\n- std::vector<file_slice> map_block (piece_index_t const piece\n- , std::int64_t offset, int size) const;\n- peer_request map_file (file_index_t const file, std::int64_t offset, int size) const;\n- string_view ssl_cert () const;\n- bool is_valid () const;\n- bool priv () const;\n- bool is_i2p () const;\n- int piece_size (piece_index_t index) const;\n- char const* hash_for_piece_ptr (piece_index_t const index) const;\n- sha1_hash hash_for_piece (piece_index_t index) const;\n- bool is_loaded () const;\n- const std::string& name () const;\n- std::time_t creation_date () const;\n- const std::string& creator () const;\n- const std::string& comment () const;\n- std::vector<std::pair<std::string, int>> const& nodes () const;\n- void add_node (std::pair<std::string, int> const& node);\n- bool parse_info_section (bdecode_node const& info, error_code& ec, int max_pieces);\n- bdecode_node info (char const* key) const;\n- span<char const> info_section () const;\n- span<char const> piece_layer (file_index_t) const;\n- void free_piece_layers ();\n-};\n+void dht_get_item (std::array<char, 32> key\n+ , std::string salt = std::string());\n \n-[report issue]\n-torrent_info()
\n+query the DHT for a mutable item under the public key key.\n+this is an ed25519 key. salt is optional and may be left\n+as an empty string if no salt is to be used.\n+if the item is found in the DHT, a dht_mutable_item_alert is\n+posted.
\n+[report issue]\n+\n+dht_put_item()
\n \n-explicit torrent_info (span<char const> buffer, from_span_t);\n-torrent_info (std::string const& filename, load_torrent_limits const& cfg);\n-torrent_info (char const* buffer, int size, error_code& ec);\n-explicit torrent_info (bdecode_node const& torrent_file);\n-torrent_info (span<char const> buffer, error_code& ec, from_span_t);\n-torrent_info (std::string const& filename, error_code& ec);\n-torrent_info (char const* buffer, int size);\n-torrent_info (bdecode_node const& torrent_file, load_torrent_limits const& cfg);\n-explicit torrent_info (info_hash_t const& info_hash);\n-explicit torrent_info (std::string const& filename);\n-torrent_info (torrent_info const& t);\n-torrent_info (bdecode_node const& torrent_file, error_code& ec);\n-torrent_info (span<char const> buffer, load_torrent_limits const& cfg, from_span_t);\n+sha1_hash dht_put_item (entry data);\n
\n-The constructor that takes an info-hash will initialize the info-hash\n-to the given value, but leave all other fields empty. This is used\n-internally when downloading torrents without the metadata. The\n-metadata will be created by libtorrent as soon as it has been\n-downloaded from the swarm.
\n-The constructor that takes a bdecode_node will create a torrent_info\n-object from the information found in the given torrent_file. The\n-bdecode_node represents a tree node in an bencoded file. To load an\n-ordinary .torrent file into a bdecode_node, use bdecode().
\n-The version that takes a buffer pointer and a size will decode it as a\n-.torrent file and initialize the torrent_info object for you.
\n-The version that takes a filename will simply load the torrent file\n-and decode it inside the constructor, for convenience. This might not\n-be the most suitable for applications that want to be able to report\n-detailed errors on what might go wrong.
\n-There is an upper limit on the size of the torrent file that will be\n-loaded by the overload taking a filename. If it's important that even\n-very large torrent files are loaded, use one of the other overloads.
\n-The overloads that takes an error_code const& never throws if an\n-error occur, they will simply set the error code to describe what went\n-wrong and not fully initialize the torrent_info object. The overloads\n-that do not take the extra error_code parameter will always throw if\n-an error occurs. These overloads are not available when building\n-without exception support.
\n-The overload that takes a span also needs an extra parameter of\n-type from_span_t to disambiguate the std::string overload for\n-string literals. There is an object in the libtorrent namespace of this\n-type called from_span.
\n-[report issue]\n-\n-~torrent_info()
\n+store the given bencoded data as an immutable item in the DHT.\n+the returned hash is the key that is to be used to look the item\n+up again. It's just the SHA-1 hash of the bencoded form of the\n+structure.
\n+[report issue]\n+\n+dht_put_item()
\n \n-~torrent_info ();\n+void dht_put_item (std::array<char, 32> key\n+ , std::function<void(entry&, std::array<char, 64>&\n+ , std::int64_t&, std::string const&)> cb\n+ , std::string salt = std::string());\n
\n-frees all storage associated with this torrent_info object
\n-\n-[report issue]\n-\n-orig_files() files()
\n+store a mutable item. The key is the public key the blob is\n+to be stored under. The optional salt argument is a string that\n+is to be mixed in with the key when determining where in the DHT\n+the value is to be stored. The callback function is called from within\n+the libtorrent network thread once we've found where to store the blob,\n+possibly with the current value stored under the key.\n+The values passed to the callback functions are:
\n+\n+- entry& value
\n+- the current value stored under the key (may be empty). Also expected\n+to be set to the value to be stored by the function.
\n+- std::array<char,64>& signature
\n+- the signature authenticating the current value. This may be zeros\n+if there is currently no value stored. The function is expected to\n+fill in this buffer with the signature of the new value to store.\n+To generate the signature, you may want to use the\n+sign_mutable_item function.
\n+- std::int64_t& seq
\n+- current sequence number. May be zero if there is no current value.\n+The function is expected to set this to the new sequence number of\n+the value that is to be stored. Sequence numbers must be monotonically\n+increasing. Attempting to overwrite a value with a lower or equal\n+sequence number will fail, even if the signature is correct.
\n+- std::string const& salt
\n+- this is the salt that was used for this put call.
\n+
\n+Since the callback function cb is called from within libtorrent,\n+it is critical to not perform any blocking operations. Ideally not\n+even locking a mutex. Pass any data required for this function along\n+with the function object's context and make the function entirely\n+self-contained. The only reason data blob's value is computed\n+via a function instead of just passing in the new value is to avoid\n+race conditions. If you want to update the value in the DHT, you\n+must first retrieve it, then modify it, then write it back. The way\n+the DHT works, it is natural to always do a lookup before storing and\n+calling the callback in between is convenient.
\n+\n+[report issue]\n+\n+dht_get_peers() dht_announce()
\n \n-file_storage const& files () const;\n-file_storage const& orig_files () const;\n+void dht_announce (sha1_hash const& info_hash, int port = 0, dht::announce_flags_t flags = {});\n+void dht_get_peers (sha1_hash const& info_hash);\n \n-The file_storage object contains the information on how to map the\n-pieces to files. It is separated from the torrent_info object because\n-when creating torrents a storage object needs to be created without\n-having a torrent file. When renaming files in a storage, the storage\n-needs to make its own copy of the file_storage in order to make its\n-mapping differ from the one in the torrent file.
\n-orig_files() returns the original (unmodified) file storage for\n-this torrent. This is used by the web server connection, which needs\n-to request files with the original names. Filename may be changed using\n-torrent_info::rename_file().
\n-For more information on the file_storage object, see the separate\n-document on how to create torrents.
\n-[report issue]\n-\n-rename_file()
\n+dht_get_peers() will issue a DHT get_peer request to the DHT for the\n+specified info-hash. The response (the peers) will be posted back in a\n+dht_get_peers_reply_alert.
\n+dht_announce() will issue a DHT announce request to the DHT to the\n+specified info-hash, advertising the specified port. If the port is\n+left at its default, 0, the port will be implied by the DHT message's\n+source port (which may improve connectivity through a NAT).
\n+Both these functions are exposed for advanced custom use of the DHT.\n+All torrents eligible to be announce to the DHT will be automatically,\n+by libtorrent.
\n+For possible flags, see announce_flags_t.
\n+[report issue]\n+\n+dht_live_nodes()
\n \n-void rename_file (file_index_t index, std::string const& new_filename);\n+void dht_live_nodes (sha1_hash const& nid);\n
\n-Renames the file with the specified index to the new name. The new\n-filename is reflected by the file_storage returned by files()\n-but not by the one returned by orig_files().
\n-If you want to rename the base name of the torrent (for a multi file\n-torrent), you can copy the file_storage (see files() and\n-orig_files() ), change the name, and then use remap_files().
\n-The new_filename can both be a relative path, in which case the\n-file name is relative to the save_path of the torrent. If the\n-new_filename is an absolute path (i.e. is_complete(new_filename)\n-== true), then the file is detached from the save_path of the\n-torrent. In this case the file is not moved when move_storage() is\n-invoked.
\n-[report issue]\n-\n-remap_files()
\n+Retrieve all the live DHT (identified by nid) nodes. All the\n+nodes id and endpoint will be returned in the list of nodes in the\n+alert dht_live_nodes_alert.\n+Since this alert is a response to an explicit call, it will always be\n+posted, regardless of the alert mask.
\n+[report issue]\n+\n+dht_sample_infohashes()
\n \n-void remap_files (file_storage const& f);\n+void dht_sample_infohashes (udp::endpoint const& ep, sha1_hash const& target);\n
\n-\n-Warning
\n-Using remap_files() is discouraged as it's incompatible with v2\n-torrents. This is because the piece boundaries and piece hashes in\n-v2 torrents are intimately tied to the file boundaries. Instead,\n-just rename individual files, or implement a custom disk_interface\n-to customize how to store files.
\n-\n-Remaps the file storage to a new file layout. This can be used to, for\n-instance, download all data in a torrent to a single file, or to a\n-number of fixed size sector aligned files, regardless of the number\n-and sizes of the files in the torrent.
\n-The new specified file_storage must have the exact same size as\n-the current one.
\n-\n-\n-[report issue]\n-\n-add_tracker() trackers() clear_trackers()
\n+Query the DHT node specified by ep to retrieve a sample of the\n+info-hashes that the node currently have in their storage.\n+The target is included for iterative lookups so that indexing nodes\n+can perform a key space traversal with a single RPC per node by adjusting\n+the target value for each RPC. It has no effect on the returned sample value.\n+The result is posted as a dht_sample_infohashes_alert.
\n+[report issue]\n+\n+dht_direct_request()
\n \n-void clear_trackers ();\n-void add_tracker (std::string const& url, int tier\n- , announce_entry::tracker_source source);\n-std::vector<announce_entry> const& trackers () const;\n-void add_tracker (std::string const& url, int tier = 0);\n+void dht_direct_request (udp::endpoint const& ep, entry const& e, client_data_t userdata = {});\n \n-add_tracker() adds a tracker to the announce-list. The tier\n-determines the order in which the trackers are to be tried.\n-The trackers() function will return a sorted vector of\n-announce_entry. Each announce entry contains a string, which is\n-the tracker url, and a tier index. The tier index is the high-level\n-priority. No matter which trackers that works or not, the ones with\n-lower tier will always be tried before the one with higher tier\n-number. For more information, see announce_entry.
\n-trackers() returns all entries from announce-list.
\n-clear_trackers() removes all trackers from announce-list.
\n-\n-[report issue]\n-\n-collections() similar_torrents()
\n+Send an arbitrary DHT request directly to the specified endpoint. This\n+function is intended for use by plugins. When a response is received\n+or the request times out, a dht_direct_response_alert will be posted\n+with the response (if any) and the userdata pointer passed in here.\n+Since this alert is a response to an explicit call, it will always be\n+posted, regardless of the alert mask.
\n+[report issue]\n+\n+add_extension()
\n \n-std::vector<sha1_hash> similar_torrents () const;\n-std::vector<std::string> collections () const;\n+void add_extension (std::shared_ptr<plugin> ext);\n+void add_extension (std::function<std::shared_ptr<torrent_plugin>(\n+ torrent_handle const&, client_data_t)> ext);\n
\n-These two functions are related to BEP 38 (mutable torrents). The\n-vectors returned from these correspond to the "similar" and\n-"collections" keys in the .torrent file. Both info-hashes and\n-collections from within the info-dict and from outside of it are\n-included.
\n-\n-\n-\n-[report issue]\n-\n-set_web_seeds() web_seeds() add_http_seed() add_url_seed()
\n-\n-void add_http_seed (std::string const& url\n- , std::string const& extern_auth = std::string()\n- , web_seed_entry::headers_t const& extra_headers = web_seed_entry::headers_t());\n-void set_web_seeds (std::vector<web_seed_entry> seeds);\n-void add_url_seed (std::string const& url\n- , std::string const& ext_auth = std::string()\n- , web_seed_entry::headers_t const& ext_headers = web_seed_entry::headers_t());\n-std::vector<web_seed_entry> const& web_seeds () const;\n+This function adds an extension to this session. The argument is a\n+function object that is called with a torrent_handle and which should\n+return a std::shared_ptr<torrent_plugin>. To write custom\n+plugins, see libtorrent plugins. For the typical bittorrent client\n+all of these extensions should be added. The main plugins implemented\n+in libtorrent are:
\n+
\n+- uTorrent metadata
\n+- Allows peers to download the metadata (.torrent files) from the swarm\n+directly. Makes it possible to join a swarm with just a tracker and\n+info-hash.
\n+
\n+\n+#include <libtorrent/extensions/ut_metadata.hpp>\n+ses.add_extension(<::create_ut_metadata_plugin);\n
\n-web_seeds() returns all url seeds and http seeds in the torrent.\n-Each entry is a web_seed_entry and may refer to either a url seed\n-or http seed.
\n-add_url_seed() and add_http_seed() adds one url to the list of\n-url/http seeds.
\n-set_web_seeds() replaces all web seeds with the ones specified in\n-the seeds vector.
\n-The extern_auth argument can be used for other authorization\n-schemes than basic HTTP authorization. If set, it will override any\n-username and password found in the URL itself. The string will be sent\n-as the HTTP authorization header's value (without specifying "Basic").
\n-The extra_headers argument defaults to an empty list, but can be\n-used to insert custom HTTP headers in the requests to a specific web\n-seed.
\n-See http seeding for more information.
\n-[report issue]\n-\n-total_size()
\n-\n-std::int64_t total_size () const;\n+
\n+- uTorrent peer exchange
\n+- Exchanges peers between clients.
\n+
\n+\n+#include <libtorrent/extensions/ut_pex.hpp>\n+ses.add_extension(<::create_ut_pex_plugin);\n
\n-total_size() returns the total number of bytes the torrent-file\n-represents. Note that this is the number of pieces times the piece\n-size (modulo the last piece possibly being smaller). With pad files,\n-the total size will be larger than the sum of all (regular) file\n-sizes.
\n-\n-[report issue]\n-\n-piece_length() num_pieces()
\n-\n-int num_pieces () const;\n-int piece_length () const;\n+
\n+- smart ban plugin
\n+- A plugin that, with a small overhead, can ban peers\n+that sends bad data with very high accuracy. Should\n+eliminate most problems on poisoned torrents.
\n+
\n+\n+#include <libtorrent/extensions/smart_ban.hpp>\n+ses.add_extension(<::create_smart_ban_plugin);\n
\n-piece_length() and num_pieces() returns the number of byte\n-for each piece and the total number of pieces, respectively. The\n-difference between piece_size() and piece_length() is that\n-piece_size() takes the piece index as argument and gives you the\n-exact size of that piece. It will always be the same as\n-piece_length() except in the case of the last piece, which may be\n-smaller.
\n-[report issue]\n-\n+\n+set_ip_filter() get_ip_filter()
\n \n-int blocks_per_piece () const;\n+void set_ip_filter (ip_filter f);\n+ip_filter get_ip_filter () const;\n
\n-returns the number of blocks there are in the typical piece. There\n-may be fewer in the last piece)
\n-\n-\n-[report issue]\n-\n-last_piece() end_piece() piece_range()
\n+Sets a filter that will be used to reject and accept incoming as well\n+as outgoing connections based on their originating ip address. The\n+default filter will allow connections to any ip address. To build a\n+set of rules for which addresses are accepted and not, see ip_filter.
\n+Each time a peer is blocked because of the IP filter, a\n+peer_blocked_alert is generated. get_ip_filter() Returns the\n+ip_filter currently in the session. See ip_filter.
\n+[report issue]\n+\n+set_port_filter()
\n \n-piece_index_t end_piece () const;\n-index_range<piece_index_t> piece_range () const;\n-piece_index_t last_piece () const;\n+void set_port_filter (port_filter const& f);\n
\n-last_piece() returns the index to the last piece in the torrent and\n-end_piece() returns the index to the one-past-end piece in the\n-torrent\n-piece_range() returns an implementation-defined type that can be\n-used as the container in a range-for loop. Where the values are the\n-indices of all pieces in the file_storage.
\n-\n-[report issue]\n-\n-info_hash() info_hashes()
\n+apply port_filter f to incoming and outgoing peers. a port filter\n+will reject making outgoing peer connections to certain remote ports.\n+The main intention is to be able to avoid triggering certain\n+anti-virus software by connecting to SMTP, FTP ports.
\n+\n+\n+[report issue]\n+\n+is_listening() listen_port() ssl_listen_port()
\n \n-sha1_hash info_hash () const noexcept;\n-info_hash_t const& info_hashes () const;\n+unsigned short ssl_listen_port () const;\n+bool is_listening () const;\n+unsigned short listen_port () const;\n
\n-returns the info-hash of the torrent. For BitTorrent v2 support, use\n-info_hashes() to get an object that may hold both a v1 and v2\n-info-hash
\n-\n-[report issue]\n-\n-v1() v2()
\n+is_listening() will tell you whether or not the session has\n+successfully opened a listening port. If it hasn't, this function will\n+return false, and then you can set a new\n+settings_pack::listen_interfaces to try another interface and port to\n+bind to.
\n+listen_port() returns the port we ended up listening on.
\n+\n+[report issue]\n+\n+set_peer_class_filter() get_peer_class_filter()
\n \n-bool v2 () const;\n-bool v1 () const;\n+void set_peer_class_filter (ip_filter const& f);\n+ip_filter get_peer_class_filter () const;\n
\n-returns whether this torrent has v1 and/or v2 metadata, respectively.\n-Hybrid torrents have both. These are shortcuts for\n-info_hashes().has_v1() and info_hashes().has_v2() calls.
\n-[report issue]\n-\n-num_files()
\n+Sets the peer class filter for this session. All new peer connections\n+will take this into account and be added to the peer classes specified\n+by this filter, based on the peer's IP address.
\n+The ip-filter essentially maps an IP -> uint32. Each bit in that 32\n+bit integer represents a peer class. The least significant bit\n+represents class 0, the next bit class 1 and so on.
\n+For more info, see ip_filter.
\n+For example, to make all peers in the range 200.1.1.0 - 200.1.255.255\n+belong to their own peer class, apply the following filter:
\n+\n+ip_filter f = ses.get_peer_class_filter();\n+peer_class_t my_class = ses.create_peer_class("200.1.x.x IP range");\n+f.add_rule(make_address("200.1.1.0"), make_address("200.1.255.255")\n+ , 1 << static_cast<std::uint32_t>(my_class));\n+ses.set_peer_class_filter(f);\n+
\n+This setting only applies to new connections, it won't affect existing\n+peer connections.
\n+This function is limited to only peer class 0-31, since there are only\n+32 bits in the IP range mapping. Only the set bits matter; no peer\n+class will be removed from a peer as a result of this call, peer\n+classes are only added.
\n+The peer_class argument cannot be greater than 31. The bitmasks\n+representing peer classes in the peer_class_filter are 32 bits.
\n+The get_peer_class_filter() function returns the current filter.
\n+For more information, see peer classes.
\n+\n+[report issue]\n+\n+set_peer_class_type_filter() get_peer_class_type_filter()
\n \n-int num_files () const;\n+void set_peer_class_type_filter (peer_class_type_filter const& f);\n+peer_class_type_filter get_peer_class_type_filter () const;\n
\n-If you need index-access to files you can use the num_files() along\n-with the file_path(), file_size()-family of functions to access\n-files using indices.
\n-[report issue]\n-\n-map_block()
\n+Sets and gets the peer class type filter. This is controls automatic\n+peer class assignments to peers based on what kind of socket it is.
\n+It does not only support assigning peer classes, it also supports\n+removing peer classes based on socket type.
\n+The order of these rules being applied are:
\n+\n+- peer-class IP filter
\n+- peer-class type filter, removing classes
\n+- peer-class type filter, adding classes
\n+
\n+For more information, see peer classes.
\n+[report issue]\n+\n+create_peer_class()
\n \n-std::vector<file_slice> map_block (piece_index_t const piece\n- , std::int64_t offset, int size) const;\n+peer_class_t create_peer_class (char const* name);\n
\n-This function will map a piece index, a byte offset within that piece\n-and a size (in bytes) into the corresponding files with offsets where\n-that data for that piece is supposed to be stored. See file_slice.
\n-[report issue]\n-\n-map_file()
\n+Creates a new peer class (see peer classes) with the given name. The\n+returned integer is the new peer class identifier. Peer classes may\n+have the same name, so each invocation of this function creates a new\n+class and returns a unique identifier.
\n+Identifiers are assigned from low numbers to higher. So if you plan on\n+using certain peer classes in a call to set_peer_class_filter(),\n+make sure to create those early on, to get low identifiers.
\n+For more information on peer classes, see peer classes.
\n+[report issue]\n+\n+delete_peer_class()
\n \n-peer_request map_file (file_index_t const file, std::int64_t offset, int size) const;\n+void delete_peer_class (peer_class_t cid);\n
\n-This function will map a range in a specific file into a range in the\n-torrent. The file_offset parameter is the offset in the file,\n-given in bytes, where 0 is the start of the file. See peer_request.
\n-The input range is assumed to be valid within the torrent.\n-file_offset + size is not allowed to be greater than the file\n-size. file_index must refer to a valid file, i.e. it cannot be >=\n-num_files().
\n-[report issue]\n-\n-ssl_cert()
\n+This call dereferences the reference count of the specified peer\n+class. When creating a peer class it's automatically referenced by 1.\n+If you want to recycle a peer class, you may call this function. You\n+may only call this function once per peer class you create.\n+Calling it more than once for the same class will lead to memory\n+corruption.
\n+Since peer classes are reference counted, this function will not\n+remove the peer class if it's still assigned to torrents or peers. It\n+will however remove it once the last peer and torrent drops their\n+references to it.
\n+There is no need to call this function for custom peer classes. All\n+peer classes will be properly destructed when the session object\n+destructs.
\n+For more information on peer classes, see peer classes.
\n+\n+[report issue]\n+\n+get_peer_class() set_peer_class()
\n \n-string_view ssl_cert () const;\n+void set_peer_class (peer_class_t cid, peer_class_info const& pci);\n+peer_class_info get_peer_class (peer_class_t cid) const;\n
\n-Returns the SSL root certificate for the torrent, if it is an SSL\n-torrent. Otherwise returns an empty string. The certificate is\n-the public certificate in x509 format.
\n-[report issue]\n-\n-is_valid()
\n+These functions queries information from a peer class and updates the\n+configuration of a peer class, respectively.
\n+cid must refer to an existing peer class. If it does not, the\n+return value of get_peer_class() is undefined.
\n+set_peer_class() sets all the information in the\n+peer_class_info object in the specified peer class. There is no\n+option to only update a single property.
\n+A peer or torrent belonging to more than one class, the highest\n+priority among any of its classes is the one that is taken into\n+account.
\n+For more information, see peer classes.
\n+[report issue]\n+\n+remove_torrent()
\n \n-bool is_valid () const;\n+void remove_torrent (const torrent_handle&, remove_flags_t = {});\n \n-returns true if this torrent_info object has a torrent loaded.\n-This is primarily used to determine if a magnet link has had its\n-metadata resolved yet or not.
\n-[report issue]\n-\n-priv()
\n+remove_torrent() will close all peer connections associated with\n+the torrent and tell the tracker that we've stopped participating in\n+the swarm. This operation cannot fail. When it completes, you will\n+receive a torrent_removed_alert.
\n+remove_torrent() is non-blocking, but will remove the torrent from the\n+session synchronously. Calling session_handle::add_torrent() immediately\n+afterward with the same torrent will succeed. Note that this creates a\n+new handle which is not equal to the removed one.
\n+The optional second argument options can be used to delete all the\n+files downloaded by this torrent. To do so, pass in the value\n+session_handle::delete_files. Once the torrent is deleted, a\n+torrent_deleted_alert is posted.
\n+The torrent_handle remains valid for some time after remove_torrent() is\n+called. It will become invalid only after all libtorrent tasks (such as\n+I/O tasks) release their references to the torrent. Until this happens,\n+torrent_handle::is_valid() will return true, and other calls such\n+as torrent_handle::status() will succeed. Because of this, and because\n+remove_torrent() is non-blocking, the following sequence usually\n+succeeds (does not throw system_error):\n+.. code:: c++
\n+\n+session.remove_handle(handle);\n+handle.save_resume_data();
\n+Note that when a queued or downloading torrent is removed, its position\n+in the download queue is vacated and every subsequent torrent in the\n+queue has their queue positions updated. This can potentially cause a\n+large state_update to be posted. When removing all torrents, it is\n+advised to remove them from the back of the queue, to minimize the\n+shifting.
\n+\n+[report issue]\n+\n+get_settings() apply_settings()
\n \n-bool priv () const;\n+void apply_settings (settings_pack&&);\n+void apply_settings (settings_pack const&);\n+settings_pack get_settings () const;\n
\n-returns true if this torrent is private. i.e., the client should not\n-advertise itself on the trackerless network (the Kademlia DHT) for this torrent.
\n-[report issue]\n-\n-is_i2p()
\n+Applies the settings specified by the settings_pack s. This is an\n+asynchronous operation that will return immediately and actually apply\n+the settings to the main thread of libtorrent some time later.
\n+\n+\n+[report issue]\n+\n+pop_alerts() set_alert_notify() wait_for_alert()
\n \n-bool is_i2p () const;\n+alert* wait_for_alert (time_duration max_wait);\n+void pop_alerts (std::vector<alert*>* alerts);\n+void set_alert_notify (std::function<void()> const& fun);\n
\n-returns true if this is an i2p torrent. This is determined by whether\n-or not it has a tracker whose URL domain name ends with ".i2p". i2p\n-torrents disable the DHT and local peer discovery as well as talking\n-to peers over anything other than the i2p network.
\n-[report issue]\n-\n-piece_size()
\n+Alerts is the main mechanism for libtorrent to report errors and\n+events. pop_alerts fills in the vector passed to it with pointers\n+to new alerts. The session still owns these alerts and they will stay\n+valid until the next time pop_alerts is called. You may not delete\n+the alert objects.
\n+It is safe to call pop_alerts from multiple different threads, as\n+long as the alerts themselves are not accessed once another thread\n+calls pop_alerts. Doing this requires manual synchronization\n+between the popping threads.
\n+wait_for_alert will block the current thread for max_wait time\n+duration, or until another alert is posted. If an alert is available\n+at the time of the call, it returns immediately. The returned alert\n+pointer is the head of the alert queue. wait_for_alert does not\n+pop alerts from the queue, it merely peeks at it. The returned alert\n+will stay valid until pop_alerts is called twice. The first time\n+will pop it and the second will free it.
\n+If there is no alert in the queue and no alert arrives within the\n+specified timeout, wait_for_alert returns nullptr.
\n+In the python binding, wait_for_alert takes the number of\n+milliseconds to wait as an integer.
\n+The alert queue in the session will not grow indefinitely. Make sure\n+to pop periodically to not miss notifications. To control the max\n+number of alerts that's queued by the session, see\n+settings_pack::alert_queue_size.
\n+Some alerts are considered so important that they are posted even when\n+the alert queue is full. Some alerts are considered mandatory and cannot\n+be disabled by the alert_mask. For instance,\n+save_resume_data_alert and save_resume_data_failed_alert are always\n+posted, regardless of the alert mask.
\n+To control which alerts are posted, set the alert_mask\n+(settings_pack::alert_mask).
\n+If the alert queue fills up to the point where alerts are dropped, this\n+will be indicated by a alerts_dropped_alert, which contains a bitmask\n+of which types of alerts were dropped. Generally it is a good idea to\n+make sure the alert queue is large enough, the alert_mask doesn't have\n+unnecessary categories enabled and to call pop_alert() frequently, to\n+avoid alerts being dropped.
\n+the set_alert_notify function lets the client set a function object\n+to be invoked every time the alert queue goes from having 0 alerts to\n+1 alert. This function is called from within libtorrent, it may be the\n+main thread, or it may be from within a user call. The intention of\n+of the function is that the client wakes up its main thread, to poll\n+for more alerts using pop_alerts(). If the notify function fails\n+to do so, it won't be called again, until pop_alerts is called for\n+some other reason. For instance, it could signal an eventfd, post a\n+message to an HWND or some other main message pump. The actual\n+retrieval of alerts should not be done in the callback. In fact, the\n+callback should not block. It should not perform any expensive work.\n+It really should just notify the main application thread.
\n+The type of an alert is returned by the polymorphic function\n+alert::type() but can also be queries from a concrete type via\n+T::alert_type, as a static constant.
\n+\n+[report issue]\n+\n+add_port_mapping() delete_port_mapping()
\n \n-int piece_size (piece_index_t index) const;\n+std::vector<port_mapping_t> add_port_mapping (portmap_protocol t, int external_port, int local_port);\n+void delete_port_mapping (port_mapping_t handle);\n
\n-returns the piece size of file with index. This will be the same as piece_length(),\n-except for the last piece, which may be shorter.
\n-\n-[report issue]\n-\n-hash_for_piece() hash_for_piece_ptr()
\n+add_port_mapping adds one or more port forwards on UPnP and/or NAT-PMP,\n+whichever is enabled. A mapping is created for each listen socket\n+in the session. The return values are all handles referring to the\n+port mappings that were just created. Pass them to delete_port_mapping()\n+to remove them.
\n+[report issue]\n+\n+reopen_network_sockets()
\n \n-char const* hash_for_piece_ptr (piece_index_t const index) const;\n-sha1_hash hash_for_piece (piece_index_t index) const;\n+void reopen_network_sockets (reopen_network_flags_t options = reopen_map_ports);\n
\n-hash_for_piece() takes a piece-index and returns the 20-bytes\n-sha1-hash for that piece and info_hash() returns the 20-bytes\n-sha1-hash for the info-section of the torrent file.\n-hash_for_piece_ptr() returns a pointer to the 20 byte sha1 digest\n-for the piece. Note that the string is not 0-terminated.
\n-[report issue]\n-\n-name()
\n+Instructs the session to reopen all listen and outgoing sockets.
\n+It's useful in the case your platform doesn't support the built in\n+IP notifier mechanism, or if you have a better more reliable way to\n+detect changes in the IP routing table.
\n+[report issue]\n+\n+native_handle()
\n \n-const std::string& name () const;\n+std::shared_ptr<aux::session_impl> native_handle () const;\n
\n-name() returns the name of the torrent.\n-name contains UTF-8 encoded string.
\n-[report issue]\n-\n-creation_date()
\n+This function is intended only for use by plugins. This type does\n+not have a stable API and should be relied on as little as possible.
\n+[report issue]\n+- save_settings
\n+- saves settings (i.e. the settings_pack)
\n+
\n+[report issue]\n+- save_dht_state
\n+- saves dht state such as nodes and node-id, possibly accelerating\n+joining the DHT if provided at next session startup.
\n+
\n+[report issue]\n+- save_extension_state
\n+- load or save state from plugins
\n+
\n+[report issue]\n+- save_ip_filter
\n+- load or save the IP filter set on the session
\n+
\n+\n+\n+[report issue]\n+- global_peer_class_id tcp_peer_class_id local_peer_class_id
\n+- built-in peer classes
\n+
\n+[report issue]\n+- delete_files
\n+- delete the files belonging to the torrent from disk.\n+including the part-file, if there is one
\n+
\n+[report issue]\n+- delete_partfile
\n+- delete just the part-file associated with this torrent
\n+
\n+[report issue]\n+- paused
\n+- when set, the session will start paused. Call\n+session_handle::resume() to start
\n+
\n+\n+[report issue]\n+- udp tcp
\n+- protocols used by add_port_mapping()
\n+
\n+[report issue]\n+- reopen_map_ports
\n+- This option indicates if the ports are mapped using natpmp\n+and upnp. If mapping was already made, they are deleted and added\n+again. This only works if natpmp and/or upnp are configured to be\n+enable.
\n+
\n+\n+\n+[report issue]\n+\n+\n+read_session_params() write_session_params_buf() write_session_params()
\n+Declared in "libtorrent/session_params.hpp"
\n \n-std::time_t creation_date () const;\n+entry write_session_params (session_params const& sp\n+ , save_state_flags_t flags = save_state_flags_t::all());\n+session_params read_session_params (bdecode_node const& e\n+ , save_state_flags_t flags = save_state_flags_t::all());\n+session_params read_session_params (span<char const> buf\n+ , save_state_flags_t flags = save_state_flags_t::all());\n+std::vector<char> write_session_params_buf (session_params const& sp\n+ , save_state_flags_t flags = save_state_flags_t::all());\n
\n-creation_date() returns the creation date of the torrent as time_t\n-(posix time). If there's no time stamp in the torrent file, 0 is\n-returned.\n-.. posix time: http://www.opengroup.org/onlinepubs/009695399/functions/time.html
\n-[report issue]\n-\n-creator()
\n+These functions serialize and de-serialize a session_params object to and\n+from bencoded form. The session_params object is used to initialize a new\n+session using the state from a previous one (or by programmatically configure\n+the session up-front).\n+The flags parameter can be used to only save and load certain aspects of the\n+session's state.\n+The _buf suffix indicates the function operates on buffer rather than the\n+bencoded structure.\n+The torrents in a session are not part of the session_params state, they have\n+to be restored separately.
\n+[report issue]\n+\n+peer_info
\n+Declared in "libtorrent/peer_info.hpp"
\n+holds information and statistics about one peer\n+that libtorrent is connected to
\n \n-const std::string& creator () const;\n+struct peer_info\n+{\n+ sha256_hash i2p_destination () const;\n+\n+ std::string client;\n+ typed_bitfield<piece_index_t> pieces;\n+ std::int64_t total_download;\n+ std::int64_t total_upload;\n+ time_duration last_request;\n+ time_duration last_active;\n+ time_duration download_queue_time;\n+ static constexpr peer_flags_t interesting = 0_bit;\n+ static constexpr peer_flags_t choked = 1_bit;\n+ static constexpr peer_flags_t remote_interested = 2_bit;\n+ static constexpr peer_flags_t remote_choked = 3_bit;\n+ static constexpr peer_flags_t supports_extensions = 4_bit;\n+ static constexpr peer_flags_t outgoing_connection = 5_bit;\n+ static constexpr peer_flags_t local_connection = 5_bit;\n+ static constexpr peer_flags_t handshake = 6_bit;\n+ static constexpr peer_flags_t connecting = 7_bit;\n+ static constexpr peer_flags_t on_parole = 9_bit;\n+ static constexpr peer_flags_t seed = 10_bit;\n+ static constexpr peer_flags_t optimistic_unchoke = 11_bit;\n+ static constexpr peer_flags_t snubbed = 12_bit;\n+ static constexpr peer_flags_t upload_only = 13_bit;\n+ static constexpr peer_flags_t endgame_mode = 14_bit;\n+ static constexpr peer_flags_t holepunched = 15_bit;\n+ static constexpr peer_flags_t i2p_socket = 16_bit;\n+ static constexpr peer_flags_t utp_socket = 17_bit;\n+ static constexpr peer_flags_t ssl_socket = 18_bit;\n+ static constexpr peer_flags_t rc4_encrypted = 19_bit;\n+ static constexpr peer_flags_t plaintext_encrypted = 20_bit;\n+ peer_flags_t flags;\n+ static constexpr peer_source_flags_t tracker = 0_bit;\n+ static constexpr peer_source_flags_t dht = 1_bit;\n+ static constexpr peer_source_flags_t pex = 2_bit;\n+ static constexpr peer_source_flags_t lsd = 3_bit;\n+ static constexpr peer_source_flags_t resume_data = 4_bit;\n+ static constexpr peer_source_flags_t incoming = 5_bit;\n+ peer_source_flags_t source;\n+ int up_speed;\n+ int down_speed;\n+ int payload_up_speed;\n+ int payload_down_speed;\n+ peer_id pid;\n+ int queue_bytes;\n+ int request_timeout;\n+ int send_buffer_size;\n+ int used_send_buffer;\n+ int receive_buffer_size;\n+ int used_receive_buffer;\n+ int receive_buffer_watermark;\n+ int num_hashfails;\n+ int download_queue_length;\n+ int timed_out_requests;\n+ int busy_requests;\n+ int requests_in_buffer;\n+ int target_dl_queue_length;\n+ int upload_queue_length;\n+ int failcount;\n+ piece_index_t downloading_piece_index;\n+ int downloading_block_index;\n+ int downloading_progress;\n+ int downloading_total;\n+ static constexpr connection_type_t standard_bittorrent = 0_bit;\n+ static constexpr connection_type_t web_seed = 1_bit;\n+ static constexpr connection_type_t http_seed = 2_bit;\n+ connection_type_t connection_type;\n+ int pending_disk_bytes;\n+ int pending_disk_read_bytes;\n+ int send_quota;\n+ int receive_quota;\n+ int rtt;\n+ int num_pieces;\n+ int download_rate_peak;\n+ int upload_rate_peak;\n+ float progress;\n+ int progress_ppm;\n+ tcp::endpoint ip;\n+ tcp::endpoint local_endpoint;\n+ static constexpr bandwidth_state_flags_t bw_idle = 0_bit;\n+ static constexpr bandwidth_state_flags_t bw_limit = 1_bit;\n+ static constexpr bandwidth_state_flags_t bw_network = 2_bit;\n+ static constexpr bandwidth_state_flags_t bw_disk = 4_bit;\n+ bandwidth_state_flags_t read_state;\n+ bandwidth_state_flags_t write_state;\n+};\n \n-creator() returns the creator string in the torrent. If there is\n-no creator string it will return an empty string.
\n-[report issue]\n-\n-comment()
\n+[report issue]\n+i2p_destination()
\n \n-const std::string& comment () const;\n+sha256_hash i2p_destination () const;\n
\n-comment() returns the comment associated with the torrent. If\n-there's no comment, it will return an empty string.\n-comment contains UTF-8 encoded string.
\n-[report issue]\n-\n-nodes()
\n+If this peer is an i2p peer, this function returns the destination\n+address of the peer
\n+[report issue]\n+- client
\n+- A human readable string describing the software at the other end of\n+the connection. In some cases this information is not available, then\n+it will contain a string that may give away something about which\n+software is running in the other end. In the case of a web seed, the\n+server type and version will be a part of this string. This is UTF-8\n+encoded.
\n+
\n+[report issue]\n+- pieces
\n+- a bitfield, with one bit per piece in the torrent. Each bit tells you\n+if the peer has that piece (if it's set to 1) or if the peer miss that\n+piece (set to 0).
\n+
\n+\n+[report issue]\n+- total_download total_upload
\n+- the total number of bytes downloaded from and uploaded to this peer.\n+These numbers do not include the protocol chatter, but only the\n+payload data.
\n+
\n+\n+[report issue]\n+- last_request last_active
\n+- the time since we last sent a request to this peer and since any\n+transfer occurred with this peer
\n+
\n+[report issue]\n+- download_queue_time
\n+- the time until all blocks in the request queue will be downloaded
\n+
\n+[report issue]\n+- interesting
\n+- we are interested in pieces from this peer.
\n+
\n+[report issue]\n+- choked
\n+- we have choked this peer.
\n+
\n+[report issue]\n+- remote_interested
\n+- the peer is interested in us
\n+
\n+[report issue]\n+- remote_choked
\n+- the peer has choked us.
\n+
\n+[report issue]\n+- supports_extensions
\n+- means that this peer supports the\n+extension protocol.
\n+
\n+[report issue]\n+- outgoing_connection
\n+- The connection was initiated by us, the peer has a\n+listen port open, and that port is the same as in the\n+address of this peer. If this flag is not set, this\n+peer connection was opened by this peer connecting to\n+us.
\n+
\n+[report issue]\n+- local_connection
\n+- deprecated synonym for outgoing_connection
\n+
\n+[report issue]\n+- handshake
\n+- The connection is opened, and waiting for the\n+handshake. Until the handshake is done, the peer\n+cannot be identified.
\n+
\n+[report issue]\n+- connecting
\n+- The connection is in a half-open state (i.e. it is\n+being connected).
\n+
\n+[report issue]\n+- on_parole
\n+- The peer has participated in a piece that failed the\n+hash check, and is now "on parole", which means we're\n+only requesting whole pieces from this peer until\n+it either fails that piece or proves that it doesn't\n+send bad data.
\n+
\n+[report issue]\n+- seed
\n+- This peer is a seed (it has all the pieces).
\n+
\n+[report issue]\n+- optimistic_unchoke
\n+- This peer is subject to an optimistic unchoke. It has\n+been unchoked for a while to see if it might unchoke\n+us in return an earn an upload/unchoke slot. If it\n+doesn't within some period of time, it will be choked\n+and another peer will be optimistically unchoked.
\n+
\n+[report issue]\n+- snubbed
\n+- This peer has recently failed to send a block within\n+the request timeout from when the request was sent.\n+We're currently picking one block at a time from this\n+peer.
\n+
\n+[report issue]\n+- upload_only
\n+- This peer has either explicitly (with an extension)\n+or implicitly (by becoming a seed) told us that it\n+will not downloading anything more, regardless of\n+which pieces we have.
\n+
\n+[report issue]\n+- endgame_mode
\n+- This means the last time this peer picket a piece,\n+it could not pick as many as it wanted because there\n+were not enough free ones. i.e. all pieces this peer\n+has were already requested from other peers.
\n+
\n+[report issue]\n+- holepunched
\n+- This flag is set if the peer was in holepunch mode\n+when the connection succeeded. This typically only\n+happens if both peers are behind a NAT and the peers\n+connect via the NAT holepunch mechanism.
\n+
\n+[report issue]\n+- i2p_socket
\n+- indicates that this socket is running on top of the\n+I2P transport.
\n+
\n+[report issue]\n+- utp_socket
\n+- indicates that this socket is a uTP socket
\n+
\n+[report issue]\n+- ssl_socket
\n+- indicates that this socket is running on top of an SSL\n+(TLS) channel
\n+
\n+[report issue]\n+- rc4_encrypted
\n+- this connection is obfuscated with RC4
\n+
\n+[report issue]\n+- plaintext_encrypted
\n+- the handshake of this connection was obfuscated\n+with a Diffie-Hellman exchange
\n+
\n+[report issue]\n+- flags
\n+- tells you in which state the peer is in. It is set to\n+any combination of the peer_flags_t flags above.
\n+
\n+[report issue]\n+- tracker
\n+- The peer was received from the tracker.
\n+
\n+[report issue]\n+- dht
\n+- The peer was received from the kademlia DHT.
\n+
\n+[report issue]\n+- pex
\n+- The peer was received from the peer exchange\n+extension.
\n+
\n+[report issue]\n+- lsd
\n+- The peer was received from the local service\n+discovery (The peer is on the local network).
\n+
\n+[report issue]\n+- resume_data
\n+- The peer was added from the fast resume data.
\n+
\n+[report issue]\n+- incoming
\n+- we received an incoming connection from this peer
\n+
\n+[report issue]\n+- source
\n+- a combination of flags describing from which sources this peer\n+was received. A combination of the peer_source_flags_t above.
\n+
\n+\n+[report issue]\n+- up_speed down_speed
\n+- the current upload and download speed we have to and from this peer\n+(including any protocol messages). updated about once per second
\n+
\n+\n+[report issue]\n+- payload_up_speed payload_down_speed
\n+- The transfer rates of payload data only updated about once per second
\n+
\n+[report issue]\n+- pid
\n+- the peer's id as used in the bittorrent protocol. This id can be used\n+to extract 'fingerprints' from the peer. Sometimes it can tell you\n+which client the peer is using. See identify_client()_
\n+
\n+[report issue]\n+- queue_bytes
\n+- the number of bytes we have requested from this peer, but not yet\n+received.
\n+
\n+[report issue]\n+- request_timeout
\n+- the number of seconds until the current front piece request will time\n+out. This timeout can be adjusted through\n+settings_pack::request_timeout.\n+-1 means that there is not outstanding request.
\n+
\n+\n+[report issue]\n+- send_buffer_size used_send_buffer
\n+- the number of bytes allocated\n+and used for the peer's send buffer, respectively.
\n+
\n+\n+\n+[report issue]\n+- receive_buffer_size used_receive_buffer receive_buffer_watermark
\n+- the number of bytes\n+allocated and used as receive buffer, respectively.
\n+
\n+[report issue]\n+- num_hashfails
\n+- the number of pieces this peer has participated in sending us that\n+turned out to fail the hash check.
\n+
\n+[report issue]\n+- download_queue_length
\n+- this is the number of requests we have sent to this peer that we\n+haven't got a response for yet
\n+
\n+[report issue]\n+- timed_out_requests
\n+- the number of block requests that have timed out, and are still in the\n+download queue
\n+
\n+[report issue]\n+- busy_requests
\n+- the number of busy requests in the download queue. A busy request is a\n+request for a block we've also requested from a different peer
\n+
\n+[report issue]\n+- requests_in_buffer
\n+- the number of requests messages that are currently in the send buffer\n+waiting to be sent.
\n+
\n+[report issue]\n+- target_dl_queue_length
\n+- the number of requests that is tried to be maintained (this is\n+typically a function of download speed)
\n+
\n+[report issue]\n+- upload_queue_length
\n+- the number of piece-requests we have received from this peer\n+that we haven't answered with a piece yet.
\n+
\n+[report issue]\n+- failcount
\n+- the number of times this peer has "failed". i.e. failed to connect or\n+disconnected us. The failcount is decremented when we see this peer in\n+a tracker response or peer exchange message.
\n+
\n+\n+\n+\n+[report issue]\n+- downloading_piece_index downloading_block_index downloading_progress downloading_total
\n+- You can know which piece, and which part of that piece, that is\n+currently being downloaded from a specific peer by looking at these\n+four members. downloading_piece_index is the index of the piece\n+that is currently being downloaded. This may be set to -1 if there's\n+currently no piece downloading from this peer. If it is >= 0, the\n+other three members are valid. downloading_block_index is the\n+index of the block (or sub-piece) that is being downloaded.\n+downloading_progress is the number of bytes of this block we have\n+received from the peer, and downloading_total is the total number\n+of bytes in this block.
\n+
\n+[report issue]\n+- standard_bittorrent
\n+- Regular bittorrent connection
\n+
\n+[report issue]\n+- web_seed
\n+- HTTP connection using the BEP 19 protocol
\n+
\n+[report issue]\n+- http_seed
\n+- HTTP connection using the BEP 17 protocol
\n+
\n+[report issue]\n+- connection_type
\n+- the kind of connection this peer uses. See connection_type_t.
\n+
\n+[report issue]\n+- pending_disk_bytes
\n+- the number of bytes this peer has pending in the disk-io thread.\n+Downloaded and waiting to be written to disk. This is what is capped\n+by settings_pack::max_queued_disk_bytes.
\n+
\n+[report issue]\n+- pending_disk_read_bytes
\n+- number of outstanding bytes to read\n+from disk
\n+
\n+\n+[report issue]\n+- send_quota receive_quota
\n+- the number of bytes this peer has been assigned to be allowed to send\n+and receive until it has to request more quota from the bandwidth\n+manager.
\n+
\n+[report issue]\n+- rtt
\n+- an estimated round trip time to this peer, in milliseconds. It is\n+estimated by timing the TCP connect(). It may be 0 for\n+incoming connections.
\n+
\n+[report issue]\n+- num_pieces
\n+- the number of pieces this peer has.
\n+
\n+\n+[report issue]\n+- download_rate_peak upload_rate_peak
\n+- the highest download and upload rates seen on this connection. They\n+are given in bytes per second. This number is reset to 0 on reconnect.
\n+
\n+[report issue]\n+- progress
\n+- the progress of the peer in the range [0, 1]. This is always 0 when\n+floating point operations are disabled, instead use progress_ppm.
\n+
\n+[report issue]\n+- progress_ppm
\n+- indicates the download progress of the peer in the range [0, 1000000]\n+(parts per million).
\n+
\n+[report issue]\n+- ip
\n+- the IP-address to this peer. The type is an asio endpoint. For\n+more info, see the asio documentation. This field is not valid for\n+i2p peers. Instead use the i2p_destination() function.
\n+
\n+[report issue]\n+- local_endpoint
\n+- the IP and port pair the socket is bound to locally. i.e. the IP\n+address of the interface it's going out over. This may be useful for\n+multi-homed clients with multiple interfaces to the internet.\n+This field is not valid for i2p peers.
\n+
\n+[report issue]\n+- bw_idle
\n+- The peer is not waiting for any external events to\n+send or receive data.
\n+
\n+[report issue]\n+- bw_limit
\n+- The peer is waiting for the rate limiter.
\n+
\n+[report issue]\n+- bw_network
\n+- The peer has quota and is currently waiting for a\n+network read or write operation to complete. This is\n+the state all peers are in if there are no bandwidth\n+limits.
\n+
\n+[report issue]\n+- bw_disk
\n+- The peer is waiting for the disk I/O thread to catch\n+up writing buffers to disk before downloading more.
\n+
\n+\n+[report issue]\n+- read_state write_state
\n+- bitmasks indicating what state this peer\n+is in with regards to sending and receiving data. The states are\n+defined as independent flags of type bandwidth_state_flags_t, in this\n+class.
\n+
\n+[report issue]\n+\n+\n+info_hash_t
\n+Declared in "libtorrent/info_hash.hpp"
\n+class holding the info-hash of a torrent. It can hold a v1 info-hash\n+(SHA-1) or a v2 info-hash (SHA-256) or both.
\n+\n+Note
\n+If has_v2() is false then the v1 hash might actually be a truncated\n+v2 hash
\n+\n \n-std::vector<std::pair<std::string, int>> const& nodes () const;\n+struct info_hash_t\n+{\n+ explicit info_hash_t (sha256_hash h2) noexcept;\n+ explicit info_hash_t (sha1_hash h1) noexcept;\n+ info_hash_t () noexcept = default;\n+ info_hash_t (sha1_hash h1, sha256_hash h2) noexcept;\n+ bool has_v1 () const;\n+ bool has (protocol_version v) const;\n+ bool has_v2 () const;\n+ sha1_hash get (protocol_version v) const;\n+ sha1_hash get_best () const;\n+ friend bool operator!= (info_hash_t const& lhs, info_hash_t const& rhs);\n+ friend bool operator== (info_hash_t const& lhs, info_hash_t const& rhs) noexcept;\n+ template <typename F> void for_each (F f) const;\n+ bool operator< (info_hash_t const& o) const;\n+ friend std::ostream& operator<< (std::ostream& os, info_hash_t const& ih);\n+\n+ sha1_hash v1;\n+ sha256_hash v2;\n+};\n \n-If this torrent contains any DHT nodes, they are put in this vector in\n-their original form (host name and port number).
\n-[report issue]\n-\n-add_node()
\n+[report issue]\n+info_hash_t()
\n \n-void add_node (std::pair<std::string, int> const& node);\n+explicit info_hash_t (sha256_hash h2) noexcept;\n+explicit info_hash_t (sha1_hash h1) noexcept;\n+info_hash_t () noexcept = default;\n+info_hash_t (sha1_hash h1, sha256_hash h2) noexcept;\n
\n-This is used when creating torrent. Use this to add a known DHT node.\n-It may be used, by the client, to bootstrap into the DHT network.
\n-[report issue]\n-\n-parse_info_section()
\n+The default constructor creates an object that has neither a v1 or v2\n+hash.
\n+For backwards compatibility, make it possible to construct directly\n+from a v1 hash. This constructor allows implicit conversion from a\n+v1 hash, but the implicitness is deprecated.
\n+\n+\n+[report issue]\n+\n+has_v2() has() has_v1()
\n \n-bool parse_info_section (bdecode_node const& info, error_code& ec, int max_pieces);\n+bool has_v1 () const;\n+bool has (protocol_version v) const;\n+bool has_v2 () const;\n
\n-populates the torrent_info by providing just the info-dict buffer.\n-This is used when loading a torrent from a magnet link for instance,\n-where we only have the info-dict. The bdecode_node e points to a\n-parsed info-dictionary. ec returns an error code if something\n-fails (typically if the info dictionary is malformed).\n-The max_pieces parameter allows limiting the amount of memory\n-dedicated to loading the torrent, and fails for torrents that exceed\n-the limit. To load large torrents, this limit may also need to be\n-raised in settings_pack::max_piece_count and in calls to\n-read_resume_data().
\n-[report issue]\n-\n-info()
\n+returns true if the corresponding info hash is present in this\n+object.
\n+[report issue]\n+\n+get()
\n \n-bdecode_node info (char const* key) const;\n+sha1_hash get (protocol_version v) const;\n
\n-This function looks up keys from the info-dictionary of the loaded\n-torrent file. It can be used to access extension values put in the\n-.torrent file. If the specified key cannot be found, it returns nullptr.
\n-[report issue]\n-\n+\n+get_best()
\n \n-span<char const> info_section () const;\n+sha1_hash get_best () const;\n
\n-returns a the raw info section of the torrent file.\n-The underlying buffer is still owned by the torrent_info object
\n-[report issue]\n-\n-piece_layer()
\n+returns the v2 (truncated) info-hash, if there is one, otherwise\n+returns the v1 info-hash
\n+[report issue]\n+\n+for_each()
\n \n-span<char const> piece_layer (file_index_t) const;\n+template <typename F> void for_each (F f) const;\n
\n-return the bytes of the piece layer hashes for the specified file. If\n-the file doesn't have a piece layer, an empty span is returned.\n-The span size is divisible by 32, the size of a SHA-256 hash.\n-If the size of the file is smaller than or equal to the piece size,\n-the files "root hash" is the hash of the file and is not saved\n-separately in the "piece layers" field, but this function still\n-returns the root hash of the file in that case.
\n-[report issue]\n-\n-free_piece_layers()
\n+calls the function object f for each hash that is available.\n+starting with v1. The signature of F is:
\n \n-void free_piece_layers ();\n+void(sha1_hash const&, protocol_version);\n
\n-clears the piece layers from the torrent_info. This is done by the\n-session when a torrent is added, to avoid storing it twice. The piece\n-layer (or other hashes part of the merkle tree) are stored in the\n-internal torrent object.
\n-Bencoding is a common representation in bittorrent used for dictionary,\n-list, int and string hierarchies. It's used to encode .torrent files and\n-some messages in the network protocol. libtorrent also uses it to store\n-settings, resume data and other session state.
\n-Strings in bencoded structures do not necessarily represent text.\n-Strings are raw byte buffers of a certain length. If a string is meant to be\n-interpreted as text, it is required to be UTF-8 encoded. See BEP 3.
\n-The function for decoding bencoded data bdecode(), returning a bdecode_node.\n-This function builds a tree that points back into the original buffer. The\n-returned bdecode_node will not be valid once the buffer it was parsed out of\n-is discarded.
\n-It's possible to construct an entry from a bdecode_node, if a structure needs\n-to be altered and re-encoded.
\n-[report issue]\n+[report issue]\n \n-\n-entry
\n-Declared in "libtorrent/entry.hpp"
\n-The entry class represents one node in a bencoded hierarchy. It works as a\n-variant type, it can be either a list, a dictionary (std::map), an integer\n-or a string.
\n+\n+peer_request
\n+Declared in "libtorrent/peer_request.hpp"
\n+represents a byte range within a piece. Internally this is is used for\n+incoming piece requests.
\n \n-class entry\n+struct peer_request\n {\n- data_type type () const;\n- entry (dictionary_type);\n- entry (span<char const>);\n- entry (list_type);\n- entry (preformatted_type);\n- entry (integer_type);\n- entry (U v);\n- entry (data_type t);\n- entry (bdecode_node const& n);\n- entry& operator= (entry&&) & noexcept;\n- entry& operator= (bdecode_node const&) &;\n- entry& operator= (list_type) &;\n- entry& operator= (dictionary_type) &;\n- entry& operator= (integer_type) &;\n- entry& operator= (entry const&) &;\n- entry& operator= (preformatted_type) &;\n- entry& operator= (span<char const>) &;\n- entry& operator= (U v) &;\n- dictionary_type const& dict () const;\n- list_type const& list () const;\n- preformatted_type const& preformatted () const;\n- string_type& string ();\n- integer_type& integer ();\n- string_type const& string () const;\n- dictionary_type& dict ();\n- integer_type const& integer () const;\n- list_type& list ();\n- preformatted_type& preformatted ();\n- void swap (entry& e);\n- entry& operator[] (string_view key);\n- entry const& operator[] (string_view key) const;\n- entry* find_key (string_view key);\n- entry const* find_key (string_view key) const;\n- std::string to_string (bool single_line = false) const;\n+ bool operator== (peer_request const& r) const;\n \n- enum data_type\n- {\n- int_t,\n- string_t,\n- list_t,\n- dictionary_t,\n- undefined_t,\n- preformatted_t,\n- };\n+ piece_index_t piece;\n+ int start;\n+ int length;\n };\n \n-[report issue]\n-type()
\n-\n-data_type type () const;\n-
\n-returns the concrete type of the entry
\n-[report issue]\n-\n-entry()
\n-\n-entry (dictionary_type);\n-entry (span<char const>);\n-entry (list_type);\n-entry (preformatted_type);\n-entry (integer_type);\n-
\n-constructors directly from a specific type.\n-The content of the argument is copied into the\n-newly constructed entry
\n-[report issue]\n-\n-entry()
\n+[report issue]\n+operator==()
\n \n-entry (data_type t);\n+bool operator== (peer_request const& r) const;\n
\n-construct an empty entry of the specified type.\n-see data_type enum.
\n-[report issue]\n-\n-entry()
\n+returns true if the right hand side peer_request refers to the same\n+range as this does.
\n+[report issue]\n+- piece
\n+- The index of the piece in which the range starts.
\n+
\n+[report issue]\n+- start
\n+- The byte offset within that piece where the range starts.
\n+
\n+[report issue]\n+- length
\n+- The size of the range, in bytes.
\n+
\n+[report issue]\n+\n+\n+piece_block
\n+Declared in "libtorrent/piece_block.hpp"
\n \n-entry (bdecode_node const& n);\n+struct piece_block\n+{\n+ piece_block (piece_index_t p_index, int b_index);\n+ piece_block () = default;\n+ bool operator< (piece_block const& b) const;\n+ bool operator== (piece_block const& b) const;\n+ bool operator!= (piece_block const& b) const;\n+\n+ static const piece_block invalid;\n+ piece_index_t piece_index {0};\n+ int block_index = 0;\n+};\n \n-construct from bdecode_node parsed form (see bdecode())
\n-[report issue]\n-\n+\n+truncate_files()
\n+Declared in "libtorrent/truncate.hpp"
\n \n-entry& operator= (entry&&) & noexcept;\n-entry& operator= (bdecode_node const&) &;\n-entry& operator= (list_type) &;\n-entry& operator= (dictionary_type) &;\n-entry& operator= (integer_type) &;\n-entry& operator= (entry const&) &;\n-entry& operator= (preformatted_type) &;\n-entry& operator= (span<char const>) &;\n+void truncate_files (file_storage const& fs, std::string const& save_path, storage_error& ec);\n
\n-copies the structure of the right hand side into this\n-entry.
\n-\n-\n-\n-\n-[report issue]\n-\n-string() integer() list() preformatted() dict()
\n+Truncates files larger than specified in the file_storage, saved under\n+the specified save_path.
\n+\n+\n+[report issue]\n+\n+load_torrent_parsed() load_torrent_file() load_torrent_buffer()
\n+Declared in "libtorrent/load_torrent.hpp"
\n \n-dictionary_type const& dict () const;\n-list_type const& list () const;\n-preformatted_type const& preformatted () const;\n-string_type& string ();\n-integer_type& integer ();\n-string_type const& string () const;\n-dictionary_type& dict ();\n-integer_type const& integer () const;\n-list_type& list ();\n-preformatted_type& preformatted ();\n-
\n-The integer(), string(), list() and dict() functions\n-are accessors that return the respective type. If the entry object\n-isn't of the type you request, the accessor will throw\n-system_error. You can ask an entry for its type through the\n-type() function.
\n-If you want to create an entry you give it the type you want it to\n-have in its constructor, and then use one of the non-const accessors\n-to get a reference which you then can assign the value you want it to\n-have.
\n-The typical code to get info from a torrent file will then look like\n-this:
\n-\n-entry torrent_file;\n-// ...\n-\n-// throws if this is not a dictionary\n-entry::dictionary_type const& dict = torrent_file.dict();\n-entry::dictionary_type::const_iterator i;\n-i = dict.find("announce");\n-if (i != dict.end())\n-{\n- std::string tracker_url = i->second.string();\n- std::cout << tracker_url << "\\n";\n-}\n-
\n-The following code is equivalent, but a little bit shorter:
\n-\n-entry torrent_file;\n-// ...\n-\n-// throws if this is not a dictionary\n-if (entry* i = torrent_file.find_key("announce"))\n-{\n- std::string tracker_url = i->string();\n- std::cout << tracker_url << "\\n";\n-}\n+add_torrent_params load_torrent_buffer (\n+ span<char const> buffer);\n+add_torrent_params load_torrent_parsed (\n+ bdecode_node const& torrent_file, load_torrent_limits const& cfg);\n+add_torrent_params load_torrent_file (\n+ std::string const& filename);\n+add_torrent_params load_torrent_buffer (\n+ span<char const> buffer, load_torrent_limits const& cfg);\n+add_torrent_params load_torrent_parsed (\n+ bdecode_node const& torrent_file);\n+add_torrent_params load_torrent_file (\n+ std::string const& filename, load_torrent_limits const& cfg);\n
\n-To make it easier to extract information from a torrent file, the\n-class torrent_info exists.
\n-[report issue]\n-\n-swap()
\n+These functions load the content of a .torrent file into an\n+add_torrent_params object.\n+The immutable part of a torrent file (the info-dictionary) is stored in\n+the ti field in the add_torrent_params object (as a torrent_info\n+object).\n+The returned object is suitable to be:
\n+\n+\n+- added to a session via add_torrent() or async_add_torrent()
\n+- saved as a .torrent_file via write_torrent_file()
\n+- turned into a magnet link via make_magnet_uri()
\n+
\n+
\n+[report issue]\n+\n+torrent_peer_equal()
\n+Declared in "libtorrent/torrent_peer.hpp"
\n \n-void swap (entry& e);\n+inline bool torrent_peer_equal (torrent_peer const* lhs, torrent_peer const* rhs);\n
\n-swaps the content of this with e.
\n-[report issue]\n-\n+\n+make_magnet_uri()
\n+Declared in "libtorrent/magnet_uri.hpp"
\n \n-entry& operator[] (string_view key);\n-entry const& operator[] (string_view key) const;\n+std::string make_magnet_uri (add_torrent_params const& atp);\n+std::string make_magnet_uri (torrent_info const& info);\n+std::string make_magnet_uri (torrent_handle const& handle);\n
\n-All of these functions requires the entry to be a dictionary, if it\n-isn't they will throw system_error.
\n-The non-const versions of the operator[] will return a reference\n-to either the existing element at the given key or, if there is no\n-element with the given key, a reference to a newly inserted element at\n-that key.
\n-The const version of operator[] will only return a reference to an\n-existing element at the given key. If the key is not found, it will\n-throw system_error.
\n-[report issue]\n-\n-find_key()
\n+Generates a magnet URI from the specified torrent.
\n+Several fields from the add_torrent_params objects are recorded in the\n+magnet link. In order to not include them, they have to be cleared before\n+calling make_magnet_uri(). These fields are used:
\n+\n+ti, info_hashes, url_seeds, dht_nodes,\n+file_priorities, trackers, name, peers.
\n+Depending on what the use case for the resulting magnet link is, clearing\n+peers and dht_nodes is probably a good idea if the add_torrent_params\n+came from a running torrent. Those lists may be long and be ephemeral.
\n+If none of the info_hashes or ti fields are set, there is not\n+info-hash available, and a magnet link cannot be created. In this case\n+make_magnet_uri() returns an empty string.
\n+The recommended way to generate a magnet link from a torrent_handle is to\n+call save_resume_data(), which will post a save_resume_data_alert\n+containing an add_torrent_params object. This can then be passed to\n+make_magnet_uri().
\n+The overload that takes a torrent_handle will make blocking calls to\n+query information about the torrent. If the torrent handle is invalid,\n+an empty string is returned.
\n+For more information about magnet links, see magnet links.
\n+[report issue]\n+\n+parse_magnet_uri()
\n+Declared in "libtorrent/magnet_uri.hpp"
\n \n-entry* find_key (string_view key);\n-entry const* find_key (string_view key) const;\n+add_torrent_params parse_magnet_uri (string_view uri);\n+void parse_magnet_uri (string_view uri, add_torrent_params& p, error_code& ec);\n+add_torrent_params parse_magnet_uri (string_view uri, error_code& ec);\n
\n-These functions requires the entry to be a dictionary, if it isn't\n-they will throw system_error.
\n-They will look for an element at the given key in the dictionary, if\n-the element cannot be found, they will return nullptr. If an element\n-with the given key is found, the return a pointer to it.
\n-[report issue]\n-\n-to_string()
\n+This function parses out information from the magnet link and populates the\n+add_torrent_params object. The overload that does not take an\n+error_code reference will throw a system_error on error\n+The overload taking an add_torrent_params reference will fill in the\n+fields specified in the magnet URI.
\n+[report issue]\n+\n+version()
\n+Declared in "libtorrent/version.hpp"
\n \n-std::string to_string (bool single_line = false) const;\n+char const* version ();\n
\n-returns a pretty-printed string representation\n-of the bencoded structure, with JSON-style syntax
\n-[report issue]\n-\n-enum data_type
\n-Declared in "libtorrent/entry.hpp"
\n+returns the libtorrent version as string form in this format:\n+"<major>.<minor>.<tiny>.<tag>"
\n+[report issue]\n+\n+enum protocol_version
\n+Declared in "libtorrent/info_hash.hpp"
\n \n \n- \n \n name \n value \n description \n int_t \n+V1 \n 0 \n- \n+The original BitTorrent version, using SHA-1 hashes \n string_t \n+V2 \n 1 \n- \n+Version 2 of the BitTorrent protocol, using SHA-256 hashes \n list_t \n+NUM \n 2 \n \n dictionary_t \n-3 \n+
\n+[report issue]\n+\n+enum connection_type
\n+Declared in "libtorrent/peer_connection.hpp"
\n+\n+\n+ \n+\n+name \n+value \n+description \n+bittorrent \n+0 \n \n undefined_t \n-4 \n+url_seed \n+1 \n \n preformatted_t \n-5 \n+http_seed \n+2 \n \n
\n-[report issue]\n-\n-\n-bencode()
\n-Declared in "libtorrent/bencode.hpp"
\n-\n-template<class OutIt> int bencode (OutIt out, const entry& e);\n-
\n-This function will encode data to bencoded form.
\n-The entry class is the internal representation of the bencoded data\n-and it can be used to retrieve information, an entry can also be build by\n-the program and given to bencode() to encode it into the OutIt\n-iterator.
\n-OutIt is an OutputIterator. It's a template and usually\n-instantiated as ostream_iterator or back_insert_iterator. This\n-function assumes the value_type of the iterator is a char.\n-In order to encode entry e into a buffer, do:
\n-\n-std::vector<char> buf;\n-bencode(std::back_inserter(buf), e);\n-
\n-[report issue]\n-\n-operator<<()
\n-Declared in "libtorrent/entry.hpp"
\n-\n-inline std::ostream& operator<< (std::ostream& os, const entry& e);\n-
\n-prints the bencoded structure to the ostream as a JSON-style structure.
\n-The pop_alerts() function on session is the main interface for retrieving\n-alerts (warnings, messages and errors from libtorrent). If no alerts have\n-been posted by libtorrent pop_alerts() will return an empty list.
\n-By default, only errors are reported. settings_pack::alert_mask can be\n-used to specify which kinds of events should be reported. The alert mask is\n-a combination of the alert_category_t flags in the alert class.
\n-Every alert belongs to one or more category. There is a cost associated with\n-posting alerts. Only alerts that belong to an enabled category are\n-posted. Setting the alert bitmask to 0 will disable all alerts (except those\n-that are non-discardable). Alerts that are responses to API calls such as\n-save_resume_data() and post_session_stats() are non-discardable and will be\n-posted even if their category is disabled.
\n-There are other alert base classes that some alerts derive from, all the\n-alerts that are generated for a specific torrent are derived from\n-torrent_alert, and tracker events derive from tracker_alert.
\n-Alerts returned by pop_alerts() are only valid until the next call to\n-pop_alerts(). You may not copy an alert object to access it after the next\n-call to pop_alerts(). Internal members of alerts also become invalid once\n-pop_alerts() is called again.
\n-[report issue]\n-\n-dht_routing_bucket
\n-Declared in "libtorrent/alert_types.hpp"
\n-struct to hold information about a single DHT routing table bucket
\n-\n-struct dht_routing_bucket\n-{\n- int num_nodes;\n- int num_replacements;\n- int last_active;\n-};\n-\n-\n-[report issue]\n-- num_nodes num_replacements
\n-- the total number of nodes and replacement nodes\n-in the routing table
\n-
\n-[report issue]\n-- last_active
\n-- number of seconds since last activity
\n-
\n-[report issue]\n-\n-torrent_alert
\n-Declared in "libtorrent/alert_types.hpp"
\n-This is a base class for alerts that are associated with a\n-specific torrent. It contains a handle to the torrent.
\n-Note that by the time the client receives a torrent_alert, its\n-handle member may be invalid.
\n-\n-struct torrent_alert : alert\n-{\n- std::string message () const override;\n- char const* torrent_name () const;\n-\n- torrent_handle handle;\n-};\n-\n-[report issue]\n-message()
\n-\n-std::string message () const override;\n-
\n-returns the message associated with this alert
\n-[report issue]\n-- handle
\n-- The torrent_handle pointing to the torrent this\n-alert is associated with.
\n-
\n-[report issue]\n-\n-\n-peer_alert
\n-Declared in "libtorrent/alert_types.hpp"
\n-The peer alert is a base class for alerts that refer to a specific peer. It includes all\n-the information to identify the peer. i.e. ip and peer-id.
\n-\n-struct peer_alert : torrent_alert\n-{\n- std::string message () const override;\n-\n- aux::noexcept_movable<tcp::endpoint> endpoint;\n- peer_id pid;\n-};\n-\n-[report issue]\n-- endpoint
\n-- The peer's IP address and port.
\n-
\n-[report issue]\n-- pid
\n-- the peer ID, if known.
\n-
\n-[report issue]\n-\n-tracker_alert
\n-Declared in "libtorrent/alert_types.hpp"
\n-This is a base class used for alerts that are associated with a\n-specific tracker. It derives from torrent_alert since a tracker\n-is also associated with a specific torrent.
\n-\n-struct tracker_alert : torrent_alert\n-{\n- std::string message () const override;\n- char const* tracker_url () const;\n-\n- aux::noexcept_movable<tcp::endpoint> local_endpoint;\n-};\n-\n-[report issue]\n-tracker_url()
\n-\n-char const* tracker_url () const;\n-
\n-returns a 0-terminated string of the tracker's URL
\n-[report issue]\n-- local_endpoint
\n-- endpoint of the listen interface being announced
\n-
\n-[report issue]\n-\n-\n-torrent_removed_alert
\n-Declared in "libtorrent/alert_types.hpp"
\n-The torrent_removed_alert is posted whenever a torrent is removed. Since\n-the torrent handle in its base class will usually be invalid (since the torrent\n-is already removed) it has the info hash as a member, to identify it.\n-It's posted when the alert_category::status bit is set in the alert_mask.
\n-Note that the handle remains valid for some time after\n-torrent_removed_alert is posted, as long as some internal libtorrent\n-task (such as an I/O task) refers to it. Additionally, other alerts like\n-save_resume_data_alert may be posted after torrent_removed_alert.\n-To synchronize on whether the torrent has been removed or not, call\n-torrent_handle::in_session(). This will return true before\n-torrent_removed_alert is posted, and false afterward.
\n-Even though the handle member doesn't point to an existing torrent anymore,\n-it is still useful for comparing to other handles, which may also no\n-longer point to existing torrents, but to the same non-existing torrents.
\n-The torrent_handle acts as a weak_ptr, even though its object no\n-longer exists, it can still compare equal to another weak pointer which\n-points to the same non-existent object.
\n-\n-struct torrent_removed_alert final : torrent_alert\n-{\n- std::string message () const override;\n-\n- static constexpr alert_category_t static_category = alert_category::status;\n- info_hash_t info_hashes;\n- client_data_t userdata;\n-};\n-\n-[report issue]\n-- userdata
\n-- 'userdata` as set in add_torrent_params at torrent creation.\n-This can be used to associate this torrent with related data\n-in the client application more efficiently than info_hashes.
\n-
\n-[report issue]\n-\n-read_piece_alert
\n-Declared in "libtorrent/alert_types.hpp"
\n-This alert is posted when the asynchronous read operation initiated by\n-a call to torrent_handle::read_piece() is completed. If the read failed, the torrent\n-is paused and an error state is set and the buffer member of the alert\n-is 0. If successful, buffer points to a buffer containing all the data\n-of the piece. piece is the piece index that was read. size is the\n-number of bytes that was read.
\n-If the operation fails, error will indicate what went wrong.
\n-\n-struct read_piece_alert final : torrent_alert\n-{\n- std::string message () const override;\n-\n- static constexpr alert_category_t static_category = alert_category::storage;\n- error_code const error;\n- boost::shared_array<char> const buffer;\n- piece_index_t const piece;\n- int const size;\n-};\n-\n-[report issue]\n-\n-file_completed_alert
\n-Declared in "libtorrent/alert_types.hpp"
\n-This is posted whenever an individual file completes its download. i.e.\n-All pieces overlapping this file have passed their hash check.
\n-\n-struct file_completed_alert final : torrent_alert\n-{\n- std::string message () const override;\n-\n- file_index_t const index;\n-};\n-\n-[report issue]\n-- index
\n-- refers to the index of the file that completed.
\n-
\n-[report issue]\n-\n-file_renamed_alert
\n-Declared in "libtorrent/alert_types.hpp"
\n-This is posted as a response to a torrent_handle::rename_file() call, if the rename\n-operation succeeds.
\n-\n-struct file_renamed_alert final : torrent_alert\n-{\n- std::string message () const override;\n- char const* new_name () const;\n- char const* old_name () const;\n-\n- static constexpr alert_category_t static_category = alert_category::storage;\n- file_index_t const index;\n-};\n-\n-\n-[report issue]\n-new_name() old_name()
\n-\n-char const* new_name () const;\n-char const* old_name () const;\n-
\n-returns the new and previous file name, respectively.
\n-[report issue]\n-- index
\n-- refers to the index of the file that was renamed,
\n-
\n-[report issue]\n-\n-\n-file_rename_failed_alert
\n-Declared in "libtorrent/alert_types.hpp"
\n-This is posted as a response to a torrent_handle::rename_file() call, if the rename\n-operation failed.
\n-\n-struct file_rename_failed_alert final : torrent_alert\n-{\n- std::string message () const override;\n-\n- static constexpr alert_category_t static_category = alert_category::storage;\n- file_index_t const index;\n- error_code const error;\n-};\n-\n-\n-[report issue]\n-- index error
\n-- refers to the index of the file that was supposed to be renamed,\n-error is the error code returned from the filesystem.
\n-
\n-[report issue]\n-\n-performance_alert
\n-Declared in "libtorrent/alert_types.hpp"
\n-This alert is generated when a limit is reached that might have a negative impact on\n-upload or download rate performance.
\n-\n-struct performance_alert final : torrent_alert\n-{\n- std::string message () const override;\n-\n- enum performance_warning_t\n- {\n- outstanding_disk_buffer_limit_reached,\n- outstanding_request_limit_reached,\n- upload_limit_too_low,\n- download_limit_too_low,\n- send_buffer_watermark_too_low,\n- too_many_optimistic_unchoke_slots,\n- too_high_disk_queue_limit,\n- aio_limit_reached,\n- deprecated_bittyrant_with_no_uplimit,\n- too_few_outgoing_ports,\n- too_few_file_descriptors,\n- num_warnings,\n- };\n-\n- static constexpr alert_category_t static_category = alert_category::performance_warning;\n- performance_warning_t const warning_code;\n-};\n-\n-[report issue]\n+\n+enum socket_type_t
\n+Declared in "libtorrent/socket_type.hpp"
\n \n \n- \n \n name \n value \n description \n outstanding_disk_buffer_limit_reached \n+tcp \n 0 \n-This warning means that the number of bytes queued to be written to disk\n-exceeds the max disk byte queue setting (settings_pack::max_queued_disk_bytes).\n-This might restrict the download rate, by not queuing up enough write jobs\n-to the disk I/O thread. When this alert is posted, peer connections are\n-temporarily stopped from downloading, until the queued disk bytes have fallen\n-below the limit again. Unless your max_queued_disk_bytes setting is already\n-high, you might want to increase it to get better performance. \n+ \n outstanding_request_limit_reached \n+socks5 \n 1 \n-This is posted when libtorrent would like to send more requests to a peer,\n-but it's limited by settings_pack::max_out_request_queue. The queue length\n-libtorrent is trying to achieve is determined by the download rate and the\n-assumed round-trip-time (settings_pack::request_queue_time). The assumed\n-round-trip-time is not limited to just the network RTT, but also the remote disk\n-access time and message handling time. It defaults to 3 seconds. The target number\n-of outstanding requests is set to fill the bandwidth-delay product (assumed RTT\n-times download rate divided by number of bytes per request). When this alert\n-is posted, there is a risk that the number of outstanding requests is too low\n-and limits the download rate. You might want to increase the max_out_request_queue\n-setting. \n+ \n upload_limit_too_low \n+http \n 2 \n-This warning is posted when the amount of TCP/IP overhead is greater than the\n-upload rate limit. When this happens, the TCP/IP overhead is caused by a much\n-faster download rate, triggering TCP ACK packets. These packets eat into the\n-rate limit specified to libtorrent. When the overhead traffic is greater than\n-the rate limit, libtorrent will not be able to send any actual payload, such\n-as piece requests. This means the download rate will suffer, and new requests\n-can be sent again. There will be an equilibrium where the download rate, on\n-average, is about 20 times the upload rate limit. If you want to maximize the\n-download rate, increase the upload rate limit above 5% of your download capacity. \n+ \n download_limit_too_low \n+utp \n 3 \n-This is the same warning as upload_limit_too_low but referring to the download\n-limit instead of upload. This suggests that your download rate limit is much lower\n-than your upload capacity. Your upload rate will suffer. To maximize upload rate,\n-make sure your download rate limit is above 5% of your upload capacity. \n+ \n send_buffer_watermark_too_low \n+i2p \n 4 \n-We're stalled on the disk. We want to write to the socket, and we can write\n-but our send buffer is empty, waiting to be refilled from the disk.\n-This either means the disk is slower than the network connection\n-or that our send buffer watermark is too small, because we can\n-send it all before the disk gets back to us.\n-The number of bytes that we keep outstanding, requested from the disk, is calculated\n-as follows:
\n-\n-min(512, max(upload_rate * send_buffer_watermark_factor / 100, send_buffer_watermark))\n-
\n-If you receive this alert, you might want to either increase your send_buffer_watermark\n-or send_buffer_watermark_factor.
\n- \n too_many_optimistic_unchoke_slots \n+tcp_ssl \n 5 \n-If the half (or more) of all upload slots are set as optimistic unchoke slots, this\n-warning is issued. You probably want more regular (rate based) unchoke slots. \n+ \n too_high_disk_queue_limit \n+socks5_ssl \n 6 \n-If the disk write queue ever grows larger than half of the cache size, this warning\n-is posted. The disk write queue eats into the total disk cache and leaves very little\n-left for the actual cache. This causes the disk cache to oscillate in evicting large\n-portions of the cache before allowing peers to download any more, onto the disk write\n-queue. Either lower max_queued_disk_bytes or increase cache_size. \n+ \n aio_limit_reached \n+http_ssl \n 7 \n \n deprecated_bittyrant_with_no_uplimit \n+utp_ssl \n 8 \n \n too_few_outgoing_ports \n-9 \n-This is generated if outgoing peer connections are failing because of address in use\n-errors, indicating that settings_pack::outgoing_ports is set and is too small of\n-a range. Consider not using the outgoing_ports setting at all, or widen the range to\n-include more ports. \n+
\n+[report issue]\n+\n+enum event_t
\n+Declared in "libtorrent/tracker_manager.hpp"
\n+\n+\n+ \n+\n+name \n+value \n+description \n too_few_file_descriptors \n-10 \n+none \n+0 \n \n num_warnings \n-11 \n+completed \n+1 \n+ \n+started \n+2 \n+ \n+stopped \n+3 \n+ \n+paused \n+4 \n \n
\n-[report issue]\n-\n-\n-state_changed_alert
\n-Declared in "libtorrent/alert_types.hpp"
\n-Generated whenever a torrent changes its state.
\n-\n-struct state_changed_alert final : torrent_alert\n-{\n- std::string message () const override;\n-\n- static constexpr alert_category_t static_category = alert_category::status;\n- torrent_status::state_t const state;\n- torrent_status::state_t const prev_state;\n-};\n-\n-[report issue]\n-- state
\n-- the new state of the torrent.
\n-
\n-[report issue]\n-- prev_state
\n-- the previous state.
\n-
\n-[report issue]\n-\n-tracker_error_alert
\n-Declared in "libtorrent/alert_types.hpp"
\n-This alert is generated on tracker time outs, premature disconnects,\n-invalid response or a HTTP response other than "200 OK". From the alert\n-you can get the handle to the torrent the tracker belongs to.
\n-\n-struct tracker_error_alert final : tracker_alert\n-{\n- std::string message () const override;\n- char const* failure_reason () const;\n-\n- static constexpr alert_category_t static_category = alert_category::tracker | alert_category::error;\n- int const times_in_row;\n- error_code const error;\n- operation_t op;\n- protocol_version version;\n-};\n-\n-[report issue]\n-failure_reason()
\n-\n-char const* failure_reason () const;\n-
\n-if the tracker sent a "failure reason" string, it will be returned\n-here.
\n-[report issue]\n-- times_in_row
\n-- This member says how many times in a row this tracker has failed.
\n-
\n-[report issue]\n-- error
\n-- the error code indicating why the tracker announce failed. If it is\n-is lt::errors::tracker_failure the failure_reason() might contain\n-a more detailed description of why the tracker rejected the request.\n-HTTP status codes indicating errors are also set in this field.
\n-
\n-[report issue]\n-- version
\n-- the bittorrent protocol version that was announced
\n-
\n-[report issue]\n-\n-\n-tracker_warning_alert
\n-Declared in "libtorrent/alert_types.hpp"
\n-This alert is triggered if the tracker reply contains a warning field.\n-Usually this means that the tracker announce was successful, but the\n-tracker has a message to the client.
\n-\n-struct tracker_warning_alert final : tracker_alert\n-{\n- std::string message () const override;\n- char const* warning_message () const;\n-\n- static constexpr alert_category_t static_category = alert_category::tracker | alert_category::error;\n- protocol_version version;\n-};\n-\n-[report issue]\n-warning_message()
\n-\n-char const* warning_message () const;\n-
\n-the message associated with this warning
\n-[report issue]\n-- version
\n-- the bittorrent protocol version that was announced
\n-
\n-[report issue]\n-\n-\n-scrape_reply_alert
\n-Declared in "libtorrent/alert_types.hpp"
\n-This alert is generated when a scrape request succeeds.
\n-\n-struct scrape_reply_alert final : tracker_alert\n-{\n- std::string message () const override;\n-\n- static constexpr alert_category_t static_category = alert_category::tracker;\n- int const incomplete;\n- int const complete;\n- protocol_version version;\n-};\n-\n-\n-[report issue]\n-- incomplete complete
\n-- the data returned in the scrape response. These numbers\n-may be -1 if the response was malformed.
\n-
\n-[report issue]\n-- version
\n-- the bittorrent protocol version that was scraped
\n-
\n-[report issue]\n-\n-scrape_failed_alert
\n-Declared in "libtorrent/alert_types.hpp"
\n-If a scrape request fails, this alert is generated. This might be due\n-to the tracker timing out, refusing connection or returning an http response\n-code indicating an error.
\n-\n-struct scrape_failed_alert final : tracker_alert\n-{\n- std::string message () const override;\n- char const* error_message () const;\n-\n- static constexpr alert_category_t static_category = alert_category::tracker | alert_category::error;\n- error_code const error;\n- protocol_version version;\n-};\n-\n-[report issue]\n-error_message()
\n-\n-char const* error_message () const;\n-
\n-if the error indicates there is an associated message, this returns\n-that message. Otherwise and empty string.
\n-[report issue]\n-- error
\n-- the error itself. This may indicate that the tracker sent an error\n-message (error::tracker_failure), in which case it can be\n-retrieved by calling error_message().
\n-
\n-[report issue]\n-- version
\n-- the bittorrent protocol version that was scraped
\n-
\n-[report issue]\n-\n-\n-tracker_reply_alert
\n-Declared in "libtorrent/alert_types.hpp"
\n-This alert is only for informational purpose. It is generated when a tracker announce\n-succeeds. It is generated regardless what kind of tracker was used, be it UDP, HTTP or\n-the DHT.
\n-\n-struct tracker_reply_alert final : tracker_alert\n-{\n- std::string message () const override;\n-\n- static constexpr alert_category_t static_category = alert_category::tracker;\n- int const num_peers;\n- protocol_version version;\n-};\n-\n-[report issue]\n-- num_peers
\n-- tells how many peers the tracker returned in this response. This is\n-not expected to be greater than the num_want settings. These are not necessarily\n-all new peers, some of them may already be connected.
\n-
\n-[report issue]\n-- version
\n-- the bittorrent protocol version that was announced
\n-
\n-[report issue]\n-\n-dht_reply_alert
\n-Declared in "libtorrent/alert_types.hpp"
\n-This alert is generated each time the DHT receives peers from a node. num_peers\n-is the number of peers we received in this packet. Typically these packets are\n-received from multiple DHT nodes, and so the alerts are typically generated\n-a few at a time.
\n-\n-struct dht_reply_alert final : tracker_alert\n-{\n- std::string message () const override;\n-\n- static constexpr alert_category_t static_category = alert_category::dht | alert_category::tracker;\n- int const num_peers;\n-};\n-\n-[report issue]\n-\n-tracker_announce_alert
\n-Declared in "libtorrent/alert_types.hpp"
\n-This alert is generated each time a tracker announce is sent (or attempted to be sent).\n-There are no extra data members in this alert. The url can be found in the base class\n-however.
\n-\n-struct tracker_announce_alert final : tracker_alert\n-{\n- std::string message () const override;\n-\n- static constexpr alert_category_t static_category = alert_category::tracker;\n- event_t const event;\n- protocol_version version;\n-};\n-\n-[report issue]\n-- event
\n-- specifies what event was sent to the tracker. See event_t.
\n-
\n-[report issue]\n-- version
\n-- the bittorrent protocol version that is announced
\n-
\n-[report issue]\n-\n-hash_failed_alert
\n-Declared in "libtorrent/alert_types.hpp"
\n-This alert is generated when a finished piece fails its hash check. You can get the handle\n-to the torrent which got the failed piece and the index of the piece itself from the alert.
\n-\n-struct hash_failed_alert final : torrent_alert\n-{\n- std::string message () const override;\n-\n- static constexpr alert_category_t static_category = alert_category::status;\n- piece_index_t const piece_index;\n-};\n-\n-[report issue]\n-\n-peer_ban_alert
\n-Declared in "libtorrent/alert_types.hpp"
\n-This alert is generated when a peer is banned because it has sent too many corrupt pieces\n-to us. ip is the endpoint to the peer that was banned.
\n-\n-struct peer_ban_alert final : peer_alert\n-{\n- std::string message () const override;\n-\n- static constexpr alert_category_t static_category = alert_category::peer;\n-};\n-\n-[report issue]\n-\n-peer_unsnubbed_alert
\n-Declared in "libtorrent/alert_types.hpp"
\n-This alert is generated when a peer is un-snubbed. Essentially when it was snubbed for stalling\n-sending data, and now it started sending data again.
\n-\n-struct peer_unsnubbed_alert final : peer_alert\n-{\n- std::string message () const override;\n-\n- static constexpr alert_category_t static_category = alert_category::peer;\n-};\n-\n-[report issue]\n-\n-peer_snubbed_alert
\n-Declared in "libtorrent/alert_types.hpp"
\n-This alert is generated when a peer is snubbed, when it stops sending data when we request\n-it.
\n-\n-struct peer_snubbed_alert final : peer_alert\n-{\n- std::string message () const override;\n-\n- static constexpr alert_category_t static_category = alert_category::peer;\n-};\n-\n-[report issue]\n-\n-peer_error_alert
\n-Declared in "libtorrent/alert_types.hpp"
\n-This alert is generated when a peer sends invalid data over the peer-peer protocol. The peer\n-will be disconnected, but you get its ip address from the alert, to identify it.
\n-\n-struct peer_error_alert final : peer_alert\n-{\n- std::string message () const override;\n-\n- static constexpr alert_category_t static_category = alert_category::peer;\n- operation_t op;\n- error_code const error;\n-};\n-\n-[report issue]\n-- op
\n-- a 0-terminated string of the low-level operation that failed, or nullptr if\n-there was no low level disk operation.
\n-
\n-[report issue]\n-- error
\n-- tells you what error caused this alert.
\n-
\n-[report issue]\n-\n-peer_connect_alert
\n-Declared in "libtorrent/alert_types.hpp"
\n-This alert is posted every time an incoming peer connection both\n-successfully passes the protocol handshake and is associated with a\n-torrent, or an outgoing peer connection attempt succeeds. For arbitrary\n-incoming connections, see incoming_connection_alert.
\n-\n-struct peer_connect_alert final : peer_alert\n-{\n- std::string message () const override;\n-\n- enum direction_t\n- {\n- in,\n- out,\n- };\n-\n- static constexpr alert_category_t static_category = alert_category::connect;\n- direction_t direction;\n- socket_type_t socket_type;\n-};\n-\n-[report issue]\n+\n+enum portmap_transport
\n+Declared in "libtorrent/portmap.hpp"
\n+\n+\n+ \n+\n+name \n+value \n+description \n+natpmp \n+0 \n+natpmp can be NAT-PMP or PCP \n+upnp \n+1 \n+ \n+
\n+[report issue]\n+\n+enum portmap_protocol
\n+Declared in "libtorrent/portmap.hpp"
\n \n \n \n \n name \n value \n description \n in \n+none \n 0 \n \n out \n+tcp \n 1 \n \n udp \n+2 \n+ \n+
\n-[report issue]\n-- direction
\n-- Tells you if the peer was incoming or outgoing
\n+[report issue]
\n+\n+pex_flags_t
\n+Declared in "libtorrent/pex_flags.hpp"
\n+\n+- pex_encryption
\n+- the peer supports protocol encryption
\n
\n-[report issue]\n-\n-\n-peer_disconnected_alert
\n-Declared in "libtorrent/alert_types.hpp"
\n-This alert is generated when a peer is disconnected for any reason (other than the ones\n-covered by peer_error_alert ).
\n-\n-struct peer_disconnected_alert final : peer_alert\n-{\n- std::string message () const override;\n-\n- static constexpr alert_category_t static_category = alert_category::connect;\n- socket_type_t const socket_type;\n- operation_t const op;\n- error_code const error;\n- close_reason_t const reason;\n-};\n-\n-[report issue]\n-- socket_type
\n-- the kind of socket this peer was connected over
\n+\n+- pex_seed
\n+- the peer is a seed
\n
\n-[report issue]\n-- op
\n-- the operation or level where the error occurred. Specified as an\n-value from the operation_t enum. Defined in operations.hpp.
\n+\n+- pex_utp
\n+- the peer supports the uTP, transport protocol over UDP.
\n
\n-[report issue]\n-- error
\n-- tells you what error caused peer to disconnect.
\n+\n+- pex_holepunch
\n+- the peer supports the holepunch extension If this flag is received from a\n+peer, it can be used as a rendezvous point in case direct connections to\n+the peer fail
\n
\n-[report issue]\n-- reason
\n-- the reason the peer disconnected (if specified)
\n+\n+- pex_lt_v2
\n+- protocol v2\n+this is not a standard flag, it is only used internally
\n
\n-[report issue]
\n-\n-invalid_request_alert
\n-Declared in "libtorrent/alert_types.hpp"
\n-This is a debug alert that is generated by an incoming invalid piece request.\n-ip is the address of the peer and the request is the actual incoming\n-request from the peer. See peer_request for more info.
\n-\n-struct invalid_request_alert final : peer_alert\n-{\n- std::string message () const override;\n-\n- static constexpr alert_category_t static_category = alert_category::peer;\n- peer_request const request;\n- bool const we_have;\n- bool const peer_interested;\n- bool const withheld;\n-};\n-\n-[report issue]\n-- request
\n-- the request we received from the peer
\n+[report issue]
\n+\n+torrent_flags_t
\n+Declared in "libtorrent/torrent_flags.hpp"
\n+\n+- seed_mode
\n+If seed_mode is set, libtorrent will assume that all files\n+are present for this torrent and that they all match the hashes in\n+the torrent file. Each time a peer requests to download a block,\n+the piece is verified against the hash, unless it has been verified\n+already. If a hash fails, the torrent will automatically leave the\n+seed mode and recheck all the files. The use case for this mode is\n+if a torrent is created and seeded, or if the user already know\n+that the files are complete, this is a way to avoid the initial\n+file checks, and significantly reduce the startup time.
\n+Setting seed_mode on a torrent without metadata (a\n+.torrent file) is a no-op and will be ignored.
\n+It is not possible to set the seed_mode flag on a torrent after it has\n+been added to a session. It is possible to clear it though.
\n+
\n-[report issue]\n-- we_have
\n-- true if we have this piece
\n+\n+- upload_mode
\n+If upload_mode is set, the torrent will be initialized in\n+upload-mode, which means it will not make any piece requests. This\n+state is typically entered on disk I/O errors, and if the torrent\n+is also auto managed, it will be taken out of this state\n+periodically (see settings_pack::optimistic_disk_retry).
\n+This mode can be used to avoid race conditions when\n+adjusting priorities of pieces before allowing the torrent to start\n+downloading.
\n+If the torrent is auto-managed (auto_managed), the torrent\n+will eventually be taken out of upload-mode, regardless of how it\n+got there. If it's important to manually control when the torrent\n+leaves upload mode, don't make it auto managed.
\n+
\n-[report issue]\n-- peer_interested
\n-- true if the peer indicated that it was interested to download before\n-sending the request
\n+\n+- share_mode
\n+determines if the torrent should be added in share mode or not.\n+Share mode indicates that we are not interested in downloading the\n+torrent, but merely want to improve our share ratio (i.e. increase\n+it). A torrent started in share mode will do its best to never\n+download more than it uploads to the swarm. If the swarm does not\n+have enough demand for upload capacity, the torrent will not\n+download anything. This mode is intended to be safe to add any\n+number of torrents to, without manual screening, without the risk\n+of downloading more than is uploaded.
\n+A torrent in share mode sets the priority to all pieces to 0,\n+except for the pieces that are downloaded, when pieces are decided\n+to be downloaded. This affects the progress bar, which might be set\n+to "100% finished" most of the time. Do not change file or piece\n+priorities for torrents in share mode, it will make it not work.
\n+The share mode has one setting, the share ratio target, see\n+settings_pack::share_mode_target for more info.
\n+
\n-[report issue]\n-- withheld
\n-- if this is true, the peer is not allowed to download this piece because\n-of super-seeding rules.
\n+\n+- apply_ip_filter
\n+- determines if the IP filter should apply to this torrent or not. By\n+default all torrents are subject to filtering by the IP filter\n+(i.e. this flag is set by default). This is useful if certain\n+torrents needs to be exempt for some reason, being an auto-update\n+torrent for instance.
\n
\n-[report issue]
\n-\n-torrent_finished_alert
\n-Declared in "libtorrent/alert_types.hpp"
\n-This alert is generated when a torrent switches from being a downloader to a seed.\n-It will only be generated once per torrent. It contains a torrent_handle to the\n-torrent in question.
\n-\n-struct torrent_finished_alert final : torrent_alert\n-{\n- std::string message () const override;\n-\n- static constexpr alert_category_t static_category = alert_category::status;\n-};\n-\n-[report issue]\n-\n-piece_finished_alert
\n-Declared in "libtorrent/alert_types.hpp"
\n-this alert is posted every time a piece completes downloading\n-and passes the hash check. This alert derives from torrent_alert\n-which contains the torrent_handle to the torrent the piece belongs to.\n-Note that being downloaded and passing the hash check may happen before\n-the piece is also fully flushed to disk. So torrent_handle::have_piece()\n-may still return false
\n+\n+- paused
\n+- specifies whether or not the torrent is paused. i.e. it won't connect to the tracker or any of the peers\n+until it's resumed. Note that a paused torrent that also has the\n+auto_managed flag set can be started at any time by libtorrent's queuing\n+logic. See queuing.
\n+
\n+\n+- auto_managed
\n+If the torrent is auto-managed (auto_managed), the torrent\n+may be resumed at any point, regardless of how it paused. If it's\n+important to manually control when the torrent is paused and\n+resumed, don't make it auto managed.
\n+If auto_managed is set, the torrent will be queued,\n+started and seeded automatically by libtorrent. When this is set,\n+the torrent should also be started as paused. The default queue\n+order is the order the torrents were added. They are all downloaded\n+in that order. For more details, see queuing.
\n+
\n+\n+- duplicate_is_error
\n+- used in add_torrent_params to indicate that it's an error to attempt\n+to add a torrent that's already in the session. If it's not considered an\n+error, a handle to the existing torrent is returned.\n+This flag is not saved by write_resume_data(), since it is only meant for\n+adding torrents.
\n+
\n+\n+- update_subscribe
\n+- on by default and means that this torrent will be part of state\n+updates when calling post_torrent_updates().\n+This flag is not saved by write_resume_data().
\n+
\n+\n+- super_seeding
\n+- sets the torrent into super seeding/initial seeding mode. If the torrent\n+is not a seed, this flag has no effect.
\n+
\n+\n+- sequential_download
\n+- sets the sequential download state for the torrent. In this mode the\n+piece picker will pick pieces with low index numbers before pieces with\n+high indices. The actual pieces that are picked depend on other factors\n+still, such as which pieces a peer has and whether it is in parole mode\n+or "prefer whole pieces"-mode. Sequential mode is not ideal for streaming\n+media. For that, see set_piece_deadline() instead.
\n+
\n+\n+- stop_when_ready
\n+When this flag is set, the torrent will force stop whenever it\n+transitions from a non-data-transferring state into a data-transferring\n+state (referred to as being ready to download or seed). This is useful\n+for torrents that should not start downloading or seeding yet, but want\n+to be made ready to do so. A torrent may need to have its files checked\n+for instance, so it needs to be started and possibly queued for checking\n+(auto-managed and started) but as soon as it's done, it should be\n+stopped.
\n+Force stopped means auto-managed is set to false and it's paused. As\n+if the auto_manages flag is cleared and the paused flag is set on the torrent.
\n+Note that the torrent may transition into a downloading state while\n+setting this flag, and since the logic is edge triggered you may\n+miss the edge. To avoid this race, if the torrent already is in a\n+downloading state when this call is made, it will trigger the\n+stop-when-ready immediately.
\n+When the stop-when-ready logic fires, the flag is cleared. Any\n+subsequent transitions between downloading and non-downloading states\n+will not be affected, until this flag is set again.
\n+The behavior is more robust when setting this flag as part of adding\n+the torrent. See add_torrent_params.
\n+The stop-when-ready flag fixes the inherent race condition of waiting\n+for the state_changed_alert and then call pause(). The download/seeding\n+will most likely start in between posting the alert and receiving the\n+call to pause.
\n+A downloading state is one where peers are being connected. Which means\n+just downloading the metadata via the ut_metadata extension counts\n+as a downloading state. In order to stop a torrent once the metadata\n+has been downloaded, instead set all file priorities to dont_download
\n+
\n+\n+- override_trackers
\n+- when this flag is set, the tracker list in the add_torrent_params\n+object override any trackers from the torrent file. If the flag is\n+not set, the trackers from the add_torrent_params object will be\n+added to the list of trackers used by the torrent.\n+This flag is set by read_resume_data() if there are trackers present in\n+the resume data file. This effectively makes the trackers saved in the\n+resume data take precedence over the original trackers. This includes if\n+there's an empty list of trackers, to support the case where they were\n+explicitly removed in the previous session.\n+This flag is not saved by write_resume_data()
\n+
\n+\n+- override_web_seeds
\n+- If this flag is set, the web seeds from the add_torrent_params\n+object will override any web seeds in the torrent file. If it's not\n+set, web seeds in the add_torrent_params object will be added to the\n+list of web seeds used by the torrent.\n+This flag is set by read_resume_data() if there are web seeds present in\n+the resume data file. This effectively makes the web seeds saved in the\n+resume data take precedence over the original ones. This includes if\n+there's an empty list of web seeds, to support the case where they were\n+explicitly removed in the previous session.\n+This flag is not saved by write_resume_data()
\n+
\n+\n+- need_save_resume
\n+if this flag is set (which it is by default) the torrent will be\n+considered needing to save its resume data immediately, in the\n+category if_metadata_changed. See resume_data_flags_t and\n+save_resume_data() for details.
\n+This flag is cleared by a successful call to save_resume_data()\n+This flag is not saved by write_resume_data(), since it represents an\n+ephemeral state of a running torrent.
\n+
\n+\n+- disable_dht
\n+- set this flag to disable DHT for this torrent. This lets you have the DHT\n+enabled for the whole client, and still have specific torrents not\n+participating in it. i.e. not announcing to the DHT nor picking up peers\n+from it.
\n+
\n+\n+- disable_lsd
\n+- set this flag to disable local service discovery for this torrent.
\n+
\n+\n+- disable_pex
\n+- set this flag to disable peer exchange for this torrent.
\n+
\n+\n+- no_verify_files
\n+- if this flag is set, the resume data will be assumed to be correct\n+without validating it against any files on disk. This may be used when\n+restoring a session by loading resume data from disk. It will save time\n+and also delay any hard disk errors until files are actually needed. If\n+the resume data cannot be trusted, or if a torrent is added for the first\n+time to some save path that may already have some of the files, this flag\n+should not be set.
\n+
\n+\n+- default_dont_download
\n+- default all file priorities to dont_download. This is useful for adding\n+magnet links where the number of files is unknown, but the\n+file_priorities is still set for some files. Any file not covered by\n+the file_priorities list will be set to normal download priority,\n+unless this flag is set, in which case they will be set to 0\n+(dont_download).
\n+
\n+\n+- i2p_torrent
\n+- this flag makes the torrent be considered an "i2p torrent" for purposes\n+of the allow_i2p_mixed setting. When mixing regular peers and i2p peers\n+is disabled, i2p torrents won't add normal peers to its peer list.\n+Note that non i2p torrents may still allow i2p peers (on the off-chance\n+that a tracker return them and the session is configured with a SAM\n+connection).\n+This flag is set automatically when adding a torrent that has at least\n+one tracker whose hostname ends with .i2p.\n+It's also set by parse_magnet_uri() if the tracker list contains such\n+URL.
\n+
\n+\n+- all
\n+- all torrent flags combined. Can conveniently be used when creating masks\n+for flags
\n+
\n+[report issue]\n+\n+int
\n+Declared in "libtorrent/version.hpp"
\n+\n+- version_major
\n+- the major, minor and tiny versions of libtorrent
\n+
\n+\n+- version_minor
\n+- the major, minor and tiny versions of libtorrent
\n+
\n+\n+- version_tiny
\n+- the major, minor and tiny versions of libtorrent
\n+
\n+[report issue]\n+\n+download_priority_t
\n+Declared in "libtorrent/download_priority.hpp"
\n+\n+- dont_download
\n+- Don't download the file or piece. Partial pieces may still be downloaded when\n+setting file priorities.
\n+
\n+\n+- default_priority
\n+- The default priority for files and pieces.
\n+
\n+\n+- low_priority
\n+- The lowest priority for files and pieces.
\n+
\n+\n+- top_priority
\n+- The highest priority for files and pieces.
\n+
\n+[report issue]\n+\n+char const*
\n+Declared in "libtorrent/version.hpp"
\n+\n+- version_str
\n+- the libtorrent version in string form
\n+
\n+[report issue]\n+\n+std::uint64_t
\n+Declared in "libtorrent/version.hpp"
\n+\n+- version_revision
\n+- the git commit of this libtorrent version
\n+
\n+[report issue]\n+\n+hasher
\n+Declared in "libtorrent/hasher.hpp"
\n+this is a SHA-1 hash class.
\n+You use it by first instantiating it, then call update() to feed it\n+with data. i.e. you don't have to keep the entire buffer of which you want to\n+create the hash in memory. You can feed the hasher parts of it at a time. When\n+You have fed the hasher with all the data, you call final() and it\n+will return the sha1-hash of the data.
\n+The constructor that takes a char const* and an integer will construct the\n+sha1 context and feed it the data passed in.
\n+If you want to reuse the hasher object once you have created a hash, you have to\n+call reset() to reinitialize it.
\n+The built-in software version of sha1-algorithm was implemented\n+by Steve Reid and released as public domain.\n+For more info, see src/sha1.cpp.
\n \n-struct piece_finished_alert final : torrent_alert\n+class hasher\n {\n- std::string message () const override;\n-\n- piece_index_t const piece_index;\n+ hasher ();\n+ hasher& operator= (hasher const&) &;\n+ hasher (char const* data, int len);\n+ hasher (hasher const&);\n+ explicit hasher (span<char const> data);\n+ hasher& update (char const* data, int len);\n+ hasher& update (span<char const> data);\n+ sha1_hash final ();\n+ void reset ();\n };\n \n-[report issue]\n-- piece_index
\n-- the index of the piece that finished
\n-
\n-[report issue]\n-\n-request_dropped_alert
\n-Declared in "libtorrent/alert_types.hpp"
\n-This alert is generated when a peer rejects or ignores a piece request.
\n+\n+[report issue]\n+hasher() operator=()
\n \n-struct request_dropped_alert final : peer_alert\n-{\n- std::string message () const override;\n-\n- int const block_index;\n- piece_index_t const piece_index;\n-};\n+hasher& operator= (hasher const&) &;\n+hasher (char const* data, int len);\n+hasher (hasher const&);\n+explicit hasher (span<char const> data);\n \n-[report issue]\n-\n-block_timeout_alert
\n-Declared in "libtorrent/alert_types.hpp"
\n-This alert is generated when a block request times out.
\n+this is the same as default constructing followed by a call to\n+update(data, len).
\n+[report issue]\n+\n+update()
\n \n-struct block_timeout_alert final : peer_alert\n-{\n- std::string message () const override;\n-\n- int const block_index;\n- piece_index_t const piece_index;\n-};\n+hasher& update (char const* data, int len);\n+hasher& update (span<char const> data);\n \n-[report issue]\n-\n-block_finished_alert
\n-Declared in "libtorrent/alert_types.hpp"
\n-This alert is generated when a block request receives a response.
\n+append the following bytes to what is being hashed
\n+[report issue]\n+\n+final()
\n \n-struct block_finished_alert final : peer_alert\n-{\n- std::string message () const override;\n-\n- int const block_index;\n- piece_index_t const piece_index;\n-};\n+sha1_hash final ();\n \n-[report issue]\n-\n-block_downloading_alert
\n-Declared in "libtorrent/alert_types.hpp"
\n-This alert is generated when a block request is sent to a peer.
\n+returns the SHA-1 digest of the buffers previously passed to\n+update() and the hasher constructor.
\n+[report issue]\n+\n+reset()
\n \n-struct block_downloading_alert final : peer_alert\n-{\n- std::string message () const override;\n-\n- int const block_index;\n- piece_index_t const piece_index;\n-};\n+void reset ();\n \n-[report issue]\n-\n-unwanted_block_alert
\n-Declared in "libtorrent/alert_types.hpp"
\n-This alert is generated when a block is received that was not requested or\n-whose request timed out.
\n+restore the hasher state to be as if the hasher has just been\n+default constructed.
\n+[report issue]\n+\n+\n+hasher256
\n+Declared in "libtorrent/hasher.hpp"
\n \n-struct unwanted_block_alert final : peer_alert\n+class hasher256\n {\n- std::string message () const override;\n-\n- static constexpr alert_category_t static_category = alert_category::peer;\n- int const block_index;\n- piece_index_t const piece_index;\n+ hasher256 ();\n+ hasher256& operator= (hasher256 const&) &;\n+ hasher256 (hasher256 const&);\n+ hasher256 (char const* data, int len);\n+ explicit hasher256 (span<char const> data);\n+ hasher256& update (span<char const> data);\n+ hasher256& update (char const* data, int len);\n+ sha256_hash final ();\n+ void reset ();\n+ ~hasher256 ();\n };\n \n-[report issue]\n-\n-storage_moved_alert
\n-Declared in "libtorrent/alert_types.hpp"
\n-The storage_moved_alert is generated when all the disk IO has\n-completed and the files have been moved, as an effect of a call to\n-torrent_handle::move_storage. This is useful to synchronize with the\n-actual disk. The storage_path() member return the new path of the\n-storage.
\n+\n+[report issue]\n+operator=() hasher256()
\n \n-struct storage_moved_alert final : torrent_alert\n-{\n- std::string message () const override;\n- char const* old_path () const;\n- char const* storage_path () const;\n-\n- static constexpr alert_category_t static_category = alert_category::storage;\n-};\n+hasher256& operator= (hasher256 const&) &;\n+hasher256 (hasher256 const&);\n+hasher256 (char const* data, int len);\n+explicit hasher256 (span<char const> data);\n \n-\n-[report issue]\n-storage_path() old_path()
\n+this is the same as default constructing followed by a call to\n+update(data, len).
\n+[report issue]\n+\n+update()
\n \n-char const* old_path () const;\n-char const* storage_path () const;\n+hasher256& update (span<char const> data);\n+hasher256& update (char const* data, int len);\n
\n-the path the torrent was moved to and from, respectively.
\n-[report issue]\n-\n-\n-storage_moved_failed_alert
\n-Declared in "libtorrent/alert_types.hpp"
\n-The storage_moved_failed_alert is generated when an attempt to move the storage,\n-via torrent_handle::move_storage(), fails.
\n+append the following bytes to what is being hashed
\n+[report issue]\n+\n+final()
\n \n-struct storage_moved_failed_alert final : torrent_alert\n-{\n- std::string message () const override;\n- char const* file_path () const;\n-\n- static constexpr alert_category_t static_category = alert_category::storage;\n- error_code const error;\n- operation_t op;\n-};\n+sha256_hash final ();\n \n-[report issue]\n-file_path()
\n+returns the SHA-1 digest of the buffers previously passed to\n+update() and the hasher constructor.
\n+[report issue]\n+\n+reset()
\n \n-char const* file_path () const;\n+void reset ();\n
\n-If the error happened for a specific file, this returns its path.
\n-[report issue]\n-- op
\n-- this indicates what underlying operation caused the error
\n-
\n-[report issue]\n+restore the hasher state to be as if the hasher has just been\n+default constructed.
\n+[report issue]\n \n-\n-torrent_deleted_alert
\n-Declared in "libtorrent/alert_types.hpp"
\n-This alert is generated when a request to delete the files of a torrent complete.
\n-This alert is posted in the alert_category::storage category, and that bit\n-needs to be set in the alert_mask.
\n+\n+bitfield
\n+Declared in "libtorrent/bitfield.hpp"
\n+The bitfield type stores any number of bits as a bitfield\n+in a heap allocated array.
\n \n-struct torrent_deleted_alert final : torrent_alert\n+struct bitfield\n {\n- std::string message () const override;\n-\n- static constexpr alert_category_t static_category = alert_category::storage;\n- info_hash_t info_hashes;\n+ bitfield () noexcept = default;\n+ bitfield (int bits, bool val);\n+ bitfield (bitfield&& rhs) noexcept = default;\n+ explicit bitfield (int bits);\n+ bitfield (bitfield const& rhs);\n+ bitfield (char const* b, int bits);\n+ void assign (char const* b, int const bits);\n+ bool get_bit (int index) const noexcept;\n+ bool operator[] (int index) const noexcept;\n+ void set_bit (int index) noexcept;\n+ void clear_bit (int index) noexcept;\n+ bool all_set () const noexcept;\n+ bool none_set () const noexcept;\n+ int size () const noexcept;\n+ int num_words () const noexcept;\n+ int num_bytes () const noexcept;\n+ bool empty () const noexcept;\n+ char* data () noexcept;\n+ char const* data () const noexcept;\n+ void swap (bitfield& rhs) noexcept;\n+ int count () const noexcept;\n+ int find_first_set () const noexcept;\n+ int find_last_clear () const noexcept;\n+ bool operator== (lt::bitfield const& rhs) const;\n };\n \n-[report issue]\n-- info_hashes
\n-- The info-hash of the torrent that was just deleted. Most of\n-the time the torrent_handle in the torrent_alert will be invalid by the time\n-this alert arrives, since the torrent is being deleted. The info_hashes member\n-is hence the main way of identifying which torrent just completed the delete.
\n-
\n-[report issue]\n-\n-torrent_delete_failed_alert
\n-Declared in "libtorrent/alert_types.hpp"
\n-This alert is generated when a request to delete the files of a torrent fails.\n-Just removing a torrent from the session cannot fail
\n+[report issue]\n+bitfield()
\n \n-struct torrent_delete_failed_alert final : torrent_alert\n-{\n- std::string message () const override;\n-\n- static constexpr alert_category_t static_category = alert_category::storage\n- | alert_category::error;\n- error_code const error;\n- info_hash_t info_hashes;\n-};\n+bitfield () noexcept = default;\n+bitfield (int bits, bool val);\n+bitfield (bitfield&& rhs) noexcept = default;\n+explicit bitfield (int bits);\n+bitfield (bitfield const& rhs);\n+bitfield (char const* b, int bits);\n \n-[report issue]\n-- error
\n-- tells you why it failed.
\n-
\n-[report issue]\n-- info_hashes
\n-- the info hash of the torrent whose files failed to be deleted
\n-
\n-[report issue]\n-\n-save_resume_data_alert
\n-Declared in "libtorrent/alert_types.hpp"
\n-This alert is generated as a response to a torrent_handle::save_resume_data request.\n-It is generated once the disk IO thread is done writing the state for this torrent.
\n+constructs a new bitfield. The default constructor creates an empty\n+bitfield. bits is the size of the bitfield (specified in bits).\n+val is the value to initialize the bits to. If not specified\n+all bits are initialized to 0.
\n+The constructor taking a pointer b and bits copies a bitfield\n+from the specified buffer, and bits number of bits (rounded up to\n+the nearest byte boundary).
\n+[report issue]\n+\n+assign()
\n \n-struct save_resume_data_alert final : torrent_alert\n-{\n- std::string message () const override;\n-\n- static constexpr alert_category_t static_category = alert_category::storage;\n- add_torrent_params params;\n-};\n+void assign (char const* b, int const bits);\n \n-[report issue]\n-- params
\n-the params object is populated with the torrent file whose resume\n-data was saved. It is suitable to be:
\n-\n-- added to a session with add_torrent() or async_add_torrent()
\n-- saved to disk with write_resume_data()
\n-- turned into a magnet link with make_magnet_uri()
\n-- saved as a .torrent file with write_torrent_file()
\n-
\n-
\n-[report issue]\n-\n-save_resume_data_failed_alert
\n-Declared in "libtorrent/alert_types.hpp"
\n-This alert is generated instead of save_resume_data_alert if there was an error\n-generating the resume data. error describes what went wrong.
\n+copy bitfield from buffer b of bits number of bits, rounded up to\n+the nearest byte boundary.
\n+\n+[report issue]\n+\n+get_bit() operator[]()
\n \n-struct save_resume_data_failed_alert final : torrent_alert\n-{\n- std::string message () const override;\n-\n- static constexpr alert_category_t static_category = alert_category::storage\n- | alert_category::error;\n- error_code const error;\n-};\n+bool get_bit (int index) const noexcept;\n+bool operator[] (int index) const noexcept;\n \n-[report issue]\n-- error
\n-- the error code from the resume_data failure
\n-
\n-[report issue]\n-\n-torrent_paused_alert
\n-Declared in "libtorrent/alert_types.hpp"
\n-This alert is generated as a response to a torrent_handle::pause request. It is\n-generated once all disk IO is complete and the files in the torrent have been closed.\n-This is useful for synchronizing with the disk.
\n+query bit at index. Returns true if bit is 1, otherwise false.
\n+\n+[report issue]\n+\n+set_bit() clear_bit()
\n \n-struct torrent_paused_alert final : torrent_alert\n-{\n- std::string message () const override;\n-\n- static constexpr alert_category_t static_category = alert_category::status;\n-};\n+void set_bit (int index) noexcept;\n+void clear_bit (int index) noexcept;\n \n-[report issue]\n-\n-torrent_resumed_alert
\n-Declared in "libtorrent/alert_types.hpp"
\n-This alert is generated as a response to a torrent_handle::resume() request. It is\n-generated when a torrent goes from a paused state to an active state.
\n+set bit at index to 0 (clear_bit) or 1 (set_bit).
\n+[report issue]\n+\n+all_set()
\n \n-struct torrent_resumed_alert final : torrent_alert\n-{\n- std::string message () const override;\n-\n- static constexpr alert_category_t static_category = alert_category::status;\n-};\n+bool all_set () const noexcept;\n \n-[report issue]\n-\n-torrent_checked_alert
\n-Declared in "libtorrent/alert_types.hpp"
\n-This alert is posted when a torrent completes checking. i.e. when it transitions\n-out of the checking files state into a state where it is ready to start downloading
\n+returns true if all bits in the bitfield are set
\n+[report issue]\n+\n+none_set()
\n \n-struct torrent_checked_alert final : torrent_alert\n-{\n- std::string message () const override;\n-\n- static constexpr alert_category_t static_category = alert_category::status;\n-};\n+bool none_set () const noexcept;\n \n-[report issue]\n-\n-url_seed_alert
\n-Declared in "libtorrent/alert_types.hpp"
\n-This alert is generated when a HTTP seed name lookup fails.
\n+returns true if no bit in the bitfield is set
\n+[report issue]\n+\n+size()
\n \n-struct url_seed_alert final : torrent_alert\n-{\n- std::string message () const override;\n- char const* server_url () const;\n- char const* error_message () const;\n-\n- static constexpr alert_category_t static_category = alert_category::peer | alert_category::error;\n- error_code const error;\n-};\n+int size () const noexcept;\n \n-[report issue]\n+\n+num_words()
\n \n-char const* server_url () const;\n+int num_words () const noexcept;\n
\n-the URL the error is associated with
\n-[report issue]\n-\n-error_message()
\n+returns the number of 32 bit words are needed to represent all bits in\n+this bitfield.
\n+[report issue]\n+\n+num_bytes()
\n \n-char const* error_message () const;\n+int num_bytes () const noexcept;\n
\n-in case the web server sent an error message, this function returns\n-it.
\n-[report issue]\n-- error
\n-- the error the web seed encountered. If this is not set, the server\n-sent an error message, call error_message().
\n-
\n-[report issue]\n-\n-\n-file_error_alert
\n-Declared in "libtorrent/alert_types.hpp"
\n-If the storage fails to read or write files that it needs access to, this alert is\n-generated and the torrent is paused.
\n+returns the number of bytes needed to represent all bits in this\n+bitfield
\n+[report issue]\n+\n+empty()
\n \n-struct file_error_alert final : torrent_alert\n-{\n- std::string message () const override;\n- char const* filename () const;\n-\n- static constexpr alert_category_t static_category = alert_category::status\n- | alert_category::storage;\n- error_code const error;\n- operation_t op;\n-};\n+bool empty () const noexcept;\n \n-[report issue]\n+\n+data()
\n \n-char const* filename () const;\n+char* data () noexcept;\n+char const* data () const noexcept;\n
\n-the file that experienced the error
\n-[report issue]\n-- error
\n-- the error code describing the error.
\n-
\n-[report issue]\n-- op
\n-- indicates which underlying operation caused the error
\n-
\n-[report issue]\n-\n-\n-metadata_failed_alert
\n-Declared in "libtorrent/alert_types.hpp"
\n-This alert is generated when the metadata has been completely received and the info-hash\n-failed to match it. i.e. the metadata that was received was corrupt. libtorrent will\n-automatically retry to fetch it in this case. This is only relevant when running a\n-torrent-less download, with the metadata extension provided by libtorrent.
\n+returns a pointer to the internal buffer of the bitfield, or\n+nullptr if it's empty.
\n+[report issue]\n+\n+swap()
\n \n-struct metadata_failed_alert final : torrent_alert\n-{\n- std::string message () const override;\n-\n- static constexpr alert_category_t static_category = alert_category::error;\n- error_code const error;\n-};\n+void swap (bitfield& rhs) noexcept;\n \n-[report issue]\n-- error
\n-- indicates what failed when parsing the metadata. This error is\n-what's returned from lazy_bdecode().
\n-
\n-[report issue]\n-\n-metadata_received_alert
\n-Declared in "libtorrent/alert_types.hpp"
\n-This alert is generated when the metadata has been completely received and the torrent\n-can start downloading. It is not generated on torrents that are started with metadata, but\n-only those that needs to download it from peers (when utilizing the libtorrent extension).
\n-There are no additional data members in this alert.
\n-Typically, when receiving this alert, you would want to save the torrent file in order\n-to load it back up again when the session is restarted. Here's an example snippet of\n-code to do that:
\n-\n-torrent_handle h = alert->handle();\n-std::shared_ptr<torrent_info const> ti = h.torrent_file();\n-create_torrent ct(*ti);\n-entry te = ct.generate();\n-std::vector<char> buffer;\n-bencode(std::back_inserter(buffer), te);\n-FILE* f = fopen((to_hex(ti->info_hashes().get_best().to_string()) + ".torrent").c_str(), "wb+");\n-if (f) {\n- fwrite(&buffer[0], 1, buffer.size(), f);\n- fclose(f);\n-}\n+swaps the bit-fields two variables refer to
\n+[report issue]
\n+\n+count()
\n+\n+int count () const noexcept;\n
\n+count the number of bits in the bitfield that are set to 1.
\n+[report issue]\n+\n+find_first_set()
\n \n-struct metadata_received_alert final : torrent_alert\n-{\n- std::string message () const override;\n-\n- static constexpr alert_category_t static_category = alert_category::status;\n-};\n+int find_first_set () const noexcept;\n \n-[report issue]\n-\n-udp_error_alert
\n-Declared in "libtorrent/alert_types.hpp"
\n-This alert is posted when there is an error on a UDP socket. The\n-UDP sockets are used for all uTP, DHT and UDP tracker traffic. They are\n-global to the session.
\n+returns the index of the first set bit in the bitfield, i.e. 1 bit.
\n+[report issue]\n+\n+find_last_clear()
\n \n-struct udp_error_alert final : alert\n-{\n- std::string message () const override;\n-\n- static constexpr alert_category_t static_category = alert_category::error;\n- aux::noexcept_movable<udp::endpoint> endpoint;\n- operation_t operation;\n- error_code const error;\n-};\n+int find_last_clear () const noexcept;\n \n-[report issue]\n-- endpoint
\n-- the source address associated with the error (if any)
\n-
\n-[report issue]\n-- operation
\n-- the operation that failed
\n-
\n-[report issue]\n-- error
\n-- the error code describing the error
\n-
\n-[report issue]\n-\n-external_ip_alert
\n-Declared in "libtorrent/alert_types.hpp"
\n-Whenever libtorrent learns about the machines external IP, this alert is\n-generated. The external IP address can be acquired from the tracker (if it\n-supports that) or from peers that supports the extension protocol.\n-The address can be accessed through the external_address member.
\n+returns the index to the last cleared bit in the bitfield, i.e. 0 bit.
\n+[report issue]\n+\n+\n+storage_error
\n+Declared in "libtorrent/error_code.hpp"
\n+used by storage to return errors\n+also includes which underlying file the\n+error happened on
\n \n-struct external_ip_alert final : alert\n+struct storage_error\n {\n- std::string message () const override;\n+ explicit operator bool () const;\n+ file_index_t file () const;\n+ void file (file_index_t f);\n \n- static constexpr alert_category_t static_category = alert_category::status;\n- aux::noexcept_movable<address> external_address;\n+ error_code ec;\n+ operation_t operation;\n };\n \n-[report issue]\n-- external_address
\n-- the IP address that is believed to be our external IP
\n-
\n-[report issue]\n-\n-listen_failed_alert
\n-Declared in "libtorrent/alert_types.hpp"
\n-This alert is generated when none of the ports, given in the port range, to\n-session can be opened for listening. The listen_interface member is the\n-interface that failed, error is the error code describing the failure.
\n-In the case an endpoint was created before generating the alert, it is\n-represented by address and port. The combinations of socket type\n-and operation in which such address and port are not valid are:\n-accept - i2p\n-accept - socks5\n-enum_if - tcp
\n-libtorrent may sometimes try to listen on port 0, if all other ports failed.\n-Port 0 asks the operating system to pick a port that's free). If that fails\n-you may see a listen_failed_alert with port 0 even if you didn't ask to\n-listen on it.
\n+[report issue]\n+bool()
\n \n-struct listen_failed_alert final : alert\n-{\n- std::string message () const override;\n- char const* listen_interface () const;\n-\n- static constexpr alert_category_t static_category = alert_category::status | alert_category::error;\n- error_code const error;\n- operation_t op;\n- lt::socket_type_t const socket_type;\n- aux::noexcept_movable<lt::address> address;\n- int const port;\n-};\n+explicit operator bool () const;\n \n-[report issue]\n-listen_interface()
\n+explicitly converts to true if this object represents an error, and\n+false if it does not.
\n+[report issue]\n+\n+file()
\n \n-char const* listen_interface () const;\n+file_index_t file () const;\n+void file (file_index_t f);\n
\n-the network device libtorrent attempted to listen on, or the IP address
\n-[report issue]\n-- error
\n-- the error the system returned
\n-
\n-[report issue]\n-- op
\n-- the underlying operation that failed
\n-
\n-[report issue]\n-- socket_type
\n-- the type of listen socket this alert refers to.
\n-
\n-[report issue]\n-- address
\n-- the address libtorrent attempted to listen on\n-see alert documentation for validity of this value
\n+set and query the index (in the torrent) of the file this error\n+occurred on. This may also have special values defined in\n+torrent_status.
\n+[report issue]\n+- ec
\n+- the error that occurred
\n
\n-[report issue]\n-- port
\n-- the port libtorrent attempted to listen on\n-see alert documentation for validity of this value
\n+[report issue]\n+- operation
\n+- A code from operation_t enum, indicating what\n+kind of operation failed.
\n
\n-[report issue]
\n+[report issue]\n \n-\n-listen_succeeded_alert
\n-Declared in "libtorrent/alert_types.hpp"
\n-This alert is posted when the listen port succeeds to be opened on a\n-particular interface. address and port is the endpoint that\n-successfully was opened for listening.
\n+\n+bdecode_category()
\n+Declared in "libtorrent/bdecode.hpp"
\n \n-struct listen_succeeded_alert final : alert\n-{\n- std::string message () const override;\n-\n- static constexpr alert_category_t static_category = alert_category::status;\n- aux::noexcept_movable<lt::address> address;\n- int const port;\n- lt::socket_type_t const socket_type;\n-};\n+boost::system::error_category& bdecode_category ();\n \n-[report issue]\n-- address
\n-- the address libtorrent ended up listening on. This address\n-refers to the local interface.
\n-
\n-[report issue]\n-- port
\n-- the port libtorrent ended up listening on.
\n-
\n-[report issue]\n-- socket_type
\n-- the type of listen socket this alert refers to.
\n-
\n-[report issue]\n-\n-portmap_error_alert
\n-Declared in "libtorrent/alert_types.hpp"
\n-This alert is generated when a NAT router was successfully found but some\n-part of the port mapping request failed. It contains a text message that\n-may help the user figure out what is wrong. This alert is not generated in\n-case it appears the client is not running on a NAT:ed network or if it\n-appears there is no NAT router that can be remote controlled to add port\n-mappings.
\n+[report issue]\n+\n+gzip_category()
\n+Declared in "libtorrent/gzip.hpp"
\n \n-struct portmap_error_alert final : alert\n-{\n- std::string message () const override;\n-\n- static constexpr alert_category_t static_category = alert_category::port_mapping\n- | alert_category::error;\n- port_mapping_t const mapping;\n- portmap_transport map_transport;\n- aux::noexcept_movable<address> local_address;\n- error_code const error;\n-};\n+boost::system::error_category& gzip_category ();\n \n-[report issue]\n-- mapping
\n-- refers to the mapping index of the port map that failed, i.e.\n-the index returned from add_mapping().
\n-
\n-[report issue]\n-- map_transport
\n-- UPnP or NAT-PMP
\n-
\n-[report issue]\n-- local_address
\n-- the local network the port mapper is running on
\n-
\n-[report issue]\n-- error
\n-- tells you what failed.
\n-
\n-[report issue]\n-\n-portmap_alert
\n-Declared in "libtorrent/alert_types.hpp"
\n-This alert is generated when a NAT router was successfully found and\n-a port was successfully mapped on it. On a NAT:ed network with a NAT-PMP\n-capable router, this is typically generated once when mapping the TCP\n-port and, if DHT is enabled, when the UDP port is mapped.
\n+get the error_category for zip errors
\n+[report issue]\n+\n+libtorrent_category()
\n+Declared in "libtorrent/error_code.hpp"
\n \n-struct portmap_alert final : alert\n-{\n- std::string message () const override;\n-\n- static constexpr alert_category_t static_category = alert_category::port_mapping;\n- port_mapping_t const mapping;\n- int const external_port;\n- portmap_protocol const map_protocol;\n- portmap_transport const map_transport;\n- aux::noexcept_movable<address> local_address;\n-};\n+boost::system::error_category& libtorrent_category ();\n \n-[report issue]\n-- mapping
\n-- refers to the mapping index of the port map that failed, i.e.\n-the index returned from add_mapping().
\n-
\n-[report issue]\n-- external_port
\n-- the external port allocated for the mapping.
\n-
\n-[report issue]\n-- local_address
\n-- the local network the port mapper is running on
\n-
\n-[report issue]\n-\n-portmap_log_alert
\n-Declared in "libtorrent/alert_types.hpp"
\n-This alert is generated to log informational events related to either\n-UPnP or NAT-PMP. They contain a log line and the type (0 = NAT-PMP\n-and 1 = UPnP). Displaying these messages to an end user is only useful\n-for debugging the UPnP or NAT-PMP implementation. This alert is only\n-posted if the alert_category::port_mapping_log flag is enabled in\n-the alert mask.
\n+return the instance of the libtorrent_error_category which\n+maps libtorrent error codes to human readable error messages.
\n+[report issue]\n+\n+http_category()
\n+Declared in "libtorrent/error_code.hpp"
\n \n-struct portmap_log_alert final : alert\n-{\n- std::string message () const override;\n- char const* log_message () const;\n-\n- static constexpr alert_category_t static_category = alert_category::port_mapping_log;\n- portmap_transport const map_transport;\n- aux::noexcept_movable<address> local_address;\n-};\n+boost::system::error_category& http_category ();\n \n-[report issue]\n+\n+socks_category()
\n+Declared in "libtorrent/socks5_stream.hpp"
\n \n-char const* log_message () const;\n+boost::system::error_category& socks_category ();\n
\n-the message associated with this log line
\n-[report issue]\n-- local_address
\n-- the local network the port mapper is running on
\n-
\n-[report issue]\n-\n-\n-fastresume_rejected_alert
\n-Declared in "libtorrent/alert_types.hpp"
\n-This alert is generated when a fast resume file has been passed to\n-add_torrent() but the files on disk did not match the fast resume file.\n-The error_code explains the reason why the resume file was rejected.
\n+returns the error_category for SOCKS5 errors
\n+[report issue]\n+\n+upnp_category()
\n+Declared in "libtorrent/upnp.hpp"
\n \n-struct fastresume_rejected_alert final : torrent_alert\n-{\n- std::string message () const override;\n- char const* file_path () const;\n-\n- static constexpr alert_category_t static_category = alert_category::status\n- | alert_category::error;\n- error_code error;\n- operation_t op;\n-};\n+boost::system::error_category& upnp_category ();\n \n-[report issue]\n+\n+i2p_category()
\n+Declared in "libtorrent/i2p_stream.hpp"
\n \n-char const* file_path () const;\n+boost::system::error_category& i2p_category ();\n
\n-If the error happened to a specific file, this returns the path to it.
\n-[report issue]\n-- op
\n-- the underlying operation that failed
\n-
\n-[report issue]\n-\n-\n-peer_blocked_alert
\n-Declared in "libtorrent/alert_types.hpp"
\n-This alert is posted when an incoming peer connection, or a peer that's about to be added\n-to our peer list, is blocked for some reason. This could be any of:
\n-\n-- the IP filter
\n-- i2p mixed mode restrictions (a normal peer is not allowed on an i2p swarm)
\n-- the port filter
\n-- the peer has a low port and no_connect_privileged_ports is enabled
\n-- the protocol of the peer is blocked (uTP/TCP blocking)
\n-
\n+returns the error category for I2P errors
\n+[report issue]\n+\n+pcp_category()
\n+Declared in "libtorrent/natpmp.hpp"
\n \n-struct peer_blocked_alert final : peer_alert\n-{\n- std::string message () const override;\n-\n- enum reason_t\n- {\n- ip_filter,\n- port_filter,\n- i2p_mixed,\n- privileged_ports,\n- utp_disabled,\n- tcp_disabled,\n- invalid_local_interface,\n- ssrf_mitigation,\n- };\n-\n- static constexpr alert_category_t static_category = alert_category::ip_block;\n- int const reason;\n-};\n+boost::system::error_category& pcp_category ();\n \n-[report issue]\n+\n+enum error_code_enum
\n+Declared in "libtorrent/bdecode.hpp"
\n \n \n- \n \n name \n value \n description \n ip_filter \n+no_error \n 0 \n- \n+Not an error \n port_filter \n+expected_digit \n 1 \n- \n+expected digit in bencoded string \n i2p_mixed \n+expected_colon \n 2 \n- \n+expected colon in bencoded string \n privileged_ports \n+unexpected_eof \n 3 \n- \n+unexpected end of file in bencoded string \n utp_disabled \n+expected_value \n 4 \n- \n+expected value (list, dict, int or string) in bencoded string \n tcp_disabled \n+depth_exceeded \n 5 \n- \n+bencoded recursion depth limit exceeded \n invalid_local_interface \n+limit_exceeded \n 6 \n- \n+bencoded item count limit exceeded \n ssrf_mitigation \n+overflow \n 7 \n- \n+integer overflow \n+error_code_max \n+8 \n+the number of error codes \n
\n-[report issue]\n-- reason
\n-- the reason for the peer being blocked. Is one of the values from the\n-reason_t enum.
\n-
\n-[report issue]\n-\n-\n-dht_announce_alert
\n-Declared in "libtorrent/alert_types.hpp"
\n-This alert is generated when a DHT node announces to an info-hash on our\n-DHT node. It belongs to the alert_category::dht category.
\n-\n-struct dht_announce_alert final : alert\n+[report issue]
\n+\n+enum error_code_enum
\n+Declared in "libtorrent/gzip.hpp"
\n+\n+\n+ \n+\n+name \n+value \n+description \n+no_error \n+0 \n+Not an error \n+invalid_gzip_header \n+1 \n+the supplied gzip buffer has invalid header \n+inflated_data_too_large \n+2 \n+the gzip buffer would inflate to more bytes than the specified\n+maximum size, and was rejected. \n+data_did_not_terminate \n+3 \n+available inflate data did not terminate \n+space_exhausted \n+4 \n+output space exhausted before completing inflate \n+invalid_block_type \n+5 \n+invalid block type (type == 3) \n+invalid_stored_block_length \n+6 \n+stored block length did not match one's complement \n+too_many_length_or_distance_codes \n+7 \n+dynamic block code description: too many length or distance codes \n+code_lengths_codes_incomplete \n+8 \n+dynamic block code description: code lengths codes incomplete \n+repeat_lengths_with_no_first_length \n+9 \n+dynamic block code description: repeat lengths with no first length \n+repeat_more_than_specified_lengths \n+10 \n+dynamic block code description: repeat more than specified lengths \n+invalid_literal_length_code_lengths \n+11 \n+dynamic block code description: invalid literal/length code lengths \n+invalid_distance_code_lengths \n+12 \n+dynamic block code description: invalid distance code lengths \n+invalid_literal_code_in_block \n+13 \n+invalid literal/length or distance code in fixed or dynamic block \n+distance_too_far_back_in_block \n+14 \n+distance is too far back in fixed or dynamic block \n+unknown_gzip_error \n+15 \n+an unknown error occurred during gzip inflation \n+error_code_max \n+16 \n+the number of error codes \n+
\n+[report issue]\n+\n+enum error_code_enum
\n+Declared in "libtorrent/error_code.hpp"
\n+\n+\n+ \n+\n+name \n+value \n+description \n+no_error \n+0 \n+Not an error \n+file_collision \n+1 \n+Two torrents has files which end up overwriting each other \n+failed_hash_check \n+2 \n+A piece did not match its piece hash \n+torrent_is_no_dict \n+3 \n+The .torrent file does not contain a bencoded dictionary at\n+its top level \n+torrent_missing_info \n+4 \n+The .torrent file does not have an info dictionary \n+torrent_info_no_dict \n+5 \n+The .torrent file's info entry is not a dictionary \n+torrent_missing_piece_length \n+6 \n+The .torrent file does not have a piece length entry \n+torrent_missing_name \n+7 \n+The .torrent file does not have a name entry \n+torrent_invalid_name \n+8 \n+The .torrent file's name entry is invalid \n+torrent_invalid_length \n+9 \n+The length of a file, or of the whole .torrent file is invalid.\n+Either negative or not an integer \n+torrent_file_parse_failed \n+10 \n+Failed to parse a file entry in the .torrent \n+torrent_missing_pieces \n+11 \n+The pieces field is missing or invalid in the .torrent file \n+torrent_invalid_hashes \n+12 \n+The pieces string has incorrect length \n+too_many_pieces_in_torrent \n+13 \n+The .torrent file has more pieces than is supported by libtorrent \n+invalid_swarm_metadata \n+14 \n+The metadata (.torrent file) that was received from the swarm\n+matched the info-hash, but failed to be parsed \n+invalid_bencoding \n+15 \n+The file or buffer is not correctly bencoded \n+no_files_in_torrent \n+16 \n+The .torrent file does not contain any files \n+invalid_escaped_string \n+17 \n+The string was not properly url-encoded as expected \n+session_is_closing \n+18 \n+Operation is not permitted since the session is shutting down \n+duplicate_torrent \n+19 \n+There's already a torrent with that info-hash added to the\n+session \n+invalid_torrent_handle \n+20 \n+The supplied torrent_handle is not referring to a valid torrent \n+invalid_entry_type \n+21 \n+The type requested from the entry did not match its type \n+missing_info_hash_in_uri \n+22 \n+The specified URI does not contain a valid info-hash \n+file_too_short \n+23 \n+One of the files in the torrent was unexpectedly small. This\n+might be caused by files being changed by an external process \n+unsupported_url_protocol \n+24 \n+The URL used an unknown protocol. Currently http and\n+https (if built with openssl support) are recognized. For\n+trackers udp is recognized as well. \n+url_parse_error \n+25 \n+The URL did not conform to URL syntax and failed to be parsed \n+peer_sent_empty_piece \n+26 \n+The peer sent a piece message of length 0 \n+parse_failed \n+27 \n+A bencoded structure was corrupt and failed to be parsed \n+invalid_file_tag \n+28 \n+The fast resume file was missing or had an invalid file version\n+tag \n+missing_info_hash \n+29 \n+The fast resume file was missing or had an invalid info-hash \n+mismatching_info_hash \n+30 \n+The info-hash did not match the torrent \n+invalid_hostname \n+31 \n+The URL contained an invalid hostname \n+invalid_port \n+32 \n+The URL had an invalid port \n+port_blocked \n+33 \n+The port is blocked by the port-filter, and prevented the\n+connection \n+expected_close_bracket_in_address \n+34 \n+The IPv6 address was expected to end with "]" \n+destructing_torrent \n+35 \n+The torrent is being destructed, preventing the operation to\n+succeed \n+timed_out \n+36 \n+The connection timed out \n+upload_upload_connection \n+37 \n+The peer is upload only, and we are upload only. There's no point\n+in keeping the connection \n+uninteresting_upload_peer \n+38 \n+The peer is upload only, and we're not interested in it. There's\n+no point in keeping the connection \n+invalid_info_hash \n+39 \n+The peer sent an unknown info-hash \n+torrent_paused \n+40 \n+The torrent is paused, preventing the operation from succeeding \n+invalid_have \n+41 \n+The peer sent an invalid have message, either wrong size or\n+referring to a piece that doesn't exist in the torrent \n+invalid_bitfield_size \n+42 \n+The bitfield message had the incorrect size \n+too_many_requests_when_choked \n+43 \n+The peer kept requesting pieces after it was choked, possible\n+abuse attempt. \n+invalid_piece \n+44 \n+The peer sent a piece message that does not correspond to a\n+piece request sent by the client \n+no_memory \n+45 \n+memory allocation failed \n+torrent_aborted \n+46 \n+The torrent is aborted, preventing the operation to succeed \n+self_connection \n+47 \n+The peer is a connection to ourself, no point in keeping it \n+invalid_piece_size \n+48 \n+The peer sent a piece message with invalid size, either negative\n+or greater than one block \n+timed_out_no_interest \n+49 \n+The peer has not been interesting or interested in us for too\n+long, no point in keeping it around \n+timed_out_inactivity \n+50 \n+The peer has not said anything in a long time, possibly dead \n+timed_out_no_handshake \n+51 \n+The peer did not send a handshake within a reasonable amount of\n+time, it might not be a bittorrent peer \n+timed_out_no_request \n+52 \n+The peer has been unchoked for too long without requesting any\n+data. It might be lying about its interest in us \n+invalid_choke \n+53 \n+The peer sent an invalid choke message \n+invalid_unchoke \n+54 \n+The peer send an invalid unchoke message \n+invalid_interested \n+55 \n+The peer sent an invalid interested message \n+invalid_not_interested \n+56 \n+The peer sent an invalid not-interested message \n+invalid_request \n+57 \n+The peer sent an invalid piece request message \n+invalid_hash_list \n+58 \n+The peer sent an invalid hash-list message (this is part of the\n+merkle-torrent extension) \n+invalid_hash_piece \n+59 \n+The peer sent an invalid hash-piece message (this is part of the\n+merkle-torrent extension) \n+invalid_cancel \n+60 \n+The peer sent an invalid cancel message \n+invalid_dht_port \n+61 \n+The peer sent an invalid DHT port-message \n+invalid_suggest \n+62 \n+The peer sent an invalid suggest piece-message \n+invalid_have_all \n+63 \n+The peer sent an invalid have all-message \n+invalid_have_none \n+64 \n+The peer sent an invalid have none-message \n+invalid_reject \n+65 \n+The peer sent an invalid reject message \n+invalid_allow_fast \n+66 \n+The peer sent an invalid allow fast-message \n+invalid_extended \n+67 \n+The peer sent an invalid extension message ID \n+invalid_message \n+68 \n+The peer sent an invalid message ID \n+sync_hash_not_found \n+69 \n+The synchronization hash was not found in the encrypted handshake \n+invalid_encryption_constant \n+70 \n+The encryption constant in the handshake is invalid \n+no_plaintext_mode \n+71 \n+The peer does not support plain text, which is the selected mode \n+no_rc4_mode \n+72 \n+The peer does not support RC4, which is the selected mode \n+unsupported_encryption_mode \n+73 \n+The peer does not support any of the encryption modes that the\n+client supports \n+unsupported_encryption_mode_selected \n+74 \n+The peer selected an encryption mode that the client did not\n+advertise and does not support \n+invalid_pad_size \n+75 \n+The pad size used in the encryption handshake is of invalid size \n+invalid_encrypt_handshake \n+76 \n+The encryption handshake is invalid \n+no_incoming_encrypted \n+77 \n+The client is set to not support incoming encrypted connections\n+and this is an encrypted connection \n+no_incoming_regular \n+78 \n+The client is set to not support incoming regular bittorrent\n+connections, and this is a regular connection \n+duplicate_peer_id \n+79 \n+The client is already connected to this peer-ID \n+torrent_removed \n+80 \n+Torrent was removed \n+packet_too_large \n+81 \n+The packet size exceeded the upper sanity check-limit \n+reserved \n+82 \n+ \n+http_error \n+83 \n+The web server responded with an error \n+missing_location \n+84 \n+The web server response is missing a location header \n+invalid_redirection \n+85 \n+The web seed redirected to a path that no longer matches the\n+.torrent directory structure \n+redirecting \n+86 \n+The connection was closed because it redirected to a different\n+URL \n+invalid_range \n+87 \n+The HTTP range header is invalid \n+no_content_length \n+88 \n+The HTTP response did not have a content length \n+banned_by_ip_filter \n+89 \n+The IP is blocked by the IP filter \n+too_many_connections \n+90 \n+At the connection limit \n+peer_banned \n+91 \n+The peer is marked as banned \n+stopping_torrent \n+92 \n+The torrent is stopping, causing the operation to fail \n+too_many_corrupt_pieces \n+93 \n+The peer has sent too many corrupt pieces and is banned \n+torrent_not_ready \n+94 \n+The torrent is not ready to receive peers \n+peer_not_constructed \n+95 \n+The peer is not completely constructed yet \n+session_closing \n+96 \n+The session is closing, causing the operation to fail \n+optimistic_disconnect \n+97 \n+The peer was disconnected in order to leave room for a\n+potentially better peer \n+torrent_finished \n+98 \n+The torrent is finished \n+no_router \n+99 \n+No UPnP router found \n+metadata_too_large \n+100 \n+The metadata message says the metadata exceeds the limit \n+invalid_metadata_request \n+101 \n+The peer sent an invalid metadata request message \n+invalid_metadata_size \n+102 \n+The peer advertised an invalid metadata size \n+invalid_metadata_offset \n+103 \n+The peer sent a message with an invalid metadata offset \n+invalid_metadata_message \n+104 \n+The peer sent an invalid metadata message \n+pex_message_too_large \n+105 \n+The peer sent a peer exchange message that was too large \n+invalid_pex_message \n+106 \n+The peer sent an invalid peer exchange message \n+invalid_lt_tracker_message \n+107 \n+The peer sent an invalid tracker exchange message \n+too_frequent_pex \n+108 \n+The peer sent an pex messages too often. This is a possible\n+attempt of and attack \n+no_metadata \n+109 \n+The operation failed because it requires the torrent to have\n+the metadata (.torrent file) and it doesn't have it yet.\n+This happens for magnet links before they have downloaded the\n+metadata, and also torrents added by URL. \n+invalid_dont_have \n+110 \n+The peer sent an invalid dont_have message. The don't have\n+message is an extension to allow peers to advertise that the\n+no longer has a piece they previously had. \n+requires_ssl_connection \n+111 \n+The peer tried to connect to an SSL torrent without connecting\n+over SSL. \n+invalid_ssl_cert \n+112 \n+The peer tried to connect to a torrent with a certificate\n+for a different torrent. \n+not_an_ssl_torrent \n+113 \n+the torrent is not an SSL torrent, and the operation requires\n+an SSL torrent \n+banned_by_port_filter \n+114 \n+peer was banned because its listen port is within a banned port\n+range, as specified by the port_filter. \n+invalid_session_handle \n+115 \n+The session_handle is not referring to a valid session_impl \n+invalid_listen_socket \n+116 \n+the listen socket associated with this request was closed \n+invalid_hash_request \n+117 \n+ \n+invalid_hashes \n+118 \n+ \n+invalid_hash_reject \n+119 \n+ \n+deprecated_120 \n+120 \n+ \n+deprecated_121 \n+121 \n+ \n+deprecated_122 \n+122 \n+ \n+deprecated_123 \n+123 \n+ \n+deprecated_124 \n+124 \n+ \n+missing_file_sizes \n+130 \n+The resume data file is missing the file sizes entry \n+no_files_in_resume_data \n+131 \n+The resume data file file sizes entry is empty \n+missing_pieces \n+132 \n+The resume data file is missing the pieces and slots entry \n+mismatching_number_of_files \n+133 \n+The number of files in the resume data does not match the number\n+of files in the torrent \n+mismatching_file_size \n+134 \n+One of the files on disk has a different size than in the fast\n+resume file \n+mismatching_file_timestamp \n+135 \n+One of the files on disk has a different timestamp than in the\n+fast resume file \n+not_a_dictionary \n+136 \n+The resume data file is not a dictionary \n+invalid_blocks_per_piece \n+137 \n+The blocks per piece entry is invalid in the resume data file \n+missing_slots \n+138 \n+The resume file is missing the slots entry, which is required\n+for torrents with compact allocation. DEPRECATED \n+too_many_slots \n+139 \n+The resume file contains more slots than the torrent \n+invalid_slot_list \n+140 \n+The slot entry is invalid in the resume data \n+invalid_piece_index \n+141 \n+One index in the slot list is invalid \n+pieces_need_reorder \n+142 \n+The pieces on disk needs to be re-ordered for the specified\n+allocation mode. This happens if you specify sparse allocation\n+and the files on disk are using compact storage. The pieces needs\n+to be moved to their right position. DEPRECATED \n+resume_data_not_modified \n+143 \n+this error is returned when asking to save resume data and\n+specifying the flag to only save when there's anything new to save\n+(torrent_handle::only_if_modified) and there wasn't anything changed. \n+http_parse_error \n+150 \n+The HTTP header was not correctly formatted \n+http_missing_location \n+151 \n+The HTTP response was in the 300-399 range but lacked a location\n+header \n+http_failed_decompress \n+152 \n+The HTTP response was encoded with gzip or deflate but\n+decompressing it failed \n+no_i2p_router \n+160 \n+The URL specified an i2p address, but no i2p router is configured \n+no_i2p_endpoint \n+161 \n+i2p acceptor is not available yet, can't announce without endpoint \n+scrape_not_available \n+170 \n+The tracker URL doesn't support transforming it into a scrape\n+URL. i.e. it doesn't contain "announce. \n+invalid_tracker_response \n+171 \n+invalid tracker response \n+invalid_peer_dict \n+172 \n+invalid peer dictionary entry. Not a dictionary \n+tracker_failure \n+173 \n+tracker sent a failure message \n+invalid_files_entry \n+174 \n+missing or invalid files entry \n+invalid_hash_entry \n+175 \n+missing or invalid hash entry \n+invalid_peers_entry \n+176 \n+missing or invalid peers and peers6 entry \n+invalid_tracker_response_length \n+177 \n+UDP tracker response packet has invalid size \n+invalid_tracker_transaction_id \n+178 \n+invalid transaction id in UDP tracker response \n+invalid_tracker_action \n+179 \n+invalid action field in UDP tracker response \n+announce_skipped \n+180 \n+skipped announce (because it's assumed to be unreachable over the\n+given source network interface) \n+no_entropy \n+200 \n+random number generation failed \n+ssrf_mitigation \n+201 \n+blocked by SSRF mitigation \n+blocked_by_idna \n+202 \n+blocked because IDNA host names are banned \n+torrent_unknown_version \n+210 \n+the torrent file has an unknown meta version \n+torrent_missing_file_tree \n+211 \n+the v2 torrent file has no file tree \n+torrent_missing_meta_version \n+212 \n+the torrent contains v2 keys but does not specify meta version 2 \n+torrent_inconsistent_files \n+213 \n+the v1 and v2 file metadata does not match \n+torrent_missing_piece_layer \n+214 \n+one or more files are missing piece layer hashes \n+torrent_invalid_piece_layer \n+215 \n+a piece layer has the wrong size or failed hash check \n+torrent_missing_pieces_root \n+216 \n+a v2 file entry has no root hash \n+torrent_inconsistent_hashes \n+217 \n+the v1 and v2 hashes do not describe the same data \n+torrent_invalid_pad_file \n+218 \n+a file in the v2 metadata has the pad attribute set \n+error_code_max \n+219 \n+the number of error codes \n+
\n+[report issue]\n+\n+enum http_errors
\n+Declared in "libtorrent/error_code.hpp"
\n+\n+\n+ \n+\n+name \n+value \n+description \n+cont \n+100 \n+ \n+ok \n+200 \n+ \n+created \n+201 \n+ \n+accepted \n+202 \n+ \n+no_content \n+204 \n+ \n+multiple_choices \n+300 \n+ \n+moved_permanently \n+301 \n+ \n+moved_temporarily \n+302 \n+ \n+not_modified \n+304 \n+ \n+bad_request \n+400 \n+ \n+unauthorized \n+401 \n+ \n+forbidden \n+403 \n+ \n+not_found \n+404 \n+ \n+internal_server_error \n+500 \n+ \n+not_implemented \n+501 \n+ \n+bad_gateway \n+502 \n+ \n+service_unavailable \n+503 \n+ \n+
\n+[report issue]\n+\n+enum socks_error_code
\n+Declared in "libtorrent/socks5_stream.hpp"
\n+\n+\n+ \n+\n+name \n+value \n+description \n+no_error \n+0 \n+ \n+unsupported_version \n+1 \n+ \n+unsupported_authentication_method \n+2 \n+ \n+unsupported_authentication_version \n+3 \n+ \n+authentication_error \n+4 \n+ \n+username_required \n+5 \n+ \n+general_failure \n+6 \n+ \n+command_not_supported \n+7 \n+ \n+no_identd \n+8 \n+ \n+identd_error \n+9 \n+ \n+num_errors \n+10 \n+ \n+
\n+[report issue]\n+\n+enum error_code_enum
\n+Declared in "libtorrent/upnp.hpp"
\n+\n+\n+ \n+\n+name \n+value \n+description \n+no_error \n+0 \n+No error \n+invalid_argument \n+402 \n+One of the arguments in the request is invalid \n+action_failed \n+501 \n+The request failed \n+value_not_in_array \n+714 \n+The specified value does not exist in the array \n+source_ip_cannot_be_wildcarded \n+715 \n+The source IP address cannot be wild-carded, but\n+must be fully specified \n+external_port_cannot_be_wildcarded \n+716 \n+The external port cannot be a wildcard, but must\n+be specified \n+port_mapping_conflict \n+718 \n+The port mapping entry specified conflicts with a\n+mapping assigned previously to another client \n+internal_port_must_match_external \n+724 \n+Internal and external port value must be the same \n+only_permanent_leases_supported \n+725 \n+The NAT implementation only supports permanent\n+lease times on port mappings \n+remote_host_must_be_wildcard \n+726 \n+RemoteHost must be a wildcard and cannot be a\n+specific IP address or DNS name \n+external_port_must_be_wildcard \n+727 \n+ExternalPort must be a wildcard and cannot be a\n+specific port \n+
\n+[report issue]\n+\n+enum i2p_error_code
\n+Declared in "libtorrent/i2p_stream.hpp"
\n+\n+\n+ \n+\n+name \n+value \n+description \n+no_error \n+0 \n+ \n+parse_failed \n+1 \n+ \n+cant_reach_peer \n+2 \n+ \n+i2p_error \n+3 \n+ \n+invalid_key \n+4 \n+ \n+invalid_id \n+5 \n+ \n+timeout \n+6 \n+ \n+key_not_found \n+7 \n+ \n+duplicated_id \n+8 \n+ \n+num_errors \n+9 \n+ \n+
\n+[report issue]\n+\n+enum pcp_errors
\n+Declared in "libtorrent/natpmp.hpp"
\n+\n+\n+ \n+\n+name \n+value \n+description \n+pcp_success \n+0 \n+ \n+pcp_unsupp_version \n+1 \n+ \n+pcp_not_authorized \n+2 \n+ \n+pcp_malformed_request \n+3 \n+ \n+pcp_unsupp_opcode \n+4 \n+ \n+pcp_unsupp_option \n+5 \n+ \n+pcp_malformed_option \n+6 \n+ \n+pcp_network_failure \n+7 \n+ \n+pcp_no_resources \n+8 \n+ \n+pcp_unsupp_protocol \n+9 \n+ \n+pcp_user_ex_quota \n+10 \n+ \n+pcp_cannot_provide_external \n+11 \n+ \n+pcp_address_mismatch \n+12 \n+ \n+pcp_excessive_remote_peers \n+13 \n+ \n+
\n+[report issue]\n+\n+file_slice
\n+Declared in "libtorrent/file_storage.hpp"
\n+represents a window of a file in a torrent.
\n+The file_index refers to the index of the file (in the torrent_info).\n+To get the path and filename, use file_path() and give the file_index\n+as argument. The offset is the byte offset in the file where the range\n+starts, and size is the number of bytes this range is. The size + offset\n+will never be greater than the file size.
\n+\n+struct file_slice\n {\n- std::string message () const override;\n-\n- static constexpr alert_category_t static_category = alert_category::dht;\n- aux::noexcept_movable<address> ip;\n- int port;\n- sha1_hash info_hash;\n+ file_index_t file_index;\n+ std::int64_t offset;\n+ std::int64_t size;\n };\n \n-[report issue]\n-\n-dht_get_peers_alert
\n-Declared in "libtorrent/alert_types.hpp"
\n-This alert is generated when a DHT node sends a get_peers message to\n-our DHT node. It belongs to the alert_category::dht category.
\n+[report issue]\n+- file_index
\n+- the index of the file
\n+
\n+[report issue]\n+- offset
\n+- the offset from the start of the file, in bytes
\n+
\n+[report issue]\n+- size
\n+- the size of the window, in bytes
\n+
\n+[report issue]\n+\n+file_storage
\n+Declared in "libtorrent/file_storage.hpp"
\n+The file_storage class represents a file list and the piece\n+size. Everything necessary to interpret a regular bittorrent storage\n+file structure.
\n \n-struct dht_get_peers_alert final : alert\n+class file_storage\n {\n- std::string message () const override;\n+ bool is_valid () const;\n+ void reserve (int num_files);\n+ void add_file (error_code& ec, std::string const& path, std::int64_t file_size\n+ , file_flags_t file_flags = {}\n+ , std::time_t mtime = 0, string_view symlink_path = string_view()\n+ , char const* root_hash = nullptr);\n+ void add_file_borrow (string_view filename\n+ , std::string const& path, std::int64_t file_size\n+ , file_flags_t file_flags = {}, char const* filehash = nullptr\n+ , std::int64_t mtime = 0, string_view symlink_path = string_view()\n+ , char const* root_hash = nullptr);\n+ void add_file_borrow (error_code& ec, string_view filename\n+ , std::string const& path, std::int64_t file_size\n+ , file_flags_t file_flags = {}, char const* filehash = nullptr\n+ , std::int64_t mtime = 0, string_view symlink_path = string_view()\n+ , char const* root_hash = nullptr);\n+ void add_file (std::string const& path, std::int64_t file_size\n+ , file_flags_t file_flags = {}\n+ , std::time_t mtime = 0, string_view symlink_path = string_view()\n+ , char const* root_hash = nullptr);\n+ void rename_file (file_index_t index, std::string const& new_filename);\n+ std::vector<file_slice> map_block (piece_index_t piece, std::int64_t offset\n+ , std::int64_t size) const;\n+ peer_request map_file (file_index_t file, std::int64_t offset, int size) const;\n+ int num_files () const noexcept;\n+ file_index_t end_file () const noexcept;\n+ index_range<file_index_t> file_range () const noexcept;\n+ std::int64_t total_size () const;\n+ void set_num_pieces (int n);\n+ int num_pieces () const;\n+ piece_index_t end_piece () const;\n+ piece_index_t last_piece () const;\n+ index_range<piece_index_t> piece_range () const noexcept;\n+ void set_piece_length (int l);\n+ int piece_length () const;\n+ int piece_size (piece_index_t index) const;\n+ int piece_size2 (piece_index_t index) const;\n+ int blocks_in_piece2 (piece_index_t index) const;\n+ int blocks_per_piece () const;\n+ std::string const& name () const;\n+ void set_name (std::string const& n);\n+ void swap (file_storage& ti) noexcept;\n+ void canonicalize ();\n+ std::int64_t file_offset (file_index_t index) const;\n+ sha256_hash root (file_index_t index) const;\n+ char const* root_ptr (file_index_t const index) const;\n+ string_view file_name (file_index_t index) const;\n+ std::time_t mtime (file_index_t index) const;\n+ std::string symlink (file_index_t index) const;\n+ bool pad_file_at (file_index_t index) const;\n+ sha1_hash hash (file_index_t index) const;\n+ std::int64_t file_size (file_index_t index) const;\n+ std::string file_path (file_index_t index, std::string const& save_path = "") const;\n+ int file_num_blocks (file_index_t index) const;\n+ int file_num_pieces (file_index_t index) const;\n+ index_range<piece_index_t::diff_type> file_piece_range (file_index_t) const;\n+ int file_first_block_node (file_index_t index) const;\n+ int file_first_piece_node (file_index_t index) const;\n+ std::uint32_t file_path_hash (file_index_t index, std::string const& save_path) const;\n+ void all_path_hashes (std::unordered_set<std::uint32_t>& table) const;\n+ file_flags_t file_flags (file_index_t index) const;\n+ bool file_absolute_path (file_index_t index) const;\n+ file_index_t file_index_at_offset (std::int64_t offset) const;\n+ file_index_t file_index_at_piece (piece_index_t piece) const;\n+ file_index_t file_index_for_root (sha256_hash const& root_hash) const;\n+ piece_index_t piece_index_at_file (file_index_t f) const;\n+ void sanitize_symlinks ();\n+ bool v2 () const;\n \n- static constexpr alert_category_t static_category = alert_category::dht;\n- sha1_hash info_hash;\n+ static constexpr file_flags_t flag_pad_file = 0_bit;\n+ static constexpr file_flags_t flag_hidden = 1_bit;\n+ static constexpr file_flags_t flag_executable = 2_bit;\n+ static constexpr file_flags_t flag_symlink = 3_bit;\n };\n \n-[report issue]\n-\n-cache_flushed_alert
\n-Declared in "libtorrent/alert_types.hpp"
\n-This alert is posted when the disk cache has been flushed for a specific\n-torrent as a result of a call to torrent_handle::flush_cache(). This\n-alert belongs to the alert_category::storage category, which must be\n-enabled to let this alert through. The alert is also posted when removing\n-a torrent from the session, once the outstanding cache flush is complete\n-and the torrent does no longer have any files open.
\n+[report issue]\n+is_valid()
\n \n-struct cache_flushed_alert final : torrent_alert\n-{\n- static constexpr alert_category_t static_category = alert_category::storage;\n-};\n+bool is_valid () const;\n \n-[report issue]\n-\n-lsd_peer_alert
\n-Declared in "libtorrent/alert_types.hpp"
\n-This alert is generated when we receive a local service discovery message\n-from a peer for a torrent we're currently participating in.
\n+returns true if the piece length has been initialized\n+on the file_storage. This is typically taken as a proxy\n+of whether the file_storage as a whole is initialized or\n+not.
\n+[report issue]\n+\n+reserve()
\n \n-struct lsd_peer_alert final : peer_alert\n-{\n- std::string message () const override;\n-\n- static constexpr alert_category_t static_category = alert_category::peer;\n-};\n+void reserve (int num_files);\n \n-[report issue]\n-\n-trackerid_alert
\n-Declared in "libtorrent/alert_types.hpp"
\n-This alert is posted whenever a tracker responds with a trackerid.\n-The tracker ID is like a cookie. libtorrent will store the tracker ID\n-for this tracker and repeat it in subsequent announces.
\n+allocates space for num_files in the internal file list. This can\n+be used to avoid reallocating the internal file list when the number\n+of files to be added is known up-front.
\n+\n+[report issue]\n+\n+add_file() add_file_borrow()
\n \n-struct trackerid_alert final : tracker_alert\n-{\n- std::string message () const override;\n- char const* tracker_id () const;\n-\n- static constexpr alert_category_t static_category = alert_category::status;\n-};\n+void add_file (error_code& ec, std::string const& path, std::int64_t file_size\n+ , file_flags_t file_flags = {}\n+ , std::time_t mtime = 0, string_view symlink_path = string_view()\n+ , char const* root_hash = nullptr);\n+void add_file_borrow (string_view filename\n+ , std::string const& path, std::int64_t file_size\n+ , file_flags_t file_flags = {}, char const* filehash = nullptr\n+ , std::int64_t mtime = 0, string_view symlink_path = string_view()\n+ , char const* root_hash = nullptr);\n+void add_file_borrow (error_code& ec, string_view filename\n+ , std::string const& path, std::int64_t file_size\n+ , file_flags_t file_flags = {}, char const* filehash = nullptr\n+ , std::int64_t mtime = 0, string_view symlink_path = string_view()\n+ , char const* root_hash = nullptr);\n+void add_file (std::string const& path, std::int64_t file_size\n+ , file_flags_t file_flags = {}\n+ , std::time_t mtime = 0, string_view symlink_path = string_view()\n+ , char const* root_hash = nullptr);\n \n-[report issue]\n-tracker_id()
\n+Adds a file to the file storage. The add_file_borrow version\n+expects that filename is the file name (without a path) of\n+the file that's being added.\n+This memory is borrowed, i.e. it is the caller's\n+responsibility to make sure it stays valid throughout the lifetime\n+of this file_storage object or any copy of it. The same thing applies\n+to filehash, which is an optional pointer to a 20 byte binary\n+SHA-1 hash of the file.
\n+if filename is empty, the filename from path is used and not\n+borrowed.
\n+The path argument is the full path (in the torrent file) to\n+the file to add. Note that this is not supposed to be an absolute\n+path, but it is expected to include the name of the torrent as the\n+first path element.
\n+file_size is the size of the file in bytes.
\n+The file_flags argument sets attributes on the file. The file\n+attributes is an extension and may not work in all bittorrent clients.
\n+For possible file attributes, see file_storage::flags_t.
\n+The mtime argument is optional and can be set to 0. If non-zero,\n+it is the posix time of the last modification time of this file.
\n+symlink_path is the path the file is a symlink to. To make this a\n+symlink you also need to set the file_storage::flag_symlink file flag.
\n+root_hash is an optional pointer to a 32 byte SHA-256 hash, being\n+the merkle tree root hash for this file. This is only used for v2\n+torrents. If the root hash is specified for one file, it has to\n+be specified for all, otherwise this function will fail.\n+Note that the buffer root_hash points to must out-live the\n+file_storage object, it will not be copied. This parameter is only\n+used when loading torrents, that already have their file hashes\n+computed. When creating torrents, the file hashes will be computed by\n+the piece hashes.
\n+If more files than one are added, certain restrictions to their paths\n+apply. In a multi-file file storage (torrent), all files must share\n+the same root directory.
\n+That is, the first path element of all files must be the same.\n+This shared path element is also set to the name of the torrent. It\n+can be changed by calling set_name.
\n+The overloads that take an error_code reference will report failures\n+via that variable, otherwise system_error is thrown.
\n+[report issue]\n+\n+rename_file()
\n \n-char const* tracker_id () const;\n+void rename_file (file_index_t index, std::string const& new_filename);\n
\n-The tracker ID returned by the tracker
\n-[report issue]\n-\n-\n-dht_bootstrap_alert
\n-Declared in "libtorrent/alert_types.hpp"
\n-This alert is posted when the initial DHT bootstrap is done.
\n+renames the file at index to new_filename. Keep in mind\n+that filenames are expected to be UTF-8 encoded.
\n+[report issue]\n+\n+map_block()
\n \n-struct dht_bootstrap_alert final : alert\n-{\n- std::string message () const override;\n-\n- static constexpr alert_category_t static_category = alert_category::dht;\n-};\n+std::vector<file_slice> map_block (piece_index_t piece, std::int64_t offset\n+ , std::int64_t size) const;\n \n-[report issue]\n-\n-torrent_error_alert
\n-Declared in "libtorrent/alert_types.hpp"
\n-This is posted whenever a torrent is transitioned into the error state.\n-If the error code is duplicate_torrent (error_code_enum) error, it suggests two magnet\n-links ended up resolving to the same hybrid torrent. For more details,\n-see BitTorrent v2 torrents.
\n+returns a list of file_slice objects representing the portions of\n+files the specified piece index, byte offset and size range overlaps.\n+this is the inverse mapping of map_file().
\n+Preconditions of this function is that the input range is within the\n+torrents address space. piece may not be negative and
\n+\n+piece * piece_size + offset + size
\n+may not exceed the total size of the torrent.
\n+[report issue]\n+\n+map_file()
\n \n-struct torrent_error_alert final : torrent_alert\n-{\n- std::string message () const override;\n- char const* filename () const;\n-\n- static constexpr alert_category_t static_category = alert_category::error | alert_category::status;\n- error_code const error;\n-};\n+peer_request map_file (file_index_t file, std::int64_t offset, int size) const;\n \n-[report issue]\n-filename()
\n+returns a peer_request representing the piece index, byte offset\n+and size the specified file range overlaps. This is the inverse\n+mapping over map_block(). Note that the peer_request return type\n+is meant to hold bittorrent block requests, which may not be larger\n+than 16 kiB. Mapping a range larger than that may return an overflown\n+integer.
\n+[report issue]\n+\n+num_files()
\n \n-char const* filename () const;\n+int num_files () const noexcept;\n
\n-the filename (or object) the error occurred on.
\n-[report issue]\n-- error
\n-- specifies which error the torrent encountered.
\n-
\n-[report issue]\n-\n-\n-torrent_need_cert_alert
\n-Declared in "libtorrent/alert_types.hpp"
\n-This is always posted for SSL torrents. This is a reminder to the client that\n-the torrent won't work unless torrent_handle::set_ssl_certificate() is called with\n-a valid certificate. Valid certificates MUST be signed by the SSL certificate\n-in the .torrent file.
\n+returns the number of files in the file_storage
\n+[report issue]\n+\n+end_file()
\n \n-struct torrent_need_cert_alert final : torrent_alert\n-{\n- std::string message () const override;\n-\n- static constexpr alert_category_t static_category = alert_category::status;\n-};\n+file_index_t end_file () const noexcept;\n \n-[report issue]\n-\n-incoming_connection_alert
\n-Declared in "libtorrent/alert_types.hpp"
\n-The incoming connection alert is posted every time we successfully accept\n-an incoming connection, through any mean. The most straight-forward ways\n-of accepting incoming connections are through the TCP listen socket and\n-the UDP listen socket for uTP sockets. However, connections may also be\n-accepted through a Socks5 or i2p listen socket, or via an SSL listen\n-socket.
\n+returns the index of the one-past-end file in the file storage
\n+[report issue]\n+\n+file_range()
\n \n-struct incoming_connection_alert final : alert\n-{\n- std::string message () const override;\n-\n- static constexpr alert_category_t static_category = alert_category::peer;\n- socket_type_t socket_type;\n- aux::noexcept_movable<tcp::endpoint> endpoint;\n-};\n+index_range<file_index_t> file_range () const noexcept;\n \n-[report issue]\n-- socket_type
\n-- tells you what kind of socket the connection was accepted
\n-
\n-[report issue]\n-- endpoint
\n-- is the IP address and port the connection came from.
\n-
\n-[report issue]\n-\n-add_torrent_alert
\n-Declared in "libtorrent/alert_types.hpp"
\n-This alert is always posted when a torrent was attempted to be added\n-and contains the return status of the add operation. The torrent handle of the new\n-torrent can be found as the handle member in the base class. If adding\n-the torrent failed, error contains the error code.
\n+returns an implementation-defined type that can be used as the\n+container in a range-for loop. Where the values are the indices of all\n+files in the file_storage.
\n+[report issue]\n+\n+total_size()
\n \n-struct add_torrent_alert final : torrent_alert\n-{\n- std::string message () const override;\n-\n- static constexpr alert_category_t static_category = alert_category::status;\n- add_torrent_params params;\n- error_code error;\n-};\n+std::int64_t total_size () const;\n \n-[report issue]\n-- params
\n-This contains copies of the most important fields from the original\n-add_torrent_params object, passed to add_torrent() or\n-async_add_torrent(). Specifically, these fields are copied:
\n-\n-- version
\n-- ti
\n-- name
\n-- save_path
\n-- userdata
\n-- tracker_id
\n-- flags
\n-- info_hash
\n-
\n-the info_hash field will be updated with the info-hash of the torrent\n-specified by ti.
\n-
\n-[report issue]\n-- error
\n-- set to the error, if one occurred while adding the torrent.
\n-
\n-[report issue]\n-\n-state_update_alert
\n-Declared in "libtorrent/alert_types.hpp"
\n-This alert is only posted when requested by the user, by calling\n-session::post_torrent_updates() on the session. It contains the torrent\n-status of all torrents that changed since last time this message was\n-posted. Its category is alert_category::status, but it's not subject to\n-filtering, since it's only manually posted anyway.
\n+returns the total number of bytes all the files in this torrent spans
\n+\n+[report issue]\n+\n+num_pieces() set_num_pieces()
\n \n-struct state_update_alert final : alert\n-{\n- std::string message () const override;\n-\n- static constexpr alert_category_t static_category = alert_category::status;\n- std::vector<torrent_status> status;\n-};\n+void set_num_pieces (int n);\n+int num_pieces () const;\n \n-[report issue]\n-- status
\n-- contains the torrent status of all torrents that changed since last\n-time this message was posted. Note that you can map a torrent status\n-to a specific torrent via its handle member. The receiving end is\n-suggested to have all torrents sorted by the torrent_handle or hashed\n-by it, for efficient updates.
\n-
\n-[report issue]\n-\n-session_stats_alert
\n-Declared in "libtorrent/alert_types.hpp"
\n-The session_stats_alert is posted when the user requests session statistics by\n-calling post_session_stats() on the session object. This alert does not\n-have a category, since it's only posted in response to an API call. It\n-is not subject to the alert_mask filter.
\n-the message() member function returns a string representation of the values that\n-properly match the line returned in session_stats_header_alert::message().
\n-this specific output is parsed by tools/parse_session_stats.py\n-if this is changed, that parser should also be changed
\n+set and get the number of pieces in the torrent
\n+[report issue]\n+\n+end_piece()
\n \n-struct session_stats_alert final : alert\n-{\n- std::string message () const override;\n- span<std::int64_t const> counters () const;\n-\n- static constexpr alert_category_t static_category = {};\n-};\n+piece_index_t end_piece () const;\n \n-[report issue]\n+\n+last_piece()
\n \n-span<std::int64_t const> counters () const;\n+piece_index_t last_piece () const;\n
\n-An array are a mix of counters and gauges, which meanings can be\n-queries via the session_stats_metrics() function on the session. The\n-mapping from a specific metric to an index into this array is constant\n-for a specific version of libtorrent, but may differ for other\n-versions. The intended usage is to request the mapping, i.e. call\n-session_stats_metrics(), once on startup, and then use that mapping to\n-interpret these values throughout the process' runtime.
\n-For more information, see the session statistics section.
\n-[report issue]\n-\n-\n-dht_error_alert
\n-Declared in "libtorrent/alert_types.hpp"
\n-posted when something fails in the DHT. This is not necessarily a fatal\n-error, but it could prevent proper operation
\n+returns the index of the last piece in the torrent. The last piece is\n+special in that it may be smaller than the other pieces (and the other\n+pieces are all the same size).
\n+[report issue]\n+\n+piece_range()
\n \n-struct dht_error_alert final : alert\n-{\n- std::string message () const override;\n-\n- static constexpr alert_category_t static_category = alert_category::error | alert_category::dht;\n- error_code error;\n- operation_t op;\n-};\n+index_range<piece_index_t> piece_range () const noexcept;\n \n-[report issue]\n-- error
\n-- the error code
\n-
\n-[report issue]\n-- op
\n-- the operation that failed
\n-
\n-[report issue]\n-\n-dht_immutable_item_alert
\n-Declared in "libtorrent/alert_types.hpp"
\n-this alert is posted as a response to a call to session::get_item(),\n-specifically the overload for looking up immutable items in the DHT.
\n+returns an implementation-defined type that can be used as the\n+container in a range-for loop. Where the values are the indices of all\n+pieces in the file_storage.
\n+\n+[report issue]\n+\n+piece_length() set_piece_length()
\n \n-struct dht_immutable_item_alert final : alert\n-{\n- std::string message () const override;\n-\n- static constexpr alert_category_t static_category = alert_category::dht;\n- sha1_hash target;\n- entry item;\n-};\n+void set_piece_length (int l);\n+int piece_length () const;\n \n-[report issue]\n-- target
\n-- the target hash of the immutable item. This must\n-match the SHA-1 hash of the bencoded form of item.
\n-
\n-[report issue]\n-- item
\n-- the data for this item
\n-
\n-[report issue]\n-\n-dht_mutable_item_alert
\n-Declared in "libtorrent/alert_types.hpp"
\n-this alert is posted as a response to a call to session::get_item(),\n-specifically the overload for looking up mutable items in the DHT.
\n+set and get the size of each piece in this torrent. It must be a power of two\n+and at least 16 kiB.
\n+[report issue]\n+\n+piece_size()
\n \n-struct dht_mutable_item_alert final : alert\n-{\n- std::string message () const override;\n-\n- static constexpr alert_category_t static_category = alert_category::dht;\n- std::array<char, 32> key;\n- std::array<char, 64> signature;\n- std::int64_t seq;\n- std::string salt;\n- entry item;\n- bool authoritative;\n-};\n+int piece_size (piece_index_t index) const;\n \n-[report issue]\n-- key
\n-- the public key that was looked up
\n-
\n-[report issue]\n-- signature
\n-- the signature of the data. This is not the signature of the\n-plain encoded form of the item, but it includes the sequence number\n-and possibly the hash as well. See the dht_store document for more\n-information. This is primarily useful for echoing back in a store\n-request.
\n-
\n-[report issue]\n-- seq
\n-- the sequence number of this item
\n-
\n-[report issue]\n-- salt
\n-- the salt, if any, used to lookup and store this item. If no\n-salt was used, this is an empty string
\n-
\n-[report issue]\n-- item
\n-- the data for this item
\n-
\n-[report issue]\n-- authoritative
\n-- the last response for mutable data is authoritative.
\n-
\n-[report issue]\n-\n-dht_put_alert
\n-Declared in "libtorrent/alert_types.hpp"
\n-this is posted when a DHT put operation completes. This is useful if the\n-client is waiting for a put to complete before shutting down for instance.
\n+returns the piece size of index. This will be the same as piece_length(), except\n+for the last piece, which may be shorter.
\n+[report issue]\n+\n+piece_size2()
\n \n-struct dht_put_alert final : alert\n-{\n- std::string message () const override;\n-\n- static constexpr alert_category_t static_category = alert_category::dht;\n- sha1_hash target;\n- std::array<char, 32> public_key;\n- std::array<char, 64> signature;\n- std::string salt;\n- std::int64_t seq;\n- int num_success;\n-};\n+int piece_size2 (piece_index_t index) const;\n \n-[report issue]\n-- target
\n-- the target hash the item was stored under if this was an immutable\n-item.
\n-
\n-\n-\n-\n-[report issue]\n-- public_key signature salt seq
\n-- if a mutable item was stored, these are the public key, signature,\n-salt and sequence number the item was stored under.
\n-
\n-[report issue]\n-- num_success
\n-- DHT put operation usually writes item to k nodes, maybe the node\n-is stale so no response, or the node doesn't support 'put', or the\n-token for write is out of date, etc. num_success is the number of\n-successful responses we got from the puts.
\n-
\n-[report issue]\n-\n-i2p_alert
\n-Declared in "libtorrent/alert_types.hpp"
\n-this alert is used to report errors in the i2p SAM connection
\n+Returns the size of the given piece. If the piece spans multiple files,\n+only the first file is considered part of the piece. This is used for\n+v2 torrents, where all files are piece aligned and padded. i.e. The pad\n+files are not considered part of the piece for this purpose.
\n+[report issue]\n+\n+blocks_in_piece2()
\n \n-struct i2p_alert final : alert\n-{\n- std::string message () const override;\n-\n- static constexpr alert_category_t static_category = alert_category::error;\n- error_code error;\n-};\n+int blocks_in_piece2 (piece_index_t index) const;\n \n-[report issue]\n-- error
\n-- the error that occurred in the i2p SAM connection
\n-
\n-[report issue]\n-\n-dht_outgoing_get_peers_alert
\n-Declared in "libtorrent/alert_types.hpp"
\n-This alert is generated when we send a get_peers request\n-It belongs to the alert_category::dht category.
\n+returns the number of blocks in the specified piece, for v2 torrents.
\n+[report issue]\n+\n+blocks_per_piece()
\n \n-struct dht_outgoing_get_peers_alert final : alert\n-{\n- std::string message () const override;\n-\n- static constexpr alert_category_t static_category = alert_category::dht;\n- sha1_hash info_hash;\n- sha1_hash obfuscated_info_hash;\n- aux::noexcept_movable<udp::endpoint> endpoint;\n-};\n+int blocks_per_piece () const;\n \n-[report issue]\n-- info_hash
\n-- the info_hash of the torrent we're looking for peers for.
\n-
\n-[report issue]\n-- obfuscated_info_hash
\n-- if this was an obfuscated lookup, this is the info-hash target\n-actually sent to the node.
\n-
\n-[report issue]\n-- endpoint
\n-- the endpoint we're sending this query to
\n-
\n-[report issue]\n-\n-log_alert
\n-Declared in "libtorrent/alert_types.hpp"
\n-This alert is posted by some session wide event. Its main purpose is\n-trouble shooting and debugging. It's not enabled by the default alert\n-mask and is enabled by the alert_category::session_log bit.\n-Furthermore, it's by default disabled as a build configuration.
\n+returns the number of blocks there are in the typical piece. There\n+may be fewer in the last piece)
\n+\n+[report issue]\n+\n+name() set_name()
\n \n-struct log_alert final : alert\n-{\n- std::string message () const override;\n- char const* log_message () const;\n-\n- static constexpr alert_category_t static_category = alert_category::session_log;\n-};\n+std::string const& name () const;\n+void set_name (std::string const& n);\n \n-[report issue]\n-log_message()
\n+set and get the name of this torrent. For multi-file torrents, this is also\n+the name of the root directory all the files are stored in.
\n+[report issue]\n+\n+swap()
\n \n-char const* log_message () const;\n+void swap (file_storage& ti) noexcept;\n
\n-returns the log message
\n-[report issue]\n-\n-\n-torrent_log_alert
\n-Declared in "libtorrent/alert_types.hpp"
\n-This alert is posted by torrent wide events. It's meant to be used for\n-trouble shooting and debugging. It's not enabled by the default alert\n-mask and is enabled by the alert_category::torrent_log bit. By\n-default it is disabled as a build configuration.
\n+swap all content of this with ti.
\n+[report issue]\n+\n+canonicalize()
\n \n-struct torrent_log_alert final : torrent_alert\n-{\n- std::string message () const override;\n- char const* log_message () const;\n-\n- static constexpr alert_category_t static_category = alert_category::torrent_log;\n-};\n+void canonicalize ();\n \n-[report issue]\n-log_message()
\n+arrange files and padding to match the canonical form required\n+by BEP 52
\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+[report issue]\n+\n+pad_file_at() mtime() file_name() file_offset() hash() symlink() file_path() file_size() root() root_ptr()
\n \n-char const* log_message () const;\n+std::int64_t file_offset (file_index_t index) const;\n+sha256_hash root (file_index_t index) const;\n+char const* root_ptr (file_index_t const index) const;\n+string_view file_name (file_index_t index) const;\n+std::time_t mtime (file_index_t index) const;\n+std::string symlink (file_index_t index) const;\n+bool pad_file_at (file_index_t index) const;\n+sha1_hash hash (file_index_t index) const;\n+std::int64_t file_size (file_index_t index) const;\n+std::string file_path (file_index_t index, std::string const& save_path = "") const;\n
\n-returns the log message
\n-[report issue]\n+These functions are used to query attributes of files at\n+a given index.
\n+The hash() is a SHA-1 hash of the file, or 0 if none was\n+provided in the torrent file. This can potentially be used to\n+join a bittorrent network with other file sharing networks.
\n+root() returns the SHA-256 merkle tree root of the specified file,\n+in case this is a v2 torrent. Otherwise returns zeros.\n+root_ptr() returns a pointer to the SHA-256 merkle tree root hash\n+for the specified file. The pointer points into storage referred to\n+when the file was added, it is not owned by this object. Torrents\n+that are not v2 torrents return nullptr.
\n+The mtime() is the modification time is the posix\n+time when a file was last modified when the torrent\n+was created, or 0 if it was not included in the torrent file.
\n+file_path() returns the full path to a file.
\n+file_size() returns the size of a file.
\n+pad_file_at() returns true if the file at the given\n+index is a pad-file.
\n+file_name() returns just the name of the file, whereas\n+file_path() returns the path (inside the torrent file) with\n+the filename appended.
\n+file_offset() returns the byte offset within the torrent file\n+where this file starts. It can be used to map the file to a piece\n+index (given the piece size).
\n+\n+\n+[report issue]\n+\n+file_num_pieces() file_num_blocks() file_piece_range()
\n+\n+int file_num_blocks (file_index_t index) const;\n+int file_num_pieces (file_index_t index) const;\n+index_range<piece_index_t::diff_type> file_piece_range (file_index_t) const;\n+
\n+Returns the number of pieces or blocks the file at index spans,\n+under the assumption that the file is aligned to the start of a piece.\n+This is only meaningful for v2 torrents, where files are guaranteed\n+such alignment.\n+These numbers are used to size and navigate the merkle hash tree for\n+each file.
\n+\n+[report issue]\n+\n+file_first_block_node() file_first_piece_node()
\n+\n+int file_first_block_node (file_index_t index) const;\n+int file_first_piece_node (file_index_t index) const;\n+
\n+index of first piece node in the merkle tree
\n+[report issue]\n+\n+file_path_hash()
\n+\n+std::uint32_t file_path_hash (file_index_t index, std::string const& save_path) const;\n+
\n+returns the crc32 hash of file_path(index)
\n+[report issue]\n+\n+all_path_hashes()
\n+\n+void all_path_hashes (std::unordered_set<std::uint32_t>& table) const;\n+
\n+this will add the CRC32 hash of all directory entries to the table. No\n+filename will be included, just directories. Every depth of directories\n+are added separately to allow test for collisions with files at all\n+levels. i.e. if one path in the torrent is foo/bar/baz, the CRC32\n+hashes for foo, foo/bar and foo/bar/baz will be added to\n+the set.
\n+[report issue]\n+\n+file_flags()
\n+\n+file_flags_t file_flags (file_index_t index) const;\n+
\n+returns a bitmask of flags from file_flags_t that apply\n+to file at index.
\n+[report issue]\n+\n+file_absolute_path()
\n+\n+bool file_absolute_path (file_index_t index) const;\n+
\n+returns true if the file at the specified index has been renamed to\n+have an absolute path, i.e. is not anchored in the save path of the\n+torrent.
\n+\n+[report issue]\n+\n+file_index_at_offset() file_index_at_piece()
\n+\n+file_index_t file_index_at_offset (std::int64_t offset) const;\n+file_index_t file_index_at_piece (piece_index_t piece) const;\n+
\n+returns the index of the file at the given offset in the torrent
\n+[report issue]\n+\n+file_index_for_root()
\n+\n+file_index_t file_index_for_root (sha256_hash const& root_hash) const;\n+
\n+finds the file with the given root hash and returns its index\n+if there is no file with the root hash, file_index_t{-1} is returned
\n+[report issue]\n+\n+piece_index_at_file()
\n+\n+piece_index_t piece_index_at_file (file_index_t f) const;\n+
\n+returns the piece index the given file starts at
\n+[report issue]\n+\n+sanitize_symlinks()
\n+\n+void sanitize_symlinks ();\n+
\n+validate any symlinks, to ensure they all point to\n+other files or directories inside this storage. Any invalid symlinks\n+are updated to point to themselves.
\n+[report issue]\n+\n+v2()
\n+\n+bool v2 () const;\n+
\n+returns true if this torrent contains v2 metadata.
\n+[report issue]\n+- flag_pad_file
\n+- the file is a pad file. It's required to contain zeros\n+at it will not be saved to disk. Its purpose is to make\n+the following file start on a piece boundary.
\n+
\n+[report issue]\n+- flag_hidden
\n+- this file has the hidden attribute set. This is primarily\n+a windows attribute
\n+
\n+[report issue]\n+- flag_executable
\n+- this file has the executable attribute set.
\n+
\n+[report issue]\n+- flag_symlink
\n+- this file is a symbolic link. It should have a link\n+target string associated with it.
\n+
\n+[report issue]\n \n-\n-peer_log_alert
\n-Declared in "libtorrent/alert_types.hpp"
\n-This alert is posted by events specific to a peer. It's meant to be used\n-for trouble shooting and debugging. It's not enabled by the default alert\n-mask and is enabled by the alert_category::peer_log bit. By\n-default it is disabled as a build configuration.
\n+\n+storage_params
\n+Declared in "libtorrent/storage_defs.hpp"
\n+a parameter pack used to construct the storage for a torrent, used in\n+disk_interface
\n \n-struct peer_log_alert final : peer_alert\n+struct storage_params\n {\n- std::string message () const override;\n- char const* log_message () const;\n-\n- enum direction_t\n- {\n- incoming_message,\n- outgoing_message,\n- incoming,\n- outgoing,\n- info,\n- };\n+ storage_params (file_storage const& f, file_storage const* mf\n+ , std::string const& sp, storage_mode_t const sm\n+ , aux::vector<download_priority_t, file_index_t> const& prio\n+ , sha1_hash const& ih);\n \n- static constexpr alert_category_t static_category = alert_category::peer_log;\n- char const* event_type;\n- direction_t direction;\n+ file_storage const& files;\n+ file_storage const* mapped_files = nullptr;\n+ std::string const& path;\n+ storage_mode_t mode {storage_mode_sparse};\n+ aux::vector<download_priority_t, file_index_t> const& priorities;\n+ sha1_hash info_hash;\n };\n \n-[report issue]\n+\n+posix_disk_io_constructor()
\n+Declared in "libtorrent/posix_disk_io.hpp"
\n \n-char const* log_message () const;\n+std::unique_ptr<disk_interface> posix_disk_io_constructor (\n+ io_context& ios, settings_interface const&, counters& cnt);\n
\n-returns the log message
\n-[report issue]\n-\n-enum direction_t
\n-Declared in "libtorrent/alert_types.hpp"
\n+this is a simple posix disk I/O back-end, used for systems that don't\n+have a 64 bit virtual address space or don't support memory mapped files.\n+It's implemented using portable C file functions and is single-threaded.
\n+[report issue]\n+\n+default_disk_io_constructor()
\n+Declared in "libtorrent/session.hpp"
\n+\n+std::unique_ptr<disk_interface> default_disk_io_constructor (\n+ io_context& ios, settings_interface const&, counters& cnt);\n+
\n+the constructor function for the default storage. On systems that support\n+memory mapped files (and a 64 bit address space) the memory mapped storage\n+will be constructed, otherwise the portable posix storage.
\n+[report issue]\n+\n+mmap_disk_io_constructor()
\n+Declared in "libtorrent/mmap_disk_io.hpp"
\n+\n+std::unique_ptr<disk_interface> mmap_disk_io_constructor (\n+ io_context& ios, settings_interface const&, counters& cnt);\n+
\n+constructs a memory mapped file disk I/O object.
\n+[report issue]\n+\n+disabled_disk_io_constructor()
\n+Declared in "libtorrent/disabled_disk_io.hpp"
\n+\n+std::unique_ptr<disk_interface> disabled_disk_io_constructor (\n+ io_context& ios, settings_interface const&, counters& cnt);\n+
\n+creates a disk io object that discards all data written to it, and only\n+returns zero-buffers when read from. May be useful for testing and\n+benchmarking.
\n+[report issue]\n+\n+enum storage_mode_t
\n+Declared in "libtorrent/storage_defs.hpp"
\n \n \n- \n \n name \n value \n description \n incoming_message \n+storage_mode_allocate \n+0 \n+All pieces will be written to their final position, all files will be\n+allocated in full when the torrent is first started. This mode minimizes\n+fragmentation but could be a costly operation. \n+storage_mode_sparse \n+1 \n+All pieces will be written to the place where they belong and sparse files\n+will be used. This is the recommended, and default mode. \n+
\n+[report issue]\n+\n+enum status_t
\n+Declared in "libtorrent/storage_defs.hpp"
\n+\n+\n+ \n+\n+name \n+value \n+description \n+no_error \n 0 \n \n outgoing_message \n+fatal_disk_error \n 1 \n \n incoming \n+need_full_check \n 2 \n \n outgoing \n+file_exist \n 3 \n \n info \n-4 \n- \n+oversized_file \n+16 \n+this is not an enum value, but a flag that can be set in the return\n+from async_check_files, in case an existing file was found larger than\n+specified in the torrent. i.e. it has garbage at the end\n+the status_t field is used for this to preserve ABI. \n
\n-[report issue]\n-- event_type
\n-- string literal indicating the kind of event. For messages, this is the\n-message name.
\n-
\n-[report issue]\n-\n-\n-lsd_error_alert
\n-Declared in "libtorrent/alert_types.hpp"
\n-posted if the local service discovery socket fails to start properly.\n-it's categorized as alert_category::error.
\n-\n-struct lsd_error_alert final : alert\n-{\n- std::string message () const override;\n-\n- static constexpr alert_category_t static_category = alert_category::error;\n- aux::noexcept_movable<address> local_address;\n- error_code error;\n-};\n-\n-[report issue]\n-- local_address
\n-- the local network the corresponding local service discovery is running\n-on
\n-
\n-[report issue]\n-- error
\n-- The error code
\n-
\n-[report issue]\n-\n-dht_lookup
\n-Declared in "libtorrent/alert_types.hpp"
\n-holds statistics about a current dht_lookup operation.\n-a DHT lookup is the traversal of nodes, looking up a\n-set of target nodes in the DHT for retrieving and possibly\n-storing information in the DHT
\n-\n-struct dht_lookup\n-{\n- char const* type;\n- int outstanding_requests;\n- int timeouts;\n- int responses;\n- int branch_factor;\n- int nodes_left;\n- int last_sent;\n- int first_timeout;\n- sha1_hash target;\n-};\n-\n-[report issue]\n-- type
\n-- string literal indicating which kind of lookup this is
\n-
\n-[report issue]\n-- outstanding_requests
\n-- the number of outstanding request to individual nodes\n-this lookup has right now
\n-
\n-[report issue]\n-- timeouts
\n-- the total number of requests that have timed out so far\n-for this lookup
\n-
\n-[report issue]\n-- responses
\n-- the total number of responses we have received for this\n-lookup so far for this lookup
\n-
\n-[report issue]\n-- branch_factor
\n-- the branch factor for this lookup. This is the number of\n-nodes we keep outstanding requests to in parallel by default.\n-when nodes time out we may increase this.
\n-
\n-[report issue]\n-- nodes_left
\n-- the number of nodes left that could be queries for this\n-lookup. Many of these are likely to be part of the trail\n-while performing the lookup and would never end up actually\n-being queried.
\n-
\n-[report issue]\n-- last_sent
\n-- the number of seconds ago the\n-last message was sent that's still\n-outstanding
\n-
\n-[report issue]\n-- first_timeout
\n-- the number of outstanding requests\n-that have exceeded the short timeout\n-and are considered timed out in the\n-sense that they increased the branch\n-factor
\n-
\n-[report issue]\n-- target
\n-- the node-id or info-hash target for this lookup
\n-
\n-[report issue]\n-\n-dht_stats_alert
\n-Declared in "libtorrent/alert_types.hpp"
\n-contains current DHT state. Posted in response to session::post_dht_stats().
\n-\n-struct dht_stats_alert final : alert\n-{\n- std::string message () const override;\n-\n- static constexpr alert_category_t static_category = {};\n- std::vector<dht_lookup> active_requests;\n- std::vector<dht_routing_bucket> routing_table;\n- sha1_hash nid;\n- aux::noexcept_movable<udp::endpoint> local_endpoint;\n-};\n-\n-[report issue]\n-- active_requests
\n-- a vector of the currently running DHT lookups.
\n-
\n-[report issue]\n-- routing_table
\n-- contains information about every bucket in the DHT routing\n-table.
\n-
\n-[report issue]\n-- nid
\n-- the node ID of the DHT node instance
\n-
\n-[report issue]\n-- local_endpoint
\n-- the local socket this DHT node is running on
\n-
\n-[report issue]\n-\n-incoming_request_alert
\n-Declared in "libtorrent/alert_types.hpp"
\n-posted every time an incoming request from a peer is accepted and queued\n-up for being serviced. This alert is only posted if\n-the alert_category::incoming_request flag is enabled in the alert\n-mask.
\n-\n-struct incoming_request_alert final : peer_alert\n-{\n- std::string message () const override;\n-\n- static constexpr alert_category_t static_category = alert_category::incoming_request;\n- peer_request req;\n-};\n-\n-[report issue]\n-- req
\n-- the request this peer sent to us
\n-
\n-[report issue]\n-\n-dht_log_alert
\n-Declared in "libtorrent/alert_types.hpp"
\n-debug logging of the DHT when alert_category::dht_log is set in the alert\n-mask.
\n-\n-struct dht_log_alert final : alert\n-{\n- std::string message () const override;\n- char const* log_message () const;\n-\n- enum dht_module_t\n- {\n- tracker,\n- node,\n- routing_table,\n- rpc_manager,\n- traversal,\n- };\n-\n- static constexpr alert_category_t static_category = alert_category::dht_log;\n- dht_module_t module;\n-};\n-\n-[report issue]\n-\n+\n+enum move_flags_t
\n+Declared in "libtorrent/storage_defs.hpp"
\n \n \n- \n \n name \n value \n description \n tracker \n+always_replace_files \n 0 \n- \n+replace any files in the destination when copying\n+or moving the storage \n node \n+fail_if_exist \n 1 \n- \n+if any files that we want to copy exist in the destination\n+exist, fail the whole operation and don't perform\n+any copy or move. There is an inherent race condition\n+in this mode. The files are checked for existence before\n+the operation starts. In between the check and performing\n+the copy, the destination files may be created, in which\n+case they are replaced. \n routing_table \n+dont_replace \n 2 \n- \n+if any file exist in the target, take those files instead\n+of the ones we may have in the source. \n rpc_manager \n+reset_save_path \n 3 \n- \n+don't move any source files, just forget about them\n+and begin checking files at new save path \n traversal \n+reset_save_path_unchecked \n 4 \n- \n+don't move any source files, just change save path\n+and continue working without any checks \n
\n-[report issue]\n-- module
\n-- the module, or part, of the DHT that produced this log message.
\n-
\n-[report issue]\n-\n-\n-dht_pkt_alert
\n-Declared in "libtorrent/alert_types.hpp"
\n-This alert is posted every time a DHT message is sent or received. It is\n-only posted if the alert_category::dht_log alert category is\n-enabled. It contains a verbatim copy of the message.
\n+[report issue]\n+\n+web_seed_entry
\n+Declared in "libtorrent/torrent_info.hpp"
\n+the web_seed_entry holds information about a web seed (also known\n+as URL seed or HTTP seed). It is essentially a URL with some state\n+associated with it. For more information, see BEP 17 and BEP 19.
\n \n-struct dht_pkt_alert final : alert\n+struct web_seed_entry\n {\n- std::string message () const override;\n- span<char const> pkt_buf () const;\n+ bool operator== (web_seed_entry const& e) const;\n+ bool operator< (web_seed_entry const& e) const;\n \n- enum direction_t\n+ enum type_t\n {\n- incoming,\n- outgoing,\n+ url_seed,\n+ http_seed,\n };\n \n- static constexpr alert_category_t static_category = alert_category::dht_log;\n- direction_t direction;\n- aux::noexcept_movable<udp::endpoint> node;\n+ std::string url;\n+ std::string auth;\n+ headers_t extra_headers;\n+ std::uint8_t type;\n };\n \n-[report issue]\n-pkt_buf()
\n+[report issue]\n+operator==()
\n \n-span<char const> pkt_buf () const;\n+bool operator== (web_seed_entry const& e) const;\n
\n-returns a pointer to the packet buffer and size of the packet,\n-respectively. This buffer is only valid for as long as the alert itself\n-is valid, which is owned by libtorrent and reclaimed whenever\n-pop_alerts() is called on the session.
\n-[report issue]\n-\n-enum direction_t
\n-Declared in "libtorrent/alert_types.hpp"
\n+URL and type comparison
\n+[report issue]\n+\n+operator<()
\n+\n+bool operator< (web_seed_entry const& e) const;\n+
\n+URL and type less-than comparison
\n+[report issue]\n+\n+enum type_t
\n+Declared in "libtorrent/torrent_info.hpp"
\n \n \n- \n \n name \n value \n description \n incoming \n+url_seed \n 0 \n \n outgoing \n+http_seed \n 1 \n \n
\n-[report issue]\n-- direction
\n-- whether this is an incoming or outgoing packet.
\n+[report issue]\n+- url
\n+- The URL of the web seed
\n
\n-[report issue]\n-- node
\n-- the DHT node we received this packet from, or sent this packet to\n-(depending on direction).
\n+[report issue]\n+- auth
\n+- Optional authentication. If this is set, it's passed\n+in as HTTP basic auth to the web seed. The format is:\n+username:password.
\n
\n-[report issue]
\n+[report issue]\n+- extra_headers
\n+- Any extra HTTP headers that need to be passed to the web seed
\n+
\n+[report issue]\n+- type
\n+- The type of web seed (see type_t)
\n+
\n+[report issue]\n \n-\n-dht_get_peers_reply_alert
\n-Declared in "libtorrent/alert_types.hpp"
\n-Posted when we receive a response to a DHT get_peers request.
\n+\n+load_torrent_limits
\n+Declared in "libtorrent/torrent_info.hpp"
\n+this object holds configuration options for limits to use when loading\n+torrents. They are meant to prevent loading potentially malicious torrents\n+that cause excessive memory allocations.
\n \n-struct dht_get_peers_reply_alert final : alert\n+struct load_torrent_limits\n {\n- std::string message () const override;\n- int num_peers () const;\n- std::vector<tcp::endpoint> peers () const;\n-\n- static constexpr alert_category_t static_category = alert_category::dht_operation;\n- sha1_hash info_hash;\n+ int max_buffer_size = 10000000;\n+ int max_pieces = 0x200000;\n+ int max_decode_depth = 100;\n+ int max_decode_tokens = 3000000;\n };\n \n-[report issue]\n-\n-dht_direct_response_alert
\n-Declared in "libtorrent/alert_types.hpp"
\n-This is posted exactly once for every call to session_handle::dht_direct_request.\n-If the request failed, response() will return a default constructed bdecode_node.
\n+[report issue]\n+- max_buffer_size
\n+- the max size of a .torrent file to load into RAM
\n+
\n+[report issue]\n+- max_pieces
\n+- the max number of pieces allowed in the torrent
\n+
\n+[report issue]\n+- max_decode_depth
\n+- the max recursion depth in the bdecoded structure
\n+
\n+[report issue]\n+- max_decode_tokens
\n+- the max number of bdecode tokens
\n+
\n+[report issue]\n+\n+torrent_info
\n+Declared in "libtorrent/torrent_info.hpp"
\n+the torrent_info class holds the information found in a .torrent file.
\n \n-struct dht_direct_response_alert final : alert\n+class torrent_info\n {\n- std::string message () const override;\n- bdecode_node response () const;\n-\n- static constexpr alert_category_t static_category = alert_category::dht;\n- client_data_t userdata;\n- aux::noexcept_movable<udp::endpoint> endpoint;\n+ explicit torrent_info (std::string const& filename);\n+ torrent_info (std::string const& filename, load_torrent_limits const& cfg);\n+ torrent_info (torrent_info const& t);\n+ torrent_info (char const* buffer, int size, error_code& ec);\n+ explicit torrent_info (span<char const> buffer, from_span_t);\n+ torrent_info (bdecode_node const& torrent_file, error_code& ec);\n+ torrent_info (span<char const> buffer, error_code& ec, from_span_t);\n+ explicit torrent_info (info_hash_t const& info_hash);\n+ torrent_info (bdecode_node const& torrent_file, load_torrent_limits const& cfg);\n+ torrent_info (std::string const& filename, error_code& ec);\n+ torrent_info (char const* buffer, int size);\n+ torrent_info (span<char const> buffer, load_torrent_limits const& cfg, from_span_t);\n+ explicit torrent_info (bdecode_node const& torrent_file);\n+ ~torrent_info ();\n+ file_storage const& files () const;\n+ file_storage const& orig_files () const;\n+ void rename_file (file_index_t index, std::string const& new_filename);\n+ void remap_files (file_storage const& f);\n+ void clear_trackers ();\n+ void add_tracker (std::string const& url, int tier = 0);\n+ std::vector<announce_entry> const& trackers () const;\n+ void add_tracker (std::string const& url, int tier\n+ , announce_entry::tracker_source source);\n+ std::vector<sha1_hash> similar_torrents () const;\n+ std::vector<std::string> collections () const;\n+ std::vector<web_seed_entry> const& web_seeds () const;\n+ void add_url_seed (std::string const& url\n+ , std::string const& ext_auth = std::string()\n+ , web_seed_entry::headers_t const& ext_headers = web_seed_entry::headers_t());\n+ void add_http_seed (std::string const& url\n+ , std::string const& extern_auth = std::string()\n+ , web_seed_entry::headers_t const& extra_headers = web_seed_entry::headers_t());\n+ void set_web_seeds (std::vector<web_seed_entry> seeds);\n+ std::int64_t total_size () const;\n+ int num_pieces () const;\n+ int piece_length () const;\n+ int blocks_per_piece () const;\n+ index_range<piece_index_t> piece_range () const;\n+ piece_index_t end_piece () const;\n+ piece_index_t last_piece () const;\n+ info_hash_t const& info_hashes () const;\n+ sha1_hash info_hash () const noexcept;\n+ bool v2 () const;\n+ bool v1 () const;\n+ int num_files () const;\n+ std::vector<file_slice> map_block (piece_index_t const piece\n+ , std::int64_t offset, int size) const;\n+ peer_request map_file (file_index_t const file, std::int64_t offset, int size) const;\n+ string_view ssl_cert () const;\n+ bool is_valid () const;\n+ bool priv () const;\n+ bool is_i2p () const;\n+ int piece_size (piece_index_t index) const;\n+ char const* hash_for_piece_ptr (piece_index_t const index) const;\n+ sha1_hash hash_for_piece (piece_index_t index) const;\n+ bool is_loaded () const;\n+ const std::string& name () const;\n+ std::time_t creation_date () const;\n+ const std::string& creator () const;\n+ const std::string& comment () const;\n+ std::vector<std::pair<std::string, int>> const& nodes () const;\n+ void add_node (std::pair<std::string, int> const& node);\n+ bool parse_info_section (bdecode_node const& info, error_code& ec, int max_pieces);\n+ bdecode_node info (char const* key) const;\n+ span<char const> info_section () const;\n+ span<char const> piece_layer (file_index_t) const;\n+ void free_piece_layers ();\n };\n \n-[report issue]\n-\n-picker_log_alert
\n-Declared in "libtorrent/alert_types.hpp"
\n-this is posted when one or more blocks are picked by the piece picker,\n-assuming the verbose piece picker logging is enabled (see\n-alert_category::picker_log).
\n+[report issue]\n+torrent_info()
\n \n-struct picker_log_alert final : peer_alert\n-{\n- std::string message () const override;\n- std::vector<piece_block> blocks () const;\n-\n- static constexpr alert_category_t static_category = alert_category::picker_log;\n- static constexpr picker_flags_t partial_ratio = 0_bit;\n- static constexpr picker_flags_t prioritize_partials = 1_bit;\n- static constexpr picker_flags_t rarest_first_partials = 2_bit;\n- static constexpr picker_flags_t rarest_first = 3_bit;\n- static constexpr picker_flags_t reverse_rarest_first = 4_bit;\n- static constexpr picker_flags_t suggested_pieces = 5_bit;\n- static constexpr picker_flags_t prio_sequential_pieces = 6_bit;\n- static constexpr picker_flags_t sequential_pieces = 7_bit;\n- static constexpr picker_flags_t reverse_pieces = 8_bit;\n- static constexpr picker_flags_t time_critical = 9_bit;\n- static constexpr picker_flags_t random_pieces = 10_bit;\n- static constexpr picker_flags_t prefer_contiguous = 11_bit;\n- static constexpr picker_flags_t reverse_sequential = 12_bit;\n- static constexpr picker_flags_t backup1 = 13_bit;\n- static constexpr picker_flags_t backup2 = 14_bit;\n- static constexpr picker_flags_t end_game = 15_bit;\n- static constexpr picker_flags_t extent_affinity = 16_bit;\n- picker_flags_t const picker_flags;\n-};\n+explicit torrent_info (std::string const& filename);\n+torrent_info (std::string const& filename, load_torrent_limits const& cfg);\n+torrent_info (torrent_info const& t);\n+torrent_info (char const* buffer, int size, error_code& ec);\n+explicit torrent_info (span<char const> buffer, from_span_t);\n+torrent_info (bdecode_node const& torrent_file, error_code& ec);\n+torrent_info (span<char const> buffer, error_code& ec, from_span_t);\n+explicit torrent_info (info_hash_t const& info_hash);\n+torrent_info (bdecode_node const& torrent_file, load_torrent_limits const& cfg);\n+torrent_info (std::string const& filename, error_code& ec);\n+torrent_info (char const* buffer, int size);\n+torrent_info (span<char const> buffer, load_torrent_limits const& cfg, from_span_t);\n+explicit torrent_info (bdecode_node const& torrent_file);\n \n-[report issue]\n-- picker_flags
\n-- this is a bitmask of which features were enabled for this particular\n-pick. The bits are defined in the picker_flags_t enum.
\n-
\n-[report issue]\n-\n-session_error_alert
\n-Declared in "libtorrent/alert_types.hpp"
\n-this alert is posted when the session encounters a serious error,\n-potentially fatal
\n+The constructor that takes an info-hash will initialize the info-hash\n+to the given value, but leave all other fields empty. This is used\n+internally when downloading torrents without the metadata. The\n+metadata will be created by libtorrent as soon as it has been\n+downloaded from the swarm.
\n+The constructor that takes a bdecode_node will create a torrent_info\n+object from the information found in the given torrent_file. The\n+bdecode_node represents a tree node in an bencoded file. To load an\n+ordinary .torrent file into a bdecode_node, use bdecode().
\n+The version that takes a buffer pointer and a size will decode it as a\n+.torrent file and initialize the torrent_info object for you.
\n+The version that takes a filename will simply load the torrent file\n+and decode it inside the constructor, for convenience. This might not\n+be the most suitable for applications that want to be able to report\n+detailed errors on what might go wrong.
\n+There is an upper limit on the size of the torrent file that will be\n+loaded by the overload taking a filename. If it's important that even\n+very large torrent files are loaded, use one of the other overloads.
\n+The overloads that takes an error_code const& never throws if an\n+error occur, they will simply set the error code to describe what went\n+wrong and not fully initialize the torrent_info object. The overloads\n+that do not take the extra error_code parameter will always throw if\n+an error occurs. These overloads are not available when building\n+without exception support.
\n+The overload that takes a span also needs an extra parameter of\n+type from_span_t to disambiguate the std::string overload for\n+string literals. There is an object in the libtorrent namespace of this\n+type called from_span.
\n+[report issue]\n+\n+~torrent_info()
\n \n-struct session_error_alert final : alert\n-{\n- std::string message () const override;\n-\n- static constexpr alert_category_t static_category = alert_category::error;\n- error_code const error;\n-};\n+~torrent_info ();\n \n-[report issue]\n-- error
\n-- The error code, if one is associated with this error
\n-
\n-[report issue]\n-\n-dht_live_nodes_alert
\n-Declared in "libtorrent/alert_types.hpp"
\n-posted in response to a call to session::dht_live_nodes(). It contains the\n-live nodes from the DHT routing table of one of the DHT nodes running\n-locally.
\n+frees all storage associated with this torrent_info object
\n+\n+[report issue]\n+\n+orig_files() files()
\n \n-struct dht_live_nodes_alert final : alert\n-{\n- std::string message () const override;\n- int num_nodes () const;\n- std::vector<std::pair<sha1_hash, udp::endpoint>> nodes () const;\n-\n- static constexpr alert_category_t static_category = alert_category::dht;\n- sha1_hash node_id;\n-};\n+file_storage const& files () const;\n+file_storage const& orig_files () const;\n \n-\n-[report issue]\n-num_nodes() nodes()
\n+The file_storage object contains the information on how to map the\n+pieces to files. It is separated from the torrent_info object because\n+when creating torrents a storage object needs to be created without\n+having a torrent file. When renaming files in a storage, the storage\n+needs to make its own copy of the file_storage in order to make its\n+mapping differ from the one in the torrent file.
\n+orig_files() returns the original (unmodified) file storage for\n+this torrent. This is used by the web server connection, which needs\n+to request files with the original names. Filename may be changed using\n+torrent_info::rename_file().
\n+For more information on the file_storage object, see the separate\n+document on how to create torrents.
\n+[report issue]\n+\n+rename_file()
\n \n-int num_nodes () const;\n-std::vector<std::pair<sha1_hash, udp::endpoint>> nodes () const;\n+void rename_file (file_index_t index, std::string const& new_filename);\n
\n-the number of nodes in the routing table and the actual nodes.
\n-[report issue]\n-- node_id
\n-- the local DHT node's node-ID this routing table belongs to
\n-
\n-[report issue]\n+Renames the file with the specified index to the new name. The new\n+filename is reflected by the file_storage returned by files()\n+but not by the one returned by orig_files().
\n+If you want to rename the base name of the torrent (for a multi file\n+torrent), you can copy the file_storage (see files() and\n+orig_files() ), change the name, and then use remap_files().
\n+The new_filename can both be a relative path, in which case the\n+file name is relative to the save_path of the torrent. If the\n+new_filename is an absolute path (i.e. is_complete(new_filename)\n+== true), then the file is detached from the save_path of the\n+torrent. In this case the file is not moved when move_storage() is\n+invoked.
\n+[report issue]\n+\n+remap_files()
\n+\n+void remap_files (file_storage const& f);\n+
\n+\n+Warning
\n+Using remap_files() is discouraged as it's incompatible with v2\n+torrents. This is because the piece boundaries and piece hashes in\n+v2 torrents are intimately tied to the file boundaries. Instead,\n+just rename individual files, or implement a custom disk_interface\n+to customize how to store files.
\n \n-\n-session_stats_header_alert
\n-Declared in "libtorrent/alert_types.hpp"
\n-The session_stats_header alert is posted the first time\n-post_session_stats() is called
\n-the message() member function returns a string representation of the\n-header that properly match the stats values string returned in\n-session_stats_alert::message().
\n-this specific output is parsed by tools/parse_session_stats.py\n-if this is changed, that parser should also be changed
\n+Remaps the file storage to a new file layout. This can be used to, for\n+instance, download all data in a torrent to a single file, or to a\n+number of fixed size sector aligned files, regardless of the number\n+and sizes of the files in the torrent.
\n+The new specified file_storage must have the exact same size as\n+the current one.
\n+\n+\n+[report issue]\n+\n+add_tracker() clear_trackers() trackers()
\n \n-struct session_stats_header_alert final : alert\n-{\n- std::string message () const override;\n-\n- static constexpr alert_category_t static_category = {};\n-};\n+void clear_trackers ();\n+void add_tracker (std::string const& url, int tier = 0);\n+std::vector<announce_entry> const& trackers () const;\n+void add_tracker (std::string const& url, int tier\n+ , announce_entry::tracker_source source);\n \n-[report issue]\n-\n-dht_sample_infohashes_alert
\n-Declared in "libtorrent/alert_types.hpp"
\n-posted as a response to a call to session::dht_sample_infohashes() with\n-the information from the DHT response message.
\n+add_tracker() adds a tracker to the announce-list. The tier\n+determines the order in which the trackers are to be tried.\n+The trackers() function will return a sorted vector of\n+announce_entry. Each announce entry contains a string, which is\n+the tracker url, and a tier index. The tier index is the high-level\n+priority. No matter which trackers that works or not, the ones with\n+lower tier will always be tried before the one with higher tier\n+number. For more information, see announce_entry.
\n+trackers() returns all entries from announce-list.
\n+clear_trackers() removes all trackers from announce-list.
\n+\n+[report issue]\n+\n+similar_torrents() collections()
\n \n-struct dht_sample_infohashes_alert final : alert\n-{\n- std::string message () const override;\n- std::vector<sha1_hash> samples () const;\n- int num_samples () const;\n- int num_nodes () const;\n- std::vector<std::pair<sha1_hash, udp::endpoint>> nodes () const;\n-\n- static constexpr alert_category_t static_category = alert_category::dht_operation;\n- sha1_hash node_id;\n- aux::noexcept_movable<udp::endpoint> endpoint;\n- time_duration const interval;\n- int const num_infohashes;\n-};\n+std::vector<sha1_hash> similar_torrents () const;\n+std::vector<std::string> collections () const;\n \n-\n-[report issue]\n-num_samples() samples()
\n+These two functions are related to BEP 38 (mutable torrents). The\n+vectors returned from these correspond to the "similar" and\n+"collections" keys in the .torrent file. Both info-hashes and\n+collections from within the info-dict and from outside of it are\n+included.
\n+\n+\n+\n+[report issue]\n+\n+add_url_seed() set_web_seeds() web_seeds() add_http_seed()
\n \n-std::vector<sha1_hash> samples () const;\n-int num_samples () const;\n+std::vector<web_seed_entry> const& web_seeds () const;\n+void add_url_seed (std::string const& url\n+ , std::string const& ext_auth = std::string()\n+ , web_seed_entry::headers_t const& ext_headers = web_seed_entry::headers_t());\n+void add_http_seed (std::string const& url\n+ , std::string const& extern_auth = std::string()\n+ , web_seed_entry::headers_t const& extra_headers = web_seed_entry::headers_t());\n+void set_web_seeds (std::vector<web_seed_entry> seeds);\n
\n-returns the number of info-hashes returned by the node, as well as the\n-actual info-hashes. num_samples() is more efficient than\n-samples().size().
\n-[report issue]\n-\n-num_nodes()
\n+web_seeds() returns all url seeds and http seeds in the torrent.\n+Each entry is a web_seed_entry and may refer to either a url seed\n+or http seed.
\n+add_url_seed() and add_http_seed() adds one url to the list of\n+url/http seeds.
\n+set_web_seeds() replaces all web seeds with the ones specified in\n+the seeds vector.
\n+The extern_auth argument can be used for other authorization\n+schemes than basic HTTP authorization. If set, it will override any\n+username and password found in the URL itself. The string will be sent\n+as the HTTP authorization header's value (without specifying "Basic").
\n+The extra_headers argument defaults to an empty list, but can be\n+used to insert custom HTTP headers in the requests to a specific web\n+seed.
\n+See http seeding for more information.
\n+[report issue]\n+\n+total_size()
\n \n-int num_nodes () const;\n+std::int64_t total_size () const;\n
\n-The total number of nodes returned by nodes().
\n-[report issue]\n-\n-nodes()
\n+total_size() returns the total number of bytes the torrent-file\n+represents. Note that this is the number of pieces times the piece\n+size (modulo the last piece possibly being smaller). With pad files,\n+the total size will be larger than the sum of all (regular) file\n+sizes.
\n+\n+[report issue]\n+\n+piece_length() num_pieces()
\n \n-std::vector<std::pair<sha1_hash, udp::endpoint>> nodes () const;\n+int num_pieces () const;\n+int piece_length () const;\n
\n-This is the set of more DHT nodes returned by the request.
\n-The information is included so that indexing nodes can perform a key\n-space traversal with a single RPC per node by adjusting the target\n-value for each RPC.
\n-[report issue]\n-- node_id
\n-- id of the node the request was sent to (and this response was received from)
\n-
\n-[report issue]\n-- endpoint
\n-- the node the request was sent to (and this response was received from)
\n-
\n-[report issue]\n-- interval
\n-- the interval to wait before making another request to this node
\n-
\n-[report issue]\n-- num_infohashes
\n-- This field indicates how many info-hash keys are currently in the node's storage.\n-If the value is larger than the number of returned samples it indicates that the\n-indexer may obtain additional samples after waiting out the interval.
\n-
\n-[report issue]\n-\n-\n-block_uploaded_alert
\n-Declared in "libtorrent/alert_types.hpp"
\n-This alert is posted when a block intended to be sent to a peer is placed in the\n-send buffer. Note that if the connection is closed before the send buffer is sent,\n-the alert may be posted without the bytes having been sent to the peer.\n-It belongs to the alert_category::upload category.
\n+piece_length() and num_pieces() returns the number of byte\n+for each piece and the total number of pieces, respectively. The\n+difference between piece_size() and piece_length() is that\n+piece_size() takes the piece index as argument and gives you the\n+exact size of that piece. It will always be the same as\n+piece_length() except in the case of the last piece, which may be\n+smaller.
\n+[report issue]\n+\n+blocks_per_piece()
\n \n-struct block_uploaded_alert final : peer_alert\n-{\n- std::string message () const override;\n-\n- int const block_index;\n- piece_index_t const piece_index;\n-};\n+int blocks_per_piece () const;\n \n-[report issue]\n-\n-alerts_dropped_alert
\n-Declared in "libtorrent/alert_types.hpp"
\n-this alert is posted to indicate to the client that some alerts were\n-dropped. Dropped meaning that the alert failed to be delivered to the\n-client. The most common cause of such failure is that the internal alert\n-queue grew too big (controlled by alert_queue_size).
\n+returns the number of blocks there are in the typical piece. There\n+may be fewer in the last piece)
\n+\n+\n+[report issue]\n+\n+end_piece() piece_range() last_piece()
\n \n-struct alerts_dropped_alert final : alert\n-{\n- std::string message () const override;\n- static_assert (num_alert_types <= abi_alert_count, "need to increase bitset. This is an ABI break");\n-\n- static constexpr alert_category_t static_category = alert_category::error;\n- std::bitset<abi_alert_count> dropped_alerts;\n-};\n+index_range<piece_index_t> piece_range () const;\n+piece_index_t end_piece () const;\n+piece_index_t last_piece () const;\n \n-[report issue]\n-- dropped_alerts
\n-- a bitmask indicating which alerts were dropped. Each bit represents the\n-alert type ID, where bit 0 represents whether any alert of type 0 has\n-been dropped, and so on.
\n-
\n-[report issue]\n-\n-socks5_alert
\n-Declared in "libtorrent/alert_types.hpp"
\n-this alert is posted with SOCKS5 related errors, when a SOCKS5 proxy is\n-configured. It's enabled with the alert_category::error alert category.
\n+last_piece() returns the index to the last piece in the torrent and\n+end_piece() returns the index to the one-past-end piece in the\n+torrent\n+piece_range() returns an implementation-defined type that can be\n+used as the container in a range-for loop. Where the values are the\n+indices of all pieces in the file_storage.
\n+\n+[report issue]\n+\n+info_hashes() info_hash()
\n \n-struct socks5_alert final : alert\n-{\n- std::string message () const override;\n-\n- static constexpr alert_category_t static_category = alert_category::error;\n- error_code error;\n- operation_t op;\n- aux::noexcept_movable<tcp::endpoint> ip;\n-};\n+info_hash_t const& info_hashes () const;\n+sha1_hash info_hash () const noexcept;\n \n-[report issue]\n-- error
\n-- the error
\n-
\n-[report issue]\n-- op
\n-- the operation that failed
\n-
\n-[report issue]\n-- ip
\n-- the endpoint configured as the proxy
\n-
\n-[report issue]\n-\n-file_prio_alert
\n-Declared in "libtorrent/alert_types.hpp"
\n-posted when a prioritize_files() or file_priority() update of the file\n-priorities complete, which requires a round-trip to the disk thread.
\n-If the disk operation fails this alert won't be posted, but a\n-file_error_alert is posted instead, and the torrent is stopped.
\n+returns the info-hash of the torrent. For BitTorrent v2 support, use\n+info_hashes() to get an object that may hold both a v1 and v2\n+info-hash
\n+\n+[report issue]\n+\n+v2() v1()
\n \n-struct file_prio_alert final : torrent_alert\n-{\n- std::string message () const override;\n-\n- static constexpr alert_category_t static_category = alert_category::storage;\n- error_code error;\n- operation_t op;\n-};\n+bool v2 () const;\n+bool v1 () const;\n \n-[report issue]\n-- error
\n-- the error
\n-
\n-[report issue]\n-- op
\n-- the operation that failed
\n-
\n-[report issue]\n-\n-oversized_file_alert
\n-Declared in "libtorrent/alert_types.hpp"
\n-this alert may be posted when the initial checking of resume data and files\n-on disk (just existence, not piece hashes) completes. If a file belonging\n-to the torrent is found on disk, but is larger than the file in the\n-torrent, that's when this alert is posted.\n-the client may want to call truncate_files() in that case, or perhaps\n-interpret it as a sign that some other file is in the way, that shouldn't\n-be overwritten.
\n+returns whether this torrent has v1 and/or v2 metadata, respectively.\n+Hybrid torrents have both. These are shortcuts for\n+info_hashes().has_v1() and info_hashes().has_v2() calls.
\n+[report issue]\n+\n+num_files()
\n \n-struct oversized_file_alert final : torrent_alert\n-{\n- std::string message () const override;\n-\n- static constexpr alert_category_t static_category = alert_category::storage;\n-};\n+int num_files () const;\n \n-[report issue]\n-\n-torrent_conflict_alert
\n-Declared in "libtorrent/alert_types.hpp"
\n-this alert is posted when two separate torrents (magnet links) resolve to\n-the same torrent, thus causing the same torrent being added twice. In\n-that case, both torrents enter an error state with duplicate_torrent\n-as the error code. This alert is posted containing the metadata. For more\n-information, see BitTorrent v2 torrents.\n-The torrent this alert originated from was the one that downloaded the
\n-metadata (i.e. the handle member from the torrent_alert base class).
\n+If you need index-access to files you can use the num_files() along\n+with the file_path(), file_size()-family of functions to access\n+files using indices.
\n+[report issue]\n+\n+map_block()
\n \n-struct torrent_conflict_alert final : torrent_alert\n-{\n- std::string message () const override;\n-\n- static constexpr alert_category_t static_category = alert_category::error;\n- torrent_handle conflicting_torrent;\n- std::shared_ptr<torrent_info> metadata;\n-};\n+std::vector<file_slice> map_block (piece_index_t const piece\n+ , std::int64_t offset, int size) const;\n \n-[report issue]\n-- conflicting_torrent
\n-- the handle to the torrent in conflict. The swarm associated with this\n-torrent handle did not download the metadata, but the downloaded\n-metadata collided with this swarm's info-hash.
\n-
\n-[report issue]\n-- metadata
\n-- the metadata that was received by one of the torrents in conflict.\n-One way to resolve the conflict is to remove both failing torrents\n-and re-add it using this metadata
\n-
\n-[report issue]\n-\n-peer_info_alert
\n-Declared in "libtorrent/alert_types.hpp"
\n-posted when torrent_handle::post_peer_info() is called
\n+This function will map a piece index, a byte offset within that piece\n+and a size (in bytes) into the corresponding files with offsets where\n+that data for that piece is supposed to be stored. See file_slice.
\n+[report issue]\n+\n+map_file()
\n \n-struct peer_info_alert final : torrent_alert\n-{\n- std::string message () const override;\n-\n- static constexpr alert_category_t static_category = alert_category::status;\n- std::vector<lt::peer_info> peer_info;\n-};\n+peer_request map_file (file_index_t const file, std::int64_t offset, int size) const;\n \n-[report issue]\n-- peer_info
\n-- the list of the currently connected peers
\n-
\n-[report issue]\n-\n-file_progress_alert
\n-Declared in "libtorrent/alert_types.hpp"
\n-posted when torrent_handle::post_file_progress() is called
\n+This function will map a range in a specific file into a range in the\n+torrent. The file_offset parameter is the offset in the file,\n+given in bytes, where 0 is the start of the file. See peer_request.
\n+The input range is assumed to be valid within the torrent.\n+file_offset + size is not allowed to be greater than the file\n+size. file_index must refer to a valid file, i.e. it cannot be >=\n+num_files().
\n+[report issue]\n+\n+ssl_cert()
\n \n-struct file_progress_alert final : torrent_alert\n-{\n- std::string message () const override;\n-\n- static constexpr alert_category_t static_category = alert_category::file_progress;\n- aux::vector<std::int64_t, file_index_t> files;\n-};\n+string_view ssl_cert () const;\n \n-[report issue]\n-- files
\n-- the list of the files in the torrent
\n-
\n-[report issue]\n-\n-piece_info_alert
\n-Declared in "libtorrent/alert_types.hpp"
\n-posted when torrent_handle::post_download_queue() is called
\n+Returns the SSL root certificate for the torrent, if it is an SSL\n+torrent. Otherwise returns an empty string. The certificate is\n+the public certificate in x509 format.
\n+[report issue]\n+\n+is_valid()
\n \n-struct piece_info_alert final : torrent_alert\n-{\n- std::string message () const override;\n-\n- static constexpr alert_category_t static_category = alert_category::piece_progress;\n- std::vector<partial_piece_info> piece_info;\n- std::vector<block_info> block_data;\n-};\n+bool is_valid () const;\n \n-[report issue]\n-- piece_info
\n-- info about pieces being downloaded for the torrent
\n-
\n-[report issue]\n-- block_data
\n-- storage for block_info pointers in partial_piece_info objects
\n-
\n-[report issue]\n-\n-piece_availability_alert
\n-Declared in "libtorrent/alert_types.hpp"
\n-posted when torrent_handle::post_piece_availability() is called
\n+returns true if this torrent_info object has a torrent loaded.\n+This is primarily used to determine if a magnet link has had its\n+metadata resolved yet or not.
\n+[report issue]\n+\n+priv()
\n \n-struct piece_availability_alert final : torrent_alert\n-{\n- std::string message () const override;\n-\n- static constexpr alert_category_t static_category = alert_category::status;\n- std::vector<int> piece_availability;\n-};\n+bool priv () const;\n \n-[report issue]\n-- piece_availability
\n-- info about pieces being downloaded for the torrent
\n-
\n-[report issue]\n-\n-tracker_list_alert
\n-Declared in "libtorrent/alert_types.hpp"
\n-posted when torrent_handle::post_trackers() is called
\n+returns true if this torrent is private. i.e., the client should not\n+advertise itself on the trackerless network (the Kademlia DHT) for this torrent.
\n+[report issue]\n+\n+is_i2p()
\n \n-struct tracker_list_alert final : torrent_alert\n-{\n- std::string message () const override;\n-\n- static constexpr alert_category_t static_category = alert_category::status;\n- std::vector<announce_entry> trackers;\n-};\n+bool is_i2p () const;\n \n-[report issue]\n-- trackers
\n-- list of trackers and their status for the torrent
\n-
\n-[report issue]\n-\n-alert
\n-Declared in "libtorrent/alert.hpp"
\n-The alert class is the base class that specific messages are derived from.\n-alert types are not copyable, and cannot be constructed by the client. The\n-pointers returned by libtorrent are short lived (the details are described\n-under session_handle::pop_alerts())
\n+returns true if this is an i2p torrent. This is determined by whether\n+or not it has a tracker whose URL domain name ends with ".i2p". i2p\n+torrents disable the DHT and local peer discovery as well as talking\n+to peers over anything other than the i2p network.
\n+[report issue]\n+\n+piece_size()
\n \n-struct alert\n-{\n- time_point timestamp () const;\n- virtual int type () const noexcept = 0;\n- virtual char const* what () const noexcept = 0;\n- virtual std::string message () const = 0;\n- virtual alert_category_t category () const noexcept = 0;\n-\n- static constexpr alert_category_t error_notification = 0_bit;\n- static constexpr alert_category_t peer_notification = 1_bit;\n- static constexpr alert_category_t port_mapping_notification = 2_bit;\n- static constexpr alert_category_t storage_notification = 3_bit;\n- static constexpr alert_category_t tracker_notification = 4_bit;\n- static constexpr alert_category_t connect_notification = 5_bit;\n- static constexpr alert_category_t status_notification = 6_bit;\n- static constexpr alert_category_t ip_block_notification = 8_bit;\n- static constexpr alert_category_t performance_warning = 9_bit;\n- static constexpr alert_category_t dht_notification = 10_bit;\n- static constexpr alert_category_t session_log_notification = 13_bit;\n- static constexpr alert_category_t torrent_log_notification = 14_bit;\n- static constexpr alert_category_t peer_log_notification = 15_bit;\n- static constexpr alert_category_t incoming_request_notification = 16_bit;\n- static constexpr alert_category_t dht_log_notification = 17_bit;\n- static constexpr alert_category_t dht_operation_notification = 18_bit;\n- static constexpr alert_category_t port_mapping_log_notification = 19_bit;\n- static constexpr alert_category_t picker_log_notification = 20_bit;\n- static constexpr alert_category_t file_progress_notification = 21_bit;\n- static constexpr alert_category_t piece_progress_notification = 22_bit;\n- static constexpr alert_category_t upload_notification = 23_bit;\n- static constexpr alert_category_t block_progress_notification = 24_bit;\n- static constexpr alert_category_t all_categories = alert_category_t::all();\n-};\n+int piece_size (piece_index_t index) const;\n \n-[report issue]\n-timestamp()
\n+returns the piece size of file with index. This will be the same as piece_length(),\n+except for the last piece, which may be shorter.
\n+\n+[report issue]\n+\n+hash_for_piece() hash_for_piece_ptr()
\n \n-time_point timestamp () const;\n+char const* hash_for_piece_ptr (piece_index_t const index) const;\n+sha1_hash hash_for_piece (piece_index_t index) const;\n
\n-a timestamp is automatically created in the constructor
\n-[report issue]\n-\n-type()
\n+hash_for_piece() takes a piece-index and returns the 20-bytes\n+sha1-hash for that piece and info_hash() returns the 20-bytes\n+sha1-hash for the info-section of the torrent file.\n+hash_for_piece_ptr() returns a pointer to the 20 byte sha1 digest\n+for the piece. Note that the string is not 0-terminated.
\n+[report issue]\n+\n+name()
\n \n-virtual int type () const noexcept = 0;\n+const std::string& name () const;\n
\n-returns an integer that is unique to this alert type. It can be\n-compared against a specific alert by querying a static constant called alert_type\n-in the alert. It can be used to determine the run-time type of an alert* in\n-order to cast to that alert type and access specific members.
\n-e.g:
\n-\n-std::vector<alert*> alerts;\n-ses.pop_alerts(&alerts);\n-for (alert* a : alerts) {\n- switch (a->type()) {\n-\n- case read_piece_alert::alert_type:\n- {\n- auto* p = static_cast<read_piece_alert*>(a);\n- if (p->ec) {\n- // read_piece failed\n- break;\n- }\n- // use p\n- break;\n- }\n- case file_renamed_alert::alert_type:\n- {\n- // etc...\n- }\n- }\n-}\n+name() returns the name of the torrent.\n+name contains UTF-8 encoded string.
\n+[report issue]
\n+\n-\n-what()
\n+creation_date() returns the creation date of the torrent as time_t\n+(posix time). If there's no time stamp in the torrent file, 0 is\n+returned.\n+.. posix time: http://www.opengroup.org/onlinepubs/009695399/functions/time.html
\n+[report issue]\n+\n+creator()
\n \n-virtual char const* what () const noexcept = 0;\n+const std::string& creator () const;\n
\n-returns a string literal describing the type of the alert. It does\n-not include any information that might be bundled with the alert.
\n-[report issue]\n-\n-message()
\n+creator() returns the creator string in the torrent. If there is\n+no creator string it will return an empty string.
\n+[report issue]\n+\n+comment()
\n \n-virtual std::string message () const = 0;\n+const std::string& comment () const;\n
\n-generate a string describing the alert and the information bundled\n-with it. This is mainly intended for debug and development use. It is not suitable\n-to use this for applications that may be localized. Instead, handle each alert\n-type individually and extract and render the information from the alert depending\n-on the locale.
\n-[report issue]\n-\n-category()
\n+comment() returns the comment associated with the torrent. If\n+there's no comment, it will return an empty string.\n+comment contains UTF-8 encoded string.
\n+[report issue]\n+\n+nodes()
\n \n-virtual alert_category_t category () const noexcept = 0;\n+std::vector<std::pair<std::string, int>> const& nodes () const;\n
\n-returns a bitmask specifying which categories this alert belong to.
\n-[report issue]\n-\n-\n-operation_name()
\n-Declared in "libtorrent/operations.hpp"
\n+If this torrent contains any DHT nodes, they are put in this vector in\n+their original form (host name and port number).
\n+[report issue]\n+\n+add_node()
\n \n-char const* operation_name (operation_t op);\n+void add_node (std::pair<std::string, int> const& node);\n
\n-maps an operation id (from peer_error_alert and peer_disconnected_alert)\n-to its name. See operation_t for the constants
\n-[report issue]\n-\n-alert_cast()
\n-Declared in "libtorrent/alert.hpp"
\n+This is used when creating torrent. Use this to add a known DHT node.\n+It may be used, by the client, to bootstrap into the DHT network.
\n+[report issue]\n+\n+parse_info_section()
\n \n-template <typename T> T const* alert_cast (alert const* a);\n-template <typename T> T* alert_cast (alert* a);\n+bool parse_info_section (bdecode_node const& info, error_code& ec, int max_pieces);\n
\n-When you get an alert, you can use alert_cast<> to attempt to cast the\n-pointer to a specific alert type, in order to query it for more\n-information.
\n-\n-Note
\n-alert_cast<> can only cast to an exact alert type, not a base class
\n+populates the torrent_info by providing just the info-dict buffer.\n+This is used when loading a torrent from a magnet link for instance,\n+where we only have the info-dict. The bdecode_node e points to a\n+parsed info-dictionary. ec returns an error code if something\n+fails (typically if the info dictionary is malformed).\n+The max_pieces parameter allows limiting the amount of memory\n+dedicated to loading the torrent, and fails for torrents that exceed\n+the limit. To load large torrents, this limit may also need to be\n+raised in settings_pack::max_piece_count and in calls to\n+read_resume_data().
\n+[report issue]\n+\n+info()
\n+\n+bdecode_node info (char const* key) const;\n+
\n+This function looks up keys from the info-dictionary of the loaded\n+torrent file. It can be used to access extension values put in the\n+.torrent file. If the specified key cannot be found, it returns nullptr.
\n+[report issue]\n+\n+info_section()
\n+\n+span<char const> info_section () const;\n+
\n+returns a the raw info section of the torrent file.\n+The underlying buffer is still owned by the torrent_info object
\n+[report issue]\n+\n+piece_layer()
\n+\n+span<char const> piece_layer (file_index_t) const;\n+
\n+return the bytes of the piece layer hashes for the specified file. If\n+the file doesn't have a piece layer, an empty span is returned.\n+The span size is divisible by 32, the size of a SHA-256 hash.\n+If the size of the file is smaller than or equal to the piece size,\n+the files "root hash" is the hash of the file and is not saved\n+separately in the "piece layers" field, but this function still\n+returns the root hash of the file in that case.
\n+[report issue]\n+\n+free_piece_layers()
\n+\n+void free_piece_layers ();\n+
\n+clears the piece layers from the torrent_info. This is done by the\n+session when a torrent is added, to avoid storing it twice. The piece\n+layer (or other hashes part of the merkle tree) are stored in the\n+internal torrent object.
\n+[report issue]\n \n-[report issue]\n-\n-enum operation_t
\n-Declared in "libtorrent/operations.hpp"
\n-\n-\n- \n-\n-name \n-value \n-description \n-unknown \n-0 \n-the error was unexpected and it is unknown which operation caused it \n-bittorrent \n-1 \n-this is used when the bittorrent logic\n-determines to disconnect \n-iocontrol \n-2 \n-a call to iocontrol failed \n-getpeername \n-3 \n-a call to getpeername() failed (querying the remote IP of a\n-connection) \n-getname \n-4 \n-a call to getname failed (querying the local IP of a\n-connection) \n-alloc_recvbuf \n-5 \n-an attempt to allocate a receive buffer failed \n-alloc_sndbuf \n-6 \n-an attempt to allocate a send buffer failed \n-file_write \n-7 \n-writing to a file failed \n-file_read \n-8 \n-reading from a file failed \n-file \n-9 \n-a non-read and non-write file operation failed \n-sock_write \n-10 \n-a socket write operation failed \n-sock_read \n-11 \n-a socket read operation failed \n-sock_open \n-12 \n-a call to open(), to create a socket socket failed \n-sock_bind \n-13 \n-a call to bind() on a socket failed \n-available \n-14 \n-an attempt to query the number of bytes available to read from a socket\n-failed \n-encryption \n-15 \n-a call related to bittorrent protocol encryption failed \n-connect \n-16 \n-an attempt to connect a socket failed \n-ssl_handshake \n-17 \n-establishing an SSL connection failed \n-get_interface \n-18 \n-a connection failed to satisfy the bind interface setting \n-sock_listen \n-19 \n-a call to listen() on a socket \n-sock_bind_to_device \n-20 \n-a call to the ioctl to bind a socket to a specific network device or\n-adapter \n-sock_accept \n-21 \n-a call to accept() on a socket \n-parse_address \n-22 \n-convert a string into a valid network address \n-enum_if \n-23 \n-enumeration network devices or adapters \n-file_stat \n-24 \n-invoking stat() on a file \n-file_copy \n-25 \n-copying a file \n-file_fallocate \n-26 \n-allocating storage for a file \n-file_hard_link \n-27 \n-creating a hard link \n-file_remove \n-28 \n-removing a file \n-file_rename \n-29 \n-renaming a file \n-file_open \n-30 \n-opening a file \n-mkdir \n-31 \n-creating a directory \n-check_resume \n-32 \n-check fast resume data against files on disk \n-exception \n-33 \n-an unknown exception \n-alloc_cache_piece \n-34 \n-allocate space for a piece in the cache \n-partfile_move \n-35 \n-move a part-file \n-partfile_read \n-36 \n-read from a part file \n-partfile_write \n-37 \n-write to a part-file \n-hostname_lookup \n-38 \n-a hostname lookup \n-symlink \n-39 \n-create or read a symlink \n-handshake \n-40 \n-handshake with a peer or server \n-sock_option \n-41 \n-set socket option \n-enum_route \n-42 \n-enumeration of network routes \n-file_seek \n-43 \n-moving read/write position in a file, operation_t::hostname_lookup \n-timer \n-44 \n-an async wait operation on a timer \n-file_mmap \n-45 \n-call to mmap() (or windows counterpart) \n-file_truncate \n-46 \n-call to ftruncate() (or SetEndOfFile() on windows) \n-
\n-[report issue]\n-\n-int
\n-Declared in "libtorrent/alert_types.hpp"
\n-\n-- user_alert_id
\n-- user defined alerts should use IDs greater than this
\n-
\n-\n-- num_alert_types
\n-- this constant represents "max_alert_index" + 1
\n-
\n-[report issue]\n-\n-alert_category_t
\n-Declared in "libtorrent/alert.hpp"
\n-\n-- error
\n-Enables alerts that report an error. This includes:
\n-\n-- tracker errors
\n-- tracker warnings
\n-- file errors
\n-- resume data failures
\n-- web seed errors
\n-- .torrent files errors
\n-- listen socket errors
\n-- port mapping errors
\n-
\n-
\n-\n-- peer
\n-- Enables alerts when peers send invalid requests, get banned or\n-snubbed.
\n-
\n-\n-- port_mapping
\n-- Enables alerts for port mapping events. For NAT-PMP and UPnP.
\n-
\n-\n-- storage
\n-- Enables alerts for events related to the storage. File errors and\n-synchronization events for moving the storage, renaming files etc.
\n-
\n-\n-- tracker
\n-- Enables all tracker events. Includes announcing to trackers,\n-receiving responses, warnings and errors.
\n-
\n-\n-- connect
\n-- Low level alerts for when peers are connected and disconnected.
\n-
\n-\n-- status
\n-- Enables alerts for when a torrent or the session changes state.
\n-
\n-\n-- ip_block
\n-- Alerts when a peer is blocked by the ip blocker or port blocker.
\n-
\n-\n-- performance_warning
\n-- Alerts when some limit is reached that might limit the download\n-or upload rate.
\n-
\n-\n-- dht
\n-- Alerts on events in the DHT node. For incoming searches or\n-bootstrapping being done etc.
\n-
\n-\n-- stats
\n-- If you enable these alerts, you will receive a stats_alert\n-approximately once every second, for every active torrent.\n-These alerts contain all statistics counters for the interval since\n-the lasts stats alert.
\n-
\n-\n-- session_log
\n-- Enables debug logging alerts. These are available unless libtorrent\n-was built with logging disabled (TORRENT_DISABLE_LOGGING). The\n-alerts being posted are log_alert and are session wide.
\n-
\n-\n-- torrent_log
\n-- Enables debug logging alerts for torrents. These are available\n-unless libtorrent was built with logging disabled\n-(TORRENT_DISABLE_LOGGING). The alerts being posted are\n-torrent_log_alert and are torrent wide debug events.
\n-
\n-\n-- peer_log
\n-- Enables debug logging alerts for peers. These are available unless\n-libtorrent was built with logging disabled\n-(TORRENT_DISABLE_LOGGING). The alerts being posted are\n-peer_log_alert and low-level peer events and messages.
\n-
\n-\n-- incoming_request
\n-- enables the incoming_request_alert.
\n+\n+announce_infohash
\n+Declared in "libtorrent/announce_entry.hpp"
\n+\n+struct announce_infohash\n+{\n+ std::string message;\n+ error_code last_error;\n+ int scrape_incomplete = -1;\n+ int scrape_complete = -1;\n+ int scrape_downloaded = -1;\n+ std::uint8_t fails : 7;\n+ bool updating : 1;\n+ bool start_sent : 1;\n+ bool complete_sent : 1;\n+};\n+\n+[report issue]\n+- message
\n+- if this tracker has returned an error or warning message\n+that message is stored here
\n
\n-\n-- dht_log
\n-- enables dht_log_alert, debug logging for the DHT
\n+[report issue]\n+- last_error
\n+- if this tracker failed the last time it was contacted\n+this error code specifies what error occurred
\n
\n-\n-- dht_operation
\n-- enable events from pure dht operations not related to torrents
\n+\n+\n+[report issue]\n+- scrape_incomplete scrape_complete scrape_downloaded
\n+- if this tracker has returned scrape data, these fields are filled in\n+with valid numbers. Otherwise they are set to -1. incomplete counts\n+the number of current downloaders. complete counts the number of\n+current peers completed the download, or "seeds". downloaded is the\n+cumulative number of completed downloads.
\n
\n-\n-- port_mapping_log
\n-- enables port mapping log events. This log is useful\n-for debugging the UPnP or NAT-PMP implementation
\n+[report issue]\n+- fails
\n+- the number of times in a row we have failed to announce to this\n+tracker.
\n
\n-\n-- picker_log
\n-- enables verbose logging from the piece picker.
\n+[report issue]\n+- updating
\n+- true while we're waiting for a response from the tracker.
\n
\n-\n-- file_progress
\n-- alerts when files complete downloading
\n+[report issue]\n+- start_sent
\n+- set to true when we get a valid response from an announce\n+with event=started. If it is set, we won't send start in the subsequent\n+announces.
\n
\n-\n-- piece_progress
\n-- alerts when pieces complete downloading or fail hash check
\n+[report issue]\n+- complete_sent
\n+- set to true when we send a event=completed.
\n
\n-\n-- upload
\n-- alerts when we upload blocks to other peers
\n+[report issue]
\n+\n+announce_endpoint
\n+Declared in "libtorrent/announce_entry.hpp"
\n+announces are sent to each tracker using every listen socket\n+this class holds information about one listen socket for one tracker
\n+\n+struct announce_endpoint\n+{\n+ announce_endpoint ();\n+\n+ tcp::endpoint local_endpoint;\n+ aux::array<announce_infohash, num_protocols, protocol_version> info_hashes;\n+ bool enabled = true;\n+};\n+\n+[report issue]\n+- local_endpoint
\n+- the local endpoint of the listen interface associated with this endpoint
\n
\n-\n-- block_progress
\n-- alerts on individual blocks being requested, downloading, finished,\n-rejected, time-out and cancelled. This is likely to post alerts at a\n-high rate.
\n+[report issue]\n+- info_hashes
\n+- info_hashes[0] is the v1 info hash (SHA1)\n+info_hashes[1] is the v2 info hash (truncated SHA-256)
\n
\n-\n-- all
\n-The full bitmask, representing all available categories.
\n-since the enum is signed, make sure this isn't\n-interpreted as -1. For instance, boost.python\n-does that and fails when assigning it to an\n-unsigned parameter.
\n-\n+- enabled
\n+- set to false to not announce from this endpoint
\n
\n-[report issue]
\n-\n-torrent_status
\n-Declared in "libtorrent/torrent_status.hpp"
\n-holds a snapshot of the status of a torrent, as queried by\n-torrent_handle::status().
\n+[report issue]\n+\n+announce_entry
\n+Declared in "libtorrent/announce_entry.hpp"
\n+this class holds information about one bittorrent tracker, as it\n+relates to a specific torrent.
\n \n-struct torrent_status\n+struct announce_entry\n {\n- bool operator== (torrent_status const& st) const;\n+ announce_entry& operator= (announce_entry const&) &;\n+ announce_entry ();\n+ ~announce_entry ();\n+ explicit announce_entry (string_view u);\n+ announce_entry (announce_entry const&);\n \n- enum state_t\n+ enum tracker_source\n {\n- checking_files,\n- downloading_metadata,\n- downloading,\n- finished,\n- seeding,\n- unused_enum_for_backwards_compatibility_allocating,\n- checking_resume_data,\n+ source_torrent,\n+ source_client,\n+ source_magnet_link,\n+ source_tex,\n };\n \n- torrent_handle handle;\n- error_code errc;\n- file_index_t error_file = torrent_status::error_file_none;\n- static constexpr file_index_t error_file_none {-1};\n- static constexpr file_index_t error_file_ssl_ctx {-3};\n- static constexpr file_index_t error_file_metadata {-4};\n- static constexpr file_index_t error_file_exception {-5};\n- static constexpr file_index_t error_file_partfile {-6};\n- std::string save_path;\n- std::string name;\n- std::weak_ptr<const torrent_info> torrent_file;\n- time_duration next_announce = seconds{0};\n- std::string current_tracker;\n- std::int64_t total_download = 0;\n- std::int64_t total_upload = 0;\n- std::int64_t total_payload_download = 0;\n- std::int64_t total_payload_upload = 0;\n- std::int64_t total_failed_bytes = 0;\n- std::int64_t total_redundant_bytes = 0;\n- typed_bitfield<piece_index_t> pieces;\n- typed_bitfield<piece_index_t> verified_pieces;\n- std::int64_t total_done = 0;\n- std::int64_t total = 0;\n- std::int64_t total_wanted_done = 0;\n- std::int64_t total_wanted = 0;\n- std::int64_t all_time_upload = 0;\n- std::int64_t all_time_download = 0;\n- std::time_t added_time = 0;\n- std::time_t completed_time = 0;\n- std::time_t last_seen_complete = 0;\n- storage_mode_t storage_mode = storage_mode_sparse;\n- float progress = 0.f;\n- int progress_ppm = 0;\n- queue_position_t queue_position {};\n- int download_rate = 0;\n- int upload_rate = 0;\n- int download_payload_rate = 0;\n- int upload_payload_rate = 0;\n- int num_seeds = 0;\n- int num_peers = 0;\n- int num_complete = -1;\n- int num_incomplete = -1;\n- int list_seeds = 0;\n- int list_peers = 0;\n- int connect_candidates = 0;\n- int num_pieces = 0;\n- int distributed_full_copies = 0;\n- int distributed_fraction = 0;\n- float distributed_copies = 0.f;\n- int block_size = 0;\n- int num_uploads = 0;\n- int num_connections = 0;\n- int uploads_limit = 0;\n- int connections_limit = 0;\n- int up_bandwidth_queue = 0;\n- int down_bandwidth_queue = 0;\n- int seed_rank = 0;\n- state_t state = checking_resume_data;\n- bool need_save_resume = false;\n- bool is_seeding = false;\n- bool is_finished = false;\n- bool has_metadata = false;\n- bool has_incoming = false;\n- bool moving_storage = false;\n- bool announcing_to_trackers = false;\n- bool announcing_to_lsd = false;\n- bool announcing_to_dht = false;\n- info_hash_t info_hashes;\n- time_point last_upload;\n- time_point last_download;\n- seconds active_duration;\n- seconds finished_duration;\n- seconds seeding_duration;\n- torrent_flags_t flags {};\n+ std::string url;\n+ std::string trackerid;\n+ std::vector<announce_endpoint> endpoints;\n+ std::uint8_t tier = 0;\n+ std::uint8_t fail_limit = 0;\n+ std::uint8_t source:4;\n+ bool verified:1;\n };\n \n-[report issue]\n-operator==()
\n+\n+\n+[report issue]\n+announce_entry() operator=() ~announce_entry()
\n \n-bool operator== (torrent_status const& st) const;\n+announce_entry& operator= (announce_entry const&) &;\n+announce_entry ();\n+~announce_entry ();\n+explicit announce_entry (string_view u);\n+announce_entry (announce_entry const&);\n
\n-compares if the torrent status objects come from the same torrent. i.e.\n-only the torrent_handle field is compared.
\n-[report issue]\n-\n-enum state_t
\n-Declared in "libtorrent/torrent_status.hpp"
\n+constructs a tracker announce entry with u as the URL.
\n+[report issue]\n+\n+enum tracker_source
\n+Declared in "libtorrent/announce_entry.hpp"
\n \n \n- \n \n name \n value \n description \n checking_files \n+source_torrent \n 1 \n-The torrent has not started its download yet, and is\n-currently checking existing files. \n+the tracker was part of the .torrent file \n downloading_metadata \n+source_client \n 2 \n-The torrent is trying to download metadata from peers.\n-This implies the ut_metadata extension is in use. \n-downloading \n-3 \n-The torrent is being downloaded. This is the state\n-most torrents will be in most of the time. The progress\n-meter will tell how much of the files that has been\n-downloaded. \n+the tracker was added programmatically via the add_tracker() function \n finished \n+source_magnet_link \n 4 \n-In this state the torrent has finished downloading but\n-still doesn't have the entire torrent. i.e. some pieces\n-are filtered and won't get downloaded. \n-seeding \n-5 \n-In this state the torrent has finished downloading and\n-is a pure seeder. \n-unused_enum_for_backwards_compatibility_allocating \n-6 \n-If the torrent was started in full allocation mode, this\n-indicates that the (disk) storage for the torrent is\n-allocated. \n+the tracker was part of a magnet link \n checking_resume_data \n-7 \n-The torrent is currently checking the fast resume data and\n-comparing it to the files on disk. This is typically\n-completed in a fraction of a second, but if you add a\n-large number of torrents at once, they will queue up. \n+source_tex \n+8 \n+the tracker was received from the swarm via tracker exchange \n
\n-[report issue]\n-- handle
\n-- a handle to the torrent whose status the object represents.
\n-
\n-[report issue]\n-- errc
\n-- may be set to an error code describing why the torrent was paused, in\n-case it was paused by an error. If the torrent is not paused or if it's\n-paused but not because of an error, this error_code is not set.\n-if the error is attributed specifically to a file, error_file is set to\n-the index of that file in the .torrent file.
\n-
\n-[report issue]\n-- error_file
\n-- if the torrent is stopped because of an disk I/O error, this field\n-contains the index of the file in the torrent that encountered the\n-error. If the error did not originate in a file in the torrent, there\n-are a few special values this can be set to: error_file_none,\n-error_file_ssl_ctx, error_file_exception, error_file_partfile or\n-error_file_metadata;
\n-
\n-[report issue]\n-- error_file_none
\n-- special values for error_file to describe which file or component\n-encountered the error (errc).\n-the error did not occur on a file
\n-
\n-[report issue]\n-- error_file_ssl_ctx
\n-- the error occurred setting up the SSL context
\n-
\n-[report issue]\n-- error_file_metadata
\n-- the error occurred while loading the metadata for the torrent
\n-
\n-[report issue]\n-- error_file_exception
\n-- there was a serious error reported in this torrent. The error code\n-or a torrent log alert may provide more information.
\n-
\n-[report issue]\n-- error_file_partfile
\n-- the error occurred with the partfile
\n-
\n-[report issue]\n-- save_path
\n-- the path to the directory where this torrent's files are stored.\n-It's typically the path as was given to async_add_torrent() or\n-add_torrent() when this torrent was started. This field is only\n-included if the torrent status is queried with\n-torrent_handle::query_save_path.
\n-
\n-[report issue]\n-- name
\n-- the name of the torrent. Typically this is derived from the\n-.torrent file. In case the torrent was started without metadata,\n-and hasn't completely received it yet, it returns the name given\n-to it when added to the session. See session::add_torrent.\n-This field is only included if the torrent status is queried\n-with torrent_handle::query_name.
\n-
\n-[report issue]\n-- torrent_file
\n-- set to point to the torrent_info object for this torrent. It's\n-only included if the torrent status is queried with\n-torrent_handle::query_torrent_file.
\n-
\n-[report issue]\n-- next_announce
\n-- the time until the torrent will announce itself to the tracker.
\n-
\n-[report issue]\n-- current_tracker
\n-- the URL of the last working tracker. If no tracker request has\n-been successful yet, it's set to an empty string.
\n-
\n-\n-[report issue]\n-- total_download total_upload
\n-- the number of bytes downloaded and uploaded to all peers, accumulated,\n-this session only. The session is considered to restart when a\n-torrent is paused and restarted again. When a torrent is paused, these\n-counters are reset to 0. If you want complete, persistent, stats, see\n-all_time_upload and all_time_download.
\n-
\n-\n-[report issue]\n-- total_payload_download total_payload_upload
\n-- counts the amount of bytes send and received this session, but only\n-the actual payload data (i.e the interesting data), these counters\n-ignore any protocol overhead. The session is considered to restart\n-when a torrent is paused and restarted again. When a torrent is\n-paused, these counters are reset to 0.
\n-
\n-[report issue]\n-- total_failed_bytes
\n-- the number of bytes that has been downloaded and that has failed the\n-piece hash test. In other words, this is just how much crap that has\n-been downloaded since the torrent was last started. If a torrent is\n-paused and then restarted again, this counter will be reset.
\n-
\n-[report issue]\n-- total_redundant_bytes
\n-- the number of bytes that has been downloaded even though that data\n-already was downloaded. The reason for this is that in some situations\n-the same data can be downloaded by mistake. When libtorrent sends\n-requests to a peer, and the peer doesn't send a response within a\n-certain timeout, libtorrent will re-request that block. Another\n-situation when libtorrent may re-request blocks is when the requests\n-it sends out are not replied in FIFO-order (it will re-request blocks\n-that are skipped by an out of order block). This is supposed to be as\n-low as possible. This only counts bytes since the torrent was last\n-started. If a torrent is paused and then restarted again, this counter\n-will be reset.
\n-
\n-[report issue]\n-- pieces
\n-- a bitmask that represents which pieces we have (set to true) and the\n-pieces we don't have. It's a pointer and may be set to 0 if the\n-torrent isn't downloading or seeding.
\n-
\n-[report issue]\n-- verified_pieces
\n-- a bitmask representing which pieces has had their hash checked. This\n-only applies to torrents in seed mode. If the torrent is not in seed\n-mode, this bitmask may be empty.
\n-
\n-[report issue]\n-- total_done
\n-- the total number of bytes of the file(s) that we have. All this does\n-not necessarily has to be downloaded during this session (that's\n-total_payload_download).
\n-
\n-[report issue]\n-- total
\n-- the total number of bytes to download for this torrent. This\n-may be less than the size of the torrent in case there are\n-pad files. This number only counts bytes that will actually\n-be requested from peers.
\n-
\n-[report issue]\n-- total_wanted_done
\n-- the number of bytes we have downloaded, only counting the pieces that\n-we actually want to download. i.e. excluding any pieces that we have\n-but have priority 0 (i.e. not wanted).\n-Once a torrent becomes seed, any piece- and file priorities are\n-forgotten and all bytes are considered "wanted".
\n-
\n-[report issue]\n-- total_wanted
\n-- The total number of bytes we want to download. This may be smaller\n-than the total torrent size in case any pieces are prioritized to 0,\n-i.e. not wanted.\n-Once a torrent becomes seed, any piece- and file priorities are\n-forgotten and all bytes are considered "wanted".
\n-
\n-\n-[report issue]\n-- all_time_upload all_time_download
\n-- are accumulated upload and download payload byte counters. They are\n-saved in and restored from resume data to keep totals across sessions.
\n-
\n-[report issue]\n-- added_time
\n-- the posix-time when this torrent was added. i.e. what time(nullptr)\n-returned at the time.
\n-
\n-[report issue]\n-- completed_time
\n-- the posix-time when this torrent was finished. If the torrent is not\n-yet finished, this is 0.
\n-
\n-[report issue]\n-- last_seen_complete
\n-- the time when we, or one of our peers, last saw a complete copy of\n-this torrent.
\n-
\n-[report issue]\n-- storage_mode
\n-- The allocation mode for the torrent. See storage_mode_t for the\n-options. For more information, see storage allocation.
\n-
\n-[report issue]\n-- progress
\n-- a value in the range [0, 1], that represents the progress of the\n-torrent's current task. It may be checking files or downloading.
\n-
\n-[report issue]\n-- progress_ppm
\n-progress parts per million (progress * 1000000) when disabling\n-floating point operations, this is the only option to query progress
\n-reflects the same value as progress, but instead in a range [0,\n-1000000] (ppm = parts per million). When floating point operations are\n-disabled, this is the only alternative to the floating point value in\n-progress.
\n-
\n-[report issue]\n-- queue_position
\n-- the position this torrent has in the download\n-queue. If the torrent is a seed or finished, this is -1.
\n-
\n-\n-[report issue]\n-- download_rate upload_rate
\n-- the total rates for all peers for this torrent. These will usually\n-have better precision than summing the rates from all peers. The rates\n-are given as the number of bytes per second.
\n-
\n-\n-[report issue]\n-- download_payload_rate upload_payload_rate
\n-- the total transfer rate of payload only, not counting protocol\n-chatter. This might be slightly smaller than the other rates, but if\n-projected over a long time (e.g. when calculating ETA:s) the\n-difference may be noticeable.
\n-
\n-[report issue]\n-- num_seeds
\n-- the number of peers that are seeding that this client is\n-currently connected to.
\n-
\n-[report issue]\n-- num_peers
\n-- the number of peers this torrent currently is connected to. Peer\n-connections that are in the half-open state (is attempting to connect)\n-or are queued for later connection attempt do not count. Although they\n-are visible in the peer list when you call get_peer_info().
\n-
\n-\n-[report issue]\n-- num_complete num_incomplete
\n-- if the tracker sends scrape info in its announce reply, these fields\n-will be set to the total number of peers that have the whole file and\n-the total number of peers that are still downloading. set to -1 if the\n-tracker did not send any scrape data in its announce reply.
\n-
\n-\n-[report issue]\n-- list_seeds list_peers
\n-- the number of seeds in our peer list and the total number of peers\n-(including seeds). We are not necessarily connected to all the peers\n-in our peer list. This is the number of peers we know of in total,\n-including banned peers and peers that we have failed to connect to.
\n-
\n-[report issue]\n-- connect_candidates
\n-- the number of peers in this torrent's peer list that is a candidate to\n-be connected to. i.e. It has fewer connect attempts than the max fail\n-count, it is not a seed if we are a seed, it is not banned etc. If\n-this is 0, it means we don't know of any more peers that we can try.
\n-
\n-[report issue]\n-- num_pieces
\n-- the number of pieces that has been downloaded. It is equivalent to:\n-std::accumulate(pieces->begin(), pieces->end()). So you don't have\n-to count yourself. This can be used to see if anything has updated\n-since last time if you want to keep a graph of the pieces up to date.
\n-
\n-[report issue]\n-- distributed_full_copies
\n-- the number of distributed copies of the torrent. Note that one copy\n-may be spread out among many peers. It tells how many copies there are\n-currently of the rarest piece(s) among the peers this client is\n-connected to.
\n-
\n-[report issue]\n-- distributed_fraction
\n-tells the share of pieces that have more copies than the rarest\n-piece(s). Divide this number by 1000 to get the fraction.
\n-For example, if distributed_full_copies is 2 and\n-distributed_fraction is 500, it means that the rarest pieces have\n-only 2 copies among the peers this torrent is connected to, and that\n-50% of all the pieces have more than two copies.
\n-If we are a seed, the piece picker is deallocated as an optimization,\n-and piece availability is no longer tracked. In this case the\n-distributed copies members are set to -1.
\n-
\n-[report issue]\n-- distributed_copies
\n-the number of distributed copies of the file. note that one copy may\n-be spread out among many peers. This is a floating point\n-representation of the distributed copies.
\n-\n-- the integer part tells how many copies
\n-- there are of the rarest piece(s)
\n-- the fractional part tells the fraction of pieces that
\n-- have more copies than the rarest piece(s).
\n-
\n-
\n-[report issue]\n-- block_size
\n-- the size of a block, in bytes. A block is a sub piece, it is the\n-number of bytes that each piece request asks for and the number of\n-bytes that each bit in the partial_piece_info's bitset represents,\n-see get_download_queue(). This is typically 16 kB, but it may be\n-smaller, if the pieces are smaller.
\n-
\n-[report issue]\n-- num_uploads
\n-- the number of unchoked peers in this torrent.
\n-
\n-[report issue]\n-- num_connections
\n-- the number of peer connections this torrent has, including half-open\n-connections that hasn't completed the bittorrent handshake yet. This\n-is always >= num_peers.
\n-
\n-[report issue]\n-- uploads_limit
\n-- the set limit of upload slots (unchoked peers) for this torrent.
\n-
\n-[report issue]\n-- connections_limit
\n-- the set limit of number of connections for this torrent.
\n-
\n-\n-[report issue]\n-- up_bandwidth_queue down_bandwidth_queue
\n-- the number of peers in this torrent that are waiting for more\n-bandwidth quota from the torrent rate limiter. This can determine if\n-the rate you get from this torrent is bound by the torrents limit or\n-not. If there is no limit set on this torrent, the peers might still\n-be waiting for bandwidth quota from the global limiter, but then they\n-are counted in the session_status object.
\n-
\n-[report issue]\n-- seed_rank
\n-- A rank of how important it is to seed the torrent, it is used to\n-determine which torrents to seed and which to queue. It is based on\n-the peer to seed ratio from the tracker scrape. For more information,\n-see queuing. Higher value means more important to seed
\n-
\n-[report issue]\n-- state
\n-- the main state the torrent is in. See torrent_status::state_t.
\n+[report issue]\n+- url
\n+- tracker URL as it appeared in the torrent file
\n
\n-[report issue]\n-- need_save_resume
\n-- true if this torrent has unsaved changes\n-to its download state and statistics since the last resume data\n-was saved.
\n+[report issue]\n+- trackerid
\n+- the current &trackerid= argument passed to the tracker.\n+this is optional and is normally empty (in which case no\n+trackerid is sent).
\n
\n-[report issue]\n-- is_seeding
\n-- true if all pieces have been downloaded.
\n+[report issue]\n+- endpoints
\n+- each local listen socket (endpoint) will announce to the tracker. This\n+list contains state per endpoint.
\n
\n-[report issue]\n-- is_finished
\n-- true if all pieces that have a priority > 0 are downloaded. There is\n-only a distinction between finished and seeding if some pieces or\n-files have been set to priority 0, i.e. are not downloaded.
\n+[report issue]\n+- tier
\n+- the tier this tracker belongs to
\n
\n-[report issue]\n-- has_metadata
\n-- true if this torrent has metadata (either it was started from a\n-.torrent file or the metadata has been downloaded). The only scenario\n-where this can be false is when the torrent was started torrent-less\n-(i.e. with just an info-hash and tracker ip, a magnet link for\n-instance).
\n+[report issue]\n+- fail_limit
\n+- the max number of failures to announce to this tracker in\n+a row, before this tracker is not used anymore. 0 means unlimited
\n
\n-[report issue]\n-- has_incoming
\n-- true if there has ever been an incoming connection attempt to this\n-torrent.
\n+[report issue]\n+- source
\n+- a bitmask specifying which sources we got this tracker from.
\n
\n-[report issue]\n-- moving_storage
\n-- this is true if this torrent's storage is currently being moved from\n-one location to another. This may potentially be a long operation\n-if a large file ends up being copied from one drive to another.
\n+[report issue]\n+- verified
\n+- set to true the first time we receive a valid response\n+from this tracker.
\n
\n-\n-\n-[report issue]\n-- announcing_to_trackers announcing_to_lsd announcing_to_dht
\n-- these are set to true if this torrent is allowed to announce to the\n-respective peer source. Whether they are true or false is determined by\n-the queue logic/auto manager. Torrents that are not auto managed will\n-always be allowed to announce to all peer sources.
\n+libtorrent has a plugin interface for implementing extensions to the protocol.\n+These can be general extensions for transferring metadata or peer exchange\n+extensions, or it could be used to provide a way to customize the protocol\n+to fit a particular (closed) network.
\n+In short, the plugin interface makes it possible to:
\n+\n+- register extension messages (sent in the extension handshake), see\n+extensions.
\n+- add data and parse data from the extension handshake.
\n+- send extension messages and standard bittorrent messages.
\n+- override or block the handling of standard bittorrent messages.
\n+- save and restore state via the session state
\n+- see all alerts that are posted
\n+
\n+
\n+\n+\n+a word of caution
\n+Writing your own plugin is a very easy way to introduce serious bugs such as\n+dead locks and race conditions. Since a plugin has access to internal\n+structures it is also quite easy to sabotage libtorrent's operation.
\n+All the callbacks are always called from the libtorrent network thread. In\n+case portions of your plugin are called from other threads, typically the main\n+thread, you cannot use any of the member functions on the internal structures\n+in libtorrent, since those require being called from the libtorrent network\n+thread . Furthermore, you also need to synchronize your own shared data\n+within the plugin, to make sure it is not accessed at the same time from the\n+libtorrent thread (through a callback). If you need to send out a message\n+from another thread, it is advised to use an internal queue, and do the\n+actual sending in tick().
\n+Since the plugin interface gives you easy access to internal structures, it\n+is not supported as a stable API. Plugins should be considered specific to a\n+specific version of libtorrent. Although, in practice the internals mostly\n+don't change that dramatically.
\n+\n+\n+plugin-interface
\n+The plugin interface consists of three base classes that the plugin may\n+implement. These are called plugin, torrent_plugin and peer_plugin.\n+They are found in the <libtorrent/extensions.hpp> header.
\n+These plugins are instantiated for each session, torrent and possibly each peer,\n+respectively.
\n+For plugins that only need per torrent state, it is enough to only implement\n+torrent_plugin and pass a constructor function or function object to\n+session::add_extension() or torrent_handle::add_extension() (if the\n+torrent has already been started and you want to hook in the extension at\n+run-time).
\n+The signature of the function is:
\n+\n+std::shared_ptr<torrent_plugin> (*)(torrent_handle const&, client_data_t);\n+
\n+The second argument is the userdata passed to session::add_torrent() or\n+torrent_handle::add_extension().
\n+The function should return a std::shared_ptr<torrent_plugin> which\n+may or may not be 0. If it is a nullptr, the extension is simply ignored\n+for this torrent. If it is a valid pointer (to a class inheriting\n+torrent_plugin), it will be associated with this torrent and callbacks\n+will be made on torrent events.
\n+For more elaborate plugins which require session wide state, you would\n+implement plugin, construct an object (in a std::shared_ptr) and pass\n+it in to session::add_extension().
\n+\n+\n+custom alerts
\n+Since plugins are running within internal libtorrent threads, one convenient\n+way to communicate with the client is to post custom alerts.
\n+The expected interface of any alert, apart from deriving from the alert\n+base class, looks like this:
\n+\n+static const int alert_type = <unique alert ID>;\n+virtual int type() const { return alert_type; }\n+\n+virtual std::string message() const;\n+\n+static const alert_category_t static_category = <bitmask of alert::category_t flags>;\n+virtual alert_category_t category() const { return static_category; }\n+\n+virtual char const* what() const { return <string literal of the name of this alert>; }\n+\n+The alert_type is used for the type-checking in alert_cast. It must\n+not collide with any other alert. The built-in alerts in libtorrent will\n+not use alert type IDs greater than user_alert_id. When defining your\n+own alert, make sure it's greater than this constant.
\n+type() is the run-time equivalence of the alert_type.
\n+The message() virtual function is expected to construct a useful\n+string representation of the alert and the event or data it represents.\n+Something convenient to put in a log file for instance.
\n+clone() is used internally to copy alerts. The suggested implementation\n+of simply allocating a new instance as a copy of *this is all that's\n+expected.
\n+The static category is required for checking whether or not the category\n+for a specific alert is enabled or not, without instantiating the alert.\n+The category virtual function is the run-time equivalence.
\n+The what() virtual function may simply be a string literal of the class\n+name of your alert.
\n+For more information, see the alert section.
\n+[report issue]\n+\n+plugin
\n+Declared in "libtorrent/extensions.hpp"
\n+this is the base class for a session plugin. One primary feature\n+is that it is notified of all torrents that are added to the session,\n+and can add its own torrent_plugins.
\n+\n+struct plugin\n+{\n+ virtual feature_flags_t implemented_features ();\n+ virtual std::shared_ptr<torrent_plugin> new_torrent (torrent_handle const&, client_data_t);\n+ virtual void added (session_handle const&);\n+ virtual void abort ();\n+ virtual bool on_dht_request (string_view /* query */\n+ , udp::endpoint const& /* source */, bdecode_node const& /* message */\n+ , entry& /* response */);\n+ virtual void on_alert (alert const*);\n+ virtual bool on_unknown_torrent (info_hash_t const& /* info_hash */\n+ , peer_connection_handle const& /* pc */, add_torrent_params& /* p */);\n+ virtual void on_tick ();\n+ virtual uint64_t get_unchoke_priority (peer_connection_handle const& /* peer */);\n+ virtual std::map<std::string, std::string> save_state () const;\n+ virtual void load_state (std::map<std::string, std::string> const&);\n+\n+ static constexpr feature_flags_t optimistic_unchoke_feature = 1_bit;\n+ static constexpr feature_flags_t tick_feature = 2_bit;\n+ static constexpr feature_flags_t dht_request_feature = 3_bit;\n+ static constexpr feature_flags_t alert_feature = 4_bit;\n+ static constexpr feature_flags_t unknown_torrent_feature = 5_bit;\n+};\n+\n+[report issue]\n+implemented_features()
\n+\n+virtual feature_flags_t implemented_features ();\n+
\n+This function is expected to return a bitmask indicating which features\n+this plugin implements. Some callbacks on this object may not be called\n+unless the corresponding feature flag is returned here. Note that\n+callbacks may still be called even if the corresponding feature is not\n+specified in the return value here. See feature_flags_t for possible\n+flags to return.
\n+[report issue]\n+\n+new_torrent()
\n+\n+virtual std::shared_ptr<torrent_plugin> new_torrent (torrent_handle const&, client_data_t);\n+
\n+this is called by the session every time a new torrent is added.\n+The torrent* points to the internal torrent object created\n+for the new torrent. The client_data_t is the userdata pointer as\n+passed in via add_torrent_params.
\n+If the plugin returns a torrent_plugin instance, it will be added\n+to the new torrent. Otherwise, return an empty shared_ptr to a\n+torrent_plugin (the default).
\n+[report issue]\n+\n+added()
\n+\n+virtual void added (session_handle const&);\n+
\n+called when plugin is added to a session
\n+[report issue]\n+\n+abort()
\n+\n+virtual void abort ();\n+
\n+called when the session is aborted\n+the plugin should perform any cleanup necessary to allow the session's\n+destruction (e.g. cancel outstanding async operations)
\n+[report issue]\n+\n+on_dht_request()
\n+\n+virtual bool on_dht_request (string_view /* query */\n+ , udp::endpoint const& /* source */, bdecode_node const& /* message */\n+ , entry& /* response */);\n+
\n+called when a dht request is received.\n+If your plugin expects this to be called, make sure to include the flag\n+dht_request_feature in the return value from implemented_features().
\n+[report issue]\n+\n+on_alert()
\n+\n+virtual void on_alert (alert const*);\n+
\n+called when an alert is posted alerts that are filtered are not posted.\n+If your plugin expects this to be called, make sure to include the flag\n+alert_feature in the return value from implemented_features().
\n+[report issue]\n+\n+on_unknown_torrent()
\n+\n+virtual bool on_unknown_torrent (info_hash_t const& /* info_hash */\n+ , peer_connection_handle const& /* pc */, add_torrent_params& /* p */);\n+
\n+return true if the add_torrent_params should be added
\n+[report issue]\n+\n+on_tick()
\n+\n+virtual void on_tick ();\n+
\n+called once per second.\n+If your plugin expects this to be called, make sure to include the flag\n+tick_feature in the return value from implemented_features().
\n+[report issue]\n+\n+get_unchoke_priority()
\n+\n+virtual uint64_t get_unchoke_priority (peer_connection_handle const& /* peer */);\n+
\n+called when choosing peers to optimistically unchoke. The return value\n+indicates the peer's priority for unchoking. Lower return values\n+correspond to higher priority. Priorities above 2^63-1 are reserved.\n+If your plugin has no priority to assign a peer it should return 2^64-1.\n+If your plugin expects this to be called, make sure to include the flag\n+optimistic_unchoke_feature in the return value from implemented_features().\n+If multiple plugins implement this function the lowest return value\n+(i.e. the highest priority) is used.
\n+[report issue]\n+\n+load_state()
\n+\n+virtual void load_state (std::map<std::string, std::string> const&);\n+
\n+called on startup while loading settings state from the session_params
\n+[report issue]\n+- optimistic_unchoke_feature
\n+- include this bit if your plugin needs to alter the order of the\n+optimistic unchoke of peers. i.e. have the on_optimistic_unchoke()\n+callback be called.
\n
\n-[report issue]\n-- info_hashes
\n-- the info-hash for this torrent
\n+[report issue]\n-\n-[report issue]\n-- last_upload last_download
\n-- the timestamps of the last time this torrent uploaded or downloaded\n-payload to any peer.
\n+[report issue]\n+- dht_request_feature
\n+- include this bit if your plugin needs to have on_dht_request()\n+called
\n
\n-\n-\n-[report issue]\n-- active_duration finished_duration seeding_duration
\n-- these are cumulative counters of for how long the torrent has been in\n-different states. active means not paused and added to session. Whether\n-it has found any peers or not is not relevant.\n-finished means all selected files/pieces were downloaded and available\n-to other peers (this is always a subset of active time).\n-seeding means all files/pieces were downloaded and available to\n-peers. Being available to peers does not imply there are other peers\n-asking for the payload.
\n+[report issue]\n+- alert_feature
\n+- include this bit if your plugin needs to have on_alert()\n+called
\n
\n-[report issue]\n-- flags
\n-- reflects several of the torrent's flags. For more\n-information, see torrent_handle::flags().
\n+[report issue]\n+- unknown_torrent_feature
\n+- include this bit if your plugin needs to have on_unknown_torrent()\n+called even if there is no active torrent in the session
\n
\n-[report issue]
\n+[report issue]\n \n-\n-session_proxy
\n-Declared in "libtorrent/session.hpp"
\n-this is a holder for the internal session implementation object. Once the\n-session destruction is explicitly initiated, this holder is used to\n-synchronize the completion of the shutdown. The lifetime of this object\n-may outlive session, causing the session destructor to not block. The\n-session_proxy destructor will block however, until the underlying session\n-is done shutting down.
\n+\n+torrent_plugin
\n+Declared in "libtorrent/extensions.hpp"
\n+Torrent plugins are associated with a single torrent and have a number\n+of functions called at certain events. Many of its functions have the\n+ability to change or override the default libtorrent behavior.
\n \n-struct session_proxy\n+struct torrent_plugin\n {\n- session_proxy (session_proxy const&);\n- ~session_proxy ();\n- session_proxy& operator= (session_proxy&&) & noexcept;\n- session_proxy (session_proxy&&) noexcept;\n- session_proxy& operator= (session_proxy const&) &;\n- session_proxy ();\n+ virtual std::shared_ptr<peer_plugin> new_connection (peer_connection_handle const&);\n+ virtual void on_piece_pass (piece_index_t);\n+ virtual void on_piece_failed (piece_index_t);\n+ virtual void tick ();\n+ virtual bool on_resume ();\n+ virtual bool on_pause ();\n+ virtual void on_files_checked ();\n+ virtual void on_state (torrent_status::state_t);\n+ virtual void on_add_peer (tcp::endpoint const&,\n+ peer_source_flags_t, add_peer_flags_t);\n+\n+ static constexpr add_peer_flags_t first_time = 1_bit;\n+ static constexpr add_peer_flags_t filtered = 2_bit;\n };\n \n-\n-\n-[report issue]\n-operator=() ~session_proxy() session_proxy()
\n+[report issue]\n+new_connection()
\n \n-session_proxy (session_proxy const&);\n-~session_proxy ();\n-session_proxy& operator= (session_proxy&&) & noexcept;\n-session_proxy (session_proxy&&) noexcept;\n-session_proxy& operator= (session_proxy const&) &;\n-session_proxy ();\n+virtual std::shared_ptr<peer_plugin> new_connection (peer_connection_handle const&);\n
\n-default constructor, does not refer to any session\n-implementation object.
\n-[report issue]\n-\n-\n-session
\n-Declared in "libtorrent/session.hpp"
\n-The session holds all state that spans multiple torrents. Among other\n-things it runs the network loop and manages all torrents. Once it's\n-created, the session object will spawn the main thread that will do all\n-the work. The main thread will be idle as long it doesn't have any\n-torrents to participate in.
\n-You have some control over session configuration through the\n-session_handle::apply_settings() member function. To change one or more\n-configuration options, create a settings_pack. object and fill it with\n-the settings to be set and pass it in to session::apply_settings().
\n-see apply_settings().
\n+This function is called each time a new peer is connected to the torrent. You\n+may choose to ignore this by just returning a default constructed\n+shared_ptr (in which case you don't need to override this member\n+function).
\n+If you need an extension to the peer connection (which most plugins do) you\n+are supposed to return an instance of your peer_plugin class. Which in\n+turn will have its hook functions called on event specific to that peer.
\n+The peer_connection_handle will be valid as long as the shared_ptr\n+is being held by the torrent object. So, it is generally a good idea to not\n+keep a shared_ptr to your own peer_plugin. If you want to keep references\n+to it, use weak_ptr.
\n+If this function throws an exception, the connection will be closed.
\n+\n+[report issue]\n+\n+on_piece_pass() on_piece_failed()
\n \n-struct session : session_handle\n-{\n- explicit session (session_params const& params);\n- session (session_params const& params, session_flags_t flags);\n- explicit session (session_params&& params);\n- session (session_params&& params, session_flags_t flags);\n- session ();\n- session (session_params&& params, io_context& ios);\n- session (session_params&& params, io_context& ios, session_flags_t);\n- session (session_params const& params, io_context& ios);\n- session (session_params const& params, io_context& ios, session_flags_t);\n- ~session ();\n- session_proxy abort ();\n-};\n+virtual void on_piece_pass (piece_index_t);\n+virtual void on_piece_failed (piece_index_t);\n \n-[report issue]\n-session()
\n+These hooks are called when a piece passes the hash check or fails the hash\n+check, respectively. The index is the piece index that was downloaded.\n+It is possible to access the list of peers that participated in sending the\n+piece through the torrent and the piece_picker.
\n+[report issue]\n+\n+tick()
\n \n-explicit session (session_params const& params);\n-session (session_params const& params, session_flags_t flags);\n-explicit session (session_params&& params);\n-session (session_params&& params, session_flags_t flags);\n-session ();\n+virtual void tick ();\n
\n-Constructs the session objects which acts as the container of torrents.\n-In order to avoid a race condition between starting the session and\n-configuring it, you can pass in a session_params object. Its settings\n-will take effect before the session starts up.
\n-The overloads taking flags can be used to start a session in\n-paused mode (by passing in session::paused). Note that\n-add_default_plugins do not have an affect on constructors that\n-take a session_params object. It already contains the plugins to use.
\n-[report issue]\n-\n-session()
\n+This hook is called approximately once per second. It is a way of making it\n+easy for plugins to do timed events, for sending messages or whatever.
\n+\n+[report issue]\n+\n+on_pause() on_resume()
\n \n-session (session_params&& params, io_context& ios);\n-session (session_params&& params, io_context& ios, session_flags_t);\n-session (session_params const& params, io_context& ios);\n-session (session_params const& params, io_context& ios, session_flags_t);\n+virtual bool on_resume ();\n+virtual bool on_pause ();\n
\n-Overload of the constructor that takes an external io_context to run\n-the session object on. This is primarily useful for tests that may want\n-to run multiple sessions on a single io_context, or low resource\n-systems where additional threads are expensive and sharing an\n-io_context with other events is fine.
\n-\n-Warning
\n-The session object does not cleanly terminate with an external\n-io_context. The io_context::run() call must have returned\n-before it's safe to destruct the session. Which means you MUST\n-call session::abort() and save the session_proxy first, then\n-destruct the session object, then sync with the io_context, then\n-destruct the session_proxy object.
\n-\n-[report issue]\n-\n-~session()
\n+These hooks are called when the torrent is paused and resumed respectively.\n+The return value indicates if the event was handled. A return value of\n+true indicates that it was handled, and no other plugin after this one\n+will have this hook function called, and the standard handler will also not be\n+invoked. So, returning true effectively overrides the standard behavior of\n+pause or resume.
\n+Note that if you call pause() or resume() on the torrent from your\n+handler it will recurse back into your handler, so in order to invoke the\n+standard handler, you have to keep your own state on whether you want standard\n+behavior or overridden behavior.
\n+[report issue]\n+\n+on_files_checked()
\n \n-~session ();\n+virtual void on_files_checked ();\n
\n-The destructor of session will notify all trackers that our torrents\n-have been shut down. If some trackers are down, they will time out.\n-All this before the destructor of session returns. So, it's advised\n-that any kind of interface (such as windows) are closed before\n-destructing the session object. Because it can take a few second for\n-it to finish. The timeout can be set with apply_settings().
\n-[report issue]\n-\n-abort()
\n+This function is called when the initial files of the torrent have been\n+checked. If there are no files to check, this function is called immediately.
\n+i.e. This function is always called when the torrent is in a state where it\n+can start downloading.
\n+[report issue]\n+\n+on_state()
\n \n-session_proxy abort ();\n+virtual void on_state (torrent_status::state_t);\n
\n-In case you want to destruct the session asynchronously, you can\n-request a session destruction proxy. If you don't do this, the\n-destructor of the session object will block while the trackers are\n-contacted. If you keep one session_proxy to the session when\n-destructing it, the destructor will not block, but start to close down\n-the session, the destructor of the proxy will then synchronize the\n-threads. So, the destruction of the session is performed from the\n-session destructor call until the session_proxy destructor\n-call. The session_proxy does not have any operations on it (since\n-the session is being closed down, no operations are allowed on it).\n-The only valid operation is calling the destructor:
\n+called when the torrent changes state\n+the state is one of torrent_status::state_t\n+enum members
\n+[report issue]\n+\n+on_add_peer()
\n \n-struct session_proxy {};\n+virtual void on_add_peer (tcp::endpoint const&,\n+ peer_source_flags_t, add_peer_flags_t);\n \n-[report issue]\n+called every time a new peer is added to the peer list.\n+This is before the peer is connected to. For flags, see\n+torrent_plugin::flags_t. The source argument refers to\n+the source where we learned about this peer from. It's a\n+bitmask, because many sources may have told us about the same\n+peer. For peer source flags, see peer_info::peer_source_flags.
\n+[report issue]\n+- first_time
\n+- this is the first time we see this peer
\n+
\n+[report issue]\n+- filtered
\n+- this peer was not added because it was\n+filtered by the IP filter
\n+
\n+[report issue]\n \n-\n-session_handle
\n-Declared in "libtorrent/session_handle.hpp"
\n-this class provides a non-owning handle to a session and a subset of the\n-interface of the session class. If the underlying session is destructed\n-any handle to it will no longer be valid. is_valid() will return false and\n-any operation on it will throw a system_error exception, with error code\n-invalid_session_handle.
\n+\n+peer_plugin
\n+Declared in "libtorrent/extensions.hpp"
\n+peer plugins are associated with a specific peer. A peer could be\n+both a regular bittorrent peer (bt_peer_connection) or one of the\n+web seed connections (web_peer_connection or http_seed_connection).\n+In order to only attach to certain peers, make your\n+torrent_plugin::new_connection only return a plugin for certain peer\n+connection types
\n \n-struct session_handle\n+struct peer_plugin\n {\n- bool is_valid () const;\n- session_params session_state (save_state_flags_t flags = save_state_flags_t::all()) const;\n- std::vector<torrent_status> get_torrent_status (\n- std::function<bool(torrent_status const&)> const& pred\n- , status_flags_t flags = {}) const;\n- void refresh_torrent_status (std::vector<torrent_status>* ret\n- , status_flags_t flags = {}) const;\n- void post_torrent_updates (status_flags_t flags = status_flags_t::all());\n- void post_session_stats ();\n- void post_dht_stats ();\n- void set_dht_state (dht::dht_state const& st);\n- void set_dht_state (dht::dht_state&& st);\n- torrent_handle find_torrent (sha1_hash const& info_hash) const;\n- std::vector<torrent_handle> get_torrents () const;\n- torrent_handle add_torrent (add_torrent_params&& params);\n- torrent_handle add_torrent (add_torrent_params&& params, error_code& ec);\n- torrent_handle add_torrent (add_torrent_params const& params, error_code& ec);\n- void async_add_torrent (add_torrent_params&& params);\n- torrent_handle add_torrent (add_torrent_params const& params);\n- void async_add_torrent (add_torrent_params const& params);\n- void pause ();\n- void resume ();\n- bool is_paused () const;\n- bool is_dht_running () const;\n- void set_dht_storage (dht::dht_storage_constructor_type sc);\n- void add_dht_node (std::pair<std::string, int> const& node);\n- void dht_get_item (sha1_hash const& target);\n- void dht_get_item (std::array<char, 32> key\n- , std::string salt = std::string());\n- sha1_hash dht_put_item (entry data);\n- void dht_put_item (std::array<char, 32> key\n- , std::function<void(entry&, std::array<char, 64>&\n- , std::int64_t&, std::string const&)> cb\n- , std::string salt = std::string());\n- void dht_get_peers (sha1_hash const& info_hash);\n- void dht_announce (sha1_hash const& info_hash, int port = 0, dht::announce_flags_t flags = {});\n- void dht_live_nodes (sha1_hash const& nid);\n- void dht_sample_infohashes (udp::endpoint const& ep, sha1_hash const& target);\n- void dht_direct_request (udp::endpoint const& ep, entry const& e, client_data_t userdata = {});\n- void add_extension (std::shared_ptr<plugin> ext);\n- void add_extension (std::function<std::shared_ptr<torrent_plugin>(\n- torrent_handle const&, client_data_t)> ext);\n- void set_ip_filter (ip_filter f);\n- ip_filter get_ip_filter () const;\n- void set_port_filter (port_filter const& f);\n- bool is_listening () const;\n- unsigned short listen_port () const;\n- unsigned short ssl_listen_port () const;\n- void set_peer_class_filter (ip_filter const& f);\n- ip_filter get_peer_class_filter () const;\n- peer_class_type_filter get_peer_class_type_filter () const;\n- void set_peer_class_type_filter (peer_class_type_filter const& f);\n- peer_class_t create_peer_class (char const* name);\n- void delete_peer_class (peer_class_t cid);\n- void set_peer_class (peer_class_t cid, peer_class_info const& pci);\n- peer_class_info get_peer_class (peer_class_t cid) const;\n- void remove_torrent (const torrent_handle&, remove_flags_t = {});\n- void apply_settings (settings_pack&&);\n- void apply_settings (settings_pack const&);\n- settings_pack get_settings () const;\n- void set_alert_notify (std::function<void()> const& fun);\n- void pop_alerts (std::vector<alert*>* alerts);\n- alert* wait_for_alert (time_duration max_wait);\n- std::vector<port_mapping_t> add_port_mapping (portmap_protocol t, int external_port, int local_port);\n- void delete_port_mapping (port_mapping_t handle);\n- void reopen_network_sockets (reopen_network_flags_t options = reopen_map_ports);\n- std::shared_ptr<aux::session_impl> native_handle () const;\n-\n- static constexpr save_state_flags_t save_settings = 0_bit;\n- static constexpr save_state_flags_t save_dht_state = 2_bit;\n- static constexpr save_state_flags_t save_extension_state = 11_bit;\n- static constexpr save_state_flags_t save_ip_filter = 12_bit;\n- static constexpr peer_class_t global_peer_class_id {0};\n- static constexpr peer_class_t tcp_peer_class_id {1};\n- static constexpr peer_class_t local_peer_class_id {2};\n- static constexpr remove_flags_t delete_files = 0_bit;\n- static constexpr remove_flags_t delete_partfile = 1_bit;\n- static constexpr session_flags_t paused = 2_bit;\n- static constexpr portmap_protocol udp = portmap_protocol::udp;\n- static constexpr portmap_protocol tcp = portmap_protocol::tcp;\n- static constexpr reopen_network_flags_t reopen_map_ports = 0_bit;\n+ virtual string_view type () const;\n+ virtual void add_handshake (entry&);\n+ virtual void on_disconnect (error_code const&);\n+ virtual void on_connected ();\n+ virtual bool on_handshake (span<char const>);\n+ virtual bool on_extension_handshake (bdecode_node const&);\n+ virtual bool on_dont_have (piece_index_t);\n+ virtual bool on_bitfield (bitfield const& /*bitfield*/);\n+ virtual bool on_choke ();\n+ virtual bool on_have (piece_index_t);\n+ virtual bool on_interested ();\n+ virtual bool on_not_interested ();\n+ virtual bool on_request (peer_request const&);\n+ virtual bool on_unchoke ();\n+ virtual bool on_allowed_fast (piece_index_t);\n+ virtual bool on_have_none ();\n+ virtual bool on_have_all ();\n+ virtual bool on_piece (peer_request const& /*piece*/\n+ , span<char const> /*buf*/);\n+ virtual bool on_suggest (piece_index_t);\n+ virtual bool on_reject (peer_request const&);\n+ virtual bool on_cancel (peer_request const&);\n+ virtual void sent_cancel (peer_request const&);\n+ virtual void sent_have_all ();\n+ virtual void sent_allow_fast (piece_index_t);\n+ virtual void sent_suggest (piece_index_t);\n+ virtual void sent_have_none ();\n+ virtual void sent_reject_request (peer_request const&);\n+ virtual void sent_choke ();\n+ virtual void sent_request (peer_request const&);\n+ virtual void sent_not_interested ();\n+ virtual void sent_have (piece_index_t);\n+ virtual void sent_interested ();\n+ virtual void sent_piece (peer_request const&);\n+ virtual void sent_unchoke ();\n+ virtual void sent_payload (int /* bytes */);\n+ virtual bool can_disconnect (error_code const& /*ec*/);\n+ virtual bool on_extended (int /*length*/, int /*msg*/,\n+ span<char const> /*body*/);\n+ virtual bool on_unknown_message (int /*length*/, int /*msg*/,\n+ span<char const> /*body*/);\n+ virtual void on_piece_pass (piece_index_t);\n+ virtual void on_piece_failed (piece_index_t);\n+ virtual void tick ();\n+ virtual bool write_request (peer_request const&);\n };\n \n-[report issue]\n-is_valid()
\n+[report issue]\n+type()
\n \n-bool is_valid () const;\n+virtual string_view type () const;\n
\n-returns true if this handle refers to a valid session object. If the\n-session has been destroyed, all session_handle objects will expire and\n-not be valid.
\n-[report issue]\n-\n+\n+add_handshake()
\n \n-session_params session_state (save_state_flags_t flags = save_state_flags_t::all()) const;\n+virtual void add_handshake (entry&);\n
\n-returns the current session state. This can be passed to\n-write_session_params() to save the state to disk and restored using\n-read_session_params() when constructing a new session. The kind of\n-state that's included is all settings, the DHT routing table, possibly\n-plugin-specific state.\n-the flags parameter can be used to only save certain parts of the\n-session state
\n-\n-[report issue]\n-\n-refresh_torrent_status() get_torrent_status()
\n+can add entries to the extension handshake\n+this is not called for web seeds
\n+[report issue]\n+\n+on_disconnect()
\n \n-std::vector<torrent_status> get_torrent_status (\n- std::function<bool(torrent_status const&)> const& pred\n- , status_flags_t flags = {}) const;\n-void refresh_torrent_status (std::vector<torrent_status>* ret\n- , status_flags_t flags = {}) const;\n+virtual void on_disconnect (error_code const&);\n \n-\n-Note
\n-these calls are potentially expensive and won't scale well with\n-lots of torrents. If you're concerned about performance, consider\n-using post_torrent_updates() instead.
\n-\n-get_torrent_status returns a vector of the torrent_status for\n-every torrent which satisfies pred, which is a predicate function\n-which determines if a torrent should be included in the returned set\n-or not. Returning true means it should be included and false means\n-excluded. The flags argument is the same as to\n-torrent_handle::status(). Since pred is guaranteed to be\n-called for every torrent, it may be used to count the number of\n-torrents of different categories as well.
\n-refresh_torrent_status takes a vector of torrent_status structs\n-(for instance the same vector that was returned by\n-get_torrent_status() ) and refreshes the status based on the\n-handle member. It is possible to use this function by first\n-setting up a vector of default constructed torrent_status objects,\n-only initializing the handle member, in order to request the\n-torrent status for multiple torrents in a single call. This can save a\n-significant amount of time if you have a lot of torrents.
\n-Any torrent_status object whose handle member is not referring to\n-a valid torrent are ignored.
\n-The intended use of these functions is to start off by calling\n-get_torrent_status() to get a list of all torrents that match your\n-criteria. Then call refresh_torrent_status() on that list. This\n-will only refresh the status for the torrents in your list, and thus\n-ignore all other torrents you might be running. This may save a\n-significant amount of time, especially if the number of torrents you're\n-interested in is small. In order to keep your list of interested\n-torrents up to date, you can either call get_torrent_status() from\n-time to time, to include torrents you might have become interested in\n-since the last time. In order to stop refreshing a certain torrent,\n-simply remove it from the list.
\n-[report issue]\n-\n+\n+on_connected()
\n \n-void post_torrent_updates (status_flags_t flags = status_flags_t::all());\n+virtual void on_connected ();\n
\n-This functions instructs the session to post the state_update_alert,\n-containing the status of all torrents whose state changed since the\n-last time this function was called.
\n-Only torrents who has the state subscription flag set will be\n-included. This flag is on by default. See add_torrent_params.\n-the flags argument is the same as for torrent_handle::status().\n-see status_flags_t in torrent_handle.
\n-[report issue]\n-\n-post_session_stats()
\n+called when the peer is successfully connected. Note that\n+incoming connections will have been connected by the time\n+the peer plugin is attached to it, and won't have this hook\n+called.
\n+[report issue]\n+\n+on_handshake()
\n \n-void post_session_stats ();\n+virtual bool on_handshake (span<char const>);\n
\n-This function will post a session_stats_alert object, containing a\n-snapshot of the performance counters from the internals of libtorrent.\n-To interpret these counters, query the session via\n-session_stats_metrics().
\n-For more information, see the session statistics section.
\n-[report issue]\n-\n-post_dht_stats()
\n+this is called when the initial bittorrent handshake is received.\n+Returning false means that the other end doesn't support this extension\n+and will remove it from the list of plugins. this is not called for web\n+seeds
\n+[report issue]\n+\n+on_extension_handshake()
\n \n-void post_dht_stats ();\n+virtual bool on_extension_handshake (bdecode_node const&);\n
\n-This will cause a dht_stats_alert to be posted.
\n-[report issue]\n-\n-set_dht_state()
\n+called when the extension handshake from the other end is received\n+if this returns false, it means that this extension isn't\n+supported by this peer. It will result in this peer_plugin\n+being removed from the peer_connection and destructed.\n+this is not called for web seeds
\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+[report issue]\n+\n+on_bitfield() on_request() on_have_all() on_choke() on_interested() on_dont_have() on_have_none() on_allowed_fast() on_have() on_not_interested() on_unchoke()
\n \n-void set_dht_state (dht::dht_state const& st);\n-void set_dht_state (dht::dht_state&& st);\n+virtual bool on_dont_have (piece_index_t);\n+virtual bool on_bitfield (bitfield const& /*bitfield*/);\n+virtual bool on_choke ();\n+virtual bool on_have (piece_index_t);\n+virtual bool on_interested ();\n+virtual bool on_not_interested ();\n+virtual bool on_request (peer_request const&);\n+virtual bool on_unchoke ();\n+virtual bool on_allowed_fast (piece_index_t);\n+virtual bool on_have_none ();\n+virtual bool on_have_all ();\n
\n-set the DHT state for the session. This will be taken into account the\n-next time the DHT is started, as if it had been passed in via the\n-session_params on startup.
\n-\n-[report issue]\n-\n-find_torrent() get_torrents()
\n+returning true from any of the message handlers\n+indicates that the plugin has handled the message.\n+it will break the plugin chain traversing and not let\n+anyone else handle the message, including the default\n+handler.
\n+[report issue]\n+\n+on_piece()
\n \n-torrent_handle find_torrent (sha1_hash const& info_hash) const;\n-std::vector<torrent_handle> get_torrents () const;\n+virtual bool on_piece (peer_request const& /*piece*/\n+ , span<char const> /*buf*/);\n
\n-find_torrent() looks for a torrent with the given info-hash. In\n-case there is such a torrent in the session, a torrent_handle to that\n-torrent is returned. In case the torrent cannot be found, an invalid\n-torrent_handle is returned.
\n-See torrent_handle::is_valid() to know if the torrent was found or\n-not.
\n-get_torrents() returns a vector of torrent_handles to all the\n-torrents currently in the session.
\n-\n-[report issue]\n-\n-add_torrent() async_add_torrent()
\n+This function is called when the peer connection is receiving\n+a piece. buf points (non-owning pointer) to the data in an\n+internal immutable disk buffer. The length of the data is specified\n+in the length member of the piece parameter.\n+returns true to indicate that the piece is handled and the\n+rest of the logic should be ignored.
\n+\n+\n+\n+\n+[report issue]\n+\n+sent_unchoke() sent_have() sent_interested() sent_not_interested() sent_piece()
\n \n-torrent_handle add_torrent (add_torrent_params&& params);\n-torrent_handle add_torrent (add_torrent_params&& params, error_code& ec);\n-torrent_handle add_torrent (add_torrent_params const& params, error_code& ec);\n-void async_add_torrent (add_torrent_params&& params);\n-torrent_handle add_torrent (add_torrent_params const& params);\n-void async_add_torrent (add_torrent_params const& params);\n+virtual void sent_not_interested ();\n+virtual void sent_have (piece_index_t);\n+virtual void sent_interested ();\n+virtual void sent_piece (peer_request const&);\n+virtual void sent_unchoke ();\n
\n-You add torrents through the add_torrent() function where you give an\n-object with all the parameters. The add_torrent() overloads will block\n-until the torrent has been added (or failed to be added) and returns\n-an error code and a torrent_handle. In order to add torrents more\n-efficiently, consider using async_add_torrent() which returns\n-immediately, without waiting for the torrent to add. Notification of\n-the torrent being added is sent as add_torrent_alert.
\n-The overload that does not take an error_code throws an exception on\n-error and is not available when building without exception support.\n-The torrent_handle returned by add_torrent() can be used to retrieve\n-information about the torrent's progress, its peers etc. It is also\n-used to abort a torrent.
\n-If the torrent you are trying to add already exists in the session (is\n-either queued for checking, being checked or downloading)\n-add_torrent() will throw system_error which derives from\n-std::exception unless duplicate_is_error is set to false. In that\n-case, add_torrent() will return the handle to the existing torrent.
\n-The add_torrent_params class has a flags field. It can be used to\n-control what state the new torrent will be added in. Common flags to\n-want to control are torrent_flags::paused and\n-torrent_flags::auto_managed. In order to add a magnet link that will\n-just download the metadata, but no payload, set the\n-torrent_flags::upload_mode flag.
\n-Special consideration has to be taken when adding hybrid torrents\n-(i.e. torrents that are BitTorrent v2 torrents that are backwards\n-compatible with v1). For more details, see BitTorrent v2 torrents.
\n-\n-\n-[report issue]\n-\n-pause() is_paused() resume()
\n+called after a choke message has been sent to the peer
\n+[report issue]\n+\n+sent_payload()
\n \n-void pause ();\n-void resume ();\n-bool is_paused () const;\n+virtual void sent_payload (int /* bytes */);\n
\n-Pausing the session has the same effect as pausing every torrent in\n-it, except that torrents will not be resumed by the auto-manage\n-mechanism. Resuming will restore the torrents to their previous paused\n-state. i.e. the session pause state is separate from the torrent pause\n-state. A torrent is inactive if it is paused or if the session is\n-paused.
\n-[report issue]\n-\n-is_dht_running()
\n+called after piece data has been sent to the peer\n+this can be used for stats book keeping
\n+[report issue]\n+\n+can_disconnect()
\n \n-bool is_dht_running () const;\n+virtual bool can_disconnect (error_code const& /*ec*/);\n
\n-is_dht_running() returns true if the DHT support has been started\n-and false otherwise.
\n-[report issue]\n-\n-set_dht_storage()
\n+called when libtorrent think this peer should be disconnected.\n+if the plugin returns false, the peer will not be disconnected.
\n+[report issue]\n+\n+on_extended()
\n \n-void set_dht_storage (dht::dht_storage_constructor_type sc);\n+virtual bool on_extended (int /*length*/, int /*msg*/,\n+ span<char const> /*body*/);\n
\n-set_dht_storage set a dht custom storage constructor function\n-to be used internally when the dht is created.
\n-Since the dht storage is a critical component for the dht behavior,\n-this function will only be effective the next time the dht is started.\n-If you never touch this feature, a default map-memory based storage\n-is used.
\n-If you want to make sure the dht is initially created with your\n-custom storage, create a session with the setting\n-settings_pack::enable_dht to false, set your constructor function\n-and call apply_settings with settings_pack::enable_dht to true.
\n-[report issue]\n-\n-add_dht_node()
\n+called when an extended message is received. If returning true,\n+the message is not processed by any other plugin and if false\n+is returned the next plugin in the chain will receive it to\n+be able to handle it. This is not called for web seeds.\n+thus function may be called more than once per incoming message, but\n+only the last of the calls will the body size equal the length.\n+i.e. Every time another fragment of the message is received, this\n+function will be called, until finally the whole message has been\n+received. The purpose of this is to allow early disconnects for invalid\n+messages and for reporting progress of receiving large messages.
\n+[report issue]\n+\n+on_unknown_message()
\n \n-void add_dht_node (std::pair<std::string, int> const& node);\n+virtual bool on_unknown_message (int /*length*/, int /*msg*/,\n+ span<char const> /*body*/);\n
\n-add_dht_node takes a host name and port pair. That endpoint will be\n-pinged, and if a valid DHT reply is received, the node will be added to\n-the routing table.
\n-[report issue]\n-\n+\n+on_piece_pass() on_piece_failed()
\n \n-void dht_get_item (sha1_hash const& target);\n+virtual void on_piece_pass (piece_index_t);\n+virtual void on_piece_failed (piece_index_t);\n
\n-query the DHT for an immutable item at the target hash.\n-the result is posted as a dht_immutable_item_alert.
\n-[report issue]\n-\n-dht_get_item()
\n+called when a piece that this peer participated in either\n+fails or passes the hash_check
\n+[report issue]\n+\n+tick()
\n \n-void dht_get_item (std::array<char, 32> key\n- , std::string salt = std::string());\n+virtual void tick ();\n
\n-query the DHT for a mutable item under the public key key.\n-this is an ed25519 key. salt is optional and may be left\n-as an empty string if no salt is to be used.\n-if the item is found in the DHT, a dht_mutable_item_alert is\n-posted.
\n-[report issue]\n-\n+\n+write_request()
\n \n-sha1_hash dht_put_item (entry data);\n+virtual bool write_request (peer_request const&);\n
\n-store the given bencoded data as an immutable item in the DHT.\n-the returned hash is the key that is to be used to look the item\n-up again. It's just the SHA-1 hash of the bencoded form of the\n-structure.
\n-[report issue]\n-\n-dht_put_item()
\n+called each time a request message is to be sent. If true\n+is returned, the original request message won't be sent and\n+no other plugin will have this function called.
\n+[report issue]\n+\n+\n+crypto_plugin
\n+Declared in "libtorrent/extensions.hpp"
\n \n-void dht_put_item (std::array<char, 32> key\n- , std::function<void(entry&, std::array<char, 64>&\n- , std::int64_t&, std::string const&)> cb\n- , std::string salt = std::string());\n+struct crypto_plugin\n+{\n+ virtual void set_outgoing_key (span<char const> key) = 0;\n+ virtual void set_incoming_key (span<char const> key) = 0;\n+ encrypt (span<span<char>> /*send_vec*/) = 0;\n+ virtual std::tuple<int, int, int> decrypt (span<span<char>> /*receive_vec*/) = 0;\n+};\n \n-store a mutable item. The key is the public key the blob is\n-to be stored under. The optional salt argument is a string that\n-is to be mixed in with the key when determining where in the DHT\n-the value is to be stored. The callback function is called from within\n-the libtorrent network thread once we've found where to store the blob,\n-possibly with the current value stored under the key.\n-The values passed to the callback functions are:
\n-\n-- entry& value
\n-- the current value stored under the key (may be empty). Also expected\n-to be set to the value to be stored by the function.
\n-- std::array<char,64>& signature
\n-- the signature authenticating the current value. This may be zeros\n-if there is currently no value stored. The function is expected to\n-fill in this buffer with the signature of the new value to store.\n-To generate the signature, you may want to use the\n-sign_mutable_item function.
\n-- std::int64_t& seq
\n-- current sequence number. May be zero if there is no current value.\n-The function is expected to set this to the new sequence number of\n-the value that is to be stored. Sequence numbers must be monotonically\n-increasing. Attempting to overwrite a value with a lower or equal\n-sequence number will fail, even if the signature is correct.
\n-- std::string const& salt
\n-- this is the salt that was used for this put call.
\n-
\n-Since the callback function cb is called from within libtorrent,\n-it is critical to not perform any blocking operations. Ideally not\n-even locking a mutex. Pass any data required for this function along\n-with the function object's context and make the function entirely\n-self-contained. The only reason data blob's value is computed\n-via a function instead of just passing in the new value is to avoid\n-race conditions. If you want to update the value in the DHT, you\n-must first retrieve it, then modify it, then write it back. The way\n-the DHT works, it is natural to always do a lookup before storing and\n-calling the callback in between is convenient.
\n-\n-[report issue]\n-\n-dht_get_peers() dht_announce()
\n+[report issue]\n+decrypt()
\n \n-void dht_get_peers (sha1_hash const& info_hash);\n-void dht_announce (sha1_hash const& info_hash, int port = 0, dht::announce_flags_t flags = {});\n+virtual std::tuple<int, int, int> decrypt (span<span<char>> /*receive_vec*/) = 0;\n \n-dht_get_peers() will issue a DHT get_peer request to the DHT for the\n-specified info-hash. The response (the peers) will be posted back in a\n-dht_get_peers_reply_alert.
\n-dht_announce() will issue a DHT announce request to the DHT to the\n-specified info-hash, advertising the specified port. If the port is\n-left at its default, 0, the port will be implied by the DHT message's\n-source port (which may improve connectivity through a NAT).
\n-Both these functions are exposed for advanced custom use of the DHT.\n-All torrents eligible to be announce to the DHT will be automatically,\n-by libtorrent.
\n-For possible flags, see announce_flags_t.
\n-[report issue]\n-\n-dht_live_nodes()
\n+decrypt the provided buffers.\n+returns is a tuple representing the values\n+(consume, produce, packet_size)
\n+consume is set to the number of bytes which should be trimmed from the\n+head of the buffers, default is 0
\n+produce is set to the number of bytes of payload which are now ready to\n+be sent to the upper layer. default is the number of bytes passed in receive_vec
\n+packet_size is set to the minimum number of bytes which must be read to\n+advance the next step of decryption. default is 0
\n+[report issue]\n+\n+\n+peer_connection_handle
\n+Declared in "libtorrent/peer_connection_handle.hpp"
\n+the peer_connection_handle class provides a handle to the internal peer\n+connection object, to be used by plugins. This is a low level interface that\n+may not be stable across libtorrent versions
\n \n-void dht_live_nodes (sha1_hash const& nid);\n+struct peer_connection_handle\n+{\n+ explicit peer_connection_handle (std::weak_ptr<peer_connection> impl);\n+ connection_type type () const;\n+ peer_plugin const* find_plugin (string_view type) const;\n+ void add_extension (std::shared_ptr<peer_plugin>);\n+ bool is_seed () const;\n+ bool upload_only () const;\n+ peer_id const& pid () const;\n+ bool has_piece (piece_index_t i) const;\n+ bool is_interesting () const;\n+ bool is_choked () const;\n+ bool has_peer_choked () const;\n+ bool is_peer_interested () const;\n+ void choke_this_peer ();\n+ void maybe_unchoke_this_peer ();\n+ void get_peer_info (peer_info& p) const;\n+ torrent_handle associated_torrent () const;\n+ tcp::endpoint const& remote () const;\n+ tcp::endpoint local_endpoint () const;\n+ bool is_outgoing () const;\n+ bool is_disconnecting () const;\n+ bool is_connecting () const;\n+ void disconnect (error_code const& ec, operation_t op\n+ , disconnect_severity_t = peer_connection_interface::normal);\n+ bool ignore_unchoke_slots () const;\n+ bool on_local_network () const;\n+ bool failed () const;\n+ bool should_log (peer_log_alert::direction_t direction) const;\n+ void peer_log (peer_log_alert::direction_t direction\n+ , char const* event, char const* fmt = "", ...) const TORRENT_FORMAT(4,5);\n+ bool can_disconnect (error_code const& ec) const;\n+ bool has_metadata () const;\n+ bool in_handshake () const;\n+ void send_buffer (char const* begin, int size);\n+ time_point time_of_last_unchoke () const;\n+ std::time_t last_seen_complete () const;\n+ bool operator!= (peer_connection_handle const& o) const;\n+ bool operator< (peer_connection_handle const& o) const;\n+ bool operator== (peer_connection_handle const& o) const;\n+ std::shared_ptr<peer_connection> native_handle () const;\n+};\n \n-Retrieve all the live DHT (identified by nid) nodes. All the\n-nodes id and endpoint will be returned in the list of nodes in the\n-alert dht_live_nodes_alert.\n-Since this alert is a response to an explicit call, it will always be\n-posted, regardless of the alert mask.
\n-[report issue]\n-\n+\n+bt_peer_connection_handle
\n+Declared in "libtorrent/peer_connection_handle.hpp"
\n+The bt_peer_connection_handle provides a handle to the internal bittorrent\n+peer connection object to plugins. It's low level and may not be a stable API\n+across libtorrent versions.
\n \n-void dht_sample_infohashes (udp::endpoint const& ep, sha1_hash const& target);\n+struct bt_peer_connection_handle : peer_connection_handle\n+{\n+ explicit bt_peer_connection_handle (peer_connection_handle pc);\n+ bool support_extensions () const;\n+ bool packet_finished () const;\n+ bool supports_encryption () const;\n+ void switch_recv_crypto (std::shared_ptr<crypto_plugin> crypto);\n+ void switch_send_crypto (std::shared_ptr<crypto_plugin> crypto);\n+ std::shared_ptr<bt_peer_connection> native_handle () const;\n+};\n \n-Query the DHT node specified by ep to retrieve a sample of the\n-info-hashes that the node currently have in their storage.\n-The target is included for iterative lookups so that indexing nodes\n-can perform a key space traversal with a single RPC per node by adjusting\n-the target value for each RPC. It has no effect on the returned sample value.\n-The result is posted as a dht_sample_infohashes_alert.
\n-[report issue]\n-\n+\n+create_ut_pex_plugin()
\n+Declared in "libtorrent/extensions/ut_pex.hpp"
\n \n-void dht_direct_request (udp::endpoint const& ep, entry const& e, client_data_t userdata = {});\n+std::shared_ptr<torrent_plugin> create_ut_pex_plugin (torrent_handle const&, client_data_t);\n \n-Send an arbitrary DHT request directly to the specified endpoint. This\n-function is intended for use by plugins. When a response is received\n-or the request times out, a dht_direct_response_alert will be posted\n-with the response (if any) and the userdata pointer passed in here.\n-Since this alert is a response to an explicit call, it will always be\n-posted, regardless of the alert mask.
\n-[report issue]\n-\n-add_extension()
\n+constructor function for the ut_pex extension. The ut_pex\n+extension allows peers to gossip about their connections, allowing\n+the swarm stay well connected and peers aware of more peers in the\n+swarm. This extension is enabled by default unless explicitly disabled in\n+the session constructor.
\n+This can either be passed in the add_torrent_params::extensions field, or\n+via torrent_handle::add_extension().
\n+[report issue]\n+\n+create_smart_ban_plugin()
\n+Declared in "libtorrent/extensions/smart_ban.hpp"
\n \n-void add_extension (std::shared_ptr<plugin> ext);\n-void add_extension (std::function<std::shared_ptr<torrent_plugin>(\n- torrent_handle const&, client_data_t)> ext);\n+std::shared_ptr<torrent_plugin> create_smart_ban_plugin (torrent_handle const&, client_data_t);\n
\n-This function adds an extension to this session. The argument is a\n-function object that is called with a torrent_handle and which should\n-return a std::shared_ptr<torrent_plugin>. To write custom\n-plugins, see libtorrent plugins. For the typical bittorrent client\n-all of these extensions should be added. The main plugins implemented\n-in libtorrent are:
\n-\n-- uTorrent metadata
\n-- Allows peers to download the metadata (.torrent files) from the swarm\n-directly. Makes it possible to join a swarm with just a tracker and\n-info-hash.
\n-
\n-\n-#include <libtorrent/extensions/ut_metadata.hpp>\n-ses.add_extension(<::create_ut_metadata_plugin);\n+constructor function for the smart ban extension. The extension keeps\n+track of the data peers have sent us for failing pieces and once the\n+piece completes and passes the hash check bans the peers that turned\n+out to have sent corrupt data.\n+This function can either be passed in the add_torrent_params::extensions\n+field, or via torrent_handle::add_extension().
\n+[report issue]
\n+\n+create_ut_metadata_plugin()
\n+Declared in "libtorrent/extensions/ut_metadata.hpp"
\n+\n+std::shared_ptr<torrent_plugin> create_ut_metadata_plugin (torrent_handle const&, client_data_t);\n
\n-\n-- uTorrent peer exchange
\n-- Exchanges peers between clients.
\n-
\n+constructor function for the ut_metadata extension. The ut_metadata\n+extension allows peers to request the .torrent file (or more\n+specifically the info-dictionary of the .torrent file) from each\n+other. This is the main building block in making magnet links work.\n+This extension is enabled by default unless explicitly disabled in\n+the session constructor.
\n+This can either be passed in the add_torrent_params::extensions field, or\n+via torrent_handle::add_extension().
\n+This section describes the functions and classes that are used\n+to create torrent files. It is a layered API with low level classes\n+and higher level convenience functions. A torrent is created in 4\n+steps:
\n+\n+- first the files that will be part of the torrent are determined.
\n+- the torrent properties are set, such as tracker url, web seeds,\n+DHT nodes etc.
\n+- Read through all the files in the torrent, SHA-1 all the data\n+and set the piece hashes.
\n+- The torrent is bencoded into a file or buffer.
\n+
\n+If there are a lot of files and or deep directory hierarchies to\n+traverse, step one can be time consuming.
\n+Typically step 3 is by far the most time consuming step, since it\n+requires to read all the bytes from all the files in the torrent.
\n+All of these classes and functions are declared by including\n+libtorrent/create_torrent.hpp.
\n+example:
\n \n-#include <libtorrent/extensions/ut_pex.hpp>\n-ses.add_extension(<::create_ut_pex_plugin);\n+file_storage fs;\n+\n+// recursively adds files in directories\n+add_files(fs, "./my_torrent");\n+\n+create_torrent t(fs);\n+t.add_tracker("http://my.tracker.com/announce");\n+t.set_creator("libtorrent example");\n+\n+// reads the files and calculates the hashes\n+set_piece_hashes(t, ".");\n+\n+ofstream out("my_torrent.torrent", std::ios_base::binary);\n+std::vector<char> buf = t.generate_buf();\n+out.write(buf.data(), buf.size());\n+\n+// alternatively, generate an entry and encode it directly to an ostream\n+// iterator\n+bencode(std::ostream_iterator<char>(out), t.generate());\n
\n-\n-- smart ban plugin
\n-- A plugin that, with a small overhead, can ban peers\n-that sends bad data with very high accuracy. Should\n-eliminate most problems on poisoned torrents.
\n-
\n-\n-#include <libtorrent/extensions/smart_ban.hpp>\n-ses.add_extension(<::create_smart_ban_plugin);\n+[report issue]
\n+\n+create_torrent
\n+Declared in "libtorrent/create_torrent.hpp"
\n+This class holds state for creating a torrent. After having added\n+all information to it, call create_torrent::generate() to generate\n+the torrent. The entry that's returned can then be bencoded into a\n+.torrent file using bencode().
\n+\n+struct create_torrent\n+{\n+ explicit create_torrent (torrent_info const& ti);\n+ explicit create_torrent (file_storage& fs, int piece_size = 0\n+ , create_flags_t flags = {});\n+ entry generate () const;\n+ std::vector<char> generate_buf () const;\n+ file_storage const& files () const;\n+ void set_comment (char const* str);\n+ void set_creator (char const* str);\n+ void set_creation_date (std::time_t timestamp);\n+ void set_hash (piece_index_t index, sha1_hash const& h);\n+ void set_hash2 (file_index_t file, piece_index_t::diff_type piece, sha256_hash const& h);\n+ void add_http_seed (string_view url);\n+ void add_url_seed (string_view url);\n+ void add_node (std::pair<std::string, int> node);\n+ void add_tracker (string_view url, int tier = 0);\n+ void set_root_cert (string_view cert);\n+ bool priv () const;\n+ void set_priv (bool p);\n+ bool is_v2_only () const;\n+ bool is_v1_only () const;\n+ int num_pieces () const;\n+ piece_index_t end_piece () const;\n+ index_range<piece_index_t> piece_range () const noexcept;\n+ file_index_t end_file () const;\n+ index_range<file_index_t> file_range () const noexcept;\n+ index_range<piece_index_t::diff_type> file_piece_range (file_index_t f);\n+ std::int64_t total_size () const;\n+ int piece_size (piece_index_t i) const;\n+ int piece_length () const;\n+ void add_collection (string_view c);\n+ void add_similar_torrent (sha1_hash ih);\n+\n+ static constexpr create_flags_t modification_time = 2_bit;\n+ static constexpr create_flags_t symlinks = 3_bit;\n+ static constexpr create_flags_t v2_only = 5_bit;\n+ static constexpr create_flags_t v1_only = 6_bit;\n+ static constexpr create_flags_t canonical_files = 7_bit;\n+ static constexpr create_flags_t no_attributes = 8_bit;\n+ static constexpr create_flags_t canonical_files_no_tail_padding = 9_bit;\n+};\n \n-\n-[report issue]\n-\n-set_ip_filter() get_ip_filter()
\n+[report issue]\n+create_torrent()
\n \n-void set_ip_filter (ip_filter f);\n-ip_filter get_ip_filter () const;\n+explicit create_torrent (torrent_info const& ti);\n+explicit create_torrent (file_storage& fs, int piece_size = 0\n+ , create_flags_t flags = {});\n \n-Sets a filter that will be used to reject and accept incoming as well\n-as outgoing connections based on their originating ip address. The\n-default filter will allow connections to any ip address. To build a\n-set of rules for which addresses are accepted and not, see ip_filter.
\n-Each time a peer is blocked because of the IP filter, a\n-peer_blocked_alert is generated. get_ip_filter() Returns the\n-ip_filter currently in the session. See ip_filter.
\n-[report issue]\n-\n-set_port_filter()
\n+The piece_size is the size of each piece in bytes. It must be a\n+power of 2 and a minimum of 16 kiB. If a piece size of 0 is\n+specified, a piece_size will be set automatically.
\n+The flags arguments specifies options for the torrent creation. It can\n+be any combination of the flags defined by create_flags_t.
\n+The file_storage (fs) parameter defines the files, sizes and\n+their properties for the torrent to be created. Set this up first,\n+before passing it to the create_torrent constructor.
\n+The overload that takes a torrent_info object will make a verbatim\n+copy of its info dictionary (to preserve the info-hash). The copy of\n+the info dictionary will be used by create_torrent::generate(). This means\n+that none of the member functions of create_torrent that affects\n+the content of the info dictionary (such as set_hash()), will\n+have any affect. Instead of using this overload, consider using\n+write_torrent_file() instead.
\n+\n+Warning
\n+The file_storage and torrent_info objects must stay alive for the\n+entire duration of the create_torrent object.
\n+\n+\n+[report issue]\n+\n+generate() generate_buf()
\n \n-void set_port_filter (port_filter const& f);\n+entry generate () const;\n+std::vector<char> generate_buf () const;\n
\n-apply port_filter f to incoming and outgoing peers. a port filter\n-will reject making outgoing peer connections to certain remote ports.\n-The main intention is to be able to avoid triggering certain\n-anti-virus software by connecting to SMTP, FTP ports.
\n-\n-\n-[report issue]\n-\n-listen_port() is_listening() ssl_listen_port()
\n+This function will generate the .torrent file as a bencode tree, or a\n+bencoded into a buffer.\n+In order to encode the entry into a flat file, use the bencode() function.
\n+The function returning an entry may be useful to add custom entries\n+to the torrent file before bencoding it and saving it to disk.
\n+Whether the resulting torrent object is v1, v2 or hybrid depends on\n+whether any of the v1_only or v2_only flags were set on the\n+constructor. If neither were set, the resulting torrent depends on\n+which hashes were set. If both v1 and v2 hashes were set, a hybrid\n+torrent is created.
\n+Any failure will cause this function to throw system_error, with an\n+appropriate error message. These are the reasons this call may throw:
\n+\n+- the file storage has 0 files
\n+- the total size of the file storage is 0 bytes (i.e. it only has\n+empty files)
\n+- not all v1 hashes (set_hash()) and not all v2 hashes (set_hash2())\n+were set
\n+- for v2 torrents, you may not have a directory with the same name as\n+a file. If that's encountered in the file storage, generate()\n+fails.
\n+
\n+[report issue]\n+\n+files()
\n \n-bool is_listening () const;\n-unsigned short listen_port () const;\n-unsigned short ssl_listen_port () const;\n+file_storage const& files () const;\n
\n-is_listening() will tell you whether or not the session has\n-successfully opened a listening port. If it hasn't, this function will\n-return false, and then you can set a new\n-settings_pack::listen_interfaces to try another interface and port to\n-bind to.
\n-listen_port() returns the port we ended up listening on.
\n-\n-[report issue]\n-\n-set_peer_class_filter() get_peer_class_filter()
\n+returns an immutable reference to the file_storage used to create\n+the torrent from.
\n+[report issue]\n+\n+set_comment()
\n \n-void set_peer_class_filter (ip_filter const& f);\n-ip_filter get_peer_class_filter () const;\n+void set_comment (char const* str);\n
\n-Sets the peer class filter for this session. All new peer connections\n-will take this into account and be added to the peer classes specified\n-by this filter, based on the peer's IP address.
\n-The ip-filter essentially maps an IP -> uint32. Each bit in that 32\n-bit integer represents a peer class. The least significant bit\n-represents class 0, the next bit class 1 and so on.
\n-For more info, see ip_filter.
\n-For example, to make all peers in the range 200.1.1.0 - 200.1.255.255\n-belong to their own peer class, apply the following filter:
\n-\n-ip_filter f = ses.get_peer_class_filter();\n-peer_class_t my_class = ses.create_peer_class("200.1.x.x IP range");\n-f.add_rule(make_address("200.1.1.0"), make_address("200.1.255.255")\n- , 1 << static_cast<std::uint32_t>(my_class));\n-ses.set_peer_class_filter(f);\n+Sets the comment for the torrent. The string str should be utf-8 encoded.\n+The comment in a torrent file is optional.
\n+[report issue]
\n+\n+set_creator()
\n+\n+void set_creator (char const* str);\n
\n-This setting only applies to new connections, it won't affect existing\n-peer connections.
\n-This function is limited to only peer class 0-31, since there are only\n-32 bits in the IP range mapping. Only the set bits matter; no peer\n-class will be removed from a peer as a result of this call, peer\n-classes are only added.
\n-The peer_class argument cannot be greater than 31. The bitmasks\n-representing peer classes in the peer_class_filter are 32 bits.
\n-The get_peer_class_filter() function returns the current filter.
\n-For more information, see peer classes.
\n-\n-[report issue]\n-\n-get_peer_class_type_filter() set_peer_class_type_filter()
\n+Sets the creator of the torrent. The string str should be utf-8 encoded.\n+This is optional.
\n+[report issue]\n+\n+set_creation_date()
\n \n-peer_class_type_filter get_peer_class_type_filter () const;\n-void set_peer_class_type_filter (peer_class_type_filter const& f);\n+void set_creation_date (std::time_t timestamp);\n
\n-Sets and gets the peer class type filter. This is controls automatic\n-peer class assignments to peers based on what kind of socket it is.
\n-It does not only support assigning peer classes, it also supports\n-removing peer classes based on socket type.
\n-The order of these rules being applied are:
\n-\n-- peer-class IP filter
\n-- peer-class type filter, removing classes
\n-- peer-class type filter, adding classes
\n-
\n-For more information, see peer classes.
\n-[report issue]\n-\n-create_peer_class()
\n+sets the "creation time" field. Defaults to the system clock at the\n+time of construction of the create_torrent object. The timestamp is\n+specified in seconds, posix time. If the creation date is set to 0,\n+the "creation date" field will be omitted from the generated torrent.
\n+[report issue]\n+\n+set_hash()
\n \n-peer_class_t create_peer_class (char const* name);\n+void set_hash (piece_index_t index, sha1_hash const& h);\n
\n-Creates a new peer class (see peer classes) with the given name. The\n-returned integer is the new peer class identifier. Peer classes may\n-have the same name, so each invocation of this function creates a new\n-class and returns a unique identifier.
\n-Identifiers are assigned from low numbers to higher. So if you plan on\n-using certain peer classes in a call to set_peer_class_filter(),\n-make sure to create those early on, to get low identifiers.
\n-For more information on peer classes, see peer classes.
\n-[report issue]\n-\n-delete_peer_class()
\n+This sets the SHA-1 hash for the specified piece (index). You are required\n+to set the hash for every piece in the torrent before generating it. If you have\n+the files on disk, you can use the high level convenience function to do this.\n+See set_piece_hashes().\n+A SHA-1 hash of all zeros is internally used to indicate a hash that\n+has not been set. Setting such hash will not be considered set when\n+calling generate().\n+This function will throw std::system_error if it is called on an\n+object constructed with the v2_only flag.
\n+[report issue]\n+\n+set_hash2()
\n \n-void delete_peer_class (peer_class_t cid);\n+void set_hash2 (file_index_t file, piece_index_t::diff_type piece, sha256_hash const& h);\n
\n-This call dereferences the reference count of the specified peer\n-class. When creating a peer class it's automatically referenced by 1.\n-If you want to recycle a peer class, you may call this function. You\n-may only call this function once per peer class you create.\n-Calling it more than once for the same class will lead to memory\n-corruption.
\n-Since peer classes are reference counted, this function will not\n-remove the peer class if it's still assigned to torrents or peers. It\n-will however remove it once the last peer and torrent drops their\n-references to it.
\n-There is no need to call this function for custom peer classes. All\n-peer classes will be properly destructed when the session object\n-destructs.
\n-For more information on peer classes, see peer classes.
\n-\n-[report issue]\n-\n-get_peer_class() set_peer_class()
\n+sets the bittorrent v2 hash for file file of the piece piece.\n+piece is relative to the first piece of the file, starting at 0. The\n+first piece in the file can be computed with\n+file_storage::file_index_at_piece().\n+The hash, h, is the root of the merkle tree formed by the piece's\n+16 kiB blocks. Note that piece sizes must be powers-of-2, so all\n+per-piece merkle trees are complete.\n+A SHA-256 hash of all zeros is internally used to indicate a hash\n+that has not been set. Setting such hash will not be considered set\n+when calling generate().\n+This function will throw std::system_error if it is called on an\n+object constructed with the v1_only flag.
\n+\n+[report issue]\n+\n+add_url_seed() add_http_seed()
\n \n-void set_peer_class (peer_class_t cid, peer_class_info const& pci);\n-peer_class_info get_peer_class (peer_class_t cid) const;\n+void add_http_seed (string_view url);\n+void add_url_seed (string_view url);\n
\n-These functions queries information from a peer class and updates the\n-configuration of a peer class, respectively.
\n-cid must refer to an existing peer class. If it does not, the\n-return value of get_peer_class() is undefined.
\n-set_peer_class() sets all the information in the\n-peer_class_info object in the specified peer class. There is no\n-option to only update a single property.
\n-A peer or torrent belonging to more than one class, the highest\n-priority among any of its classes is the one that is taken into\n-account.
\n-For more information, see peer classes.
\n-[report issue]\n-\n-remove_torrent()
\n+This adds a url seed to the torrent. You can have any number of url seeds. For a\n+single file torrent, this should be an HTTP url, pointing to a file with identical\n+content as the file of the torrent. For a multi-file torrent, it should point to\n+a directory containing a directory with the same name as this torrent, and all the\n+files of the torrent in it.
\n+The second function, add_http_seed() adds an HTTP seed instead.
\n+[report issue]\n+\n+add_node()
\n \n-void remove_torrent (const torrent_handle&, remove_flags_t = {});\n+void add_node (std::pair<std::string, int> node);\n \n-remove_torrent() will close all peer connections associated with\n-the torrent and tell the tracker that we've stopped participating in\n-the swarm. This operation cannot fail. When it completes, you will\n-receive a torrent_removed_alert.
\n-remove_torrent() is non-blocking, but will remove the torrent from the\n-session synchronously. Calling session_handle::add_torrent() immediately\n-afterward with the same torrent will succeed. Note that this creates a\n-new handle which is not equal to the removed one.
\n-The optional second argument options can be used to delete all the\n-files downloaded by this torrent. To do so, pass in the value\n-session_handle::delete_files. Once the torrent is deleted, a\n-torrent_deleted_alert is posted.
\n-The torrent_handle remains valid for some time after remove_torrent() is\n-called. It will become invalid only after all libtorrent tasks (such as\n-I/O tasks) release their references to the torrent. Until this happens,\n-torrent_handle::is_valid() will return true, and other calls such\n-as torrent_handle::status() will succeed. Because of this, and because\n-remove_torrent() is non-blocking, the following sequence usually\n-succeeds (does not throw system_error):\n-.. code:: c++
\n-\n-session.remove_handle(handle);\n-handle.save_resume_data();
\n-Note that when a queued or downloading torrent is removed, its position\n-in the download queue is vacated and every subsequent torrent in the\n-queue has their queue positions updated. This can potentially cause a\n-large state_update to be posted. When removing all torrents, it is\n-advised to remove them from the back of the queue, to minimize the\n-shifting.
\n-\n-[report issue]\n-\n-get_settings() apply_settings()
\n+This adds a DHT node to the torrent. This especially useful if you're creating a\n+tracker less torrent. It can be used by clients to bootstrap their DHT node from.\n+The node is a hostname and a port number where there is a DHT node running.\n+You can have any number of DHT nodes in a torrent.
\n+[report issue]\n+\n+add_tracker()
\n \n-void apply_settings (settings_pack&&);\n-void apply_settings (settings_pack const&);\n-settings_pack get_settings () const;\n+void add_tracker (string_view url, int tier = 0);\n
\n-Applies the settings specified by the settings_pack s. This is an\n-asynchronous operation that will return immediately and actually apply\n-the settings to the main thread of libtorrent some time later.
\n-\n-\n-[report issue]\n-\n-wait_for_alert() set_alert_notify() pop_alerts()
\n+Adds a tracker to the torrent. This is not strictly required, but most torrents\n+use a tracker as their main source of peers. The url should be an http:// or udp://\n+url to a machine running a bittorrent tracker that accepts announces for this torrent's\n+info-hash. The tier is the fallback priority of the tracker. All trackers with tier 0 are\n+tried first (in any order). If all fail, trackers with tier 1 are tried. If all of those\n+fail, trackers with tier 2 are tried, and so on.
\n+[report issue]\n+\n+set_root_cert()
\n \n-void set_alert_notify (std::function<void()> const& fun);\n-void pop_alerts (std::vector<alert*>* alerts);\n-alert* wait_for_alert (time_duration max_wait);\n+void set_root_cert (string_view cert);\n
\n-Alerts is the main mechanism for libtorrent to report errors and\n-events. pop_alerts fills in the vector passed to it with pointers\n-to new alerts. The session still owns these alerts and they will stay\n-valid until the next time pop_alerts is called. You may not delete\n-the alert objects.
\n-It is safe to call pop_alerts from multiple different threads, as\n-long as the alerts themselves are not accessed once another thread\n-calls pop_alerts. Doing this requires manual synchronization\n-between the popping threads.
\n-wait_for_alert will block the current thread for max_wait time\n-duration, or until another alert is posted. If an alert is available\n-at the time of the call, it returns immediately. The returned alert\n-pointer is the head of the alert queue. wait_for_alert does not\n-pop alerts from the queue, it merely peeks at it. The returned alert\n-will stay valid until pop_alerts is called twice. The first time\n-will pop it and the second will free it.
\n-If there is no alert in the queue and no alert arrives within the\n-specified timeout, wait_for_alert returns nullptr.
\n-In the python binding, wait_for_alert takes the number of\n-milliseconds to wait as an integer.
\n-The alert queue in the session will not grow indefinitely. Make sure\n-to pop periodically to not miss notifications. To control the max\n-number of alerts that's queued by the session, see\n-settings_pack::alert_queue_size.
\n-Some alerts are considered so important that they are posted even when\n-the alert queue is full. Some alerts are considered mandatory and cannot\n-be disabled by the alert_mask. For instance,\n-save_resume_data_alert and save_resume_data_failed_alert are always\n-posted, regardless of the alert mask.
\n-To control which alerts are posted, set the alert_mask\n-(settings_pack::alert_mask).
\n-If the alert queue fills up to the point where alerts are dropped, this\n-will be indicated by a alerts_dropped_alert, which contains a bitmask\n-of which types of alerts were dropped. Generally it is a good idea to\n-make sure the alert queue is large enough, the alert_mask doesn't have\n-unnecessary categories enabled and to call pop_alert() frequently, to\n-avoid alerts being dropped.
\n-the set_alert_notify function lets the client set a function object\n-to be invoked every time the alert queue goes from having 0 alerts to\n-1 alert. This function is called from within libtorrent, it may be the\n-main thread, or it may be from within a user call. The intention of\n-of the function is that the client wakes up its main thread, to poll\n-for more alerts using pop_alerts(). If the notify function fails\n-to do so, it won't be called again, until pop_alerts is called for\n-some other reason. For instance, it could signal an eventfd, post a\n-message to an HWND or some other main message pump. The actual\n-retrieval of alerts should not be done in the callback. In fact, the\n-callback should not block. It should not perform any expensive work.\n-It really should just notify the main application thread.
\n-The type of an alert is returned by the polymorphic function\n-alert::type() but can also be queries from a concrete type via\n-T::alert_type, as a static constant.
\n-\n-[report issue]\n-\n-delete_port_mapping() add_port_mapping()
\n+This function sets an X.509 certificate in PEM format to the torrent. This makes the\n+torrent an SSL torrent. An SSL torrent requires that each peer has a valid certificate\n+signed by this root certificate. For SSL torrents, all peers are connecting over SSL\n+connections. For more information, see the section on ssl torrents.
\n+The string is not the path to the cert, it's the actual content of the\n+certificate.
\n+\n+[report issue]\n+\n+priv() set_priv()
\n \n-std::vector<port_mapping_t> add_port_mapping (portmap_protocol t, int external_port, int local_port);\n-void delete_port_mapping (port_mapping_t handle);\n+bool priv () const;\n+void set_priv (bool p);\n
\n-add_port_mapping adds one or more port forwards on UPnP and/or NAT-PMP,\n-whichever is enabled. A mapping is created for each listen socket\n-in the session. The return values are all handles referring to the\n-port mappings that were just created. Pass them to delete_port_mapping()\n-to remove them.
\n-[report issue]\n-\n-reopen_network_sockets()
\n+Sets and queries the private flag of the torrent.\n+Torrents with the private flag set ask the client to not use any other\n+sources than the tracker for peers, and to not use DHT to advertise itself publicly,\n+only the tracker.
\n+[report issue]\n+\n+num_pieces()
\n \n-void reopen_network_sockets (reopen_network_flags_t options = reopen_map_ports);\n+int num_pieces () const;\n
\n-Instructs the session to reopen all listen and outgoing sockets.
\n-It's useful in the case your platform doesn't support the built in\n-IP notifier mechanism, or if you have a better more reliable way to\n-detect changes in the IP routing table.
\n-[report issue]\n-\n-native_handle()
\n+returns the number of pieces in the associated file_storage object.
\n+[report issue]\n+\n+piece_range()
\n \n-std::shared_ptr<aux::session_impl> native_handle () const;\n+index_range<piece_index_t> piece_range () const noexcept;\n
\n-This function is intended only for use by plugins. This type does\n-not have a stable API and should be relied on as little as possible.
\n-[report issue]\n-- save_settings
\n-- saves settings (i.e. the settings_pack)
\n-
\n-[report issue]\n-- save_dht_state
\n-- saves dht state such as nodes and node-id, possibly accelerating\n-joining the DHT if provided at next session startup.
\n-
\n-[report issue]\n-- save_extension_state
\n-- load or save state from plugins
\n-
\n-[report issue]\n-- save_ip_filter
\n-- load or save the IP filter set on the session
\n+all piece indices in the torrent to be created
\n+[report issue]
\n+\n+file_range()
\n+\n+index_range<file_index_t> file_range () const noexcept;\n+
\n+all file indices in the torrent to be created
\n+[report issue]\n+\n+file_piece_range()
\n+\n+index_range<piece_index_t::diff_type> file_piece_range (file_index_t f);\n+
\n+for v2 and hybrid torrents only, the pieces in the\n+specified file, specified as delta from the first piece in the file.\n+i.e. the first index is 0.
\n+[report issue]\n+\n+total_size()
\n+\n+std::int64_t total_size () const;\n+
\n+the total number of bytes of all files and pad files
\n+\n+[report issue]\n+\n+piece_length() piece_size()
\n+\n+int piece_size (piece_index_t i) const;\n+int piece_length () const;\n+
\n+piece_length() returns the piece size of all pieces but the\n+last one. piece_size() returns the size of the specified piece.\n+these functions are just forwarding to the associated file_storage.
\n+\n+[report issue]\n+\n+add_similar_torrent() add_collection()
\n+\n+void add_collection (string_view c);\n+void add_similar_torrent (sha1_hash ih);\n+
\n+Add similar torrents (by info-hash) or collections of similar torrents.\n+Similar torrents are expected to share some files with this torrent.\n+Torrents sharing a collection name with this torrent are also expected\n+to share files with this torrent. A torrent may have more than one\n+collection and more than one similar torrents. For more information,\n+see BEP 38.
\n+[report issue]\n+- modification_time
\n+- This will include the file modification time as part of the torrent.\n+This is not enabled by default, as it might cause problems when you\n+create a torrent from separate files with the same content, hoping to\n+yield the same info-hash. If the files have different modification times,\n+with this option enabled, you would get different info-hashes for the\n+files.
\n
\n-\n-\n-[report issue]\n-- global_peer_class_id tcp_peer_class_id local_peer_class_id
\n-- built-in peer classes
\n+[report issue]\n+- symlinks
\n+- If this flag is set, files that are symlinks get a symlink attribute\n+set on them and their data will not be included in the torrent. This\n+is useful if you need to reconstruct a file hierarchy which contains\n+symlinks.
\n
\n-[report issue]\n-- delete_files
\n-- delete the files belonging to the torrent from disk.\n-including the part-file, if there is one
\n+[report issue]\n+- v2_only
\n+- Do not generate v1 metadata. The resulting torrent will only be usable by\n+clients which support v2. This requires setting all v2 hashes, with\n+set_hash2() before calling generate(). Setting v1 hashes (with\n+set_hash()) is an error with this flag set.
\n
\n-[report issue]\n-- delete_partfile
\n-- delete just the part-file associated with this torrent
\n+[report issue]\n+- v1_only
\n+- do not generate v2 metadata or enforce v2 alignment and padding rules\n+this is mainly for tests, not recommended for production use. This\n+requires setting all v1 hashes, with set_hash(), before calling\n+generate(). Setting v2 hashes (with set_hash2()) is an error with\n+this flag set.
\n
\n-[report issue]\n-- paused
\n-- when set, the session will start paused. Call\n-session_handle::resume() to start
\n+[report issue]\n+- canonical_files
\n+- This flag only affects v1-only torrents, and is only relevant\n+together with the v1_only_flag. This flag will force the\n+same file order and padding as a v2 (or hybrid) torrent would have.\n+It has the effect of ordering files and inserting pad files to align\n+them with piece boundaries.
\n
\n-\n-[report issue]\n-- udp tcp
\n-- protocols used by add_port_mapping()
\n+[report issue]\n+- no_attributes
\n+- passing this flag to add_files() will ignore file attributes (such as\n+executable or hidden) when adding the files to the file storage.\n+Since not all filesystems and operating systems support all file\n+attributes the resulting torrent may differ depending on where it's\n+created. If it's important for torrents to be created consistently\n+across systems, this flag should be set.
\n
\n-[report issue]\n-- reopen_map_ports
\n-- This option indicates if the ports are mapped using natpmp\n-and upnp. If mapping was already made, they are deleted and added\n-again. This only works if natpmp and/or upnp are configured to be\n-enable.
\n+[report issue]\n+- canonical_files_no_tail_padding
\n+- this flag enforces the file layout to be canonical according to the\n+bittorrent v2 specification (just like the canonical_files flag)\n+with the one exception that tail padding is not added to the last\n+file.\n+This behavior deviates from the specification but was the way\n+libtorrent created torrents in version up to and including 2.0.7.\n+This flag is here for backwards compatibility.
\n
\n-[report issue]
\n+[report issue]\n \n-\n-session_params
\n-Declared in "libtorrent/session_params.hpp"
\n-The session_params is a parameters pack for configuring the session\n-before it's started.
\n+\n+add_files()
\n+Declared in "libtorrent/create_torrent.hpp"
\n \n-struct session_params\n+void add_files (file_storage& fs, std::string const& file\n+ , create_flags_t flags = {});\n+void add_files (file_storage& fs, std::string const& file\n+ , std::function<bool(std::string)> p, create_flags_t flags = {});\n+\n+Adds the file specified by path to the file_storage object. In case path\n+refers to a directory, files will be added recursively from the directory.
\n+If specified, the predicate p is called once for every file and directory that\n+is encountered. Files for which p returns true are added, and directories for\n+which p returns true are traversed. p must have the following signature:
\n+\n+bool Pred(std::string const& p);\n+
\n+The path that is passed in to the predicate is the full path of the file or\n+directory. If no predicate is specified, all files are added, and all directories\n+are traversed.
\n+The ".." directory is never traversed.
\n+The flags argument should be the same as the flags passed to the create_torrent\n+constructor.
\n+[report issue]\n+\n+set_piece_hashes()
\n+Declared in "libtorrent/create_torrent.hpp"
\n+\n+void set_piece_hashes (create_torrent& t, std::string const& p\n+ , std::function<void(piece_index_t)> const& f, error_code& ec);\n+void set_piece_hashes (create_torrent& t, std::string const& p\n+ , settings_interface const& settings\n+ , std::function<void(piece_index_t)> const& f, error_code& ec);\n+inline void set_piece_hashes (create_torrent& t, std::string const& p, error_code& ec);\n+inline void set_piece_hashes (create_torrent& t, std::string const& p\n+ , std::function<void(piece_index_t)> const& f);\n+inline void set_piece_hashes (create_torrent& t, std::string const& p);\n+void set_piece_hashes (create_torrent& t, std::string const& p\n+ , settings_interface const& settings, disk_io_constructor_type disk_io\n+ , std::function<void(piece_index_t)> const& f, error_code& ec);\n+inline void set_piece_hashes (create_torrent& t, std::string const& p\n+ , settings_interface const& settings\n+ , std::function<void(piece_index_t)> const& f);\n+
\n+This function will assume that the files added to the torrent file exists at path\n+p, read those files and hash the content and set the hashes in the create_torrent\n+object. The optional function f is called in between every hash that is set. f\n+must have the following signature:
\n+\n+void Fun(piece_index_t);\n+
\n+The overloads taking a settings_pack may be used to configure the\n+underlying disk access. Such as settings_pack::aio_threads.
\n+The overloads that don't take an error_code& may throw an exception in case of a\n+file error, the other overloads sets the error code to reflect the error, if any.
\n+Bencoding is a common representation in bittorrent used for dictionary,\n+list, int and string hierarchies. It's used to encode .torrent files and\n+some messages in the network protocol. libtorrent also uses it to store\n+settings, resume data and other session state.
\n+Strings in bencoded structures do not necessarily represent text.\n+Strings are raw byte buffers of a certain length. If a string is meant to be\n+interpreted as text, it is required to be UTF-8 encoded. See BEP 3.
\n+The function for decoding bencoded data bdecode(), returning a bdecode_node.\n+This function builds a tree that points back into the original buffer. The\n+returned bdecode_node will not be valid once the buffer it was parsed out of\n+is discarded.
\n+It's possible to construct an entry from a bdecode_node, if a structure needs\n+to be altered and re-encoded.
\n+[report issue]\n+\n+entry
\n+Declared in "libtorrent/entry.hpp"
\n+The entry class represents one node in a bencoded hierarchy. It works as a\n+variant type, it can be either a list, a dictionary (std::map), an integer\n+or a string.
\n+\n+class entry\n {\n- session_params (settings_pack&& sp);\n- session_params (settings_pack const& sp);\n- session_params ();\n- session_params (settings_pack const& sp\n- , std::vector<std::shared_ptr<plugin>> exts);\n- session_params (settings_pack&& sp\n- , std::vector<std::shared_ptr<plugin>> exts);\n+ data_type type () const;\n+ entry (integer_type);\n+ entry (preformatted_type);\n+ entry (span<char const>);\n+ entry (list_type);\n+ entry (dictionary_type);\n+ entry (U v);\n+ entry (data_type t);\n+ entry (bdecode_node const& n);\n+ entry& operator= (entry const&) &;\n+ entry& operator= (span<char const>) &;\n+ entry& operator= (list_type) &;\n+ entry& operator= (preformatted_type) &;\n+ entry& operator= (dictionary_type) &;\n+ entry& operator= (bdecode_node const&) &;\n+ entry& operator= (entry&&) & noexcept;\n+ entry& operator= (integer_type) &;\n+ entry& operator= (U v) &;\n+ list_type const& list () const;\n+ string_type& string ();\n+ dictionary_type& dict ();\n+ integer_type const& integer () const;\n+ string_type const& string () const;\n+ preformatted_type& preformatted ();\n+ integer_type& integer ();\n+ dictionary_type const& dict () const;\n+ preformatted_type const& preformatted () const;\n+ list_type& list ();\n+ void swap (entry& e);\n+ entry& operator[] (string_view key);\n+ entry const& operator[] (string_view key) const;\n+ entry const* find_key (string_view key) const;\n+ entry* find_key (string_view key);\n+ std::string to_string (bool single_line = false) const;\n \n- settings_pack settings;\n- std::vector<std::shared_ptr<plugin>> extensions;\n- dht::dht_state dht_state;\n- dht::dht_storage_constructor_type dht_storage_constructor;\n- disk_io_constructor_type disk_io_constructor;\n- std::map<std::string, std::string> ext_state;\n- libtorrent::ip_filter ip_filter;\n+ enum data_type\n+ {\n+ int_t,\n+ string_t,\n+ list_t,\n+ dictionary_t,\n+ undefined_t,\n+ preformatted_t,\n+ };\n };\n \n-[report issue]\n-session_params()
\n+[report issue]\n+type()
\n \n-session_params (settings_pack&& sp);\n-session_params (settings_pack const& sp);\n-session_params ();\n+data_type type () const;\n
\n-This constructor can be used to start with the default plugins\n-(ut_metadata, ut_pex and smart_ban). Pass a settings_pack to set the\n-initial settings when the session starts.
\n-[report issue]\n-\n+\n+entry()
\n \n-session_params (settings_pack const& sp\n- , std::vector<std::shared_ptr<plugin>> exts);\n-session_params (settings_pack&& sp\n- , std::vector<std::shared_ptr<plugin>> exts);\n+entry (integer_type);\n+entry (preformatted_type);\n+entry (span<char const>);\n+entry (list_type);\n+entry (dictionary_type);\n
\n-This constructor helps to configure the set of initial plugins\n-to be added to the session before it's started.
\n-[report issue]\n-- settings
\n-- The settings to configure the session with
\n-
\n-[report issue]\n-- extensions
\n-- the plugins to add to the session as it is constructed
\n-
\n-[report issue]\n-- dht_state
\n-- DHT node ID and node addresses to bootstrap the DHT with.
\n-
\n-[report issue]\n-- dht_storage_constructor
\n-- function object to construct the storage object for DHT items.
\n-
\n-[report issue]\n-- disk_io_constructor
\n-- function object to create the disk I/O subsystem. Defaults to\n-default_disk_io_constructor.
\n-
\n-[report issue]\n-- ext_state
\n-- this container can be used by extensions/plugins to store settings. It's\n-primarily here to make it convenient to save and restore state across\n-sessions, using read_session_params() and write_session_params().
\n-
\n-[report issue]\n-- ip_filter
\n-- the IP filter to use for the session. This restricts which peers are allowed\n-to connect. As if passed to set_ip_filter().
\n-
\n-\n-\n-[report issue]\n-\n-\n-write_session_params_buf() write_session_params() read_session_params()
\n-Declared in "libtorrent/session_params.hpp"
\n+constructors directly from a specific type.\n+The content of the argument is copied into the\n+newly constructed entry
\n+[report issue]\n+\n+entry()
\n \n-entry write_session_params (session_params const& sp\n- , save_state_flags_t flags = save_state_flags_t::all());\n-std::vector<char> write_session_params_buf (session_params const& sp\n- , save_state_flags_t flags = save_state_flags_t::all());\n-session_params read_session_params (span<char const> buf\n- , save_state_flags_t flags = save_state_flags_t::all());\n-session_params read_session_params (bdecode_node const& e\n- , save_state_flags_t flags = save_state_flags_t::all());\n+entry (data_type t);\n
\n-These functions serialize and de-serialize a session_params object to and\n-from bencoded form. The session_params object is used to initialize a new\n-session using the state from a previous one (or by programmatically configure\n-the session up-front).\n-The flags parameter can be used to only save and load certain aspects of the\n-session's state.\n-The _buf suffix indicates the function operates on buffer rather than the\n-bencoded structure.\n-The torrents in a session are not part of the session_params state, they have\n-to be restored separately.
\n-The disk I/O can be customized in libtorrent. In previous versions, the\n-customization was at the level of each torrent. Now, the customization point\n-is at the session level. All torrents added to a session will use the same\n-disk I/O subsystem, as determined by the disk_io_constructor (in\n-session_params).
\n-This allows the disk subsystem to also customize threading and disk job\n-management.
\n-To customize the disk subsystem, implement disk_interface and provide a\n-factory function to the session constructor (via session_params).
\n-Example use:
\n+construct an empty entry of the specified type.\n+see data_type enum.
\n+[report issue]\n+\n+entry()
\n+\n+entry (bdecode_node const& n);\n+
\n+construct from bdecode_node parsed form (see bdecode())
\n+[report issue]\n+\n+operator=()
\n+\n+entry& operator= (entry const&) &;\n+entry& operator= (span<char const>) &;\n+entry& operator= (list_type) &;\n+entry& operator= (preformatted_type) &;\n+entry& operator= (dictionary_type) &;\n+entry& operator= (bdecode_node const&) &;\n+entry& operator= (entry&&) & noexcept;\n+entry& operator= (integer_type) &;\n+
\n+copies the structure of the right hand side into this\n+entry.
\n+\n+\n+\n+\n+[report issue]\n+\n+dict() preformatted() integer() string() list()
\n+\n+list_type const& list () const;\n+string_type& string ();\n+dictionary_type& dict ();\n+integer_type const& integer () const;\n+string_type const& string () const;\n+preformatted_type& preformatted ();\n+integer_type& integer ();\n+dictionary_type const& dict () const;\n+preformatted_type const& preformatted () const;\n+list_type& list ();\n+
\n+The integer(), string(), list() and dict() functions\n+are accessors that return the respective type. If the entry object\n+isn't of the type you request, the accessor will throw\n+system_error. You can ask an entry for its type through the\n+type() function.
\n+If you want to create an entry you give it the type you want it to\n+have in its constructor, and then use one of the non-const accessors\n+to get a reference which you then can assign the value you want it to\n+have.
\n+The typical code to get info from a torrent file will then look like\n+this:
\n \n-struct temp_storage\n-{\n- explicit temp_storage(lt::file_storage const& fs) : m_files(fs) {}\n-\n- lt::span<char const> readv(lt::peer_request const r, lt::storage_error& ec) const\n- {\n- auto const i = m_file_data.find(r.piece);\n- if (i == m_file_data.end())\n- {\n- ec.operation = lt::operation_t::file_read;\n- ec.ec = boost::asio::error::eof;\n- return {};\n- }\n- if (int(i->second.size()) <= r.start)\n- {\n- ec.operation = lt::operation_t::file_read;\n- ec.ec = boost::asio::error::eof;\n- return {};\n- }\n- return { i->second.data() + r.start, std::min(r.length, int(i->second.size()) - r.start) };\n- }\n- void writev(lt::span<char const> const b, lt::piece_index_t const piece, int const offset)\n- {\n- auto& data = m_file_data[piece];\n- if (data.empty())\n- {\n- // allocate the whole piece, otherwise we'll invalidate the pointers\n- // we have returned back to libtorrent\n- int const size = piece_size(piece);\n- data.resize(std::size_t(size));\n- }\n- TORRENT_ASSERT(offset + b.size() <= int(data.size()));\n- std::memcpy(data.data() + offset, b.data(), std::size_t(b.size()));\n- }\n- lt::sha1_hash hash(lt::piece_index_t const piece\n- , lt::span<lt::sha256_hash> const block_hashes, lt::storage_error& ec) const\n- {\n- auto const i = m_file_data.find(piece);\n- if (i == m_file_data.end())\n- {\n- ec.operation = lt::operation_t::file_read;\n- ec.ec = boost::asio::error::eof;\n- return {};\n- }\n- if (!block_hashes.empty())\n- {\n- int const piece_size2 = m_files.piece_size2(piece);\n- int const blocks_in_piece2 = m_files.blocks_in_piece2(piece);\n- char const* buf = i->second.data();\n- std::int64_t offset = 0;\n- for (int k = 0; k < blocks_in_piece2; ++k)\n- {\n- lt::hasher256 h2;\n- std::ptrdiff_t const len2 = std::min(lt::default_block_size, int(piece_size2 - offset));\n- h2.update({ buf, len2 });\n- buf += len2;\n- offset += len2;\n- block_hashes[k] = h2.final();\n- }\n- }\n- return lt::hasher(i->second).final();\n- }\n- lt::sha256_hash hash2(lt::piece_index_t const piece, int const offset, lt::storage_error& ec)\n- {\n- auto const i = m_file_data.find(piece);\n- if (i == m_file_data.end())\n- {\n- ec.operation = lt::operation_t::file_read;\n- ec.ec = boost::asio::error::eof;\n- return {};\n- }\n-\n- int const piece_size = m_files.piece_size2(piece);\n-\n- std::ptrdiff_t const len = std::min(lt::default_block_size, piece_size - offset);\n-\n- lt::span<char const> b = {i->second.data() + offset, len};\n- return lt::hasher256(b).final();\n- }\n-\n-private:\n- int piece_size(lt::piece_index_t piece) const\n- {\n- int const num_pieces = static_cast<int>((m_files.total_size() + m_files.piece_length() - 1) / m_files.piece_length());\n- return static_cast<int>(piece) < num_pieces - 1\n- ? m_files.piece_length() : static_cast<int>(m_files.total_size() - std::int64_t(num_pieces - 1) * m_files.piece_length());\n- }\n-\n- lt::file_storage const& m_files;\n- std::map<lt::piece_index_t, std::vector<char>> m_file_data;\n-};\n-\n-lt::storage_index_t pop(std::vector<lt::storage_index_t>& q)\n-{\n- TORRENT_ASSERT(!q.empty());\n- lt::storage_index_t const ret = q.back();\n- q.pop_back();\n- return ret;\n-}\n-\n-struct temp_disk_io final : lt::disk_interface\n- , lt::buffer_allocator_interface\n-{\n- explicit temp_disk_io(lt::io_context& ioc): m_ioc(ioc) {}\n-\n- void settings_updated() override {}\n-\n- lt::storage_holder new_torrent(lt::storage_params const& params\n- , std::shared_ptr<void> const&) override\n- {\n- lt::storage_index_t const idx = m_free_slots.empty()\n- ? m_torrents.end_index()\n- : pop(m_free_slots);\n- auto storage = std::make_unique<temp_storage>(params.files);\n- if (idx == m_torrents.end_index()) m_torrents.emplace_back(std::move(storage));\n- else m_torrents[idx] = std::move(storage);\n- return lt::storage_holder(idx, *this);\n- }\n-\n- void remove_torrent(lt::storage_index_t const idx) override\n- {\n- m_torrents[idx].reset();\n- m_free_slots.push_back(idx);\n- }\n-\n- void abort(bool) override {}\n-\n- void async_read(lt::storage_index_t storage, lt::peer_request const& r\n- , std::function<void(lt::disk_buffer_holder block, lt::storage_error const& se)> handler\n- , lt::disk_job_flags_t) override\n- {\n- // this buffer is owned by the storage. It will remain valid for as\n- // long as the torrent remains in the session. We don't need any lifetime\n- // management of it.\n- lt::storage_error error;\n- lt::span<char const> b = m_torrents[storage]->readv(r, error);\n-\n- post(m_ioc, [handler, error, b, this]\n- { handler(lt::disk_buffer_holder(*this, const_cast<char*>(b.data()), int(b.size())), error); });\n- }\n-\n- bool async_write(lt::storage_index_t storage, lt::peer_request const& r\n- , char const* buf, std::shared_ptr<lt::disk_observer>\n- , std::function<void(lt::storage_error const&)> handler\n- , lt::disk_job_flags_t) override\n- {\n- lt::span<char const> const b = { buf, r.length };\n-\n- m_torrents[storage]->writev(b, r.piece, r.start);\n-\n- post(m_ioc, [=]{ handler(lt::storage_error()); });\n- return false;\n- }\n-\n- void async_hash(lt::storage_index_t storage, lt::piece_index_t const piece\n- , lt::span<lt::sha256_hash> block_hashes, lt::disk_job_flags_t\n- , std::function<void(lt::piece_index_t, lt::sha1_hash const&, lt::storage_error const&)> handler) override\n- {\n- lt::storage_error error;\n- lt::sha1_hash const hash = m_torrents[storage]->hash(piece, block_hashes, error);\n- post(m_ioc, [=]{ handler(piece, hash, error); });\n- }\n-\n- void async_hash2(lt::storage_index_t storage, lt::piece_index_t const piece\n- , int const offset, lt::disk_job_flags_t\n- , std::function<void(lt::piece_index_t, lt::sha256_hash const&, lt::storage_error const&)> handler) override\n- {\n- lt::storage_error error;\n- lt::sha256_hash const hash = m_torrents[storage]->hash2(piece, offset, error);\n- post(m_ioc, [=]{ handler(piece, hash, error); });\n- }\n-\n- void async_move_storage(lt::storage_index_t, std::string p, lt::move_flags_t\n- , std::function<void(lt::status_t, std::string const&, lt::storage_error const&)> handler) override\n- {\n- post(m_ioc, [=]{\n- handler(lt::status_t::fatal_disk_error, p\n- , lt::storage_error(lt::error_code(boost::system::errc::operation_not_supported, lt::system_category())));\n- });\n- }\n-\n- void async_release_files(lt::storage_index_t, std::function<void()>) override {}\n-\n- void async_delete_files(lt::storage_index_t, lt::remove_flags_t\n- , std::function<void(lt::storage_error const&)> handler) override\n- {\n- post(m_ioc, [=]{ handler(lt::storage_error()); });\n- }\n-\n- void async_check_files(lt::storage_index_t\n- , lt::add_torrent_params const*\n- , lt::aux::vector<std::string, lt::file_index_t>\n- , std::function<void(lt::status_t, lt::storage_error const&)> handler) override\n- {\n- post(m_ioc, [=]{ handler(lt::status_t::no_error, lt::storage_error()); });\n- }\n-\n- void async_rename_file(lt::storage_index_t\n- , lt::file_index_t const idx\n- , std::string const name\n- , std::function<void(std::string const&, lt::file_index_t, lt::storage_error const&)> handler) override\n- {\n- post(m_ioc, [=]{ handler(name, idx, lt::storage_error()); });\n- }\n-\n- void async_stop_torrent(lt::storage_index_t, std::function<void()> handler) override\n- {\n- post(m_ioc, handler);\n- }\n-\n- void async_set_file_priority(lt::storage_index_t\n- , lt::aux::vector<lt::download_priority_t, lt::file_index_t> prio\n- , std::function<void(lt::storage_error const&\n- , lt::aux::vector<lt::download_priority_t, lt::file_index_t>)> handler) override\n- {\n- post(m_ioc, [=]{\n- handler(lt::storage_error(lt::error_code(\n- boost::system::errc::operation_not_supported, lt::system_category())), std::move(prio));\n- });\n- }\n-\n- void async_clear_piece(lt::storage_index_t, lt::piece_index_t index\n- , std::function<void(lt::piece_index_t)> handler) override\n- {\n- post(m_ioc, [=]{ handler(index); });\n- }\n-\n- // implements buffer_allocator_interface\n- void free_disk_buffer(char*) override\n- {\n- // never free any buffer. We only return buffers owned by the storage\n- // object\n- }\n-\n- void update_stats_counters(lt::counters&) const override {}\n-\n- std::vector<lt::open_file_state> get_status(lt::storage_index_t) const override\n- { return {}; }\n-\n- void submit_jobs() override {}\n-\n-private:\n-\n- lt::aux::vector<std::shared_ptr<temp_storage>, lt::storage_index_t> m_torrents;\n-\n- // slots that are unused in the m_torrents vector\n- std::vector<lt::storage_index_t> m_free_slots;\n-\n- // callbacks are posted on this\n- lt::io_context& m_ioc;\n-};\n-\n-std::unique_ptr<lt::disk_interface> temp_disk_constructor(\n- lt::io_context& ioc, lt::settings_interface const&, lt::counters&)\n+entry torrent_file;\n+// ...\n+\n+// throws if this is not a dictionary\n+entry::dictionary_type const& dict = torrent_file.dict();\n+entry::dictionary_type::const_iterator i;\n+i = dict.find("announce");\n+if (i != dict.end())\n {\n- return std::make_unique<temp_disk_io>(ioc);\n+ std::string tracker_url = i->second.string();\n+ std::cout << tracker_url << "\\n";\n }\n
\n-[report issue]\n-\n-disk_observer
\n-Declared in "libtorrent/disk_observer.hpp"
\n-\n-struct disk_observer\n-{\n- virtual void on_disk () = 0;\n-};\n+The following code is equivalent, but a little bit shorter:
\n+\n+entry torrent_file;\n+// ...\n+\n+// throws if this is not a dictionary\n+if (entry* i = torrent_file.find_key("announce"))\n+{\n+ std::string tracker_url = i->string();\n+ std::cout << tracker_url << "\\n";\n+}\n
\n-[report issue]\n-on_disk()
\n+To make it easier to extract information from a torrent file, the\n+class torrent_info exists.
\n+[report issue]\n+\n+swap()
\n \n-virtual void on_disk () = 0;\n+void swap (entry& e);\n
\n-called when the disk cache size has dropped\n-below the low watermark again and we can\n-resume downloading from peers
\n-[report issue]\n-\n-\n-buffer_allocator_interface
\n-Declared in "libtorrent/disk_buffer_holder.hpp"
\n-the interface for freeing disk buffers, used by the disk_buffer_holder.\n-when implementing disk_interface, this must also be implemented in order\n-to return disk buffers back to libtorrent
\n+swaps the content of this with e.
\n+[report issue]\n+\n+operator[]()
\n \n-struct buffer_allocator_interface\n-{\n- virtual void free_disk_buffer (char* b) = 0;\n-};\n+entry& operator[] (string_view key);\n+entry const& operator[] (string_view key) const;\n \n-[report issue]\n-\n-disk_buffer_holder
\n-Declared in "libtorrent/disk_buffer_holder.hpp"
\n-The disk buffer holder acts like a unique_ptr that frees a disk buffer\n-when it's destructed
\n-If this buffer holder is moved-from, default constructed or reset,\n-data() will return nullptr.
\n+All of these functions requires the entry to be a dictionary, if it\n+isn't they will throw system_error.
\n+The non-const versions of the operator[] will return a reference\n+to either the existing element at the given key or, if there is no\n+element with the given key, a reference to a newly inserted element at\n+that key.
\n+The const version of operator[] will only return a reference to an\n+existing element at the given key. If the key is not found, it will\n+throw system_error.
\n+[report issue]\n+\n+find_key()
\n \n-struct disk_buffer_holder\n-{\n- disk_buffer_holder (disk_buffer_holder&&) noexcept;\n- disk_buffer_holder& operator= (disk_buffer_holder&&) & noexcept;\n- disk_buffer_holder& operator= (disk_buffer_holder const&) = delete;\n- disk_buffer_holder (disk_buffer_holder const&) = delete;\n- disk_buffer_holder (buffer_allocator_interface& alloc\n- , char* buf, int sz) noexcept;\n- disk_buffer_holder () noexcept = default;\n- ~disk_buffer_holder ();\n- char* data () const noexcept;\n- void reset ();\n- void swap (disk_buffer_holder& h) noexcept;\n- bool is_mutable () const noexcept;\n- explicit operator bool () const noexcept;\n- std::ptrdiff_t size () const;\n-};\n+entry const* find_key (string_view key) const;\n+entry* find_key (string_view key);\n \n-[report issue]\n-disk_buffer_holder()
\n+These functions requires the entry to be a dictionary, if it isn't\n+they will throw system_error.
\n+They will look for an element at the given key in the dictionary, if\n+the element cannot be found, they will return nullptr. If an element\n+with the given key is found, the return a pointer to it.
\n+[report issue]\n+\n+to_string()
\n \n-disk_buffer_holder (buffer_allocator_interface& alloc\n- , char* buf, int sz) noexcept;\n+std::string to_string (bool single_line = false) const;\n
\n-construct a buffer holder that will free the held buffer\n-using a disk buffer pool directly (there's only one\n-disk_buffer_pool per session)
\n-[report issue]\n-\n-disk_buffer_holder()
\n+returns a pretty-printed string representation\n+of the bencoded structure, with JSON-style syntax
\n+[report issue]\n+\n+enum data_type
\n+Declared in "libtorrent/entry.hpp"
\n+\n+\n+ \n+\n+name \n+value \n+description \n+int_t \n+0 \n+ \n+string_t \n+1 \n+ \n+list_t \n+2 \n+ \n+dictionary_t \n+3 \n+ \n+undefined_t \n+4 \n+ \n+preformatted_t \n+5 \n+ \n+
\n+[report issue]\n+\n+\n+bencode()
\n+Declared in "libtorrent/bencode.hpp"
\n \n-disk_buffer_holder () noexcept = default;\n+template<class OutIt> int bencode (OutIt out, const entry& e);\n
\n-default construct a holder that does not own any buffer
\n-[report issue]\n-\n-~disk_buffer_holder()
\n+This function will encode data to bencoded form.
\n+The entry class is the internal representation of the bencoded data\n+and it can be used to retrieve information, an entry can also be build by\n+the program and given to bencode() to encode it into the OutIt\n+iterator.
\n+OutIt is an OutputIterator. It's a template and usually\n+instantiated as ostream_iterator or back_insert_iterator. This\n+function assumes the value_type of the iterator is a char.\n+In order to encode entry e into a buffer, do:
\n \n-~disk_buffer_holder ();\n+std::vector<char> buf;\n+bencode(std::back_inserter(buf), e);\n
\n-frees disk buffer held by this object
\n-[report issue]\n-\n+\n+operator<<()
\n+Declared in "libtorrent/entry.hpp"
\n \n-char* data () const noexcept;\n+inline std::ostream& operator<< (std::ostream& os, const entry& e);\n
\n-return a pointer to the held buffer, if any. Otherwise returns nullptr.
\n-[report issue]\n-\n-reset()
\n+prints the bencoded structure to the ostream as a JSON-style structure.
\n+[report issue]\n+\n+peer_class_type_filter
\n+Declared in "libtorrent/peer_class_type_filter.hpp"
\n+peer_class_type_filter is a simple container for rules for adding and subtracting\n+peer-classes from peers. It is applied after the peer class filter is applied (which\n+is based on the peer's IP address).
\n \n-void reset ();\n+struct peer_class_type_filter\n+{\n+ void add (socket_type_t const st, peer_class_t const peer_class);\n+ void remove (socket_type_t const st, peer_class_t const peer_class);\n+ void allow (socket_type_t const st, peer_class_t const peer_class);\n+ void disallow (socket_type_t const st, peer_class_t const peer_class);\n+ std::uint32_t apply (socket_type_t const st, std::uint32_t peer_class_mask);\n+ friend bool operator== (peer_class_type_filter const& lhs\n+ , peer_class_type_filter const& rhs);\n+\n+ enum socket_type_t\n+ {\n+ tcp_socket,\n+ utp_socket,\n+ ssl_tcp_socket,\n+ ssl_utp_socket,\n+ i2p_socket,\n+ num_socket_types,\n+ };\n+};\n \n-free the held disk buffer, if any, and clear the holder. This sets the\n-holder object to a default-constructed state
\n-[report issue]\n-\n-swap()
\n+\n+[report issue]\n+remove() add()
\n \n-void swap (disk_buffer_holder& h) noexcept;\n+void add (socket_type_t const st, peer_class_t const peer_class);\n+void remove (socket_type_t const st, peer_class_t const peer_class);\n
\n-swap pointers of two disk buffer holders.
\n-[report issue]\n-\n-is_mutable()
\n+add() and remove() adds and removes a peer class to be added\n+to new peers based on socket type.
\n+\n+[report issue]\n+\n+allow() disallow()
\n \n-bool is_mutable () const noexcept;\n+void allow (socket_type_t const st, peer_class_t const peer_class);\n+void disallow (socket_type_t const st, peer_class_t const peer_class);\n
\n-if this returns true, the buffer may not be modified in place
\n-[report issue]\n-\n-bool()
\n+disallow() and allow() adds and removes a peer class to be\n+removed from new peers based on socket type.
\n+The peer_class argument cannot be greater than 31. The bitmasks representing\n+peer classes in the peer_class_type_filter are 32 bits.
\n+[report issue]\n+\n+apply()
\n \n-explicit operator bool () const noexcept;\n+std::uint32_t apply (socket_type_t const st, std::uint32_t peer_class_mask);\n
\n-implicitly convertible to true if the object is currently holding a\n-buffer
\n-[report issue]\n+takes a bitmask of peer classes and returns a new bitmask of\n+peer classes after the rules have been applied, based on the socket type argument\n+(st).
\n+[report issue]\n+\n+enum socket_type_t
\n+Declared in "libtorrent/peer_class_type_filter.hpp"
\n+\n+\n+ \n+\n+name \n+value \n+description \n+tcp_socket \n+0 \n+these match the socket types from socket_type.hpp\n+shifted one down \n+utp_socket \n+1 \n+ \n+ssl_tcp_socket \n+2 \n+ \n+ssl_utp_socket \n+3 \n+ \n+i2p_socket \n+4 \n+ \n+num_socket_types \n+5 \n+ \n+
\n+[report issue]\n \n-\n-settings_interface
\n-Declared in "libtorrent/settings_pack.hpp"
\n-the common interface to settings_pack and the internal representation of\n-settings.
\n+\n+peer_class_info
\n+Declared in "libtorrent/peer_class.hpp"
\n+holds settings for a peer class. Used in set_peer_class() and\n+get_peer_class() calls.
\n \n-struct settings_interface\n+struct peer_class_info\n {\n- virtual void set_int (int name, int val) = 0;\n- virtual void set_str (int name, std::string val) = 0;\n- virtual bool has_val (int name) const = 0;\n- virtual void set_bool (int name, bool val) = 0;\n- virtual std::string const& get_str (int name) const = 0;\n- virtual bool get_bool (int name) const = 0;\n- virtual int get_int (int name) const = 0;\n+ bool ignore_unchoke_slots;\n+ int connection_limit_factor;\n+ std::string label;\n+ int upload_limit;\n+ int download_limit;\n+ int upload_priority;\n+ int download_priority;\n };\n \n-[report issue]\n-\n-open_file_state
\n-Declared in "libtorrent/disk_interface.hpp"
\n-this contains information about a file that's currently open by the\n-libtorrent disk I/O subsystem. It's associated with a single torrent.
\n+[report issue]\n+- ignore_unchoke_slots
\n+- ignore_unchoke_slots determines whether peers should always\n+unchoke a peer, regardless of the choking algorithm, or if it should\n+honor the unchoke slot limits. It's used for local peers by default.\n+If any of the peer classes a peer belongs to has this set to true,\n+that peer will be unchoked at all times.
\n+
\n+[report issue]\n+- connection_limit_factor
\n+- adjusts the connection limit (global and per torrent) that applies to\n+this peer class. By default, local peers are allowed to exceed the\n+normal connection limit for instance. This is specified as a percent\n+factor. 100 makes the peer class apply normally to the limit. 200\n+means as long as there are fewer connections than twice the limit, we\n+accept this peer. This factor applies both to the global connection\n+limit and the per-torrent limit. Note that if not used carefully one\n+peer class can potentially completely starve out all other over time.
\n+
\n+[report issue]\n+- label
\n+- not used by libtorrent. It's intended as a potentially user-facing\n+identifier of this peer class.
\n+
\n+\n+[report issue]\n+- upload_limit download_limit
\n+- transfer rates limits for the whole peer class. They are specified in\n+bytes per second and apply to the sum of all peers that are members of\n+this class.
\n+
\n+\n+[report issue]\n+- upload_priority download_priority
\n+- relative priorities used by the bandwidth allocator in the rate\n+limiter. If no rate limits are in use, the priority is not used\n+either. Priorities start at 1 (0 is not a valid priority) and may not\n+exceed 255.
\n+
\n+The pop_alerts() function on session is the main interface for retrieving\n+alerts (warnings, messages and errors from libtorrent). If no alerts have\n+been posted by libtorrent pop_alerts() will return an empty list.
\n+By default, only errors are reported. settings_pack::alert_mask can be\n+used to specify which kinds of events should be reported. The alert mask is\n+a combination of the alert_category_t flags in the alert class.
\n+Every alert belongs to one or more category. There is a cost associated with\n+posting alerts. Only alerts that belong to an enabled category are\n+posted. Setting the alert bitmask to 0 will disable all alerts (except those\n+that are non-discardable). Alerts that are responses to API calls such as\n+save_resume_data() and post_session_stats() are non-discardable and will be\n+posted even if their category is disabled.
\n+There are other alert base classes that some alerts derive from, all the\n+alerts that are generated for a specific torrent are derived from\n+torrent_alert, and tracker events derive from tracker_alert.
\n+Alerts returned by pop_alerts() are only valid until the next call to\n+pop_alerts(). You may not copy an alert object to access it after the next\n+call to pop_alerts(). Internal members of alerts also become invalid once\n+pop_alerts() is called again.
\n+[report issue]\n+\n+dht_routing_bucket
\n+Declared in "libtorrent/alert_types.hpp"
\n+struct to hold information about a single DHT routing table bucket
\n \n-struct open_file_state\n+struct dht_routing_bucket\n {\n- file_index_t file_index;\n- file_open_mode_t open_mode;\n- time_point last_use;\n+ int num_nodes;\n+ int num_replacements;\n+ int last_active;\n };\n \n-[report issue]\n-- file_index
\n-- the index of the file this entry refers to into the file_storage\n-file list of this torrent. This starts indexing at 0.
\n-
\n-[report issue]\n-- open_mode
\n-open_mode is a bitmask of the file flags this file is currently\n-opened with. For possible flags, see file_open_mode_t.
\n-Note that the read/write mode is not a bitmask. The two least significant bits are used\n-to represent the read/write mode. Those bits can be masked out using the rw_mask constant.
\n-\n+- num_nodes num_replacements
\n+- the total number of nodes and replacement nodes\n+in the routing table
\n
\n-[report issue]\n-- last_use
\n-- a (high precision) timestamp of when the file was last used.
\n+[report issue]\n+- last_active
\n+- number of seconds since last activity
\n
\n-[report issue]
\n-\n-disk_interface
\n-Declared in "libtorrent/disk_interface.hpp"
\n-The disk_interface is the customization point for disk I/O in libtorrent.\n-implement this interface and provide a factory function to the session constructor\n-use custom disk I/O. All functions on the disk subsystem (implementing\n-disk_interface) are called from within libtorrent's network thread. For\n-disk I/O to be performed in a separate thread, the disk subsystem has to\n-manage that itself.
\n-Although the functions are called async_*, they do not technically\n-have to be asynchronous, but they support being asynchronous, by\n-expecting the result passed back into a callback. The callbacks must be\n-posted back onto the network thread via the io_context object passed into\n-the constructor. The callbacks will be run in the network thread.
\n+[report issue]\n+\n+torrent_alert
\n+Declared in "libtorrent/alert_types.hpp"
\n+This is a base class for alerts that are associated with a\n+specific torrent. It contains a handle to the torrent.
\n+Note that by the time the client receives a torrent_alert, its\n+handle member may be invalid.
\n \n-struct disk_interface\n+struct torrent_alert : alert\n {\n- virtual storage_holder new_torrent (storage_params const& p\n- , std::shared_ptr<void> const& torrent) = 0;\n- virtual void remove_torrent (storage_index_t) = 0;\n- virtual void async_read (storage_index_t storage, peer_request const& r\n- , std::function<void(disk_buffer_holder, storage_error const&)> handler\n- , disk_job_flags_t flags = {}) = 0;\n- virtual bool async_write (storage_index_t storage, peer_request const& r\n- , char const* buf, std::shared_ptr<disk_observer> o\n- , std::function<void(storage_error const&)> handler\n- , disk_job_flags_t flags = {}) = 0;\n- virtual void async_hash (storage_index_t storage, piece_index_t piece, span<sha256_hash> v2\n- , disk_job_flags_t flags\n- , std::function<void(piece_index_t, sha1_hash const&, storage_error const&)> handler) = 0;\n- virtual void async_hash2 (storage_index_t storage, piece_index_t piece, int offset, disk_job_flags_t flags\n- , std::function<void(piece_index_t, sha256_hash const&, storage_error const&)> handler) = 0;\n- virtual void async_move_storage (storage_index_t storage, std::string p, move_flags_t flags\n- , std::function<void(status_t, std::string const&, storage_error const&)> handler) = 0;\n- virtual void async_release_files (storage_index_t storage\n- , std::function<void()> handler = std::function<void()>()) = 0;\n- virtual void async_check_files (storage_index_t storage\n- , add_torrent_params const* resume_data\n- , aux::vector<std::string, file_index_t> links\n- , std::function<void(status_t, storage_error const&)> handler) = 0;\n- virtual void async_stop_torrent (storage_index_t storage\n- , std::function<void()> handler = std::function<void()>()) = 0;\n- virtual void async_rename_file (storage_index_t storage\n- , file_index_t index, std::string name\n- , std::function<void(std::string const&, file_index_t, storage_error const&)> handler) = 0;\n- virtual void async_delete_files (storage_index_t storage, remove_flags_t options\n- , std::function<void(storage_error const&)> handler) = 0;\n- virtual void async_set_file_priority (storage_index_t storage\n- , aux::vector<download_priority_t, file_index_t> prio\n- , std::function<void(storage_error const&\n- , aux::vector<download_priority_t, file_index_t>)> handler) = 0;\n- virtual void async_clear_piece (storage_index_t storage, piece_index_t index\n- , std::function<void(piece_index_t)> handler) = 0;\n- virtual void update_stats_counters (counters& c) const = 0;\n- virtual std::vector<open_file_state> get_status (storage_index_t) const = 0;\n- virtual void abort (bool wait) = 0;\n- virtual void submit_jobs () = 0;\n- virtual void settings_updated () = 0;\n+ std::string message () const override;\n+ char const* torrent_name () const;\n \n- static constexpr disk_job_flags_t force_copy = 0_bit;\n- static constexpr disk_job_flags_t sequential_access = 3_bit;\n- static constexpr disk_job_flags_t volatile_read = 4_bit;\n- static constexpr disk_job_flags_t v1_hash = 5_bit;\n- static constexpr disk_job_flags_t flush_piece = 7_bit;\n+ torrent_handle handle;\n };\n \n-[report issue]\n-new_torrent()
\n+[report issue]\n+message()
\n \n-virtual storage_holder new_torrent (storage_params const& p\n- , std::shared_ptr<void> const& torrent) = 0;\n+std::string message () const override;\n
\n-this is called when a new torrent is added. The shared_ptr can be\n-used to hold the internal torrent object alive as long as there are\n-outstanding disk operations on the storage.\n-The returned storage_holder is an owning reference to the underlying\n-storage that was just created. It is fundamentally a storage_index_t
\n-[report issue]\n-\n-remove_torrent()
\n+returns the message associated with this alert
\n+[report issue]\n+- handle
\n+- The torrent_handle pointing to the torrent this\n+alert is associated with.
\n+
\n+[report issue]\n+\n+\n+peer_alert
\n+Declared in "libtorrent/alert_types.hpp"
\n+The peer alert is a base class for alerts that refer to a specific peer. It includes all\n+the information to identify the peer. i.e. ip and peer-id.
\n \n-virtual void remove_torrent (storage_index_t) = 0;\n+struct peer_alert : torrent_alert\n+{\n+ std::string message () const override;\n+\n+ aux::noexcept_movable<tcp::endpoint> endpoint;\n+ peer_id pid;\n+};\n \n-remove the storage with the specified index. This is not expected to\n-delete any files from disk, just to clean up any resources associated\n-with the specified storage.
\n-\n-[report issue]\n-\n-async_write() async_read()
\n+[report issue]\n+- endpoint
\n+- The peer's IP address and port.
\n+
\n+[report issue]\n+- pid
\n+- the peer ID, if known.
\n+
\n+[report issue]\n+\n+tracker_alert
\n+Declared in "libtorrent/alert_types.hpp"
\n+This is a base class used for alerts that are associated with a\n+specific tracker. It derives from torrent_alert since a tracker\n+is also associated with a specific torrent.
\n \n-virtual void async_read (storage_index_t storage, peer_request const& r\n- , std::function<void(disk_buffer_holder, storage_error const&)> handler\n- , disk_job_flags_t flags = {}) = 0;\n-virtual bool async_write (storage_index_t storage, peer_request const& r\n- , char const* buf, std::shared_ptr<disk_observer> o\n- , std::function<void(storage_error const&)> handler\n- , disk_job_flags_t flags = {}) = 0;\n+struct tracker_alert : torrent_alert\n+{\n+ std::string message () const override;\n+ char const* tracker_url () const;\n+\n+ aux::noexcept_movable<tcp::endpoint> local_endpoint;\n+};\n \n-perform a read or write operation from/to the specified storage\n-index and the specified request. When the operation completes, call\n-handler possibly with a disk_buffer_holder, holding the buffer with\n-the result. Flags may be set to affect the read operation. See\n-disk_job_flags_t.
\n-The disk_observer is a callback to indicate that\n-the store buffer/disk write queue is below the watermark to let peers\n-start writing buffers to disk again. When async_write() returns\n-true, indicating the write queue is full, the peer will stop\n-further writes and wait for the passed-in disk_observer to be\n-notified before resuming.
\n-Note that for async_read, the peer_request (r) is not\n-necessarily aligned to blocks (but it is most of the time). However,\n-all writes (passed to async_write) are guaranteed to be block\n-aligned.
\n-[report issue]\n-\n-async_hash()
\n+[report issue]\n+tracker_url()
\n \n-virtual void async_hash (storage_index_t storage, piece_index_t piece, span<sha256_hash> v2\n- , disk_job_flags_t flags\n- , std::function<void(piece_index_t, sha1_hash const&, storage_error const&)> handler) = 0;\n+char const* tracker_url () const;\n
\n-Compute hash(es) for the specified piece. Unless the v1_hash flag is\n-set (in flags), the SHA-1 hash of the whole piece does not need\n-to be computed.
\n-The v2 span is optional and can be empty, which means v2 hashes\n-should not be computed. If v2 is non-empty it must be at least large\n-enough to hold all v2 blocks in the piece, and this function will\n-fill in the span with the SHA-256 block hashes of the piece.
\n-[report issue]\n-\n-async_hash2()
\n+returns a 0-terminated string of the tracker's URL
\n+[report issue]\n+- local_endpoint
\n+- endpoint of the listen interface being announced
\n+
\n+[report issue]\n+\n+\n+torrent_removed_alert
\n+Declared in "libtorrent/alert_types.hpp"
\n+The torrent_removed_alert is posted whenever a torrent is removed. Since\n+the torrent handle in its base class will usually be invalid (since the torrent\n+is already removed) it has the info hash as a member, to identify it.\n+It's posted when the alert_category::status bit is set in the alert_mask.
\n+Note that the handle remains valid for some time after\n+torrent_removed_alert is posted, as long as some internal libtorrent\n+task (such as an I/O task) refers to it. Additionally, other alerts like\n+save_resume_data_alert may be posted after torrent_removed_alert.\n+To synchronize on whether the torrent has been removed or not, call\n+torrent_handle::in_session(). This will return true before\n+torrent_removed_alert is posted, and false afterward.
\n+Even though the handle member doesn't point to an existing torrent anymore,\n+it is still useful for comparing to other handles, which may also no\n+longer point to existing torrents, but to the same non-existing torrents.
\n+The torrent_handle acts as a weak_ptr, even though its object no\n+longer exists, it can still compare equal to another weak pointer which\n+points to the same non-existent object.
\n \n-virtual void async_hash2 (storage_index_t storage, piece_index_t piece, int offset, disk_job_flags_t flags\n- , std::function<void(piece_index_t, sha256_hash const&, storage_error const&)> handler) = 0;\n+struct torrent_removed_alert final : torrent_alert\n+{\n+ std::string message () const override;\n+\n+ static constexpr alert_category_t static_category = alert_category::status;\n+ info_hash_t info_hashes;\n+ client_data_t userdata;\n+};\n \n-computes the v2 hash (SHA-256) of a single block. The block at\n-offset in piece piece.
\n-[report issue]\n-\n-async_move_storage()
\n+[report issue]\n+- userdata
\n+- 'userdata` as set in add_torrent_params at torrent creation.\n+This can be used to associate this torrent with related data\n+in the client application more efficiently than info_hashes.
\n+
\n+[report issue]\n+\n+read_piece_alert
\n+Declared in "libtorrent/alert_types.hpp"
\n+This alert is posted when the asynchronous read operation initiated by\n+a call to torrent_handle::read_piece() is completed. If the read failed, the torrent\n+is paused and an error state is set and the buffer member of the alert\n+is 0. If successful, buffer points to a buffer containing all the data\n+of the piece. piece is the piece index that was read. size is the\n+number of bytes that was read.
\n+If the operation fails, error will indicate what went wrong.
\n \n-virtual void async_move_storage (storage_index_t storage, std::string p, move_flags_t flags\n- , std::function<void(status_t, std::string const&, storage_error const&)> handler) = 0;\n+struct read_piece_alert final : torrent_alert\n+{\n+ std::string message () const override;\n+\n+ static constexpr alert_category_t static_category = alert_category::storage;\n+ error_code const error;\n+ boost::shared_array<char> const buffer;\n+ piece_index_t const piece;\n+ int const size;\n+};\n \n-called to request the files for the specified storage/torrent be\n-moved to a new location. It is the disk I/O object's responsibility\n-to synchronize this with any currently outstanding disk operations to\n-the storage. Whether files are replaced at the destination path or\n-not is controlled by flags (see move_flags_t).
\n-[report issue]\n-\n+\n+file_completed_alert
\n+Declared in "libtorrent/alert_types.hpp"
\n+This is posted whenever an individual file completes its download. i.e.\n+All pieces overlapping this file have passed their hash check.
\n \n-virtual void async_release_files (storage_index_t storage\n- , std::function<void()> handler = std::function<void()>()) = 0;\n+struct file_completed_alert final : torrent_alert\n+{\n+ std::string message () const override;\n+\n+ file_index_t const index;\n+};\n \n-This is called on disk I/O objects to request they close all open\n-files for the specified storage/torrent. If file handles are not\n-pooled/cached, it can be a no-op. For truly asynchronous disk I/O,\n-this should provide at least one point in time when all files are\n-closed. It is possible that later asynchronous operations will\n-re-open some of the files, by the time this completion handler is\n-called, that's fine.
\n-[report issue]\n-\n-async_check_files()
\n+[report issue]\n+- index
\n+- refers to the index of the file that completed.
\n+
\n+[report issue]\n+\n+file_renamed_alert
\n+Declared in "libtorrent/alert_types.hpp"
\n+This is posted as a response to a torrent_handle::rename_file() call, if the rename\n+operation succeeds.
\n \n-virtual void async_check_files (storage_index_t storage\n- , add_torrent_params const* resume_data\n- , aux::vector<std::string, file_index_t> links\n- , std::function<void(status_t, storage_error const&)> handler) = 0;\n+struct file_renamed_alert final : torrent_alert\n+{\n+ std::string message () const override;\n+ char const* new_name () const;\n+ char const* old_name () const;\n+\n+ static constexpr alert_category_t static_category = alert_category::storage;\n+ file_index_t const index;\n+};\n \n-this is called when torrents are added to validate their resume data\n-against the files on disk. This function is expected to do a few things:
\n-if links is non-empty, it contains a string for each file in the\n-torrent. The string being a path to an existing identical file. The\n-default behavior is to create hard links of those files into the\n-storage of the new torrent (specified by storage). An empty\n-string indicates that there is no known identical file. This is part\n-of the "mutable torrent" feature, where files can be reused from\n-other torrents.
\n-The resume_data points the resume data passed in by the client.
\n-If the resume_data->flags field has the seed_mode flag set, all\n-files/pieces are expected to be on disk already. This should be\n-verified. Not just the existence of the file, but also that it has\n-the correct size.
\n-Any file with a piece set in the resume_data->have_pieces bitmask\n-should exist on disk, this should be verified. Pad files and files\n-with zero priority may be skipped.
\n-[report issue]\n-\n-async_stop_torrent()
\n+\n+[report issue]\n+new_name() old_name()
\n \n-virtual void async_stop_torrent (storage_index_t storage\n- , std::function<void()> handler = std::function<void()>()) = 0;\n+char const* new_name () const;\n+char const* old_name () const;\n
\n-This is called when a torrent is stopped. It gives the disk I/O\n-object an opportunity to flush any data to disk that's currently kept\n-cached. This function should at least do the same thing as\n-async_release_files().
\n-[report issue]\n-\n-async_rename_file()
\n+returns the new and previous file name, respectively.
\n+[report issue]\n+- index
\n+- refers to the index of the file that was renamed,
\n+
\n+[report issue]\n+\n+\n+file_rename_failed_alert
\n+Declared in "libtorrent/alert_types.hpp"
\n+This is posted as a response to a torrent_handle::rename_file() call, if the rename\n+operation failed.
\n \n-virtual void async_rename_file (storage_index_t storage\n- , file_index_t index, std::string name\n- , std::function<void(std::string const&, file_index_t, storage_error const&)> handler) = 0;\n+struct file_rename_failed_alert final : torrent_alert\n+{\n+ std::string message () const override;\n+\n+ static constexpr alert_category_t static_category = alert_category::storage;\n+ file_index_t const index;\n+ error_code const error;\n+};\n \n-This function is called when the name of a file in the specified\n-storage has been requested to be renamed. The disk I/O object is\n-responsible for renaming the file without racing with other\n-potentially outstanding operations against the file (such as read,\n-write, move, etc.).
\n-[report issue]\n-\n-async_delete_files()
\n+\n+[report issue]\n+- index error
\n+- refers to the index of the file that was supposed to be renamed,\n+error is the error code returned from the filesystem.
\n+
\n+[report issue]\n+\n+performance_alert
\n+Declared in "libtorrent/alert_types.hpp"
\n+This alert is generated when a limit is reached that might have a negative impact on\n+upload or download rate performance.
\n \n-virtual void async_delete_files (storage_index_t storage, remove_flags_t options\n- , std::function<void(storage_error const&)> handler) = 0;\n+struct performance_alert final : torrent_alert\n+{\n+ std::string message () const override;\n+\n+ enum performance_warning_t\n+ {\n+ outstanding_disk_buffer_limit_reached,\n+ outstanding_request_limit_reached,\n+ upload_limit_too_low,\n+ download_limit_too_low,\n+ send_buffer_watermark_too_low,\n+ too_many_optimistic_unchoke_slots,\n+ too_high_disk_queue_limit,\n+ aio_limit_reached,\n+ deprecated_bittyrant_with_no_uplimit,\n+ too_few_outgoing_ports,\n+ too_few_file_descriptors,\n+ num_warnings,\n+ };\n+\n+ static constexpr alert_category_t static_category = alert_category::performance_warning;\n+ performance_warning_t const warning_code;\n+};\n \n-This function is called when some file(s) on disk have been requested\n-to be removed by the client. storage indicates which torrent is\n-referred to. See session_handle for remove_flags_t flags\n-indicating which files are to be removed.\n-e.g. session_handle::delete_files - delete all files\n-session_handle::delete_partfile - only delete part file.
\n-[report issue]\n-\n-async_set_file_priority()
\n-\n-virtual void async_set_file_priority (storage_index_t storage\n- , aux::vector<download_priority_t, file_index_t> prio\n- , std::function<void(storage_error const&\n- , aux::vector<download_priority_t, file_index_t>)> handler) = 0;\n+[report issue]\n+enum performance_warning_t
\n+Declared in "libtorrent/alert_types.hpp"
\n+\n+\n+ \n+\n+name \n+value \n+description \n+outstanding_disk_buffer_limit_reached \n+0 \n+This warning means that the number of bytes queued to be written to disk\n+exceeds the max disk byte queue setting (settings_pack::max_queued_disk_bytes).\n+This might restrict the download rate, by not queuing up enough write jobs\n+to the disk I/O thread. When this alert is posted, peer connections are\n+temporarily stopped from downloading, until the queued disk bytes have fallen\n+below the limit again. Unless your max_queued_disk_bytes setting is already\n+high, you might want to increase it to get better performance. \n+outstanding_request_limit_reached \n+1 \n+This is posted when libtorrent would like to send more requests to a peer,\n+but it's limited by settings_pack::max_out_request_queue. The queue length\n+libtorrent is trying to achieve is determined by the download rate and the\n+assumed round-trip-time (settings_pack::request_queue_time). The assumed\n+round-trip-time is not limited to just the network RTT, but also the remote disk\n+access time and message handling time. It defaults to 3 seconds. The target number\n+of outstanding requests is set to fill the bandwidth-delay product (assumed RTT\n+times download rate divided by number of bytes per request). When this alert\n+is posted, there is a risk that the number of outstanding requests is too low\n+and limits the download rate. You might want to increase the max_out_request_queue\n+setting. \n+upload_limit_too_low \n+2 \n+This warning is posted when the amount of TCP/IP overhead is greater than the\n+upload rate limit. When this happens, the TCP/IP overhead is caused by a much\n+faster download rate, triggering TCP ACK packets. These packets eat into the\n+rate limit specified to libtorrent. When the overhead traffic is greater than\n+the rate limit, libtorrent will not be able to send any actual payload, such\n+as piece requests. This means the download rate will suffer, and new requests\n+can be sent again. There will be an equilibrium where the download rate, on\n+average, is about 20 times the upload rate limit. If you want to maximize the\n+download rate, increase the upload rate limit above 5% of your download capacity. \n+download_limit_too_low \n+3 \n+This is the same warning as upload_limit_too_low but referring to the download\n+limit instead of upload. This suggests that your download rate limit is much lower\n+than your upload capacity. Your upload rate will suffer. To maximize upload rate,\n+make sure your download rate limit is above 5% of your upload capacity. \n+send_buffer_watermark_too_low \n+4 \n+We're stalled on the disk. We want to write to the socket, and we can write\n+but our send buffer is empty, waiting to be refilled from the disk.\n+This either means the disk is slower than the network connection\n+or that our send buffer watermark is too small, because we can\n+send it all before the disk gets back to us.\n+The number of bytes that we keep outstanding, requested from the disk, is calculated\n+as follows:
\n+\n+min(512, max(upload_rate * send_buffer_watermark_factor / 100, send_buffer_watermark))\n
\n-This is called to set the priority of some or all files. Changing the\n-priority from or to 0 may involve moving data to and from the\n-partfile. The disk I/O object is responsible for correctly\n-synchronizing this work to not race with any potentially outstanding\n-asynchronous operations affecting these files.
\n-prio is a vector of the file priority for all files. If it's\n-shorter than the total number of files in the torrent, they are\n-assumed to be set to the default priority.
\n-[report issue]\n-\n-async_clear_piece()
\n+If you receive this alert, you might want to either increase your send_buffer_watermark\n+or send_buffer_watermark_factor.
\n+too_many_optimistic_unchoke_slots \n+5 \n+If the half (or more) of all upload slots are set as optimistic unchoke slots, this\n+warning is issued. You probably want more regular (rate based) unchoke slots. \n+too_high_disk_queue_limit \n+6 \n+If the disk write queue ever grows larger than half of the cache size, this warning\n+is posted. The disk write queue eats into the total disk cache and leaves very little\n+left for the actual cache. This causes the disk cache to oscillate in evicting large\n+portions of the cache before allowing peers to download any more, onto the disk write\n+queue. Either lower max_queued_disk_bytes or increase cache_size. \n+aio_limit_reached \n+7 \n+ \n+deprecated_bittyrant_with_no_uplimit \n+8 \n+ \n+too_few_outgoing_ports \n+9 \n+This is generated if outgoing peer connections are failing because of address in use\n+errors, indicating that settings_pack::outgoing_ports is set and is too small of\n+a range. Consider not using the outgoing_ports setting at all, or widen the range to\n+include more ports. \n+too_few_file_descriptors \n+10 \n+ \n+num_warnings \n+11 \n+ \n+
\n+[report issue]\n+
\n+\n+state_changed_alert
\n+Declared in "libtorrent/alert_types.hpp"
\n+Generated whenever a torrent changes its state.
\n \n-virtual void async_clear_piece (storage_index_t storage, piece_index_t index\n- , std::function<void(piece_index_t)> handler) = 0;\n+struct state_changed_alert final : torrent_alert\n+{\n+ std::string message () const override;\n+\n+ static constexpr alert_category_t static_category = alert_category::status;\n+ torrent_status::state_t const state;\n+ torrent_status::state_t const prev_state;\n+};\n \n-This is called when a piece fails the hash check, to ensure there are\n-no outstanding disk operations to the piece before blocks are\n-re-requested from peers to overwrite the existing blocks. The disk I/O\n-object does not need to perform any action other than synchronize\n-with all outstanding disk operations to the specified piece before\n-posting the result back.
\n-[report issue]\n-\n-update_stats_counters()
\n+[report issue]\n+- state
\n+- the new state of the torrent.
\n+
\n+[report issue]\n+- prev_state
\n+- the previous state.
\n+
\n+[report issue]\n+\n+tracker_error_alert
\n+Declared in "libtorrent/alert_types.hpp"
\n+This alert is generated on tracker time outs, premature disconnects,\n+invalid response or a HTTP response other than "200 OK". From the alert\n+you can get the handle to the torrent the tracker belongs to.
\n \n-virtual void update_stats_counters (counters& c) const = 0;\n+struct tracker_error_alert final : tracker_alert\n+{\n+ std::string message () const override;\n+ char const* failure_reason () const;\n+\n+ static constexpr alert_category_t static_category = alert_category::tracker | alert_category::error;\n+ int const times_in_row;\n+ error_code const error;\n+ operation_t op;\n+ protocol_version version;\n+};\n \n-update_stats_counters() is called to give the disk storage an\n-opportunity to update gauges in the c stats counters, that aren't\n-updated continuously as operations are performed. This is called\n-before a snapshot of the counters are passed to the client.
\n-[report issue]\n-\n-get_status()
\n+[report issue]\n+failure_reason()
\n \n-virtual std::vector<open_file_state> get_status (storage_index_t) const = 0;\n+char const* failure_reason () const;\n
\n-Return a list of all the files that are currently open for the\n-specified storage/torrent. This is is just used for the client to\n-query the currently open files, and which modes those files are open\n-in.
\n-[report issue]\n-\n-abort()
\n+if the tracker sent a "failure reason" string, it will be returned\n+here.
\n+[report issue]\n+- times_in_row
\n+- This member says how many times in a row this tracker has failed.
\n+
\n+[report issue]\n+- error
\n+- the error code indicating why the tracker announce failed. If it is\n+is lt::errors::tracker_failure the failure_reason() might contain\n+a more detailed description of why the tracker rejected the request.\n+HTTP status codes indicating errors are also set in this field.
\n+
\n+[report issue]\n+- version
\n+- the bittorrent protocol version that was announced
\n+
\n+[report issue]\n+\n+\n+tracker_warning_alert
\n+Declared in "libtorrent/alert_types.hpp"
\n+This alert is triggered if the tracker reply contains a warning field.\n+Usually this means that the tracker announce was successful, but the\n+tracker has a message to the client.
\n \n-virtual void abort (bool wait) = 0;\n+struct tracker_warning_alert final : tracker_alert\n+{\n+ std::string message () const override;\n+ char const* warning_message () const;\n+\n+ static constexpr alert_category_t static_category = alert_category::tracker | alert_category::error;\n+ protocol_version version;\n+};\n \n-this is called when the session is starting to shut down. The disk\n-I/O object is expected to flush any outstanding write jobs, cancel\n-hash jobs and initiate tearing down of any internal threads. If\n-wait is true, this should be asynchronous. i.e. this call should\n-not return until all threads have stopped and all jobs have either\n-been aborted or completed and the disk I/O object is ready to be\n-destructed.
\n-[report issue]\n-\n-submit_jobs()
\n+[report issue]\n+warning_message()
\n \n-virtual void submit_jobs () = 0;\n+char const* warning_message () const;\n
\n-This will be called after a batch of disk jobs has been issues (via\n-the async_* ). It gives the disk I/O object an opportunity to\n-notify any potential condition variables to wake up the disk\n-thread(s). The async_* calls can of course also notify condition\n-variables, but doing it in this call allows for batching jobs, by\n-issuing the notification once for a collection of jobs.
\n-[report issue]\n-\n-settings_updated()
\n+the message associated with this warning
\n+[report issue]\n+- version
\n+- the bittorrent protocol version that was announced
\n+
\n+[report issue]\n+\n+\n+scrape_reply_alert
\n+Declared in "libtorrent/alert_types.hpp"
\n+This alert is generated when a scrape request succeeds.
\n \n-virtual void settings_updated () = 0;\n+struct scrape_reply_alert final : tracker_alert\n+{\n+ std::string message () const override;\n+\n+ static constexpr alert_category_t static_category = alert_category::tracker;\n+ int const incomplete;\n+ int const complete;\n+ protocol_version version;\n+};\n \n-This is called to notify the disk I/O object that the settings have\n-been updated. In the disk io constructor, a settings_interface\n-reference is passed in. Whenever these settings are updated, this\n-function is called to allow the disk I/O object to react to any\n-changed settings relevant to its operations.
\n-[report issue]\n-- force_copy
\n-- force making a copy of the cached block, rather than getting a\n-reference to a block already in the cache. This is used the block is\n-expected to be overwritten very soon, by async_write()`, and we need\n-access to the previous content.
\n-
\n-[report issue]\n-- sequential_access
\n-- hint that there may be more disk operations with sequential access to\n-the file
\n+\n+[report issue]\n+- incomplete complete
\n+- the data returned in the scrape response. These numbers\n+may be -1 if the response was malformed.
\n
\n-[report issue]\n-- volatile_read
\n-- don't keep the read block in cache. This is a hint that this block is\n-unlikely to be read again anytime soon, and caching it would be\n-wasteful.
\n+[report issue]\n+- version
\n+- the bittorrent protocol version that was scraped
\n
\n-[report issue]\n-- v1_hash
\n-- compute a v1 piece hash. This is only used by the async_hash() call.\n-If this flag is not set in the async_hash() call, the SHA-1 piece\n-hash does not need to be computed.
\n+[report issue]
\n+\n+scrape_failed_alert
\n+Declared in "libtorrent/alert_types.hpp"
\n+If a scrape request fails, this alert is generated. This might be due\n+to the tracker timing out, refusing connection or returning an http response\n+code indicating an error.
\n+\n+struct scrape_failed_alert final : tracker_alert\n+{\n+ std::string message () const override;\n+ char const* error_message () const;\n+\n+ static constexpr alert_category_t static_category = alert_category::tracker | alert_category::error;\n+ error_code const error;\n+ protocol_version version;\n+};\n+\n+[report issue]\n+error_message()
\n+\n+char const* error_message () const;\n+
\n+if the error indicates there is an associated message, this returns\n+that message. Otherwise and empty string.
\n+[report issue]\n+- error
\n+- the error itself. This may indicate that the tracker sent an error\n+message (error::tracker_failure), in which case it can be\n+retrieved by calling error_message().
\n
\n-[report issue]\n-- flush_piece
\n-- this flag instructs a hash job that we just completed this piece, and\n-it should be flushed to disk
\n+[report issue]\n+- version
\n+- the bittorrent protocol version that was scraped
\n
\n-[report issue]
\n+[report issue]\n \n-\n-storage_holder
\n-Declared in "libtorrent/disk_interface.hpp"
\n-a unique, owning, reference to the storage of a torrent in a disk io\n-subsystem (class that implements disk_interface). This is held by the\n-internal libtorrent torrent object to tie the storage object allocated\n-for a torrent to the lifetime of the internal torrent object. When a\n-torrent is removed from the session, this holder is destructed and will\n-inform the disk object.
\n+\n+tracker_reply_alert
\n+Declared in "libtorrent/alert_types.hpp"
\n+This alert is only for informational purpose. It is generated when a tracker announce\n+succeeds. It is generated regardless what kind of tracker was used, be it UDP, HTTP or\n+the DHT.
\n \n-struct storage_holder\n+struct tracker_reply_alert final : tracker_alert\n {\n- ~storage_holder ();\n- storage_holder () = default;\n- storage_holder (storage_index_t idx, disk_interface& disk_io);\n- explicit operator bool () const;\n- operator storage_index_t () const;\n- void reset ();\n- storage_holder (storage_holder const&) = delete;\n- storage_holder& operator= (storage_holder const&) = delete;\n- storage_holder (storage_holder&& rhs) noexcept;\n- storage_holder& operator= (storage_holder&& rhs) noexcept;\n+ std::string message () const override;\n+\n+ static constexpr alert_category_t static_category = alert_category::tracker;\n+ int const num_peers;\n+ protocol_version version;\n };\n \n-[report issue]\n-\n-file_open_mode_t
\n-Declared in "libtorrent/disk_interface.hpp"
\n-\n-- read_only
\n-- open the file for reading only
\n-
\n-\n-- write_only
\n-- open the file for writing only
\n-
\n-\n-- read_write
\n-- open the file for reading and writing
\n-
\n-\n-- rw_mask
\n-- the mask for the bits determining read or write mode
\n-
\n-\n-- sparse
\n-- open the file in sparse mode (if supported by the\n-filesystem).
\n+[report issue]\n+- num_peers
\n+- tells how many peers the tracker returned in this response. This is\n+not expected to be greater than the num_want settings. These are not necessarily\n+all new peers, some of them may already be connected.
\n
\n-\n-- no_atime
\n-- don't update the access timestamps on the file (if\n-supported by the operating system and filesystem).\n-this generally improves disk performance.
\n+[report issue]\n+- version
\n+- the bittorrent protocol version that was announced
\n
\n-\n-- random_access
\n-- open the file for random access. This disables read-ahead\n-logic
\n-
\n-\n-- mmapped
\n-- the file is memory mapped
\n-
\n-[report issue]
\n-\n-add_torrent_params
\n-Declared in "libtorrent/add_torrent_params.hpp"
\n-The add_torrent_params contains all the information in a .torrent file\n-along with all information necessary to add that torrent to a session.\n-The key fields when adding a torrent are:
\n-\n-- ti - the immutable info-dict part of the torrent
\n-- info_hash - when you don't have the metadata (.torrent file). This\n-uniquely identifies the torrent and can validate the info-dict when\n-received from the swarm.
\n-
\n-In order to add a torrent to a session, one of those fields must be set\n-in addition to save_path. The add_torrent_params object can then be\n-passed into one of the session::add_torrent() overloads or\n-session::async_add_torrent().
\n-If you only specify the info-hash, the torrent file will be downloaded\n-from peers, which requires them to support the metadata extension. For\n-the metadata extension to work, libtorrent must be built with extensions\n-enabled (TORRENT_DISABLE_EXTENSIONS must not be defined). It also\n-takes an optional name argument. This may be left empty in case no\n-name should be assigned to the torrent. In case it's not, the name is\n-used for the torrent as long as it doesn't have metadata. See\n-torrent_handle::name.
\n-The add_torrent_params is also used when requesting resume data for a\n-torrent. It can be saved to and restored from a file and added back to a\n-new session. For serialization and de-serialization of\n-add_torrent_params objects, see read_resume_data() and\n-write_resume_data().
\n-The add_torrent_params is also used to represent a parsed .torrent\n-file. It can be loaded via load_torrent_file(), load_torrent_buffer() and\n-load_torrent_parsed(). It can be saved via write_torrent_file().
\n-\n-struct add_torrent_params\n-{\n- int version = LIBTORRENT_VERSION_NUM;\n- std::shared_ptr<torrent_info> ti;\n- aux::noexcept_movable<std::vector<std::string>> trackers;\n- aux::noexcept_movable<std::vector<int>> tracker_tiers;\n- aux::noexcept_movable<std::vector<std::pair<std::string, int>>> dht_nodes;\n- std::string name;\n- std::string save_path;\n- storage_mode_t storage_mode = storage_mode_sparse;\n- client_data_t userdata;\n- aux::noexcept_movable<std::vector<download_priority_t>> file_priorities;\n- std::string trackerid;\n- torrent_flags_t flags = torrent_flags::default_flags;\n- info_hash_t info_hashes;\n- int max_uploads = -1;\n- int max_connections = -1;\n- int upload_limit = -1;\n- int download_limit = -1;\n- std::int64_t total_uploaded = 0;\n- std::int64_t total_downloaded = 0;\n- int active_time = 0;\n- int finished_time = 0;\n- int seeding_time = 0;\n- std::time_t added_time = 0;\n- std::time_t completed_time = 0;\n- std::time_t last_seen_complete = 0;\n- int num_complete = -1;\n- int num_incomplete = -1;\n- int num_downloaded = -1;\n- aux::noexcept_movable<std::vector<std::string>> http_seeds;\n- aux::noexcept_movable<std::vector<std::string>> url_seeds;\n- aux::noexcept_movable<std::vector<tcp::endpoint>> peers;\n- aux::noexcept_movable<std::vector<tcp::endpoint>> banned_peers;\n- aux::noexcept_movable<std::map<piece_index_t, bitfield>> unfinished_pieces;\n- typed_bitfield<piece_index_t> have_pieces;\n- typed_bitfield<piece_index_t> verified_pieces;\n- aux::noexcept_movable<std::vector<download_priority_t>> piece_priorities;\n- aux::vector<std::vector<sha256_hash>, file_index_t> merkle_trees;\n- aux::vector<std::vector<bool>, file_index_t> merkle_tree_mask;\n- aux::vector<std::vector<bool>, file_index_t> verified_leaf_hashes;\n- aux::noexcept_movable<std::map<file_index_t, std::string>> renamed_files;\n- std::time_t last_download = 0;\n- std::time_t last_upload = 0;\n-};\n-\n-[report issue]\n-- version
\n-- filled in by the constructor and should be left untouched. It is used\n-for forward binary compatibility.
\n-
\n-[report issue]\n-- ti
\n-- torrent_info object with the torrent to add. Unless the\n-info_hash is set, this is required to be initialized.
\n-
\n-[report issue]\n-- trackers
\n-- If the torrent doesn't have a tracker, but relies on the DHT to find\n-peers, the trackers can specify tracker URLs for the torrent.
\n-
\n-[report issue]\n-- tracker_tiers
\n-- the tiers the URLs in trackers belong to. Trackers belonging to\n-different tiers may be treated differently, as defined by the multi\n-tracker extension. This is optional, if not specified trackers are\n-assumed to be part of tier 0, or whichever the last tier was as\n-iterating over the trackers.
\n-
\n-[report issue]\n-- dht_nodes
\n-- a list of hostname and port pairs, representing DHT nodes to be added\n-to the session (if DHT is enabled). The hostname may be an IP address.
\n-
\n-[report issue]\n-- name
\n-- in case there's no other name in this torrent, this name will be used.\n-The name out of the torrent_info object takes precedence if available.
\n-
\n-[report issue]\n-- save_path
\n-the path where the torrent is or will be stored.
\n-\n-Note
\n-On windows this path (and other paths) are interpreted as UNC\n-paths. This means they must use backslashes as directory separators\n-and may not contain the special directories "." or "..".
\n-\n-Setting this to an absolute path performs slightly better than a\n-relative path.
\n-
\n-[report issue]\n-- storage_mode
\n-- One of the values from storage_mode_t. For more information, see\n-storage allocation.
\n-
\n-[report issue]\n-- userdata
\n-- The userdata parameter is optional and will be passed on to the\n-extension constructor functions, if any\n-(see torrent_handle::add_extension()). It will also be stored in the\n-torrent object and can be retrieved by calling userdata().
\n-
\n-[report issue]\n-- file_priorities
\n-- can be set to control the initial file priorities when adding a\n-torrent. The semantics are the same as for\n-torrent_handle::prioritize_files(). The file priorities specified\n-in here take precedence over those specified in the resume data, if\n-any.\n-If this vector of file priorities is shorter than the number of files\n-in the torrent, the remaining files (not covered by this) will still\n-have the default download priority. This default can be changed by\n-setting the default_dont_download torrent_flag.
\n-
\n-[report issue]\n-- trackerid
\n-- the default tracker id to be used when announcing to trackers. By\n-default this is empty, and no tracker ID is used, since this is an\n-optional argument. If a tracker returns a tracker ID, that ID is used\n-instead of this.
\n-
\n-[report issue]\n-- flags
\n-flags controlling aspects of this torrent and how it's added. See\n-torrent_flags_t for details.
\n-\n-Note
\n-The flags field is initialized with default flags by the\n-constructor. In order to preserve default behavior when clearing or\n-setting other flags, make sure to bitwise OR or in a flag or bitwise\n-AND the inverse of a flag to clear it.
\n-\n-
\n-[report issue]\n-- info_hashes
\n-- set this to the info hash of the torrent to add in case the info-hash\n-is the only known property of the torrent. i.e. you don't have a\n-.torrent file nor a magnet link.\n-To add a magnet link, use parse_magnet_uri() to populate fields in the\n-add_torrent_params object.
\n-
\n-\n-[report issue]\n-- max_uploads max_connections
\n-max_uploads, max_connections, upload_limit,\n-download_limit correspond to the set_max_uploads(),\n-set_max_connections(), set_upload_limit() and\n-set_download_limit() functions on torrent_handle. These values let\n-you initialize these settings when the torrent is added, instead of\n-calling these functions immediately following adding it.
\n--1 means unlimited on these settings just like their counterpart\n-functions on torrent_handle
\n-For fine grained control over rate limits, including making them apply\n-to local peers, see peer classes.
\n-
\n-\n-[report issue]\n-- upload_limit download_limit
\n-- the upload and download rate limits for this torrent, specified in\n-bytes per second. -1 means unlimited.
\n-
\n-\n-[report issue]\n-- total_uploaded total_downloaded
\n-- the total number of bytes uploaded and downloaded by this torrent so\n-far.
\n-
\n-\n-\n-[report issue]\n-- active_time finished_time seeding_time
\n-- the number of seconds this torrent has spent in started, finished and\n-seeding state so far, respectively.
\n-
\n-\n-[report issue]\n-- added_time completed_time
\n-- if set to a non-zero value, this is the posix time of when this torrent\n-was first added, including previous runs/sessions. If set to zero, the\n-internal added_time will be set to the time of when add_torrent() is\n-called.
\n-
\n-[report issue]\n-- last_seen_complete
\n-- if set to non-zero, initializes the time (expressed in posix time) when\n-we last saw a seed or peers that together formed a complete copy of the\n-torrent. If left set to zero, the internal counterpart to this field\n-will be updated when we see a seed or a distributed copies >= 1.0.
\n-
\n-\n-\n-[report issue]\n-- num_complete num_incomplete num_downloaded
\n-these field can be used to initialize the torrent's cached scrape data.\n-The scrape data is high level metadata about the current state of the\n-swarm, as returned by the tracker (either when announcing to it or by\n-sending a specific scrape request). num_complete is the number of\n-peers in the swarm that are seeds, or have every piece in the torrent.\n-num_incomplete is the number of peers in the swarm that do not have\n-every piece. num_downloaded is the number of times the torrent has\n-been downloaded (not initiated, but the number of times a download has\n-completed).
\n-Leaving any of these values set to -1 indicates we don't know, or we\n-have not received any scrape data.
\n-
\n-\n-[report issue]\n-- http_seeds url_seeds
\n-URLs can be added to these two lists to specify additional web\n-seeds to be used by the torrent. If the flag_override_web_seeds\n-is set, these will be the _only_ ones to be used. i.e. any web seeds\n-found in the .torrent file will be overridden.
\n-http_seeds expects URLs to web servers implementing the original HTTP\n-seed specification BEP 17.
\n-url_seeds expects URLs to regular web servers, aka "get right" style,\n-specified in BEP 19.
\n-
\n-[report issue]\n-- peers
\n-- peers to add to the torrent, to be tried to be connected to as\n-bittorrent peers.
\n-
\n-[report issue]\n-- banned_peers
\n-- peers banned from this torrent. The will not be connected to
\n-
\n-[report issue]\n-- unfinished_pieces
\n-- this is a map of partially downloaded piece. The key is the piece index\n-and the value is a bitfield where each bit represents a 16 kiB block.\n-A set bit means we have that block.
\n-
\n-[report issue]\n-- have_pieces
\n-- this is a bitfield indicating which pieces we already have of this\n-torrent.
\n-
\n-[report issue]\n-- verified_pieces
\n-- when in seed_mode, pieces with a set bit in this bitfield have been\n-verified to be valid. Other pieces will be verified the first time a\n-peer requests it.
\n-
\n-[report issue]\n-- piece_priorities
\n-- this sets the priorities for each individual piece in the torrent. Each\n-element in the vector represent the piece with the same index. If you\n-set both file- and piece priorities, file priorities will take\n-precedence.
\n-
\n-[report issue]\n-- merkle_trees
\n-- v2 hashes, if known
\n-
\n-[report issue]\n-- merkle_tree_mask
\n-- if set, indicates which hashes are included in the corresponding\n-vector of merkle_trees. These bitmasks always cover the full\n-tree, a cleared bit means the hash is all zeros (i.e. not set) and\n-set bit means the next hash in the corresponding vector in\n-merkle_trees is the hash for that node. This is an optimization\n-to avoid storing a lot of zeros.
\n-
\n-[report issue]\n-- verified_leaf_hashes
\n-- bit-fields indicating which v2 leaf hashes have been verified\n-against the root hash. If this vector is empty and merkle_trees is\n-non-empty it implies that all hashes in merkle_trees are verified.
\n-
\n-[report issue]\n-- renamed_files
\n-- this is a map of file indices in the torrent and new filenames to be\n-applied before the torrent is added.
\n-
\n-\n-[report issue]\n-- last_download last_upload
\n-- the posix time of the last time payload was received or sent for this\n-torrent, respectively. A value of 0 means we don't know when we last\n-uploaded or downloaded, or we have never uploaded or downloaded any\n-payload for this torrent.
\n-
\n-[report issue]\n-\n-client_data_t
\n-Declared in "libtorrent/client_data.hpp"
\n-A thin wrapper around a void pointer used as "user data". i.e. an opaque\n-cookie passed in to libtorrent and returned on demand. It adds type-safety by\n-requiring the same type be requested out of it as was assigned to it.
\n+[report issue]\n+\n+dht_reply_alert
\n+Declared in "libtorrent/alert_types.hpp"
\n+This alert is generated each time the DHT receives peers from a node. num_peers\n+is the number of peers we received in this packet. Typically these packets are\n+received from multiple DHT nodes, and so the alerts are typically generated\n+a few at a time.
\n \n-struct client_data_t\n+struct dht_reply_alert final : tracker_alert\n {\n- client_data_t () = default;\n- explicit client_data_t (T* v);\n- client_data_t& operator= (T* v);\n- T* get () const;\n- explicit operator T () const;\n- client_data_t& operator= (void*) = delete;\n- operator void* () const = delete;\n- operator void const* () const = delete;\n- client_data_t& operator= (void const*) = delete;\n+ std::string message () const override;\n \n- template <typename T, typename U = typename std::enable_if<std::is_pointer<T>::value>::type>\n+ static constexpr alert_category_t static_category = alert_category::dht | alert_category::tracker;\n+ int const num_peers;\n };\n \n-[report issue]\n-client_data_t()
\n-\n-client_data_t () = default;\n-
\n-construct a nullptr client data
\n-\n-\n-[report issue]\n-\n-operator=() void*() const*()
\n-\n-client_data_t& operator= (void*) = delete;\n-operator void* () const = delete;\n-operator void const* () const = delete;\n-client_data_t& operator= (void const*) = delete;\n-
\n-we don't allow type-unsafe operations
\n-[report issue]\n-\n-\n-file_slice
\n-Declared in "libtorrent/file_storage.hpp"
\n-represents a window of a file in a torrent.
\n-The file_index refers to the index of the file (in the torrent_info).\n-To get the path and filename, use file_path() and give the file_index\n-as argument. The offset is the byte offset in the file where the range\n-starts, and size is the number of bytes this range is. The size + offset\n-will never be greater than the file size.
\n+[report issue]\n+\n+tracker_announce_alert
\n+Declared in "libtorrent/alert_types.hpp"
\n+This alert is generated each time a tracker announce is sent (or attempted to be sent).\n+There are no extra data members in this alert. The url can be found in the base class\n+however.
\n \n-struct file_slice\n+struct tracker_announce_alert final : tracker_alert\n {\n- file_index_t file_index;\n- std::int64_t offset;\n- std::int64_t size;\n+ std::string message () const override;\n+\n+ static constexpr alert_category_t static_category = alert_category::tracker;\n+ event_t const event;\n+ protocol_version version;\n };\n \n-[report issue]\n-- file_index
\n-- the index of the file
\n-
\n-[report issue]\n-- offset
\n-- the offset from the start of the file, in bytes
\n+[report issue]\n+- event
\n+- specifies what event was sent to the tracker. See event_t.
\n
\n-[report issue]\n-- size
\n-- the size of the window, in bytes
\n+[report issue]\n+- version
\n+- the bittorrent protocol version that is announced
\n
\n-[report issue]
\n-\n-file_storage
\n-Declared in "libtorrent/file_storage.hpp"
\n-The file_storage class represents a file list and the piece\n-size. Everything necessary to interpret a regular bittorrent storage\n-file structure.
\n+[report issue]\n+\n+hash_failed_alert
\n+Declared in "libtorrent/alert_types.hpp"
\n+This alert is generated when a finished piece fails its hash check. You can get the handle\n+to the torrent which got the failed piece and the index of the piece itself from the alert.
\n \n-class file_storage\n+struct hash_failed_alert final : torrent_alert\n {\n- bool is_valid () const;\n- void reserve (int num_files);\n- void add_file (std::string const& path, std::int64_t file_size\n- , file_flags_t file_flags = {}\n- , std::time_t mtime = 0, string_view symlink_path = string_view()\n- , char const* root_hash = nullptr);\n- void add_file (error_code& ec, std::string const& path, std::int64_t file_size\n- , file_flags_t file_flags = {}\n- , std::time_t mtime = 0, string_view symlink_path = string_view()\n- , char const* root_hash = nullptr);\n- void add_file_borrow (string_view filename\n- , std::string const& path, std::int64_t file_size\n- , file_flags_t file_flags = {}, char const* filehash = nullptr\n- , std::int64_t mtime = 0, string_view symlink_path = string_view()\n- , char const* root_hash = nullptr);\n- void add_file_borrow (error_code& ec, string_view filename\n- , std::string const& path, std::int64_t file_size\n- , file_flags_t file_flags = {}, char const* filehash = nullptr\n- , std::int64_t mtime = 0, string_view symlink_path = string_view()\n- , char const* root_hash = nullptr);\n- void rename_file (file_index_t index, std::string const& new_filename);\n- std::vector<file_slice> map_block (piece_index_t piece, std::int64_t offset\n- , std::int64_t size) const;\n- peer_request map_file (file_index_t file, std::int64_t offset, int size) const;\n- int num_files () const noexcept;\n- file_index_t end_file () const noexcept;\n- index_range<file_index_t> file_range () const noexcept;\n- std::int64_t total_size () const;\n- int num_pieces () const;\n- void set_num_pieces (int n);\n- piece_index_t end_piece () const;\n- piece_index_t last_piece () const;\n- index_range<piece_index_t> piece_range () const noexcept;\n- void set_piece_length (int l);\n- int piece_length () const;\n- int piece_size (piece_index_t index) const;\n- int piece_size2 (piece_index_t index) const;\n- int blocks_in_piece2 (piece_index_t index) const;\n- int blocks_per_piece () const;\n- void set_name (std::string const& n);\n- std::string const& name () const;\n- void swap (file_storage& ti) noexcept;\n- void canonicalize ();\n- bool pad_file_at (file_index_t index) const;\n- std::string file_path (file_index_t index, std::string const& save_path = "") const;\n- std::int64_t file_offset (file_index_t index) const;\n- sha1_hash hash (file_index_t index) const;\n- std::int64_t file_size (file_index_t index) const;\n- char const* root_ptr (file_index_t const index) const;\n- sha256_hash root (file_index_t index) const;\n- string_view file_name (file_index_t index) const;\n- std::string symlink (file_index_t index) const;\n- std::time_t mtime (file_index_t index) const;\n- index_range<piece_index_t::diff_type> file_piece_range (file_index_t) const;\n- int file_num_blocks (file_index_t index) const;\n- int file_num_pieces (file_index_t index) const;\n- int file_first_block_node (file_index_t index) const;\n- int file_first_piece_node (file_index_t index) const;\n- std::uint32_t file_path_hash (file_index_t index, std::string const& save_path) const;\n- void all_path_hashes (std::unordered_set<std::uint32_t>& table) const;\n- file_flags_t file_flags (file_index_t index) const;\n- bool file_absolute_path (file_index_t index) const;\n- file_index_t file_index_at_offset (std::int64_t offset) const;\n- file_index_t file_index_at_piece (piece_index_t piece) const;\n- file_index_t file_index_for_root (sha256_hash const& root_hash) const;\n- piece_index_t piece_index_at_file (file_index_t f) const;\n- void sanitize_symlinks ();\n- bool v2 () const;\n+ std::string message () const override;\n \n- static constexpr file_flags_t flag_pad_file = 0_bit;\n- static constexpr file_flags_t flag_hidden = 1_bit;\n- static constexpr file_flags_t flag_executable = 2_bit;\n- static constexpr file_flags_t flag_symlink = 3_bit;\n+ static constexpr alert_category_t static_category = alert_category::status;\n+ piece_index_t const piece_index;\n };\n \n-[report issue]\n-is_valid()
\n-\n-bool is_valid () const;\n-
\n-returns true if the piece length has been initialized\n-on the file_storage. This is typically taken as a proxy\n-of whether the file_storage as a whole is initialized or\n-not.
\n-[report issue]\n-\n-reserve()
\n-\n-void reserve (int num_files);\n-
\n-allocates space for num_files in the internal file list. This can\n-be used to avoid reallocating the internal file list when the number\n-of files to be added is known up-front.
\n-\n-[report issue]\n-\n-add_file_borrow() add_file()
\n-\n-void add_file (std::string const& path, std::int64_t file_size\n- , file_flags_t file_flags = {}\n- , std::time_t mtime = 0, string_view symlink_path = string_view()\n- , char const* root_hash = nullptr);\n-void add_file (error_code& ec, std::string const& path, std::int64_t file_size\n- , file_flags_t file_flags = {}\n- , std::time_t mtime = 0, string_view symlink_path = string_view()\n- , char const* root_hash = nullptr);\n-void add_file_borrow (string_view filename\n- , std::string const& path, std::int64_t file_size\n- , file_flags_t file_flags = {}, char const* filehash = nullptr\n- , std::int64_t mtime = 0, string_view symlink_path = string_view()\n- , char const* root_hash = nullptr);\n-void add_file_borrow (error_code& ec, string_view filename\n- , std::string const& path, std::int64_t file_size\n- , file_flags_t file_flags = {}, char const* filehash = nullptr\n- , std::int64_t mtime = 0, string_view symlink_path = string_view()\n- , char const* root_hash = nullptr);\n-\n-Adds a file to the file storage. The add_file_borrow version\n-expects that filename is the file name (without a path) of\n-the file that's being added.\n-This memory is borrowed, i.e. it is the caller's\n-responsibility to make sure it stays valid throughout the lifetime\n-of this file_storage object or any copy of it. The same thing applies\n-to filehash, which is an optional pointer to a 20 byte binary\n-SHA-1 hash of the file.
\n-if filename is empty, the filename from path is used and not\n-borrowed.
\n-The path argument is the full path (in the torrent file) to\n-the file to add. Note that this is not supposed to be an absolute\n-path, but it is expected to include the name of the torrent as the\n-first path element.
\n-file_size is the size of the file in bytes.
\n-The file_flags argument sets attributes on the file. The file\n-attributes is an extension and may not work in all bittorrent clients.
\n-For possible file attributes, see file_storage::flags_t.
\n-The mtime argument is optional and can be set to 0. If non-zero,\n-it is the posix time of the last modification time of this file.
\n-symlink_path is the path the file is a symlink to. To make this a\n-symlink you also need to set the file_storage::flag_symlink file flag.
\n-root_hash is an optional pointer to a 32 byte SHA-256 hash, being\n-the merkle tree root hash for this file. This is only used for v2\n-torrents. If the root hash is specified for one file, it has to\n-be specified for all, otherwise this function will fail.\n-Note that the buffer root_hash points to must out-live the\n-file_storage object, it will not be copied. This parameter is only\n-used when loading torrents, that already have their file hashes\n-computed. When creating torrents, the file hashes will be computed by\n-the piece hashes.
\n-If more files than one are added, certain restrictions to their paths\n-apply. In a multi-file file storage (torrent), all files must share\n-the same root directory.
\n-That is, the first path element of all files must be the same.\n-This shared path element is also set to the name of the torrent. It\n-can be changed by calling set_name.
\n-The overloads that take an error_code reference will report failures\n-via that variable, otherwise system_error is thrown.
\n-[report issue]\n-\n-rename_file()
\n-\n-void rename_file (file_index_t index, std::string const& new_filename);\n-
\n-renames the file at index to new_filename. Keep in mind\n-that filenames are expected to be UTF-8 encoded.
\n-[report issue]\n-\n-map_block()
\n-\n-std::vector<file_slice> map_block (piece_index_t piece, std::int64_t offset\n- , std::int64_t size) const;\n-
\n-returns a list of file_slice objects representing the portions of\n-files the specified piece index, byte offset and size range overlaps.\n-this is the inverse mapping of map_file().
\n-Preconditions of this function is that the input range is within the\n-torrents address space. piece may not be negative and
\n-\n-piece * piece_size + offset + size
\n-may not exceed the total size of the torrent.
\n-[report issue]\n-\n-map_file()
\n-\n-peer_request map_file (file_index_t file, std::int64_t offset, int size) const;\n-
\n-returns a peer_request representing the piece index, byte offset\n-and size the specified file range overlaps. This is the inverse\n-mapping over map_block(). Note that the peer_request return type\n-is meant to hold bittorrent block requests, which may not be larger\n-than 16 kiB. Mapping a range larger than that may return an overflown\n-integer.
\n-[report issue]\n-\n-num_files()
\n-\n-int num_files () const noexcept;\n-
\n-returns the number of files in the file_storage
\n-[report issue]\n-\n-end_file()
\n-\n-file_index_t end_file () const noexcept;\n-
\n-returns the index of the one-past-end file in the file storage
\n-[report issue]\n-\n-file_range()
\n-\n-index_range<file_index_t> file_range () const noexcept;\n-
\n-returns an implementation-defined type that can be used as the\n-container in a range-for loop. Where the values are the indices of all\n-files in the file_storage.
\n-[report issue]\n-\n-total_size()
\n-\n-std::int64_t total_size () const;\n-
\n-returns the total number of bytes all the files in this torrent spans
\n-\n-[report issue]\n-\n-set_num_pieces() num_pieces()
\n-\n-int num_pieces () const;\n-void set_num_pieces (int n);\n-
\n-set and get the number of pieces in the torrent
\n-[report issue]\n-\n-end_piece()
\n-\n-piece_index_t end_piece () const;\n-
\n-returns the index of the one-past-end piece in the file storage
\n-[report issue]\n-\n-last_piece()
\n-\n-piece_index_t last_piece () const;\n-
\n-returns the index of the last piece in the torrent. The last piece is\n-special in that it may be smaller than the other pieces (and the other\n-pieces are all the same size).
\n-[report issue]\n-\n-piece_range()
\n-\n-index_range<piece_index_t> piece_range () const noexcept;\n-
\n-returns an implementation-defined type that can be used as the\n-container in a range-for loop. Where the values are the indices of all\n-pieces in the file_storage.
\n-\n-[report issue]\n-\n-piece_length() set_piece_length()
\n-\n-void set_piece_length (int l);\n-int piece_length () const;\n-
\n-set and get the size of each piece in this torrent. It must be a power of two\n-and at least 16 kiB.
\n-[report issue]\n-\n-piece_size()
\n-\n-int piece_size (piece_index_t index) const;\n-
\n-returns the piece size of index. This will be the same as piece_length(), except\n-for the last piece, which may be shorter.
\n-[report issue]\n-\n-piece_size2()
\n-\n-int piece_size2 (piece_index_t index) const;\n-
\n-Returns the size of the given piece. If the piece spans multiple files,\n-only the first file is considered part of the piece. This is used for\n-v2 torrents, where all files are piece aligned and padded. i.e. The pad\n-files are not considered part of the piece for this purpose.
\n-[report issue]\n-\n-blocks_in_piece2()
\n-\n-int blocks_in_piece2 (piece_index_t index) const;\n-
\n-returns the number of blocks in the specified piece, for v2 torrents.
\n-[report issue]\n-\n-blocks_per_piece()
\n-\n-int blocks_per_piece () const;\n-
\n-returns the number of blocks there are in the typical piece. There\n-may be fewer in the last piece)
\n-\n-[report issue]\n-\n-name() set_name()
\n-\n-void set_name (std::string const& n);\n-std::string const& name () const;\n-
\n-set and get the name of this torrent. For multi-file torrents, this is also\n-the name of the root directory all the files are stored in.
\n-[report issue]\n-\n-swap()
\n-\n-void swap (file_storage& ti) noexcept;\n-
\n-swap all content of this with ti.
\n-[report issue]\n-\n-canonicalize()
\n-\n-void canonicalize ();\n-
\n-arrange files and padding to match the canonical form required\n-by BEP 52
\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-[report issue]\n-\n-hash() root() file_path() file_name() pad_file_at() file_offset() mtime() symlink() root_ptr() file_size()
\n-\n-bool pad_file_at (file_index_t index) const;\n-std::string file_path (file_index_t index, std::string const& save_path = "") const;\n-std::int64_t file_offset (file_index_t index) const;\n-sha1_hash hash (file_index_t index) const;\n-std::int64_t file_size (file_index_t index) const;\n-char const* root_ptr (file_index_t const index) const;\n-sha256_hash root (file_index_t index) const;\n-string_view file_name (file_index_t index) const;\n-std::string symlink (file_index_t index) const;\n-std::time_t mtime (file_index_t index) const;\n-
\n-These functions are used to query attributes of files at\n-a given index.
\n-The hash() is a SHA-1 hash of the file, or 0 if none was\n-provided in the torrent file. This can potentially be used to\n-join a bittorrent network with other file sharing networks.
\n-root() returns the SHA-256 merkle tree root of the specified file,\n-in case this is a v2 torrent. Otherwise returns zeros.\n-root_ptr() returns a pointer to the SHA-256 merkle tree root hash\n-for the specified file. The pointer points into storage referred to\n-when the file was added, it is not owned by this object. Torrents\n-that are not v2 torrents return nullptr.
\n-The mtime() is the modification time is the posix\n-time when a file was last modified when the torrent\n-was created, or 0 if it was not included in the torrent file.
\n-file_path() returns the full path to a file.
\n-file_size() returns the size of a file.
\n-pad_file_at() returns true if the file at the given\n-index is a pad-file.
\n-file_name() returns just the name of the file, whereas\n-file_path() returns the path (inside the torrent file) with\n-the filename appended.
\n-file_offset() returns the byte offset within the torrent file\n-where this file starts. It can be used to map the file to a piece\n-index (given the piece size).
\n-\n-\n-[report issue]\n-\n-file_num_pieces() file_piece_range() file_num_blocks()
\n-\n-index_range<piece_index_t::diff_type> file_piece_range (file_index_t) const;\n-int file_num_blocks (file_index_t index) const;\n-int file_num_pieces (file_index_t index) const;\n-
\n-Returns the number of pieces or blocks the file at index spans,\n-under the assumption that the file is aligned to the start of a piece.\n-This is only meaningful for v2 torrents, where files are guaranteed\n-such alignment.\n-These numbers are used to size and navigate the merkle hash tree for\n-each file.
\n-\n-[report issue]\n-\n-file_first_block_node() file_first_piece_node()
\n-\n-int file_first_block_node (file_index_t index) const;\n-int file_first_piece_node (file_index_t index) const;\n-
\n-index of first piece node in the merkle tree
\n-[report issue]\n-\n-file_path_hash()
\n-\n-std::uint32_t file_path_hash (file_index_t index, std::string const& save_path) const;\n-
\n-returns the crc32 hash of file_path(index)
\n-[report issue]\n-\n-all_path_hashes()
\n-\n-void all_path_hashes (std::unordered_set<std::uint32_t>& table) const;\n-
\n-this will add the CRC32 hash of all directory entries to the table. No\n-filename will be included, just directories. Every depth of directories\n-are added separately to allow test for collisions with files at all\n-levels. i.e. if one path in the torrent is foo/bar/baz, the CRC32\n-hashes for foo, foo/bar and foo/bar/baz will be added to\n-the set.
\n-[report issue]\n-\n-file_flags()
\n-\n-file_flags_t file_flags (file_index_t index) const;\n-
\n-returns a bitmask of flags from file_flags_t that apply\n-to file at index.
\n-[report issue]\n-\n-file_absolute_path()
\n-\n-bool file_absolute_path (file_index_t index) const;\n-
\n-returns true if the file at the specified index has been renamed to\n-have an absolute path, i.e. is not anchored in the save path of the\n-torrent.
\n-\n-[report issue]\n-\n-file_index_at_piece() file_index_at_offset()
\n-\n-file_index_t file_index_at_offset (std::int64_t offset) const;\n-file_index_t file_index_at_piece (piece_index_t piece) const;\n-
\n-returns the index of the file at the given offset in the torrent
\n-[report issue]\n-\n+\n+peer_ban_alert
\n+Declared in "libtorrent/alert_types.hpp"
\n+This alert is generated when a peer is banned because it has sent too many corrupt pieces\n+to us. ip is the endpoint to the peer that was banned.
\n \n-file_index_t file_index_for_root (sha256_hash const& root_hash) const;\n+struct peer_ban_alert final : peer_alert\n+{\n+ std::string message () const override;\n+\n+ static constexpr alert_category_t static_category = alert_category::peer;\n+};\n \n-finds the file with the given root hash and returns its index\n-if there is no file with the root hash, file_index_t{-1} is returned
\n-[report issue]\n-\n+\n+peer_unsnubbed_alert
\n+Declared in "libtorrent/alert_types.hpp"
\n+This alert is generated when a peer is un-snubbed. Essentially when it was snubbed for stalling\n+sending data, and now it started sending data again.
\n \n-piece_index_t piece_index_at_file (file_index_t f) const;\n+struct peer_unsnubbed_alert final : peer_alert\n+{\n+ std::string message () const override;\n+\n+ static constexpr alert_category_t static_category = alert_category::peer;\n+};\n \n-returns the piece index the given file starts at
\n-[report issue]\n-\n+\n+peer_snubbed_alert
\n+Declared in "libtorrent/alert_types.hpp"
\n+This alert is generated when a peer is snubbed, when it stops sending data when we request\n+it.
\n \n-void sanitize_symlinks ();\n+struct peer_snubbed_alert final : peer_alert\n+{\n+ std::string message () const override;\n+\n+ static constexpr alert_category_t static_category = alert_category::peer;\n+};\n \n-validate any symlinks, to ensure they all point to\n-other files or directories inside this storage. Any invalid symlinks\n-are updated to point to themselves.
\n-[report issue]\n-\n+\n+peer_error_alert
\n+Declared in "libtorrent/alert_types.hpp"
\n+This alert is generated when a peer sends invalid data over the peer-peer protocol. The peer\n+will be disconnected, but you get its ip address from the alert, to identify it.
\n \n-bool v2 () const;\n+struct peer_error_alert final : peer_alert\n+{\n+ std::string message () const override;\n+\n+ static constexpr alert_category_t static_category = alert_category::peer;\n+ operation_t op;\n+ error_code const error;\n+};\n \n-returns true if this torrent contains v2 metadata.
\n-[report issue]\n-- flag_pad_file
\n-- the file is a pad file. It's required to contain zeros\n-at it will not be saved to disk. Its purpose is to make\n-the following file start on a piece boundary.
\n-
\n-[report issue]\n-- flag_hidden
\n-- this file has the hidden attribute set. This is primarily\n-a windows attribute
\n-
\n-[report issue]\n-- flag_executable
\n-- this file has the executable attribute set.
\n+[report issue]\n+- op
\n+- a 0-terminated string of the low-level operation that failed, or nullptr if\n+there was no low level disk operation.
\n
\n-[report issue]\n-- flag_symlink
\n-- this file is a symbolic link. It should have a link\n-target string associated with it.
\n+[report issue]\n+- error
\n+- tells you what error caused this alert.
\n
\n-[report issue]
\n-\n-\n-storage_params
\n-Declared in "libtorrent/storage_defs.hpp"
\n-a parameter pack used to construct the storage for a torrent, used in\n-disk_interface
\n+[report issue]\n+\n+peer_connect_alert
\n+Declared in "libtorrent/alert_types.hpp"
\n+This alert is posted every time an incoming peer connection both\n+successfully passes the protocol handshake and is associated with a\n+torrent, or an outgoing peer connection attempt succeeds. For arbitrary\n+incoming connections, see incoming_connection_alert.
\n \n-struct storage_params\n+struct peer_connect_alert final : peer_alert\n {\n- storage_params (file_storage const& f, file_storage const* mf\n- , std::string const& sp, storage_mode_t const sm\n- , aux::vector<download_priority_t, file_index_t> const& prio\n- , sha1_hash const& ih);\n+ std::string message () const override;\n \n- file_storage const& files;\n- file_storage const* mapped_files = nullptr;\n- std::string const& path;\n- storage_mode_t mode {storage_mode_sparse};\n- aux::vector<download_priority_t, file_index_t> const& priorities;\n- sha1_hash info_hash;\n+ enum direction_t\n+ {\n+ in,\n+ out,\n+ };\n+\n+ static constexpr alert_category_t static_category = alert_category::connect;\n+ direction_t direction;\n+ socket_type_t socket_type;\n };\n \n-[report issue]\n-\n-mmap_disk_io_constructor()
\n-Declared in "libtorrent/mmap_disk_io.hpp"
\n-\n-std::unique_ptr<disk_interface> mmap_disk_io_constructor (\n- io_context& ios, settings_interface const&, counters& cnt);\n-
\n-constructs a memory mapped file disk I/O object.
\n-[report issue]\n-\n-default_disk_io_constructor()
\n-Declared in "libtorrent/session.hpp"
\n-\n-std::unique_ptr<disk_interface> default_disk_io_constructor (\n- io_context& ios, settings_interface const&, counters& cnt);\n-
\n-the constructor function for the default storage. On systems that support\n-memory mapped files (and a 64 bit address space) the memory mapped storage\n-will be constructed, otherwise the portable posix storage.
\n-[report issue]\n-\n-disabled_disk_io_constructor()
\n-Declared in "libtorrent/disabled_disk_io.hpp"
\n-\n-std::unique_ptr<disk_interface> disabled_disk_io_constructor (\n- io_context& ios, settings_interface const&, counters& cnt);\n-
\n-creates a disk io object that discards all data written to it, and only\n-returns zero-buffers when read from. May be useful for testing and\n-benchmarking.
\n-[report issue]\n-\n-posix_disk_io_constructor()
\n-Declared in "libtorrent/posix_disk_io.hpp"
\n-\n-std::unique_ptr<disk_interface> posix_disk_io_constructor (\n- io_context& ios, settings_interface const&, counters& cnt);\n-
\n-this is a simple posix disk I/O back-end, used for systems that don't\n-have a 64 bit virtual address space or don't support memory mapped files.\n-It's implemented using portable C file functions and is single-threaded.
\n-[report issue]\n-\n-enum storage_mode_t
\n-Declared in "libtorrent/storage_defs.hpp"
\n-\n-\n- \n-\n-name \n-value \n-description \n-storage_mode_allocate \n-0 \n-All pieces will be written to their final position, all files will be\n-allocated in full when the torrent is first started. This mode minimizes\n-fragmentation but could be a costly operation. \n-storage_mode_sparse \n-1 \n-All pieces will be written to the place where they belong and sparse files\n-will be used. This is the recommended, and default mode. \n-
\n-[report issue]\n-\n-enum status_t
\n-Declared in "libtorrent/storage_defs.hpp"
\n+[report issue]\n+enum direction_t
\n+Declared in "libtorrent/alert_types.hpp"
\n \n \n- \n \n name \n value \n description \n no_error \n+in \n 0 \n \n fatal_disk_error \n+out \n 1 \n \n need_full_check \n-2 \n- \n-file_exist \n-3 \n- \n-oversized_file \n-16 \n-this is not an enum value, but a flag that can be set in the return\n-from async_check_files, in case an existing file was found larger than\n-specified in the torrent. i.e. it has garbage at the end\n-the status_t field is used for this to preserve ABI. \n-
\n-[report issue]\n-\n-enum move_flags_t
\n-Declared in "libtorrent/storage_defs.hpp"
\n-\n-\n- \n-\n-name \n-value \n-description \n-always_replace_files \n-0 \n-replace any files in the destination when copying\n-or moving the storage \n-fail_if_exist \n-1 \n-if any files that we want to copy exist in the destination\n-exist, fail the whole operation and don't perform\n-any copy or move. There is an inherent race condition\n-in this mode. The files are checked for existence before\n-the operation starts. In between the check and performing\n-the copy, the destination files may be created, in which\n-case they are replaced. \n-dont_replace \n-2 \n-if any file exist in the target, take those files instead\n-of the ones we may have in the source. \n-reset_save_path \n-3 \n-don't move any source files, just forget about them\n-and begin checking files at new save path \n-reset_save_path_unchecked \n-4 \n-don't move any source files, just change save path\n-and continue working without any checks \n-
\n-[report issue]\n-\n-peer_request
\n-Declared in "libtorrent/peer_request.hpp"
\n-represents a byte range within a piece. Internally this is is used for\n-incoming piece requests.
\n+[report issue]\n+- direction
\n+- Tells you if the peer was incoming or outgoing
\n+
\n+[report issue]\n+\n+\n+peer_disconnected_alert
\n+Declared in "libtorrent/alert_types.hpp"
\n+This alert is generated when a peer is disconnected for any reason (other than the ones\n+covered by peer_error_alert ).
\n \n-struct peer_request\n+struct peer_disconnected_alert final : peer_alert\n {\n- bool operator== (peer_request const& r) const;\n+ std::string message () const override;\n \n- piece_index_t piece;\n- int start;\n- int length;\n+ static constexpr alert_category_t static_category = alert_category::connect;\n+ socket_type_t const socket_type;\n+ operation_t const op;\n+ error_code const error;\n+ close_reason_t const reason;\n };\n \n-[report issue]\n-operator==()
\n-\n-bool operator== (peer_request const& r) const;\n-
\n-returns true if the right hand side peer_request refers to the same\n-range as this does.
\n-[report issue]\n-- piece
\n-- The index of the piece in which the range starts.
\n+[report issue]\n+- socket_type
\n+- the kind of socket this peer was connected over
\n
\n-[report issue]\n-- start
\n-- The byte offset within that piece where the range starts.
\n+[report issue]\n+- op
\n+- the operation or level where the error occurred. Specified as an\n+value from the operation_t enum. Defined in operations.hpp.
\n
\n-[report issue]\n-- length
\n-- The size of the range, in bytes.
\n+[report issue]\n+- error
\n+- tells you what error caused peer to disconnect.
\n
\n-[report issue]
\n-\n-\n-peer_info
\n-Declared in "libtorrent/peer_info.hpp"
\n-holds information and statistics about one peer\n-that libtorrent is connected to
\n+[report issue]\n+- reason
\n+- the reason the peer disconnected (if specified)
\n+
\n+[report issue]\n+\n+invalid_request_alert
\n+Declared in "libtorrent/alert_types.hpp"
\n+This is a debug alert that is generated by an incoming invalid piece request.\n+ip is the address of the peer and the request is the actual incoming\n+request from the peer. See peer_request for more info.
\n \n-struct peer_info\n+struct invalid_request_alert final : peer_alert\n {\n- sha256_hash i2p_destination () const;\n+ std::string message () const override;\n \n- std::string client;\n- typed_bitfield<piece_index_t> pieces;\n- std::int64_t total_download;\n- std::int64_t total_upload;\n- time_duration last_request;\n- time_duration last_active;\n- time_duration download_queue_time;\n- static constexpr peer_flags_t interesting = 0_bit;\n- static constexpr peer_flags_t choked = 1_bit;\n- static constexpr peer_flags_t remote_interested = 2_bit;\n- static constexpr peer_flags_t remote_choked = 3_bit;\n- static constexpr peer_flags_t supports_extensions = 4_bit;\n- static constexpr peer_flags_t outgoing_connection = 5_bit;\n- static constexpr peer_flags_t local_connection = 5_bit;\n- static constexpr peer_flags_t handshake = 6_bit;\n- static constexpr peer_flags_t connecting = 7_bit;\n- static constexpr peer_flags_t on_parole = 9_bit;\n- static constexpr peer_flags_t seed = 10_bit;\n- static constexpr peer_flags_t optimistic_unchoke = 11_bit;\n- static constexpr peer_flags_t snubbed = 12_bit;\n- static constexpr peer_flags_t upload_only = 13_bit;\n- static constexpr peer_flags_t endgame_mode = 14_bit;\n- static constexpr peer_flags_t holepunched = 15_bit;\n- static constexpr peer_flags_t i2p_socket = 16_bit;\n- static constexpr peer_flags_t utp_socket = 17_bit;\n- static constexpr peer_flags_t ssl_socket = 18_bit;\n- static constexpr peer_flags_t rc4_encrypted = 19_bit;\n- static constexpr peer_flags_t plaintext_encrypted = 20_bit;\n- peer_flags_t flags;\n- static constexpr peer_source_flags_t tracker = 0_bit;\n- static constexpr peer_source_flags_t dht = 1_bit;\n- static constexpr peer_source_flags_t pex = 2_bit;\n- static constexpr peer_source_flags_t lsd = 3_bit;\n- static constexpr peer_source_flags_t resume_data = 4_bit;\n- static constexpr peer_source_flags_t incoming = 5_bit;\n- peer_source_flags_t source;\n- int up_speed;\n- int down_speed;\n- int payload_up_speed;\n- int payload_down_speed;\n- peer_id pid;\n- int queue_bytes;\n- int request_timeout;\n- int send_buffer_size;\n- int used_send_buffer;\n- int receive_buffer_size;\n- int used_receive_buffer;\n- int receive_buffer_watermark;\n- int num_hashfails;\n- int download_queue_length;\n- int timed_out_requests;\n- int busy_requests;\n- int requests_in_buffer;\n- int target_dl_queue_length;\n- int upload_queue_length;\n- int failcount;\n- piece_index_t downloading_piece_index;\n- int downloading_block_index;\n- int downloading_progress;\n- int downloading_total;\n- static constexpr connection_type_t standard_bittorrent = 0_bit;\n- static constexpr connection_type_t web_seed = 1_bit;\n- static constexpr connection_type_t http_seed = 2_bit;\n- connection_type_t connection_type;\n- int pending_disk_bytes;\n- int pending_disk_read_bytes;\n- int send_quota;\n- int receive_quota;\n- int rtt;\n- int num_pieces;\n- int download_rate_peak;\n- int upload_rate_peak;\n- float progress;\n- int progress_ppm;\n- tcp::endpoint ip;\n- tcp::endpoint local_endpoint;\n- static constexpr bandwidth_state_flags_t bw_idle = 0_bit;\n- static constexpr bandwidth_state_flags_t bw_limit = 1_bit;\n- static constexpr bandwidth_state_flags_t bw_network = 2_bit;\n- static constexpr bandwidth_state_flags_t bw_disk = 4_bit;\n- bandwidth_state_flags_t read_state;\n- bandwidth_state_flags_t write_state;\n+ static constexpr alert_category_t static_category = alert_category::peer;\n+ peer_request const request;\n+ bool const we_have;\n+ bool const peer_interested;\n+ bool const withheld;\n };\n \n-[report issue]\n-i2p_destination()
\n-\n-sha256_hash i2p_destination () const;\n-
\n-If this peer is an i2p peer, this function returns the destination\n-address of the peer
\n-[report issue]\n-- client
\n-- A human readable string describing the software at the other end of\n-the connection. In some cases this information is not available, then\n-it will contain a string that may give away something about which\n-software is running in the other end. In the case of a web seed, the\n-server type and version will be a part of this string. This is UTF-8\n-encoded.
\n-
\n-[report issue]\n-- pieces
\n-- a bitfield, with one bit per piece in the torrent. Each bit tells you\n-if the peer has that piece (if it's set to 1) or if the peer miss that\n-piece (set to 0).
\n-
\n-\n-[report issue]\n-- total_download total_upload
\n-- the total number of bytes downloaded from and uploaded to this peer.\n-These numbers do not include the protocol chatter, but only the\n-payload data.
\n-
\n-\n-[report issue]\n-- last_request last_active
\n-- the time since we last sent a request to this peer and since any\n-transfer occurred with this peer
\n-
\n-[report issue]\n-- download_queue_time
\n-- the time until all blocks in the request queue will be downloaded
\n-
\n-[report issue]\n-- interesting
\n-- we are interested in pieces from this peer.
\n-
\n-[report issue]\n-- choked
\n-- we have choked this peer.
\n-
\n-[report issue]\n-- remote_interested
\n-- the peer is interested in us
\n-
\n-[report issue]\n-- remote_choked
\n-- the peer has choked us.
\n-
\n-[report issue]\n-- supports_extensions
\n-- means that this peer supports the\n-extension protocol.
\n-
\n-[report issue]\n-- outgoing_connection
\n-- The connection was initiated by us, the peer has a\n-listen port open, and that port is the same as in the\n-address of this peer. If this flag is not set, this\n-peer connection was opened by this peer connecting to\n-us.
\n-
\n-[report issue]\n-- local_connection
\n-- deprecated synonym for outgoing_connection
\n-
\n-[report issue]\n-- handshake
\n-- The connection is opened, and waiting for the\n-handshake. Until the handshake is done, the peer\n-cannot be identified.
\n-
\n-[report issue]\n-- connecting
\n-- The connection is in a half-open state (i.e. it is\n-being connected).
\n-
\n-[report issue]\n-- on_parole
\n-- The peer has participated in a piece that failed the\n-hash check, and is now "on parole", which means we're\n-only requesting whole pieces from this peer until\n-it either fails that piece or proves that it doesn't\n-send bad data.
\n-
\n-[report issue]\n-- seed
\n-- This peer is a seed (it has all the pieces).
\n-
\n-[report issue]\n-- optimistic_unchoke
\n-- This peer is subject to an optimistic unchoke. It has\n-been unchoked for a while to see if it might unchoke\n-us in return an earn an upload/unchoke slot. If it\n-doesn't within some period of time, it will be choked\n-and another peer will be optimistically unchoked.
\n-
\n-[report issue]\n-- snubbed
\n-- This peer has recently failed to send a block within\n-the request timeout from when the request was sent.\n-We're currently picking one block at a time from this\n-peer.
\n-
\n-[report issue]\n-- upload_only
\n-- This peer has either explicitly (with an extension)\n-or implicitly (by becoming a seed) told us that it\n-will not downloading anything more, regardless of\n-which pieces we have.
\n-
\n-[report issue]\n-- endgame_mode
\n-- This means the last time this peer picket a piece,\n-it could not pick as many as it wanted because there\n-were not enough free ones. i.e. all pieces this peer\n-has were already requested from other peers.
\n-
\n-[report issue]\n-- holepunched
\n-- This flag is set if the peer was in holepunch mode\n-when the connection succeeded. This typically only\n-happens if both peers are behind a NAT and the peers\n-connect via the NAT holepunch mechanism.
\n-
\n-[report issue]\n-- i2p_socket
\n-- indicates that this socket is running on top of the\n-I2P transport.
\n-
\n-[report issue]\n-- utp_socket
\n-- indicates that this socket is a uTP socket
\n-
\n-[report issue]\n-- ssl_socket
\n-- indicates that this socket is running on top of an SSL\n-(TLS) channel
\n-
\n-[report issue]\n-- rc4_encrypted
\n-- this connection is obfuscated with RC4
\n-
\n-[report issue]\n-- plaintext_encrypted
\n-- the handshake of this connection was obfuscated\n-with a Diffie-Hellman exchange
\n-
\n-[report issue]\n-- flags
\n-- tells you in which state the peer is in. It is set to\n-any combination of the peer_flags_t flags above.
\n-
\n-[report issue]\n-- tracker
\n-- The peer was received from the tracker.
\n-
\n-[report issue]\n-- dht
\n-- The peer was received from the kademlia DHT.
\n-
\n-[report issue]\n-- pex
\n-- The peer was received from the peer exchange\n-extension.
\n-
\n-[report issue]\n-- lsd
\n-- The peer was received from the local service\n-discovery (The peer is on the local network).
\n-
\n-[report issue]\n-- resume_data
\n-- The peer was added from the fast resume data.
\n-
\n-[report issue]\n-- incoming
\n-- we received an incoming connection from this peer
\n-
\n-[report issue]\n-- source
\n-- a combination of flags describing from which sources this peer\n-was received. A combination of the peer_source_flags_t above.
\n-
\n-\n-[report issue]\n-- up_speed down_speed
\n-- the current upload and download speed we have to and from this peer\n-(including any protocol messages). updated about once per second
\n-
\n-\n-[report issue]\n-- payload_up_speed payload_down_speed
\n-- The transfer rates of payload data only updated about once per second
\n-
\n-[report issue]\n-- pid
\n-- the peer's id as used in the bittorrent protocol. This id can be used\n-to extract 'fingerprints' from the peer. Sometimes it can tell you\n-which client the peer is using. See identify_client()_
\n-
\n-[report issue]\n-- queue_bytes
\n-- the number of bytes we have requested from this peer, but not yet\n-received.
\n-
\n-[report issue]\n-- request_timeout
\n-- the number of seconds until the current front piece request will time\n-out. This timeout can be adjusted through\n-settings_pack::request_timeout.\n--1 means that there is not outstanding request.
\n-
\n-\n-[report issue]\n-- send_buffer_size used_send_buffer
\n-- the number of bytes allocated\n-and used for the peer's send buffer, respectively.
\n-
\n-\n-\n-[report issue]\n-- receive_buffer_size used_receive_buffer receive_buffer_watermark
\n-- the number of bytes\n-allocated and used as receive buffer, respectively.
\n-
\n-[report issue]\n-- num_hashfails
\n-- the number of pieces this peer has participated in sending us that\n-turned out to fail the hash check.
\n-
\n-[report issue]\n-- download_queue_length
\n-- this is the number of requests we have sent to this peer that we\n-haven't got a response for yet
\n-
\n-[report issue]\n-- timed_out_requests
\n-- the number of block requests that have timed out, and are still in the\n-download queue
\n-
\n-[report issue]\n-- busy_requests
\n-- the number of busy requests in the download queue. A busy request is a\n-request for a block we've also requested from a different peer
\n-
\n-[report issue]\n-- requests_in_buffer
\n-- the number of requests messages that are currently in the send buffer\n-waiting to be sent.
\n-
\n-[report issue]\n-- target_dl_queue_length
\n-- the number of requests that is tried to be maintained (this is\n-typically a function of download speed)
\n-
\n-[report issue]\n-- upload_queue_length
\n-- the number of piece-requests we have received from this peer\n-that we haven't answered with a piece yet.
\n-
\n-[report issue]\n-- failcount
\n-- the number of times this peer has "failed". i.e. failed to connect or\n-disconnected us. The failcount is decremented when we see this peer in\n-a tracker response or peer exchange message.
\n-
\n-\n-\n-\n-[report issue]\n-- downloading_piece_index downloading_block_index downloading_progress downloading_total
\n-- You can know which piece, and which part of that piece, that is\n-currently being downloaded from a specific peer by looking at these\n-four members. downloading_piece_index is the index of the piece\n-that is currently being downloaded. This may be set to -1 if there's\n-currently no piece downloading from this peer. If it is >= 0, the\n-other three members are valid. downloading_block_index is the\n-index of the block (or sub-piece) that is being downloaded.\n-downloading_progress is the number of bytes of this block we have\n-received from the peer, and downloading_total is the total number\n-of bytes in this block.
\n-
\n-[report issue]\n-- standard_bittorrent
\n-- Regular bittorrent connection
\n-
\n-[report issue]\n-- web_seed
\n-- HTTP connection using the BEP 19 protocol
\n-
\n-[report issue]\n-- http_seed
\n-- HTTP connection using the BEP 17 protocol
\n-
\n-[report issue]\n-- connection_type
\n-- the kind of connection this peer uses. See connection_type_t.
\n-
\n-[report issue]\n-- pending_disk_bytes
\n-- the number of bytes this peer has pending in the disk-io thread.\n-Downloaded and waiting to be written to disk. This is what is capped\n-by settings_pack::max_queued_disk_bytes.
\n-
\n-[report issue]\n-- pending_disk_read_bytes
\n-- number of outstanding bytes to read\n-from disk
\n-
\n-\n-[report issue]\n-- send_quota receive_quota
\n-- the number of bytes this peer has been assigned to be allowed to send\n-and receive until it has to request more quota from the bandwidth\n-manager.
\n-
\n-[report issue]\n-- rtt
\n-- an estimated round trip time to this peer, in milliseconds. It is\n-estimated by timing the TCP connect(). It may be 0 for\n-incoming connections.
\n-
\n-[report issue]\n-- num_pieces
\n-- the number of pieces this peer has.
\n-
\n-\n-[report issue]\n-- download_rate_peak upload_rate_peak
\n-- the highest download and upload rates seen on this connection. They\n-are given in bytes per second. This number is reset to 0 on reconnect.
\n-
\n-[report issue]\n-- progress
\n-- the progress of the peer in the range [0, 1]. This is always 0 when\n-floating point operations are disabled, instead use progress_ppm.
\n-
\n-[report issue]\n-- progress_ppm
\n-- indicates the download progress of the peer in the range [0, 1000000]\n-(parts per million).
\n-
\n-[report issue]\n-- ip
\n-- the IP-address to this peer. The type is an asio endpoint. For\n-more info, see the asio documentation. This field is not valid for\n-i2p peers. Instead use the i2p_destination() function.
\n-
\n-[report issue]\n-- local_endpoint
\n-- the IP and port pair the socket is bound to locally. i.e. the IP\n-address of the interface it's going out over. This may be useful for\n-multi-homed clients with multiple interfaces to the internet.\n-This field is not valid for i2p peers.
\n-
\n-[report issue]\n-- bw_idle
\n-- The peer is not waiting for any external events to\n-send or receive data.
\n-
\n-[report issue]\n-- bw_limit
\n-- The peer is waiting for the rate limiter.
\n+[report issue]\n+- request
\n+- the request we received from the peer
\n
\n-[report issue]\n-- bw_network
\n-- The peer has quota and is currently waiting for a\n-network read or write operation to complete. This is\n-the state all peers are in if there are no bandwidth\n-limits.
\n+[report issue]\n+- we_have
\n+- true if we have this piece
\n
\n-[report issue]\n-- bw_disk
\n-- The peer is waiting for the disk I/O thread to catch\n-up writing buffers to disk before downloading more.
\n+[report issue]\n+- peer_interested
\n+- true if the peer indicated that it was interested to download before\n+sending the request
\n
\n-\n-[report issue]\n-- read_state write_state
\n-- bitmasks indicating what state this peer\n-is in with regards to sending and receiving data. The states are\n-defined as independent flags of type bandwidth_state_flags_t, in this\n-class.
\n+[report issue]\n+- withheld
\n+- if this is true, the peer is not allowed to download this piece because\n+of super-seeding rules.
\n
\n-[report issue]
\n-\n-\n-info_hash_t
\n-Declared in "libtorrent/info_hash.hpp"
\n-class holding the info-hash of a torrent. It can hold a v1 info-hash\n-(SHA-1) or a v2 info-hash (SHA-256) or both.
\n-\n-Note
\n-If has_v2() is false then the v1 hash might actually be a truncated\n-v2 hash
\n-\n+[report issue]\n+\n+torrent_finished_alert
\n+Declared in "libtorrent/alert_types.hpp"
\n+This alert is generated when a torrent switches from being a downloader to a seed.\n+It will only be generated once per torrent. It contains a torrent_handle to the\n+torrent in question.
\n \n-struct info_hash_t\n+struct torrent_finished_alert final : torrent_alert\n {\n- explicit info_hash_t (sha1_hash h1) noexcept;\n- info_hash_t () noexcept = default;\n- info_hash_t (sha1_hash h1, sha256_hash h2) noexcept;\n- explicit info_hash_t (sha256_hash h2) noexcept;\n- bool has_v2 () const;\n- bool has (protocol_version v) const;\n- bool has_v1 () const;\n- sha1_hash get (protocol_version v) const;\n- sha1_hash get_best () const;\n- friend bool operator!= (info_hash_t const& lhs, info_hash_t const& rhs);\n- friend bool operator== (info_hash_t const& lhs, info_hash_t const& rhs) noexcept;\n- template <typename F> void for_each (F f) const;\n- bool operator< (info_hash_t const& o) const;\n- friend std::ostream& operator<< (std::ostream& os, info_hash_t const& ih);\n+ std::string message () const override;\n \n- sha1_hash v1;\n- sha256_hash v2;\n+ static constexpr alert_category_t static_category = alert_category::status;\n };\n \n-[report issue]\n-info_hash_t()
\n-\n-explicit info_hash_t (sha1_hash h1) noexcept;\n-info_hash_t () noexcept = default;\n-info_hash_t (sha1_hash h1, sha256_hash h2) noexcept;\n-explicit info_hash_t (sha256_hash h2) noexcept;\n-
\n-The default constructor creates an object that has neither a v1 or v2\n-hash.
\n-For backwards compatibility, make it possible to construct directly\n-from a v1 hash. This constructor allows implicit conversion from a\n-v1 hash, but the implicitness is deprecated.
\n-\n-\n-[report issue]\n-\n-has() has_v2() has_v1()
\n-\n-bool has_v2 () const;\n-bool has (protocol_version v) const;\n-bool has_v1 () const;\n-
\n-returns true if the corresponding info hash is present in this\n-object.
\n-[report issue]\n-\n-get()
\n-\n-sha1_hash get (protocol_version v) const;\n-
\n-returns the has for the specified protocol version
\n-[report issue]\n-\n+\n+piece_finished_alert
\n+Declared in "libtorrent/alert_types.hpp"
\n+this alert is posted every time a piece completes downloading\n+and passes the hash check. This alert derives from torrent_alert\n+which contains the torrent_handle to the torrent the piece belongs to.\n+Note that being downloaded and passing the hash check may happen before\n+the piece is also fully flushed to disk. So torrent_handle::have_piece()\n+may still return false
\n \n-sha1_hash get_best () const;\n+struct piece_finished_alert final : torrent_alert\n+{\n+ std::string message () const override;\n+\n+ piece_index_t const piece_index;\n+};\n \n-returns the v2 (truncated) info-hash, if there is one, otherwise\n-returns the v1 info-hash
\n-[report issue]\n-\n-for_each()
\n+[report issue]\n+- piece_index
\n+- the index of the piece that finished
\n+
\n+[report issue]\n+\n+request_dropped_alert
\n+Declared in "libtorrent/alert_types.hpp"
\n+This alert is generated when a peer rejects or ignores a piece request.
\n \n-template <typename F> void for_each (F f) const;\n+struct request_dropped_alert final : peer_alert\n+{\n+ std::string message () const override;\n+\n+ int const block_index;\n+ piece_index_t const piece_index;\n+};\n \n-calls the function object f for each hash that is available.\n-starting with v1. The signature of F is:
\n+[report issue]\n+\n+block_timeout_alert
\n+Declared in "libtorrent/alert_types.hpp"
\n+This alert is generated when a block request times out.
\n \n-void(sha1_hash const&, protocol_version);\n+struct block_timeout_alert final : peer_alert\n+{\n+ std::string message () const override;\n+\n+ int const block_index;\n+ piece_index_t const piece_index;\n+};\n \n-[report issue]\n-\n-\n+\n+block_finished_alert
\n+Declared in "libtorrent/alert_types.hpp"
\n+This alert is generated when a block request receives a response.
\n \n-struct piece_block\n+struct block_finished_alert final : peer_alert\n {\n- piece_block (piece_index_t p_index, int b_index);\n- piece_block () = default;\n- bool operator< (piece_block const& b) const;\n- bool operator== (piece_block const& b) const;\n- bool operator!= (piece_block const& b) const;\n+ std::string message () const override;\n \n- static const piece_block invalid;\n- piece_index_t piece_index {0};\n- int block_index = 0;\n+ int const block_index;\n+ piece_index_t const piece_index;\n };\n \n-[report issue]\n-\n+\n+block_downloading_alert
\n+Declared in "libtorrent/alert_types.hpp"
\n+This alert is generated when a block request is sent to a peer.
\n \n-void truncate_files (file_storage const& fs, std::string const& save_path, storage_error& ec);\n+struct block_downloading_alert final : peer_alert\n+{\n+ std::string message () const override;\n+\n+ int const block_index;\n+ piece_index_t const piece_index;\n+};\n \n-Truncates files larger than specified in the file_storage, saved under\n-the specified save_path.
\n-[report issue]\n-\n+\n+unwanted_block_alert
\n+Declared in "libtorrent/alert_types.hpp"
\n+This alert is generated when a block is received that was not requested or\n+whose request timed out.
\n \n-std::string make_magnet_uri (add_torrent_params const& atp);\n-std::string make_magnet_uri (torrent_info const& info);\n-std::string make_magnet_uri (torrent_handle const& handle);\n+struct unwanted_block_alert final : peer_alert\n+{\n+ std::string message () const override;\n+\n+ static constexpr alert_category_t static_category = alert_category::peer;\n+ int const block_index;\n+ piece_index_t const piece_index;\n+};\n \n-Generates a magnet URI from the specified torrent.
\n-Several fields from the add_torrent_params objects are recorded in the\n-magnet link. In order to not include them, they have to be cleared before\n-calling make_magnet_uri(). These fields are used:
\n-\n-ti, info_hashes, url_seeds, dht_nodes,\n-file_priorities, trackers, name, peers.
\n-Depending on what the use case for the resulting magnet link is, clearing\n-peers and dht_nodes is probably a good idea if the add_torrent_params\n-came from a running torrent. Those lists may be long and be ephemeral.
\n-If none of the info_hashes or ti fields are set, there is not\n-info-hash available, and a magnet link cannot be created. In this case\n-make_magnet_uri() returns an empty string.
\n-The recommended way to generate a magnet link from a torrent_handle is to\n-call save_resume_data(), which will post a save_resume_data_alert\n-containing an add_torrent_params object. This can then be passed to\n-make_magnet_uri().
\n-The overload that takes a torrent_handle will make blocking calls to\n-query information about the torrent. If the torrent handle is invalid,\n-an empty string is returned.
\n-For more information about magnet links, see magnet links.
\n-[report issue]\n-\n+\n+storage_moved_alert
\n+Declared in "libtorrent/alert_types.hpp"
\n+The storage_moved_alert is generated when all the disk IO has\n+completed and the files have been moved, as an effect of a call to\n+torrent_handle::move_storage. This is useful to synchronize with the\n+actual disk. The storage_path() member return the new path of the\n+storage.
\n \n-void parse_magnet_uri (string_view uri, add_torrent_params& p, error_code& ec);\n-add_torrent_params parse_magnet_uri (string_view uri);\n-add_torrent_params parse_magnet_uri (string_view uri, error_code& ec);\n+struct storage_moved_alert final : torrent_alert\n+{\n+ std::string message () const override;\n+ char const* old_path () const;\n+ char const* storage_path () const;\n+\n+ static constexpr alert_category_t static_category = alert_category::storage;\n+};\n \n-This function parses out information from the magnet link and populates the\n-add_torrent_params object. The overload that does not take an\n-error_code reference will throw a system_error on error\n-The overload taking an add_torrent_params reference will fill in the\n-fields specified in the magnet URI.
\n-\n-\n-[report issue]\n-\n-load_torrent_file() load_torrent_parsed() load_torrent_buffer()
\n-Declared in "libtorrent/load_torrent.hpp"
\n+\n+[report issue]\n+old_path() storage_path()
\n \n-add_torrent_params load_torrent_buffer (\n- span<char const> buffer);\n-add_torrent_params load_torrent_parsed (\n- bdecode_node const& torrent_file);\n-add_torrent_params load_torrent_parsed (\n- bdecode_node const& torrent_file, load_torrent_limits const& cfg);\n-add_torrent_params load_torrent_buffer (\n- span<char const> buffer, load_torrent_limits const& cfg);\n-add_torrent_params load_torrent_file (\n- std::string const& filename, load_torrent_limits const& cfg);\n-add_torrent_params load_torrent_file (\n- std::string const& filename);\n+char const* old_path () const;\n+char const* storage_path () const;\n
\n-These functions load the content of a .torrent file into an\n-add_torrent_params object.\n-The immutable part of a torrent file (the info-dictionary) is stored in\n-the ti field in the add_torrent_params object (as a torrent_info\n-object).\n-The returned object is suitable to be:
\n-\n-\n-- added to a session via add_torrent() or async_add_torrent()
\n-- saved as a .torrent_file via write_torrent_file()
\n-- turned into a magnet link via make_magnet_uri()
\n-
\n-
\n-[report issue]\n-\n-torrent_peer_equal()
\n-Declared in "libtorrent/torrent_peer.hpp"
\n+the path the torrent was moved to and from, respectively.
\n+[report issue]\n+\n+\n+storage_moved_failed_alert
\n+Declared in "libtorrent/alert_types.hpp"
\n+The storage_moved_failed_alert is generated when an attempt to move the storage,\n+via torrent_handle::move_storage(), fails.
\n \n-inline bool torrent_peer_equal (torrent_peer const* lhs, torrent_peer const* rhs);\n+struct storage_moved_failed_alert final : torrent_alert\n+{\n+ std::string message () const override;\n+ char const* file_path () const;\n+\n+ static constexpr alert_category_t static_category = alert_category::storage;\n+ error_code const error;\n+ operation_t op;\n+};\n \n-[report issue]\n-\n-version()
\n-Declared in "libtorrent/version.hpp"
\n+[report issue]\n+file_path()
\n \n-char const* version ();\n+char const* file_path () const;\n
\n-returns the libtorrent version as string form in this format:\n-"<major>.<minor>.<tiny>.<tag>"
\n-[report issue]\n-\n-enum socket_type_t
\n-Declared in "libtorrent/socket_type.hpp"
\n-\n-\n- \n-\n-name \n-value \n-description \n-tcp \n-0 \n- \n-socks5 \n-1 \n- \n-http \n-2 \n- \n-utp \n-3 \n- \n-i2p \n-4 \n- \n-tcp_ssl \n-5 \n- \n-socks5_ssl \n-6 \n- \n-http_ssl \n-7 \n- \n-utp_ssl \n-8 \n- \n-
\n-[report issue]\n-\n-enum portmap_transport
\n-Declared in "libtorrent/portmap.hpp"
\n-\n-\n- \n-\n-name \n-value \n-description \n-natpmp \n-0 \n-natpmp can be NAT-PMP or PCP \n-upnp \n-1 \n- \n-
\n-[report issue]\n-\n-enum portmap_protocol
\n-Declared in "libtorrent/portmap.hpp"
\n-\n-\n- \n-\n-name \n-value \n-description \n-none \n-0 \n- \n-tcp \n-1 \n- \n-udp \n-2 \n- \n-
\n-[report issue]\n-\n-enum protocol_version
\n-Declared in "libtorrent/info_hash.hpp"
\n-\n-\n- \n-\n-name \n-value \n-description \n-V1 \n-0 \n-The original BitTorrent version, using SHA-1 hashes \n-V2 \n-1 \n-Version 2 of the BitTorrent protocol, using SHA-256 hashes \n-NUM \n-2 \n- \n-
\n-[report issue]\n-\n-enum event_t
\n-Declared in "libtorrent/tracker_manager.hpp"
\n-\n-\n- \n-\n-name \n-value \n-description \n-none \n-0 \n- \n-completed \n-1 \n- \n-started \n-2 \n- \n-stopped \n-3 \n- \n-paused \n-4 \n- \n-
\n-[report issue]\n-\n-enum connection_type
\n-Declared in "libtorrent/peer_connection.hpp"
\n-\n-\n- \n-\n-name \n-value \n-description \n-bittorrent \n-0 \n- \n-url_seed \n-1 \n- \n-http_seed \n-2 \n- \n-
\n-[report issue]\n-\n-torrent_flags_t
\n-Declared in "libtorrent/torrent_flags.hpp"
\n-\n-- seed_mode
\n-If seed_mode is set, libtorrent will assume that all files\n-are present for this torrent and that they all match the hashes in\n-the torrent file. Each time a peer requests to download a block,\n-the piece is verified against the hash, unless it has been verified\n-already. If a hash fails, the torrent will automatically leave the\n-seed mode and recheck all the files. The use case for this mode is\n-if a torrent is created and seeded, or if the user already know\n-that the files are complete, this is a way to avoid the initial\n-file checks, and significantly reduce the startup time.
\n-Setting seed_mode on a torrent without metadata (a\n-.torrent file) is a no-op and will be ignored.
\n-It is not possible to set the seed_mode flag on a torrent after it has\n-been added to a session. It is possible to clear it though.
\n-
\n-\n-- upload_mode
\n-If upload_mode is set, the torrent will be initialized in\n-upload-mode, which means it will not make any piece requests. This\n-state is typically entered on disk I/O errors, and if the torrent\n-is also auto managed, it will be taken out of this state\n-periodically (see settings_pack::optimistic_disk_retry).
\n-This mode can be used to avoid race conditions when\n-adjusting priorities of pieces before allowing the torrent to start\n-downloading.
\n-If the torrent is auto-managed (auto_managed), the torrent\n-will eventually be taken out of upload-mode, regardless of how it\n-got there. If it's important to manually control when the torrent\n-leaves upload mode, don't make it auto managed.
\n-
\n-\n-- share_mode
\n-determines if the torrent should be added in share mode or not.\n-Share mode indicates that we are not interested in downloading the\n-torrent, but merely want to improve our share ratio (i.e. increase\n-it). A torrent started in share mode will do its best to never\n-download more than it uploads to the swarm. If the swarm does not\n-have enough demand for upload capacity, the torrent will not\n-download anything. This mode is intended to be safe to add any\n-number of torrents to, without manual screening, without the risk\n-of downloading more than is uploaded.
\n-A torrent in share mode sets the priority to all pieces to 0,\n-except for the pieces that are downloaded, when pieces are decided\n-to be downloaded. This affects the progress bar, which might be set\n-to "100% finished" most of the time. Do not change file or piece\n-priorities for torrents in share mode, it will make it not work.
\n-The share mode has one setting, the share ratio target, see\n-settings_pack::share_mode_target for more info.
\n-
\n-\n-- apply_ip_filter
\n-- determines if the IP filter should apply to this torrent or not. By\n-default all torrents are subject to filtering by the IP filter\n-(i.e. this flag is set by default). This is useful if certain\n-torrents needs to be exempt for some reason, being an auto-update\n-torrent for instance.
\n-
\n-\n-- paused
\n-- specifies whether or not the torrent is paused. i.e. it won't connect to the tracker or any of the peers\n-until it's resumed. Note that a paused torrent that also has the\n-auto_managed flag set can be started at any time by libtorrent's queuing\n-logic. See queuing.
\n-
\n-\n-- auto_managed
\n-If the torrent is auto-managed (auto_managed), the torrent\n-may be resumed at any point, regardless of how it paused. If it's\n-important to manually control when the torrent is paused and\n-resumed, don't make it auto managed.
\n-If auto_managed is set, the torrent will be queued,\n-started and seeded automatically by libtorrent. When this is set,\n-the torrent should also be started as paused. The default queue\n-order is the order the torrents were added. They are all downloaded\n-in that order. For more details, see queuing.
\n-
\n-\n-- duplicate_is_error
\n-- used in add_torrent_params to indicate that it's an error to attempt\n-to add a torrent that's already in the session. If it's not considered an\n-error, a handle to the existing torrent is returned.\n-This flag is not saved by write_resume_data(), since it is only meant for\n-adding torrents.
\n-
\n-\n-- update_subscribe
\n-- on by default and means that this torrent will be part of state\n-updates when calling post_torrent_updates().\n-This flag is not saved by write_resume_data().
\n-
\n-\n-- super_seeding
\n-- sets the torrent into super seeding/initial seeding mode. If the torrent\n-is not a seed, this flag has no effect.
\n-
\n-\n-- sequential_download
\n-- sets the sequential download state for the torrent. In this mode the\n-piece picker will pick pieces with low index numbers before pieces with\n-high indices. The actual pieces that are picked depend on other factors\n-still, such as which pieces a peer has and whether it is in parole mode\n-or "prefer whole pieces"-mode. Sequential mode is not ideal for streaming\n-media. For that, see set_piece_deadline() instead.
\n-
\n-\n-- stop_when_ready
\n-When this flag is set, the torrent will force stop whenever it\n-transitions from a non-data-transferring state into a data-transferring\n-state (referred to as being ready to download or seed). This is useful\n-for torrents that should not start downloading or seeding yet, but want\n-to be made ready to do so. A torrent may need to have its files checked\n-for instance, so it needs to be started and possibly queued for checking\n-(auto-managed and started) but as soon as it's done, it should be\n-stopped.
\n-Force stopped means auto-managed is set to false and it's paused. As\n-if the auto_manages flag is cleared and the paused flag is set on the torrent.
\n-Note that the torrent may transition into a downloading state while\n-setting this flag, and since the logic is edge triggered you may\n-miss the edge. To avoid this race, if the torrent already is in a\n-downloading state when this call is made, it will trigger the\n-stop-when-ready immediately.
\n-When the stop-when-ready logic fires, the flag is cleared. Any\n-subsequent transitions between downloading and non-downloading states\n-will not be affected, until this flag is set again.
\n-The behavior is more robust when setting this flag as part of adding\n-the torrent. See add_torrent_params.
\n-The stop-when-ready flag fixes the inherent race condition of waiting\n-for the state_changed_alert and then call pause(). The download/seeding\n-will most likely start in between posting the alert and receiving the\n-call to pause.
\n-A downloading state is one where peers are being connected. Which means\n-just downloading the metadata via the ut_metadata extension counts\n-as a downloading state. In order to stop a torrent once the metadata\n-has been downloaded, instead set all file priorities to dont_download
\n-
\n-\n-- override_trackers
\n-- when this flag is set, the tracker list in the add_torrent_params\n-object override any trackers from the torrent file. If the flag is\n-not set, the trackers from the add_torrent_params object will be\n-added to the list of trackers used by the torrent.\n-This flag is set by read_resume_data() if there are trackers present in\n-the resume data file. This effectively makes the trackers saved in the\n-resume data take precedence over the original trackers. This includes if\n-there's an empty list of trackers, to support the case where they were\n-explicitly removed in the previous session.\n-This flag is not saved by write_resume_data()
\n-
\n-\n-- override_web_seeds
\n-- If this flag is set, the web seeds from the add_torrent_params\n-object will override any web seeds in the torrent file. If it's not\n-set, web seeds in the add_torrent_params object will be added to the\n-list of web seeds used by the torrent.\n-This flag is set by read_resume_data() if there are web seeds present in\n-the resume data file. This effectively makes the web seeds saved in the\n-resume data take precedence over the original ones. This includes if\n-there's an empty list of web seeds, to support the case where they were\n-explicitly removed in the previous session.\n-This flag is not saved by write_resume_data()
\n-
\n-\n-- need_save_resume
\n-if this flag is set (which it is by default) the torrent will be\n-considered needing to save its resume data immediately, in the\n-category if_metadata_changed. See resume_data_flags_t and\n-save_resume_data() for details.
\n-This flag is cleared by a successful call to save_resume_data()\n-This flag is not saved by write_resume_data(), since it represents an\n-ephemeral state of a running torrent.
\n-
\n-\n-- disable_dht
\n-- set this flag to disable DHT for this torrent. This lets you have the DHT\n-enabled for the whole client, and still have specific torrents not\n-participating in it. i.e. not announcing to the DHT nor picking up peers\n-from it.
\n-
\n-\n-- disable_lsd
\n-- set this flag to disable local service discovery for this torrent.
\n-
\n-\n-- disable_pex
\n-- set this flag to disable peer exchange for this torrent.
\n-
\n-\n-- no_verify_files
\n-- if this flag is set, the resume data will be assumed to be correct\n-without validating it against any files on disk. This may be used when\n-restoring a session by loading resume data from disk. It will save time\n-and also delay any hard disk errors until files are actually needed. If\n-the resume data cannot be trusted, or if a torrent is added for the first\n-time to some save path that may already have some of the files, this flag\n-should not be set.
\n-
\n-\n-- default_dont_download
\n-- default all file priorities to dont_download. This is useful for adding\n-magnet links where the number of files is unknown, but the\n-file_priorities is still set for some files. Any file not covered by\n-the file_priorities list will be set to normal download priority,\n-unless this flag is set, in which case they will be set to 0\n-(dont_download).
\n-
\n-\n-- i2p_torrent
\n-- this flag makes the torrent be considered an "i2p torrent" for purposes\n-of the allow_i2p_mixed setting. When mixing regular peers and i2p peers\n-is disabled, i2p torrents won't add normal peers to its peer list.\n-Note that non i2p torrents may still allow i2p peers (on the off-chance\n-that a tracker return them and the session is configured with a SAM\n-connection).\n-This flag is set automatically when adding a torrent that has at least\n-one tracker whose hostname ends with .i2p.\n-It's also set by parse_magnet_uri() if the tracker list contains such\n-URL.
\n-
\n-\n-- all
\n-- all torrent flags combined. Can conveniently be used when creating masks\n-for flags
\n-
\n-[report issue]\n-\n-int
\n-Declared in "libtorrent/version.hpp"
\n-\n-- version_major
\n-- the major, minor and tiny versions of libtorrent
\n-
\n-\n-- version_minor
\n-- the major, minor and tiny versions of libtorrent
\n-
\n-\n-- version_tiny
\n-- the major, minor and tiny versions of libtorrent
\n-
\n-[report issue]\n-\n-download_priority_t
\n-Declared in "libtorrent/download_priority.hpp"
\n-\n-- dont_download
\n-- Don't download the file or piece. Partial pieces may still be downloaded when\n-setting file priorities.
\n-
\n-\n-- default_priority
\n-- The default priority for files and pieces.
\n-
\n-\n-- low_priority
\n-- The lowest priority for files and pieces.
\n-
\n-\n-- top_priority
\n-- The highest priority for files and pieces.
\n-
\n-[report issue]\n-\n-pex_flags_t
\n-Declared in "libtorrent/pex_flags.hpp"
\n-\n-- pex_encryption
\n-- the peer supports protocol encryption
\n-
\n-\n-- pex_seed
\n-- the peer is a seed
\n-
\n-\n-- pex_utp
\n-- the peer supports the uTP, transport protocol over UDP.
\n-
\n-\n-- pex_holepunch
\n-- the peer supports the holepunch extension If this flag is received from a\n-peer, it can be used as a rendezvous point in case direct connections to\n-the peer fail
\n-
\n-\n-- pex_lt_v2
\n-- protocol v2\n-this is not a standard flag, it is only used internally
\n-
\n-[report issue]\n-\n-char const*
\n-Declared in "libtorrent/version.hpp"
\n-\n-- version_str
\n-- the libtorrent version in string form
\n-
\n-[report issue]\n-\n-std::uint64_t
\n-Declared in "libtorrent/version.hpp"
\n-\n-- version_revision
\n-- the git commit of this libtorrent version
\n+If the error happened for a specific file, this returns its path.
\n+[report issue]\n+- op
\n+- this indicates what underlying operation caused the error
\n
\n-libtorrent has a plugin interface for implementing extensions to the protocol.\n-These can be general extensions for transferring metadata or peer exchange\n-extensions, or it could be used to provide a way to customize the protocol\n-to fit a particular (closed) network.
\n-In short, the plugin interface makes it possible to:
\n-\n-- register extension messages (sent in the extension handshake), see\n-extensions.
\n-- add data and parse data from the extension handshake.
\n-- send extension messages and standard bittorrent messages.
\n-- override or block the handling of standard bittorrent messages.
\n-- save and restore state via the session state
\n-- see all alerts that are posted
\n-
\n-
\n-\n-a word of caution
\n-Writing your own plugin is a very easy way to introduce serious bugs such as\n-dead locks and race conditions. Since a plugin has access to internal\n-structures it is also quite easy to sabotage libtorrent's operation.
\n-All the callbacks are always called from the libtorrent network thread. In\n-case portions of your plugin are called from other threads, typically the main\n-thread, you cannot use any of the member functions on the internal structures\n-in libtorrent, since those require being called from the libtorrent network\n-thread . Furthermore, you also need to synchronize your own shared data\n-within the plugin, to make sure it is not accessed at the same time from the\n-libtorrent thread (through a callback). If you need to send out a message\n-from another thread, it is advised to use an internal queue, and do the\n-actual sending in tick().
\n-Since the plugin interface gives you easy access to internal structures, it\n-is not supported as a stable API. Plugins should be considered specific to a\n-specific version of libtorrent. Although, in practice the internals mostly\n-don't change that dramatically.
\n-\n-\n-plugin-interface
\n-The plugin interface consists of three base classes that the plugin may\n-implement. These are called plugin, torrent_plugin and peer_plugin.\n-They are found in the <libtorrent/extensions.hpp> header.
\n-These plugins are instantiated for each session, torrent and possibly each peer,\n-respectively.
\n-For plugins that only need per torrent state, it is enough to only implement\n-torrent_plugin and pass a constructor function or function object to\n-session::add_extension() or torrent_handle::add_extension() (if the\n-torrent has already been started and you want to hook in the extension at\n-run-time).
\n-The signature of the function is:
\n-\n-std::shared_ptr<torrent_plugin> (*)(torrent_handle const&, client_data_t);\n-
\n-The second argument is the userdata passed to session::add_torrent() or\n-torrent_handle::add_extension().
\n-The function should return a std::shared_ptr<torrent_plugin> which\n-may or may not be 0. If it is a nullptr, the extension is simply ignored\n-for this torrent. If it is a valid pointer (to a class inheriting\n-torrent_plugin), it will be associated with this torrent and callbacks\n-will be made on torrent events.
\n-For more elaborate plugins which require session wide state, you would\n-implement plugin, construct an object (in a std::shared_ptr) and pass\n-it in to session::add_extension().
\n+[report issue]\n \n-\n-custom alerts
\n-Since plugins are running within internal libtorrent threads, one convenient\n-way to communicate with the client is to post custom alerts.
\n-The expected interface of any alert, apart from deriving from the alert\n-base class, looks like this:
\n+\n+torrent_deleted_alert
\n+Declared in "libtorrent/alert_types.hpp"
\n+This alert is generated when a request to delete the files of a torrent complete.
\n+This alert is posted in the alert_category::storage category, and that bit\n+needs to be set in the alert_mask.
\n \n-static const int alert_type = <unique alert ID>;\n-virtual int type() const { return alert_type; }\n-\n-virtual std::string message() const;\n-\n-static const alert_category_t static_category = <bitmask of alert::category_t flags>;\n-virtual alert_category_t category() const { return static_category; }\n+struct torrent_deleted_alert final : torrent_alert\n+{\n+ std::string message () const override;\n \n-virtual char const* what() const { return <string literal of the name of this alert>; }\n+ static constexpr alert_category_t static_category = alert_category::storage;\n+ info_hash_t info_hashes;\n+};\n \n-The alert_type is used for the type-checking in alert_cast. It must\n-not collide with any other alert. The built-in alerts in libtorrent will\n-not use alert type IDs greater than user_alert_id. When defining your\n-own alert, make sure it's greater than this constant.
\n-type() is the run-time equivalence of the alert_type.
\n-The message() virtual function is expected to construct a useful\n-string representation of the alert and the event or data it represents.\n-Something convenient to put in a log file for instance.
\n-clone() is used internally to copy alerts. The suggested implementation\n-of simply allocating a new instance as a copy of *this is all that's\n-expected.
\n-The static category is required for checking whether or not the category\n-for a specific alert is enabled or not, without instantiating the alert.\n-The category virtual function is the run-time equivalence.
\n-The what() virtual function may simply be a string literal of the class\n-name of your alert.
\n-For more information, see the alert section.
\n-[report issue]\n-\n-peer_connection_handle
\n-Declared in "libtorrent/peer_connection_handle.hpp"
\n-the peer_connection_handle class provides a handle to the internal peer\n-connection object, to be used by plugins. This is a low level interface that\n-may not be stable across libtorrent versions
\n+[report issue]\n+- info_hashes
\n+- The info-hash of the torrent that was just deleted. Most of\n+the time the torrent_handle in the torrent_alert will be invalid by the time\n+this alert arrives, since the torrent is being deleted. The info_hashes member\n+is hence the main way of identifying which torrent just completed the delete.
\n+
\n+[report issue]\n+\n+torrent_delete_failed_alert
\n+Declared in "libtorrent/alert_types.hpp"
\n+This alert is generated when a request to delete the files of a torrent fails.\n+Just removing a torrent from the session cannot fail
\n \n-struct peer_connection_handle\n+struct torrent_delete_failed_alert final : torrent_alert\n {\n- explicit peer_connection_handle (std::weak_ptr<peer_connection> impl);\n- connection_type type () const;\n- peer_plugin const* find_plugin (string_view type) const;\n- void add_extension (std::shared_ptr<peer_plugin>);\n- bool is_seed () const;\n- bool upload_only () const;\n- peer_id const& pid () const;\n- bool has_piece (piece_index_t i) const;\n- bool is_choked () const;\n- bool is_interesting () const;\n- bool is_peer_interested () const;\n- bool has_peer_choked () const;\n- void choke_this_peer ();\n- void maybe_unchoke_this_peer ();\n- void get_peer_info (peer_info& p) const;\n- torrent_handle associated_torrent () const;\n- tcp::endpoint local_endpoint () const;\n- tcp::endpoint const& remote () const;\n- bool is_outgoing () const;\n- bool is_disconnecting () const;\n- bool is_connecting () const;\n- void disconnect (error_code const& ec, operation_t op\n- , disconnect_severity_t = peer_connection_interface::normal);\n- bool on_local_network () const;\n- bool ignore_unchoke_slots () const;\n- bool failed () const;\n- void peer_log (peer_log_alert::direction_t direction\n- , char const* event, char const* fmt = "", ...) const TORRENT_FORMAT(4,5);\n- bool should_log (peer_log_alert::direction_t direction) const;\n- bool can_disconnect (error_code const& ec) const;\n- bool has_metadata () const;\n- bool in_handshake () const;\n- void send_buffer (char const* begin, int size);\n- time_point time_of_last_unchoke () const;\n- std::time_t last_seen_complete () const;\n- bool operator== (peer_connection_handle const& o) const;\n- bool operator!= (peer_connection_handle const& o) const;\n- bool operator< (peer_connection_handle const& o) const;\n- std::shared_ptr<peer_connection> native_handle () const;\n+ std::string message () const override;\n+\n+ static constexpr alert_category_t static_category = alert_category::storage\n+ | alert_category::error;\n+ error_code const error;\n+ info_hash_t info_hashes;\n };\n \n-[report issue]\n-\n-bt_peer_connection_handle
\n-Declared in "libtorrent/peer_connection_handle.hpp"
\n-The bt_peer_connection_handle provides a handle to the internal bittorrent\n-peer connection object to plugins. It's low level and may not be a stable API\n-across libtorrent versions.
\n+[report issue]\n+- error
\n+- tells you why it failed.
\n+
\n+[report issue]\n+- info_hashes
\n+- the info hash of the torrent whose files failed to be deleted
\n+
\n+[report issue]\n+\n+save_resume_data_alert
\n+Declared in "libtorrent/alert_types.hpp"
\n+This alert is generated as a response to a torrent_handle::save_resume_data request.\n+It is generated once the disk IO thread is done writing the state for this torrent.
\n \n-struct bt_peer_connection_handle : peer_connection_handle\n+struct save_resume_data_alert final : torrent_alert\n {\n- explicit bt_peer_connection_handle (peer_connection_handle pc);\n- bool support_extensions () const;\n- bool packet_finished () const;\n- bool supports_encryption () const;\n- void switch_send_crypto (std::shared_ptr<crypto_plugin> crypto);\n- void switch_recv_crypto (std::shared_ptr<crypto_plugin> crypto);\n- std::shared_ptr<bt_peer_connection> native_handle () const;\n+ std::string message () const override;\n+\n+ static constexpr alert_category_t static_category = alert_category::storage;\n+ add_torrent_params params;\n };\n \n-[report issue]\n-\n-plugin
\n-Declared in "libtorrent/extensions.hpp"
\n-this is the base class for a session plugin. One primary feature\n-is that it is notified of all torrents that are added to the session,\n-and can add its own torrent_plugins.
\n+[report issue]\n+- params
\n+the params object is populated with the torrent file whose resume\n+data was saved. It is suitable to be:
\n+\n+- added to a session with add_torrent() or async_add_torrent()
\n+- saved to disk with write_resume_data()
\n+- turned into a magnet link with make_magnet_uri()
\n+- saved as a .torrent file with write_torrent_file()
\n+
\n+
\n+[report issue]\n+\n+save_resume_data_failed_alert
\n+Declared in "libtorrent/alert_types.hpp"
\n+This alert is generated instead of save_resume_data_alert if there was an error\n+generating the resume data. error describes what went wrong.
\n \n-struct plugin\n+struct save_resume_data_failed_alert final : torrent_alert\n {\n- virtual feature_flags_t implemented_features ();\n- virtual std::shared_ptr<torrent_plugin> new_torrent (torrent_handle const&, client_data_t);\n- virtual void added (session_handle const&);\n- virtual void abort ();\n- virtual bool on_dht_request (string_view /* query */\n- , udp::endpoint const& /* source */, bdecode_node const& /* message */\n- , entry& /* response */);\n- virtual void on_alert (alert const*);\n- virtual bool on_unknown_torrent (info_hash_t const& /* info_hash */\n- , peer_connection_handle const& /* pc */, add_torrent_params& /* p */);\n- virtual void on_tick ();\n- virtual uint64_t get_unchoke_priority (peer_connection_handle const& /* peer */);\n- virtual std::map<std::string, std::string> save_state () const;\n- virtual void load_state (std::map<std::string, std::string> const&);\n+ std::string message () const override;\n \n- static constexpr feature_flags_t optimistic_unchoke_feature = 1_bit;\n- static constexpr feature_flags_t tick_feature = 2_bit;\n- static constexpr feature_flags_t dht_request_feature = 3_bit;\n- static constexpr feature_flags_t alert_feature = 4_bit;\n- static constexpr feature_flags_t unknown_torrent_feature = 5_bit;\n+ static constexpr alert_category_t static_category = alert_category::storage\n+ | alert_category::error;\n+ error_code const error;\n };\n \n-[report issue]\n-implemented_features()
\n-\n-virtual feature_flags_t implemented_features ();\n-
\n-This function is expected to return a bitmask indicating which features\n-this plugin implements. Some callbacks on this object may not be called\n-unless the corresponding feature flag is returned here. Note that\n-callbacks may still be called even if the corresponding feature is not\n-specified in the return value here. See feature_flags_t for possible\n-flags to return.
\n-[report issue]\n-\n-new_torrent()
\n-\n-virtual std::shared_ptr<torrent_plugin> new_torrent (torrent_handle const&, client_data_t);\n-
\n-this is called by the session every time a new torrent is added.\n-The torrent* points to the internal torrent object created\n-for the new torrent. The client_data_t is the userdata pointer as\n-passed in via add_torrent_params.
\n-If the plugin returns a torrent_plugin instance, it will be added\n-to the new torrent. Otherwise, return an empty shared_ptr to a\n-torrent_plugin (the default).
\n-[report issue]\n-\n-added()
\n-\n-virtual void added (session_handle const&);\n-
\n-called when plugin is added to a session
\n-[report issue]\n-\n-abort()
\n-\n-virtual void abort ();\n-
\n-called when the session is aborted\n-the plugin should perform any cleanup necessary to allow the session's\n-destruction (e.g. cancel outstanding async operations)
\n-[report issue]\n-\n-on_dht_request()
\n+[report issue]\n+- error
\n+- the error code from the resume_data failure
\n+
\n+[report issue]\n+\n+torrent_paused_alert
\n+Declared in "libtorrent/alert_types.hpp"
\n+This alert is generated as a response to a torrent_handle::pause request. It is\n+generated once all disk IO is complete and the files in the torrent have been closed.\n+This is useful for synchronizing with the disk.
\n \n-virtual bool on_dht_request (string_view /* query */\n- , udp::endpoint const& /* source */, bdecode_node const& /* message */\n- , entry& /* response */);\n+struct torrent_paused_alert final : torrent_alert\n+{\n+ std::string message () const override;\n+\n+ static constexpr alert_category_t static_category = alert_category::status;\n+};\n \n-called when a dht request is received.\n-If your plugin expects this to be called, make sure to include the flag\n-dht_request_feature in the return value from implemented_features().
\n-[report issue]\n-\n+\n+torrent_resumed_alert
\n+Declared in "libtorrent/alert_types.hpp"
\n+This alert is generated as a response to a torrent_handle::resume() request. It is\n+generated when a torrent goes from a paused state to an active state.
\n \n-virtual void on_alert (alert const*);\n+struct torrent_resumed_alert final : torrent_alert\n+{\n+ std::string message () const override;\n+\n+ static constexpr alert_category_t static_category = alert_category::status;\n+};\n \n-called when an alert is posted alerts that are filtered are not posted.\n-If your plugin expects this to be called, make sure to include the flag\n-alert_feature in the return value from implemented_features().
\n-[report issue]\n-\n+\n+torrent_checked_alert
\n+Declared in "libtorrent/alert_types.hpp"
\n+This alert is posted when a torrent completes checking. i.e. when it transitions\n+out of the checking files state into a state where it is ready to start downloading
\n \n-virtual bool on_unknown_torrent (info_hash_t const& /* info_hash */\n- , peer_connection_handle const& /* pc */, add_torrent_params& /* p */);\n+struct torrent_checked_alert final : torrent_alert\n+{\n+ std::string message () const override;\n+\n+ static constexpr alert_category_t static_category = alert_category::status;\n+};\n \n-return true if the add_torrent_params should be added
\n-[report issue]\n-\n+\n+url_seed_alert
\n+Declared in "libtorrent/alert_types.hpp"
\n+This alert is generated when a HTTP seed name lookup fails.
\n \n-virtual void on_tick ();\n+struct url_seed_alert final : torrent_alert\n+{\n+ std::string message () const override;\n+ char const* server_url () const;\n+ char const* error_message () const;\n+\n+ static constexpr alert_category_t static_category = alert_category::peer | alert_category::error;\n+ error_code const error;\n+};\n \n-called once per second.\n-If your plugin expects this to be called, make sure to include the flag\n-tick_feature in the return value from implemented_features().
\n-[report issue]\n-\n-get_unchoke_priority()
\n+[report issue]\n+server_url()
\n \n-virtual uint64_t get_unchoke_priority (peer_connection_handle const& /* peer */);\n+char const* server_url () const;\n
\n-called when choosing peers to optimistically unchoke. The return value\n-indicates the peer's priority for unchoking. Lower return values\n-correspond to higher priority. Priorities above 2^63-1 are reserved.\n-If your plugin has no priority to assign a peer it should return 2^64-1.\n-If your plugin expects this to be called, make sure to include the flag\n-optimistic_unchoke_feature in the return value from implemented_features().\n-If multiple plugins implement this function the lowest return value\n-(i.e. the highest priority) is used.
\n-[report issue]\n-\n+\n+error_message()
\n \n-virtual void load_state (std::map<std::string, std::string> const&);\n+char const* error_message () const;\n
\n-called on startup while loading settings state from the session_params
\n-[report issue]\n-- optimistic_unchoke_feature
\n-- include this bit if your plugin needs to alter the order of the\n-optimistic unchoke of peers. i.e. have the on_optimistic_unchoke()\n-callback be called.
\n-
\n-[report issue]\n-[report issue]\n-- dht_request_feature
\n-- include this bit if your plugin needs to have on_dht_request()\n-called
\n-
\n-[report issue]\n-- alert_feature
\n-- include this bit if your plugin needs to have on_alert()\n-called
\n-
\n-[report issue]\n-- unknown_torrent_feature
\n-- include this bit if your plugin needs to have on_unknown_torrent()\n-called even if there is no active torrent in the session
\n+in case the web server sent an error message, this function returns\n+it.
\n+[report issue]\n+- error
\n+- the error the web seed encountered. If this is not set, the server\n+sent an error message, call error_message().
\n
\n-[report issue]
\n+[report issue]\n \n-\n-torrent_plugin
\n-Declared in "libtorrent/extensions.hpp"
\n-Torrent plugins are associated with a single torrent and have a number\n-of functions called at certain events. Many of its functions have the\n-ability to change or override the default libtorrent behavior.
\n+\n+file_error_alert
\n+Declared in "libtorrent/alert_types.hpp"
\n+If the storage fails to read or write files that it needs access to, this alert is\n+generated and the torrent is paused.
\n \n-struct torrent_plugin\n+struct file_error_alert final : torrent_alert\n {\n- virtual std::shared_ptr<peer_plugin> new_connection (peer_connection_handle const&);\n- virtual void on_piece_failed (piece_index_t);\n- virtual void on_piece_pass (piece_index_t);\n- virtual void tick ();\n- virtual bool on_resume ();\n- virtual bool on_pause ();\n- virtual void on_files_checked ();\n- virtual void on_state (torrent_status::state_t);\n- virtual void on_add_peer (tcp::endpoint const&,\n- peer_source_flags_t, add_peer_flags_t);\n+ std::string message () const override;\n+ char const* filename () const;\n \n- static constexpr add_peer_flags_t first_time = 1_bit;\n- static constexpr add_peer_flags_t filtered = 2_bit;\n+ static constexpr alert_category_t static_category = alert_category::status\n+ | alert_category::storage;\n+ error_code const error;\n+ operation_t op;\n };\n \n-[report issue]\n-new_connection()
\n-\n-virtual std::shared_ptr<peer_plugin> new_connection (peer_connection_handle const&);\n-
\n-This function is called each time a new peer is connected to the torrent. You\n-may choose to ignore this by just returning a default constructed\n-shared_ptr (in which case you don't need to override this member\n-function).
\n-If you need an extension to the peer connection (which most plugins do) you\n-are supposed to return an instance of your peer_plugin class. Which in\n-turn will have its hook functions called on event specific to that peer.
\n-The peer_connection_handle will be valid as long as the shared_ptr\n-is being held by the torrent object. So, it is generally a good idea to not\n-keep a shared_ptr to your own peer_plugin. If you want to keep references\n-to it, use weak_ptr.
\n-If this function throws an exception, the connection will be closed.
\n-\n-[report issue]\n-\n-on_piece_failed() on_piece_pass()
\n-\n-virtual void on_piece_failed (piece_index_t);\n-virtual void on_piece_pass (piece_index_t);\n-
\n-These hooks are called when a piece passes the hash check or fails the hash\n-check, respectively. The index is the piece index that was downloaded.\n-It is possible to access the list of peers that participated in sending the\n-piece through the torrent and the piece_picker.
\n-[report issue]\n-\n-tick()
\n-\n-virtual void tick ();\n-
\n-This hook is called approximately once per second. It is a way of making it\n-easy for plugins to do timed events, for sending messages or whatever.
\n-\n-[report issue]\n-\n-on_pause() on_resume()
\n-\n-virtual bool on_resume ();\n-virtual bool on_pause ();\n-
\n-These hooks are called when the torrent is paused and resumed respectively.\n-The return value indicates if the event was handled. A return value of\n-true indicates that it was handled, and no other plugin after this one\n-will have this hook function called, and the standard handler will also not be\n-invoked. So, returning true effectively overrides the standard behavior of\n-pause or resume.
\n-Note that if you call pause() or resume() on the torrent from your\n-handler it will recurse back into your handler, so in order to invoke the\n-standard handler, you have to keep your own state on whether you want standard\n-behavior or overridden behavior.
\n-[report issue]\n-\n-on_files_checked()
\n-\n-virtual void on_files_checked ();\n-
\n-This function is called when the initial files of the torrent have been\n-checked. If there are no files to check, this function is called immediately.
\n-i.e. This function is always called when the torrent is in a state where it\n-can start downloading.
\n-[report issue]\n-\n-on_state()
\n-\n-virtual void on_state (torrent_status::state_t);\n-
\n-called when the torrent changes state\n-the state is one of torrent_status::state_t\n-enum members
\n-[report issue]\n-\n-on_add_peer()
\n+[report issue]\n+filename()
\n \n-virtual void on_add_peer (tcp::endpoint const&,\n- peer_source_flags_t, add_peer_flags_t);\n+char const* filename () const;\n
\n-called every time a new peer is added to the peer list.\n-This is before the peer is connected to. For flags, see\n-torrent_plugin::flags_t. The source argument refers to\n-the source where we learned about this peer from. It's a\n-bitmask, because many sources may have told us about the same\n-peer. For peer source flags, see peer_info::peer_source_flags.
\n-[report issue]\n-- first_time
\n-- this is the first time we see this peer
\n+the file that experienced the error
\n+[report issue]\n+- error
\n+- the error code describing the error.
\n
\n-[report issue]\n-- filtered
\n-- this peer was not added because it was\n-filtered by the IP filter
\n+[report issue]\n+- op
\n+- indicates which underlying operation caused the error
\n
\n-[report issue]
\n+[report issue]\n \n-\n-peer_plugin
\n-Declared in "libtorrent/extensions.hpp"
\n-peer plugins are associated with a specific peer. A peer could be\n-both a regular bittorrent peer (bt_peer_connection) or one of the\n-web seed connections (web_peer_connection or http_seed_connection).\n-In order to only attach to certain peers, make your\n-torrent_plugin::new_connection only return a plugin for certain peer\n-connection types
\n+\n+metadata_failed_alert
\n+Declared in "libtorrent/alert_types.hpp"
\n+This alert is generated when the metadata has been completely received and the info-hash\n+failed to match it. i.e. the metadata that was received was corrupt. libtorrent will\n+automatically retry to fetch it in this case. This is only relevant when running a\n+torrent-less download, with the metadata extension provided by libtorrent.
\n \n-struct peer_plugin\n+struct metadata_failed_alert final : torrent_alert\n {\n- virtual string_view type () const;\n- virtual void add_handshake (entry&);\n- virtual void on_disconnect (error_code const&);\n- virtual void on_connected ();\n- virtual bool on_handshake (span<char const>);\n- virtual bool on_extension_handshake (bdecode_node const&);\n- virtual bool on_dont_have (piece_index_t);\n- virtual bool on_request (peer_request const&);\n- virtual bool on_allowed_fast (piece_index_t);\n- virtual bool on_have_none ();\n- virtual bool on_choke ();\n- virtual bool on_have (piece_index_t);\n- virtual bool on_interested ();\n- virtual bool on_have_all ();\n- virtual bool on_bitfield (bitfield const& /*bitfield*/);\n- virtual bool on_unchoke ();\n- virtual bool on_not_interested ();\n- virtual bool on_piece (peer_request const& /*piece*/\n- , span<char const> /*buf*/);\n- virtual bool on_cancel (peer_request const&);\n- virtual bool on_suggest (piece_index_t);\n- virtual bool on_reject (peer_request const&);\n- virtual void sent_have_all ();\n- virtual void sent_allow_fast (piece_index_t);\n- virtual void sent_have_none ();\n- virtual void sent_request (peer_request const&);\n- virtual void sent_choke ();\n- virtual void sent_reject_request (peer_request const&);\n- virtual void sent_cancel (peer_request const&);\n- virtual void sent_suggest (piece_index_t);\n- virtual void sent_unchoke ();\n- virtual void sent_have (piece_index_t);\n- virtual void sent_interested ();\n- virtual void sent_not_interested ();\n- virtual void sent_piece (peer_request const&);\n- virtual void sent_payload (int /* bytes */);\n- virtual bool can_disconnect (error_code const& /*ec*/);\n- virtual bool on_extended (int /*length*/, int /*msg*/,\n- span<char const> /*body*/);\n- virtual bool on_unknown_message (int /*length*/, int /*msg*/,\n- span<char const> /*body*/);\n- virtual void on_piece_failed (piece_index_t);\n- virtual void on_piece_pass (piece_index_t);\n- virtual void tick ();\n- virtual bool write_request (peer_request const&);\n+ std::string message () const override;\n+\n+ static constexpr alert_category_t static_category = alert_category::error;\n+ error_code const error;\n };\n \n-[report issue]\n-type()
\n-\n-virtual string_view type () const;\n-
\n-This function is expected to return the name of\n-the plugin.
\n-[report issue]\n-\n-add_handshake()
\n-\n-virtual void add_handshake (entry&);\n-
\n-can add entries to the extension handshake\n-this is not called for web seeds
\n-[report issue]\n-\n-on_disconnect()
\n-\n-virtual void on_disconnect (error_code const&);\n-
\n-called when the peer is being disconnected.
\n-[report issue]\n-\n-on_connected()
\n-\n-virtual void on_connected ();\n-
\n-called when the peer is successfully connected. Note that\n-incoming connections will have been connected by the time\n-the peer plugin is attached to it, and won't have this hook\n-called.
\n-[report issue]\n-\n-on_handshake()
\n-\n-virtual bool on_handshake (span<char const>);\n-
\n-this is called when the initial bittorrent handshake is received.\n-Returning false means that the other end doesn't support this extension\n-and will remove it from the list of plugins. this is not called for web\n-seeds
\n-[report issue]\n-\n-on_extension_handshake()
\n-\n-virtual bool on_extension_handshake (bdecode_node const&);\n-
\n-called when the extension handshake from the other end is received\n-if this returns false, it means that this extension isn't\n-supported by this peer. It will result in this peer_plugin\n-being removed from the peer_connection and destructed.\n-this is not called for web seeds
\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-[report issue]\n-\n-on_request() on_interested() on_allowed_fast() on_have_all() on_choke() on_unchoke() on_have_none() on_have() on_bitfield() on_dont_have() on_not_interested()
\n-\n-virtual bool on_dont_have (piece_index_t);\n-virtual bool on_request (peer_request const&);\n-virtual bool on_allowed_fast (piece_index_t);\n-virtual bool on_have_none ();\n-virtual bool on_choke ();\n-virtual bool on_have (piece_index_t);\n-virtual bool on_interested ();\n-virtual bool on_have_all ();\n-virtual bool on_bitfield (bitfield const& /*bitfield*/);\n-virtual bool on_unchoke ();\n-virtual bool on_not_interested ();\n-
\n-returning true from any of the message handlers\n-indicates that the plugin has handled the message.\n-it will break the plugin chain traversing and not let\n-anyone else handle the message, including the default\n-handler.
\n-[report issue]\n-\n-on_piece()
\n-\n-virtual bool on_piece (peer_request const& /*piece*/\n- , span<char const> /*buf*/);\n-
\n-This function is called when the peer connection is receiving\n-a piece. buf points (non-owning pointer) to the data in an\n-internal immutable disk buffer. The length of the data is specified\n-in the length member of the piece parameter.\n-returns true to indicate that the piece is handled and the\n-rest of the logic should be ignored.
\n-\n-\n-\n-\n-[report issue]\n-\n-sent_interested() sent_unchoke() sent_not_interested() sent_piece() sent_have()
\n-\n-virtual void sent_unchoke ();\n-virtual void sent_have (piece_index_t);\n-virtual void sent_interested ();\n-virtual void sent_not_interested ();\n-virtual void sent_piece (peer_request const&);\n-
\n-called after a choke message has been sent to the peer
\n-[report issue]\n-\n-sent_payload()
\n-\n-virtual void sent_payload (int /* bytes */);\n-
\n-called after piece data has been sent to the peer\n-this can be used for stats book keeping
\n-[report issue]\n-\n-can_disconnect()
\n-\n-virtual bool can_disconnect (error_code const& /*ec*/);\n-
\n-called when libtorrent think this peer should be disconnected.\n-if the plugin returns false, the peer will not be disconnected.
\n-[report issue]\n-\n-on_extended()
\n-\n-virtual bool on_extended (int /*length*/, int /*msg*/,\n- span<char const> /*body*/);\n-
\n-called when an extended message is received. If returning true,\n-the message is not processed by any other plugin and if false\n-is returned the next plugin in the chain will receive it to\n-be able to handle it. This is not called for web seeds.\n-thus function may be called more than once per incoming message, but\n-only the last of the calls will the body size equal the length.\n-i.e. Every time another fragment of the message is received, this\n-function will be called, until finally the whole message has been\n-received. The purpose of this is to allow early disconnects for invalid\n-messages and for reporting progress of receiving large messages.
\n-[report issue]\n-\n-on_unknown_message()
\n-\n-virtual bool on_unknown_message (int /*length*/, int /*msg*/,\n- span<char const> /*body*/);\n+[report issue]
\n+- error
\n+- indicates what failed when parsing the metadata. This error is\n+what's returned from lazy_bdecode().
\n+
\n+[report issue]\n+\n+metadata_received_alert
\n+Declared in "libtorrent/alert_types.hpp"
\n+This alert is generated when the metadata has been completely received and the torrent\n+can start downloading. It is not generated on torrents that are started with metadata, but\n+only those that needs to download it from peers (when utilizing the libtorrent extension).
\n+There are no additional data members in this alert.
\n+Typically, when receiving this alert, you would want to save the torrent file in order\n+to load it back up again when the session is restarted. Here's an example snippet of\n+code to do that:
\n+\n+torrent_handle h = alert->handle();\n+std::shared_ptr<torrent_info const> ti = h.torrent_file();\n+create_torrent ct(*ti);\n+entry te = ct.generate();\n+std::vector<char> buffer;\n+bencode(std::back_inserter(buffer), te);\n+FILE* f = fopen((to_hex(ti->info_hashes().get_best().to_string()) + ".torrent").c_str(), "wb+");\n+if (f) {\n+ fwrite(&buffer[0], 1, buffer.size(), f);\n+ fclose(f);\n+}\n
\n-this is not called for web seeds
\n-\n-[report issue]\n-\n-on_piece_failed() on_piece_pass()
\n \n-virtual void on_piece_failed (piece_index_t);\n-virtual void on_piece_pass (piece_index_t);\n+struct metadata_received_alert final : torrent_alert\n+{\n+ std::string message () const override;\n+\n+ static constexpr alert_category_t static_category = alert_category::status;\n+};\n \n-called when a piece that this peer participated in either\n-fails or passes the hash_check
\n-[report issue]\n-\n+\n+udp_error_alert
\n+Declared in "libtorrent/alert_types.hpp"
\n+This alert is posted when there is an error on a UDP socket. The\n+UDP sockets are used for all uTP, DHT and UDP tracker traffic. They are\n+global to the session.
\n \n-virtual void tick ();\n+struct udp_error_alert final : alert\n+{\n+ std::string message () const override;\n+\n+ static constexpr alert_category_t static_category = alert_category::error;\n+ aux::noexcept_movable<udp::endpoint> endpoint;\n+ operation_t operation;\n+ error_code const error;\n+};\n \n-called approximately once every second
\n-[report issue]\n-\n-write_request()
\n+[report issue]\n+- endpoint
\n+- the source address associated with the error (if any)
\n+
\n+[report issue]\n+- operation
\n+- the operation that failed
\n+
\n+[report issue]\n+- error
\n+- the error code describing the error
\n+
\n+[report issue]\n+\n+external_ip_alert
\n+Declared in "libtorrent/alert_types.hpp"
\n+Whenever libtorrent learns about the machines external IP, this alert is\n+generated. The external IP address can be acquired from the tracker (if it\n+supports that) or from peers that supports the extension protocol.\n+The address can be accessed through the external_address member.
\n \n-virtual bool write_request (peer_request const&);\n+struct external_ip_alert final : alert\n+{\n+ std::string message () const override;\n+\n+ static constexpr alert_category_t static_category = alert_category::status;\n+ aux::noexcept_movable<address> external_address;\n+};\n \n-called each time a request message is to be sent. If true\n-is returned, the original request message won't be sent and\n-no other plugin will have this function called.
\n-[report issue]\n-\n-\n-crypto_plugin
\n-Declared in "libtorrent/extensions.hpp"
\n+[report issue]\n+- external_address
\n+- the IP address that is believed to be our external IP
\n+
\n+[report issue]\n+\n+listen_failed_alert
\n+Declared in "libtorrent/alert_types.hpp"
\n+This alert is generated when none of the ports, given in the port range, to\n+session can be opened for listening. The listen_interface member is the\n+interface that failed, error is the error code describing the failure.
\n+In the case an endpoint was created before generating the alert, it is\n+represented by address and port. The combinations of socket type\n+and operation in which such address and port are not valid are:\n+accept - i2p\n+accept - socks5\n+enum_if - tcp
\n+libtorrent may sometimes try to listen on port 0, if all other ports failed.\n+Port 0 asks the operating system to pick a port that's free). If that fails\n+you may see a listen_failed_alert with port 0 even if you didn't ask to\n+listen on it.
\n \n-struct crypto_plugin\n+struct listen_failed_alert final : alert\n {\n- virtual void set_incoming_key (span<char const> key) = 0;\n- virtual void set_outgoing_key (span<char const> key) = 0;\n- encrypt (span<span<char>> /*send_vec*/) = 0;\n- virtual std::tuple<int, int, int> decrypt (span<span<char>> /*receive_vec*/) = 0;\n+ std::string message () const override;\n+ char const* listen_interface () const;\n+\n+ static constexpr alert_category_t static_category = alert_category::status | alert_category::error;\n+ error_code const error;\n+ operation_t op;\n+ lt::socket_type_t const socket_type;\n+ aux::noexcept_movable<lt::address> address;\n+ int const port;\n };\n \n-[report issue]\n-decrypt()
\n+[report issue]\n+listen_interface()
\n \n-virtual std::tuple<int, int, int> decrypt (span<span<char>> /*receive_vec*/) = 0;\n+char const* listen_interface () const;\n
\n-decrypt the provided buffers.\n-returns is a tuple representing the values\n-(consume, produce, packet_size)
\n-consume is set to the number of bytes which should be trimmed from the\n-head of the buffers, default is 0
\n-produce is set to the number of bytes of payload which are now ready to\n-be sent to the upper layer. default is the number of bytes passed in receive_vec
\n-packet_size is set to the minimum number of bytes which must be read to\n-advance the next step of decryption. default is 0
\n-[report issue]\n+the network device libtorrent attempted to listen on, or the IP address
\n+[report issue]\n+- error
\n+- the error the system returned
\n+
\n+[report issue]\n+- op
\n+- the underlying operation that failed
\n+
\n+[report issue]\n+- socket_type
\n+- the type of listen socket this alert refers to.
\n+
\n+[report issue]\n+- address
\n+- the address libtorrent attempted to listen on\n+see alert documentation for validity of this value
\n+
\n+[report issue]\n+- port
\n+- the port libtorrent attempted to listen on\n+see alert documentation for validity of this value
\n+
\n+[report issue]\n \n-\n-create_ut_pex_plugin()
\n-Declared in "libtorrent/extensions/ut_pex.hpp"
\n-\n-std::shared_ptr<torrent_plugin> create_ut_pex_plugin (torrent_handle const&, client_data_t);\n-
\n-constructor function for the ut_pex extension. The ut_pex\n-extension allows peers to gossip about their connections, allowing\n-the swarm stay well connected and peers aware of more peers in the\n-swarm. This extension is enabled by default unless explicitly disabled in\n-the session constructor.
\n-This can either be passed in the add_torrent_params::extensions field, or\n-via torrent_handle::add_extension().
\n-[report issue]\n-\n-create_ut_metadata_plugin()
\n-Declared in "libtorrent/extensions/ut_metadata.hpp"
\n-\n-std::shared_ptr<torrent_plugin> create_ut_metadata_plugin (torrent_handle const&, client_data_t);\n-
\n-constructor function for the ut_metadata extension. The ut_metadata\n-extension allows peers to request the .torrent file (or more\n-specifically the info-dictionary of the .torrent file) from each\n-other. This is the main building block in making magnet links work.\n-This extension is enabled by default unless explicitly disabled in\n-the session constructor.
\n-This can either be passed in the add_torrent_params::extensions field, or\n-via torrent_handle::add_extension().
\n-[report issue]\n-\n-create_smart_ban_plugin()
\n-Declared in "libtorrent/extensions/smart_ban.hpp"
\n-\n-std::shared_ptr<torrent_plugin> create_smart_ban_plugin (torrent_handle const&, client_data_t);\n-
\n-constructor function for the smart ban extension. The extension keeps\n-track of the data peers have sent us for failing pieces and once the\n-piece completes and passes the hash check bans the peers that turned\n-out to have sent corrupt data.\n-This function can either be passed in the add_torrent_params::extensions\n-field, or via torrent_handle::add_extension().
\n-[report issue]\n-\n-announce_infohash
\n-Declared in "libtorrent/announce_entry.hpp"
\n+\n+listen_succeeded_alert
\n+Declared in "libtorrent/alert_types.hpp"
\n+This alert is posted when the listen port succeeds to be opened on a\n+particular interface. address and port is the endpoint that\n+successfully was opened for listening.
\n \n-struct announce_infohash\n+struct listen_succeeded_alert final : alert\n {\n- std::string message;\n- error_code last_error;\n- int scrape_incomplete = -1;\n- int scrape_complete = -1;\n- int scrape_downloaded = -1;\n- std::uint8_t fails : 7;\n- bool updating : 1;\n- bool start_sent : 1;\n- bool complete_sent : 1;\n+ std::string message () const override;\n+\n+ static constexpr alert_category_t static_category = alert_category::status;\n+ aux::noexcept_movable<lt::address> address;\n+ int const port;\n+ lt::socket_type_t const socket_type;\n };\n \n-[report issue]\n-- message
\n-- if this tracker has returned an error or warning message\n-that message is stored here
\n+[report issue]\n+- address
\n+- the address libtorrent ended up listening on. This address\n+refers to the local interface.
\n
\n-[report issue]\n-- last_error
\n-- if this tracker failed the last time it was contacted\n-this error code specifies what error occurred
\n+[report issue]\n+- port
\n+- the port libtorrent ended up listening on.
\n
\n-\n-\n-[report issue]\n-- scrape_incomplete scrape_complete scrape_downloaded
\n-- if this tracker has returned scrape data, these fields are filled in\n-with valid numbers. Otherwise they are set to -1. incomplete counts\n-the number of current downloaders. complete counts the number of\n-current peers completed the download, or "seeds". downloaded is the\n-cumulative number of completed downloads.
\n+[report issue]\n+- socket_type
\n+- the type of listen socket this alert refers to.
\n
\n-[report issue]\n-- fails
\n-- the number of times in a row we have failed to announce to this\n-tracker.
\n+[report issue]
\n+\n+portmap_error_alert
\n+Declared in "libtorrent/alert_types.hpp"
\n+This alert is generated when a NAT router was successfully found but some\n+part of the port mapping request failed. It contains a text message that\n+may help the user figure out what is wrong. This alert is not generated in\n+case it appears the client is not running on a NAT:ed network or if it\n+appears there is no NAT router that can be remote controlled to add port\n+mappings.
\n+\n+struct portmap_error_alert final : alert\n+{\n+ std::string message () const override;\n+\n+ static constexpr alert_category_t static_category = alert_category::port_mapping\n+ | alert_category::error;\n+ port_mapping_t const mapping;\n+ portmap_transport map_transport;\n+ aux::noexcept_movable<address> local_address;\n+ error_code const error;\n+};\n+\n+[report issue]\n+- mapping
\n+- refers to the mapping index of the port map that failed, i.e.\n+the index returned from add_mapping().
\n
\n-[report issue]\n-- updating
\n-- true while we're waiting for a response from the tracker.
\n+[report issue]\n+- map_transport
\n+- UPnP or NAT-PMP
\n
\n-[report issue]\n-- start_sent
\n-- set to true when we get a valid response from an announce\n-with event=started. If it is set, we won't send start in the subsequent\n-announces.
\n+[report issue]\n+- local_address
\n+- the local network the port mapper is running on
\n
\n-[report issue]\n-- complete_sent
\n-- set to true when we send a event=completed.
\n+[report issue]\n+- error
\n+- tells you what failed.
\n
\n-[report issue]
\n-\n-announce_endpoint
\n-Declared in "libtorrent/announce_entry.hpp"
\n-announces are sent to each tracker using every listen socket\n-this class holds information about one listen socket for one tracker
\n+[report issue]\n+\n+portmap_alert
\n+Declared in "libtorrent/alert_types.hpp"
\n+This alert is generated when a NAT router was successfully found and\n+a port was successfully mapped on it. On a NAT:ed network with a NAT-PMP\n+capable router, this is typically generated once when mapping the TCP\n+port and, if DHT is enabled, when the UDP port is mapped.
\n \n-struct announce_endpoint\n+struct portmap_alert final : alert\n {\n- announce_endpoint ();\n+ std::string message () const override;\n \n- tcp::endpoint local_endpoint;\n- aux::array<announce_infohash, num_protocols, protocol_version> info_hashes;\n- bool enabled = true;\n+ static constexpr alert_category_t static_category = alert_category::port_mapping;\n+ port_mapping_t const mapping;\n+ int const external_port;\n+ portmap_protocol const map_protocol;\n+ portmap_transport const map_transport;\n+ aux::noexcept_movable<address> local_address;\n };\n \n-[report issue]\n-- local_endpoint
\n-- the local endpoint of the listen interface associated with this endpoint
\n+[report issue]\n+- mapping
\n+- refers to the mapping index of the port map that failed, i.e.\n+the index returned from add_mapping().
\n
\n-[report issue]\n-- info_hashes
\n-- info_hashes[0] is the v1 info hash (SHA1)\n-info_hashes[1] is the v2 info hash (truncated SHA-256)
\n+[report issue]\n+- external_port
\n+- the external port allocated for the mapping.
\n
\n-[report issue]\n-- enabled
\n-- set to false to not announce from this endpoint
\n+[report issue]\n+- local_address
\n+- the local network the port mapper is running on
\n
\n-[report issue]
\n-\n-announce_entry
\n-Declared in "libtorrent/announce_entry.hpp"
\n-this class holds information about one bittorrent tracker, as it\n-relates to a specific torrent.
\n+[report issue]\n+\n+portmap_log_alert
\n+Declared in "libtorrent/alert_types.hpp"
\n+This alert is generated to log informational events related to either\n+UPnP or NAT-PMP. They contain a log line and the type (0 = NAT-PMP\n+and 1 = UPnP). Displaying these messages to an end user is only useful\n+for debugging the UPnP or NAT-PMP implementation. This alert is only\n+posted if the alert_category::port_mapping_log flag is enabled in\n+the alert mask.
\n \n-struct announce_entry\n+struct portmap_log_alert final : alert\n {\n- explicit announce_entry (string_view u);\n- announce_entry ();\n- announce_entry (announce_entry const&);\n- ~announce_entry ();\n- announce_entry& operator= (announce_entry const&) &;\n-\n- enum tracker_source\n- {\n- source_torrent,\n- source_client,\n- source_magnet_link,\n- source_tex,\n- };\n+ std::string message () const override;\n+ char const* log_message () const;\n \n- std::string url;\n- std::string trackerid;\n- std::vector<announce_endpoint> endpoints;\n- std::uint8_t tier = 0;\n- std::uint8_t fail_limit = 0;\n- std::uint8_t source:4;\n- bool verified:1;\n+ static constexpr alert_category_t static_category = alert_category::port_mapping_log;\n+ portmap_transport const map_transport;\n+ aux::noexcept_movable<address> local_address;\n };\n \n-\n-\n-[report issue]\n-announce_entry() ~announce_entry() operator=()
\n+[report issue]\n+log_message()
\n \n-explicit announce_entry (string_view u);\n-announce_entry ();\n-announce_entry (announce_entry const&);\n-~announce_entry ();\n-announce_entry& operator= (announce_entry const&) &;\n+char const* log_message () const;\n
\n-constructs a tracker announce entry with u as the URL.
\n-[report issue]\n-\n-enum tracker_source
\n-Declared in "libtorrent/announce_entry.hpp"
\n-\n-\n- \n-\n-name \n-value \n-description \n-source_torrent \n-1 \n-the tracker was part of the .torrent file \n-source_client \n-2 \n-the tracker was added programmatically via the add_tracker() function \n-source_magnet_link \n-4 \n-the tracker was part of a magnet link \n-source_tex \n-8 \n-the tracker was received from the swarm via tracker exchange \n-
\n-[report issue]\n-- url
\n-- tracker URL as it appeared in the torrent file
\n-
\n-[report issue]\n-- trackerid
\n-- the current &trackerid= argument passed to the tracker.\n-this is optional and is normally empty (in which case no\n-trackerid is sent).
\n-
\n-[report issue]\n-- endpoints
\n-- each local listen socket (endpoint) will announce to the tracker. This\n-list contains state per endpoint.
\n-
\n-[report issue]\n-- tier
\n-- the tier this tracker belongs to
\n-
\n-[report issue]\n-- fail_limit
\n-- the max number of failures to announce to this tracker in\n-a row, before this tracker is not used anymore. 0 means unlimited
\n-
\n-[report issue]\n-- source
\n-- a bitmask specifying which sources we got this tracker from.
\n-
\n-[report issue]\n-- verified
\n-- set to true the first time we receive a valid response\n-from this tracker.
\n+the message associated with this log line
\n+[report issue]\n+- local_address
\n+- the local network the port mapper is running on
\n
\n-You have some control over session configuration through the session::apply_settings()\n-member function. To change one or more configuration options, create a settings_pack\n-object and fill it with the settings to be set and pass it in to session::apply_settings().
\n-The settings_pack object is a collection of settings updates that are applied\n-to the session when passed to session::apply_settings(). It's empty when\n-constructed.
\n-You have control over proxy and authorization settings and also the user-agent\n-that will be sent to the tracker. The user-agent will also be used to identify the\n-client with other peers.
\n-Each configuration option is named with an enum value inside the\n-settings_pack class. These are the available settings:
\n-[report issue]
\n-\n-\n-settings_pack
\n-Declared in "libtorrent/settings_pack.hpp"
\n-The settings_pack struct, contains the names of all settings as\n-enum values. These values are passed in to the set_str(),\n-set_int(), set_bool() functions, to specify the setting to\n-change.
\n-The settings_pack only stores values for settings that have been\n-explicitly set on this object. However, it can still be queried for\n-settings that have not been set and returns the default value for those\n-settings.
\n-\n-\n- \n-\n-name \n-type \n-default \n-user_agent \n-string \n-libtorrent/ \n-
\n-this is the client identification to the tracker. The recommended\n-format of this string is: "client-name/client-version\n-libtorrent/libtorrent-version". This name will not only be used when\n-making HTTP requests, but also when sending extended headers to\n-peers that support that extension. It may not contain r or n
\n-\n-\n- \n-\n-name \n-type \n-default \n-announce_ip \n-string \n-nullptr \n-
\n-announce_ip is the ip address passed along to trackers as the\n-&ip= parameter. If left as the default, that parameter is\n-omitted.
\n-\n-Note
\n-This setting is only meant for very special cases where a seed is\n-running on the same host as the tracker, and the tracker accepts\n-the IP parameter (which normal trackers don't). Do not set this\n-option unless you also control the tracker.
\n+[report issue]\n \n-\n-\n- \n-\n-name \n-type \n-default \n-handshake_client_version \n-string \n-nullptr \n-
\n-this is the client name and version identifier sent to peers in the\n-handshake message. If this is an empty string, the user_agent is\n-used instead. This string must be a UTF-8 encoded unicode string.
\n-\n-\n- \n-\n-name \n-type \n-default \n-outgoing_interfaces \n-string \n- \n-
\n-This controls which IP address outgoing TCP peer connections are bound\n-to, in addition to controlling whether such connections are also\n-bound to a specific network interface/adapter (bind-to-device).
\n-This string is a comma-separated list of IP addresses and\n-interface names. An empty string will not bind TCP sockets to a\n-device, and let the network stack assign the local address.
\n-A list of names will be used to bind outgoing TCP sockets in a\n-round-robin fashion. An IP address will simply be used to bind()\n-the socket. An interface name will attempt to bind the socket to\n-that interface. If that fails, or is unsupported, one of the IP\n-addresses configured for that interface is used to bind() the\n-socket to. If the interface or adapter doesn't exist, the\n-outgoing peer connection will fail with an error message suggesting\n-the device cannot be found. Adapter names on Unix systems are of\n-the form "eth0", "eth1", "tun0", etc. This may be useful for\n-clients that are multi-homed. Binding an outgoing connection to a\n-local IP does not necessarily make the connection via the\n-associated NIC/Adapter.
\n-When outgoing interfaces are specified, incoming connections or\n-packets sent to a local interface or IP that's not in this list\n-will be rejected with a peer_blocked_alert with\n-invalid_local_interface as the reason.
\n-Note that these are just interface/adapter names or IP addresses.\n-There are no ports specified in this list. IPv6 addresses without\n-port should be specified without enclosing [, ].
\n-\n-\n- \n-\n-name \n-type \n-default \n-listen_interfaces \n-string \n-0.0.0.0:6881,[::]:6881 \n-
\n-a comma-separated list of (IP or device name, port) pairs. These are\n-the listen ports that will be opened for accepting incoming uTP and\n-TCP peer connections. These are also used for outgoing uTP and UDP\n-tracker connections and DHT nodes.
\n-It is possible to listen on multiple interfaces and\n-multiple ports. Binding to port 0 will make the operating system\n-pick the port.
\n-\n-Note
\n-There are reasons to stick to the same port across sessions,\n-which would mean only using port 0 on the first start, and\n-recording the port that was picked for subsequent startups.\n-Trackers, the DHT and other peers will remember the port they see\n-you use and hand that port out to other peers trying to connect\n-to you, as well as trying to connect to you themselves.
\n+\n+fastresume_rejected_alert
\n+Declared in "libtorrent/alert_types.hpp"
\n+This alert is generated when a fast resume file has been passed to\n+add_torrent() but the files on disk did not match the fast resume file.\n+The error_code explains the reason why the resume file was rejected.
\n+\n+struct fastresume_rejected_alert final : torrent_alert\n+{\n+ std::string message () const override;\n+ char const* file_path () const;\n+\n+ static constexpr alert_category_t static_category = alert_category::status\n+ | alert_category::error;\n+ error_code error;\n+ operation_t op;\n+};\n+\n+[report issue]\n+file_path()
\n+\n+char const* file_path () const;\n+
\n+If the error happened to a specific file, this returns the path to it.
\n+[report issue]\n+- op
\n+- the underlying operation that failed
\n+
\n+[report issue]\n \n-A port that has an "s" suffix will accept SSL peer connections. (note\n-that SSL sockets are only available in builds with SSL support)
\n-A port that has an "l" suffix will be considered a local network.\n-i.e. it's assumed to only be able to reach hosts in the same local\n-network as the IP address (based on the netmask associated with the\n-IP, queried from the operating system).
\n-if binding fails, the listen_failed_alert is posted. Once a\n-socket binding succeeds (if it does), the listen_succeeded_alert\n-is posted. There may be multiple failures before a success.
\n-If a device name that does not exist is configured, no listen\n-socket will be opened for that interface. If this is the only\n-interface configured, it will be as if no listen ports are\n-configured.
\n-If no listen ports are configured (e.g. listen_interfaces is an\n-empty string), networking will be disabled. No DHT will start, no\n-outgoing uTP or tracker connections will be made. No incoming TCP\n-or uTP connections will be accepted. (outgoing TCP connections\n-will still be possible, depending on\n-settings_pack::outgoing_interfaces).
\n-For example:\n-[::1]:8888 - will only accept connections on the IPv6 loopback\n-address on port 8888.
\n-eth0:4444,eth1:4444 - will accept connections on port 4444 on\n-any IP address bound to device eth0 or eth1.
\n-[::]:0s - will accept SSL connections on a port chosen by the\n-OS. And not accept non-SSL connections at all.
\n-0.0.0.0:6881,[::]:6881 - binds to all interfaces on port 6881.
\n-10.0.1.13:6881l - binds to the local IP address, port 6881, but\n-only allow talking to peers on the same local network. The netmask\n-is queried from the operating system. Interfaces marked l are\n-not announced to trackers, unless the tracker is also on the same\n-local network.
\n-Windows OS network adapter device name must be specified with GUID.\n-It can be obtained from "netsh lan show interfaces" command output.\n-GUID must be uppercased string embraced in curly brackets.\n-{E4F0B674-0DFC-48BB-98A5-2AA730BDB6D6}:7777 - will accept\n-connections on port 7777 on adapter with this GUID.
\n-For more information, see the Multi-homed hosts section.
\n-\n-\n- \n-\n-name \n-type \n-default \n-proxy_hostname \n-string \n- \n-
\n-when using a proxy, this is the hostname where the proxy is running\n-see proxy_type. Note that when using a proxy, the\n-settings_pack::listen_interfaces setting is overridden and only a\n-single interface is created, just to contact the proxy. This\n-means a proxy cannot be combined with SSL torrents or multiple\n-listen interfaces. This proxy listen interface will not accept\n-incoming TCP connections, will not map ports with any gateway and\n-will not enable local service discovery. All traffic is supposed\n-to be channeled through the proxy.
\n-\n-\n-\n- \n-\n-name \n-type \n-default \n-proxy_username \n-string \n- \n-proxy_password \n-string \n- \n-
\n-when using a proxy, these are the credentials (if any) to use when\n-connecting to it. see proxy_type
\n-\n-\n- \n-\n-name \n-type \n-default \n-i2p_hostname \n-string \n- \n-
\n-sets the i2p SAM bridge to connect to. set the port with the\n-i2p_port setting. Unless this is set, i2p torrents are not\n-supported. This setting is separate from the other proxy settings\n-since i2p torrents and their peers are orthogonal. You can have\n-i2p peers as well as regular peers via a proxy.
\n-\n-\n- \n-\n-name \n-type \n-default \n-peer_fingerprint \n-string \n--LT20A0- \n-
\n-this is the fingerprint for the client. It will be used as the\n-prefix to the peer_id. If this is 20 bytes (or longer) it will be\n-truncated to 20 bytes and used as the entire peer-id
\n-There is a utility function, generate_fingerprint() that can be used\n-to generate a standard client peer ID fingerprint prefix.
\n-\n-\n- \n-\n-name \n-type \n-default \n-dht_bootstrap_nodes \n-string \n-dht.libtorrent.org:25401 \n-
\n-This is a comma-separated list of IP port-pairs. They will be added\n-to the DHT node (if it's enabled) as back-up nodes in case we don't\n-know of any.
\n-Changing these after the DHT has been started may not have any\n-effect until the DHT is restarted.
\n-\n-\n- \n-\n-name \n-type \n-default \n-allow_multiple_connections_per_ip \n-bool \n-false \n-
\n-determines if connections from the same IP address as existing\n-connections should be rejected or not. Rejecting multiple connections\n-from the same IP address will prevent abusive\n-behavior by peers. The logic for determining whether connections are\n-to the same peer is more complicated with this enabled, and more\n-likely to fail in some edge cases. It is not recommended to enable\n-this feature.
\n-\n-\n- \n-\n-name \n-type \n-default \n-send_redundant_have \n-bool \n-true \n-
\n-send_redundant_have controls if have messages will be sent to\n-peers that already have the piece. This is typically not necessary,\n-but it might be necessary for collecting statistics in some cases.
\n-\n-\n- \n-\n-name \n-type \n-default \n-use_dht_as_fallback \n-bool \n-false \n-
\n-use_dht_as_fallback determines how the DHT is used. If this is\n-true, the DHT will only be used for torrents where all trackers in\n-its tracker list has failed. Either by an explicit error message or\n-a time out. If this is false, the DHT is used regardless of if the\n-trackers fail or not.
\n-\n-\n- \n-\n-name \n-type \n-default \n-upnp_ignore_nonrouters \n-bool \n-false \n-
\n-upnp_ignore_nonrouters indicates whether or not the UPnP\n-implementation should ignore any broadcast response from a device\n-whose address is not on our subnet. i.e.\n-it's a way to not talk to other people's routers by mistake.
\n-\n-\n- \n-\n-name \n-type \n-default \n-use_parole_mode \n-bool \n-true \n-
\n-use_parole_mode specifies if parole mode should be used. Parole\n-mode means that peers that participate in pieces that fail the hash\n-check are put in a mode where they are only allowed to download\n-whole pieces. If the whole piece a peer in parole mode fails the\n-hash check, it is banned. If a peer participates in a piece that\n-passes the hash check, it is taken out of parole mode.
\n-\n-\n- \n-\n-name \n-type \n-default \n-auto_manage_prefer_seeds \n-bool \n-false \n-
\n-if true, prefer seeding torrents when determining which torrents to give\n-active slots to. If false, give preference to downloading torrents
\n-\n-\n- \n-\n-name \n-type \n-default \n-dont_count_slow_torrents \n-bool \n-true \n-
\n-if dont_count_slow_torrents is true, torrents without any\n-payload transfers are not subject to the active_seeds and\n-active_downloads limits. This is intended to make it more\n-likely to utilize all available bandwidth, and avoid having\n-torrents that don't transfer anything block the active slots.
\n-\n-\n- \n-\n-name \n-type \n-default \n-close_redundant_connections \n-bool \n-true \n-
\n-close_redundant_connections specifies whether libtorrent should\n-close connections where both ends have no utility in keeping the\n-connection open. For instance if both ends have completed their\n-downloads, there's no point in keeping it open.
\n-\n-\n- \n-\n-name \n-type \n-default \n-prioritize_partial_pieces \n-bool \n-false \n-
\n-If prioritize_partial_pieces is true, partial pieces are picked\n-before pieces that are more rare. If false, rare pieces are always\n-prioritized, unless the number of partial pieces is growing out of\n-proportion.
\n-\n-\n- \n-\n-name \n-type \n-default \n-rate_limit_ip_overhead \n-bool \n-true \n-
\n-if set to true, the estimated TCP/IP overhead is drained from the\n-rate limiters, to avoid exceeding the limits with the total traffic
\n-\n-\n-\n- \n-\n-name \n-type \n-default \n-announce_to_all_tiers \n-bool \n-false \n-announce_to_all_trackers \n-bool \n-false \n-
\n-announce_to_all_trackers controls how multi tracker torrents\n-are treated. If this is set to true, all trackers in the same tier\n-are announced to in parallel. If all trackers in tier 0 fails, all\n-trackers in tier 1 are announced as well. If it's set to false, the\n-behavior is as defined by the multi tracker specification.
\n-announce_to_all_tiers also controls how multi tracker torrents\n-are treated. When this is set to true, one tracker from each tier\n-is announced to. This is the uTorrent behavior. To be compliant\n-with the Multi-tracker specification, set it to false.
\n-\n-\n- \n-\n-name \n-type \n-default \n-prefer_udp_trackers \n-bool \n-true \n-
\n-prefer_udp_trackers: true means that trackers\n-may be rearranged in a way that udp trackers are always tried\n-before http trackers for the same hostname. Setting this to false\n-means that the tracker's tier is respected and there's no\n-preference of one protocol over another.
\n-\n-\n- \n-\n-name \n-type \n-default \n-disable_hash_checks \n-bool \n-false \n-
\n-when set to true, all data downloaded from peers will be assumed to\n-be correct, and not tested to match the hashes in the torrent this\n-is only useful for simulation and testing purposes (typically\n-combined with disabled_storage)
\n-\n-\n- \n-\n-name \n-type \n-default \n-allow_i2p_mixed \n-bool \n-false \n-
\n-if this is true, i2p torrents are allowed to also get peers from\n-other sources than the tracker, and connect to regular IPs, not\n-providing any anonymization. This may be useful if the user is not\n-interested in the anonymization of i2p, but still wants to be able\n-to connect to i2p peers.
\n-\n-\n- \n-\n-name \n-type \n-default \n-no_atime_storage \n-bool \n-true \n-
\n-no_atime_storage this is a Linux-only option and passes in the\n-O_NOATIME to open() when opening files. This may lead to\n-some disk performance improvements.
\n-\n-\n- \n-\n-name \n-type \n-default \n-incoming_starts_queued_torrents \n-bool \n-false \n-
\n-incoming_starts_queued_torrents. If a torrent\n-has been paused by the auto managed feature in libtorrent, i.e. the\n-torrent is paused and auto managed, this feature affects whether or\n-not it is automatically started on an incoming connection. The main\n-reason to queue torrents, is not to make them unavailable, but to\n-save on the overhead of announcing to the trackers, the DHT and to\n-avoid spreading one's unchoke slots too thin. If a peer managed to\n-find us, even though we're no in the torrent anymore, this setting\n-can make us start the torrent and serve it.
\n-\n-\n- \n-\n-name \n-type \n-default \n-report_true_downloaded \n-bool \n-false \n-
\n-when set to true, the downloaded counter sent to trackers will\n-include the actual number of payload bytes downloaded including\n-redundant bytes. If set to false, it will not include any redundancy\n-bytes
\n-\n-\n- \n-\n-name \n-type \n-default \n-strict_end_game_mode \n-bool \n-true \n-
\n-strict_end_game_mode controls when a\n-block may be requested twice. If this is true, a block may only\n-be requested twice when there's at least one request to every piece\n-that's left to download in the torrent. This may slow down progress\n-on some pieces sometimes, but it may also avoid downloading a lot\n-of redundant bytes. If this is false, libtorrent attempts to\n-use each peer connection to its max, by always requesting\n-something, even if it means requesting something that has been\n-requested from another peer already.
\n-\n-\n-\n-\n-\n- \n-\n-name \n-type \n-default \n-enable_outgoing_utp \n-bool \n-true \n-enable_incoming_utp \n-bool \n-true \n-enable_outgoing_tcp \n-bool \n-true \n-enable_incoming_tcp \n-bool \n-true \n-
\n-Enables incoming and outgoing, TCP and uTP peer connections.\n-false is disabled and true is enabled. When outgoing\n-connections are disabled, libtorrent will simply not make\n-outgoing peer connections with the specific transport protocol.\n-Disabled incoming peer connections will simply be rejected.\n-These options only apply to peer connections, not tracker- or any\n-other kinds of connections.
\n-\n-\n- \n-\n-name \n-type \n-default \n-no_recheck_incomplete_resume \n-bool \n-false \n-
\n-no_recheck_incomplete_resume determines if the storage should\n-check the whole files when resume data is incomplete or missing or\n-whether it should simply assume we don't have any of the data. If\n-false, any existing files will be checked.\n-By setting this setting to true, the files won't be checked, but\n-will go straight to download mode.
\n-\n-\n- \n-\n-name \n-type \n-default \n-anonymous_mode \n-bool \n-false \n-
\n-anonymous_mode: When set to true, the client tries to hide\n-its identity to a certain degree.
\n-\n-- A generic user-agent will be\n-used for trackers (except for private torrents).
\n-- Your local IPv4 and IPv6 address won't be sent as query string\n-parameters to private trackers.
\n-- If announce_ip is configured, it will not be sent to trackers
\n-- The client version will not be sent to peers in the extension\n-handshake.
\n-
\n-\n-\n- \n-\n-name \n-type \n-default \n-report_web_seed_downloads \n-bool \n-true \n-
\n-specifies whether downloads from web seeds is reported to the\n-tracker or not. Turning it off also excludes web\n-seed traffic from other stats and download rate reporting via the\n-libtorrent API.
\n-\n-\n- \n-\n-name \n-type \n-default \n-seeding_outgoing_connections \n-bool \n-true \n-
\n-seeding_outgoing_connections determines if seeding (and\n-finished) torrents should attempt to make outgoing connections or\n-not. It may be set to false in very\n-specific applications where the cost of making outgoing connections\n-is high, and there are no or small benefits of doing so. For\n-instance, if no nodes are behind a firewall or a NAT, seeds don't\n-need to make outgoing connections.
\n-\n-\n- \n-\n-name \n-type \n-default \n-no_connect_privileged_ports \n-bool \n-false \n-
\n-when this is true, libtorrent will not attempt to make outgoing\n-connections to peers whose port is < 1024. This is a safety\n-precaution to avoid being part of a DDoS attack
\n-\n-\n- \n-\n-name \n-type \n-default \n-smooth_connects \n-bool \n-true \n-
\n-smooth_connects means the number of\n-connection attempts per second may be limited to below the\n-connection_speed, in case we're close to bump up against the\n-limit of number of connections. The intention of this setting is to\n-more evenly distribute our connection attempts over time, instead\n-of attempting to connect in batches, and timing them out in\n-batches.
\n-\n-\n- \n-\n-name \n-type \n-default \n-always_send_user_agent \n-bool \n-false \n-
\n-always send user-agent in every web seed request. If false, only\n-the first request per http connection will include the user agent
\n-\n-\n- \n-\n-name \n-type \n-default \n-apply_ip_filter_to_trackers \n-bool \n-true \n-
\n-apply_ip_filter_to_trackers determines\n-whether the IP filter applies to trackers as well as peers. If this\n-is set to false, trackers are exempt from the IP filter (if there\n-is one). If no IP filter is set, this setting is irrelevant.
\n-\n-\n- \n-\n-name \n-type \n-default \n-ban_web_seeds \n-bool \n-true \n-
\n-when true, web seeds sending bad data will be banned
\n-\n-\n- \n-\n-name \n-type \n-default \n-support_share_mode \n-bool \n-true \n-
\n-if false, prevents libtorrent to advertise share-mode support
\n-\n-\n- \n-\n-name \n-type \n-default \n-report_redundant_bytes \n-bool \n-true \n-
\n-if this is true, the number of redundant bytes is sent to the\n-tracker
\n-\n-\n- \n-\n-name \n-type \n-default \n-listen_system_port_fallback \n-bool \n-true \n-
\n-if this is true, libtorrent will fall back to listening on a port\n-chosen by the operating system (i.e. binding to port 0). If a\n-failure is preferred, set this to false.
\n-\n-\n- \n-\n-name \n-type \n-default \n-announce_crypto_support \n-bool \n-true \n-
\n-when this is true, and incoming encrypted connections are enabled,\n-&supportcrypt=1 is included in http tracker announces
\n-\n-\n- \n-\n-name \n-type \n-default \n-enable_upnp \n-bool \n-true \n-
\n-Starts and stops the UPnP service. When started, the listen port\n-and the DHT port are attempted to be forwarded on local UPnP router\n-devices.
\n-The upnp object returned by start_upnp() can be used to add and\n-remove arbitrary port mappings. Mapping status is returned through\n-the portmap_alert and the portmap_error_alert. The object will be\n-valid until stop_upnp() is called. See upnp and nat pmp.
\n-\n-\n- \n-\n-name \n-type \n-default \n-enable_natpmp \n-bool \n-true \n-
\n-Starts and stops the NAT-PMP service. When started, the listen port\n-and the DHT port are attempted to be forwarded on the router\n-through NAT-PMP.
\n-The natpmp object returned by start_natpmp() can be used to add\n-and remove arbitrary port mappings. Mapping status is returned\n-through the portmap_alert and the portmap_error_alert. The object\n-will be valid until stop_natpmp() is called. See\n-upnp and nat pmp.
\n-\n-\n- \n-\n-name \n-type \n-default \n-enable_lsd \n-bool \n-true \n-
\n-Starts and stops Local Service Discovery. This service will\n-broadcast the info-hashes of all the non-private torrents on the\n-local network to look for peers on the same swarm within multicast\n-reach.
\n-\n-\n- \n-\n-name \n-type \n-default \n-enable_dht \n-bool \n-true \n-
\n-starts the dht node and makes the trackerless service available to\n-torrents.
\n-\n-\n- \n-\n-name \n-type \n-default \n-prefer_rc4 \n-bool \n-false \n-
\n-if the allowed encryption level is both, setting this to true will\n-prefer RC4 if both methods are offered, plain text otherwise
\n-\n-\n- \n-\n-name \n-type \n-default \n-proxy_hostnames \n-bool \n-true \n-
\n-if true, hostname lookups are done via the configured proxy (if\n-any). This is only supported by SOCKS5 and HTTP.
\n-\n-\n- \n-\n-name \n-type \n-default \n-proxy_peer_connections \n-bool \n-true \n-
\n-if true, peer connections are made (and accepted) over the\n-configured proxy, if any. Web seeds as well as regular bittorrent\n-peer connections are considered "peer connections". Anything\n-transporting actual torrent payload (trackers and DHT traffic are\n-not considered peer connections).
\n-\n-\n- \n-\n-name \n-type \n-default \n-auto_sequential \n-bool \n-true \n-
\n-if this setting is true, torrents with a very high availability of\n-pieces (and seeds) are downloaded sequentially. This is more\n-efficient for the disk I/O. With many seeds, the download order is\n-unlikely to matter anyway
\n-\n-\n- \n-\n-name \n-type \n-default \n-proxy_tracker_connections \n-bool \n-true \n-
\n-if true, tracker connections are made over the configured proxy, if\n-any.
\n-\n-\n- \n-\n-name \n-type \n-default \n-enable_ip_notifier \n-bool \n-true \n-
\n-Starts and stops the internal IP table route changes notifier.
\n-The current implementation supports multiple platforms, and it is\n-recommended to have it enable, but you may want to disable it if\n-it's supported but unreliable, or if you have a better way to\n-detect the changes. In the later case, you should manually call\n-session_handle::reopen_network_sockets to ensure network\n-changes are taken in consideration.
\n-\n-\n- \n-\n-name \n-type \n-default \n-dht_prefer_verified_node_ids \n-bool \n-true \n-
\n-when this is true, nodes whose IDs are derived from their source\n-IP according to BEP 42 are preferred in the routing table.
\n-\n-\n- \n-\n-name \n-type \n-default \n-dht_restrict_routing_ips \n-bool \n-true \n-
\n-determines if the routing table entries should restrict entries to one\n-per IP. This defaults to true, which helps mitigate some attacks on\n-the DHT. It prevents adding multiple nodes with IPs with a very close\n-CIDR distance.
\n-when set, nodes whose IP address that's in the same /24 (or /64 for\n-IPv6) range in the same routing table bucket. This is an attempt to\n-mitigate node ID spoofing attacks also restrict any IP to only have a\n-single entry in the whole routing table
\n-\n-\n- \n-\n-name \n-type \n-default \n-dht_restrict_search_ips \n-bool \n-true \n-
\n-determines if DHT searches should prevent adding nodes with IPs with\n-very close CIDR distance. This also defaults to true and helps\n-mitigate certain attacks on the DHT.
\n-\n-\n- \n-\n-name \n-type \n-default \n-dht_extended_routing_table \n-bool \n-true \n-
\n-makes the first buckets in the DHT routing table fit 128, 64, 32 and\n-16 nodes respectively, as opposed to the standard size of 8. All other\n-buckets have size 8 still.
\n-\n-\n- \n-\n-name \n-type \n-default \n-dht_aggressive_lookups \n-bool \n-true \n-
\n-slightly changes the lookup behavior in terms of how many outstanding\n-requests we keep. Instead of having branch factor be a hard limit, we\n-always keep branch factor outstanding requests to the closest nodes.\n-i.e. every time we get results back with closer nodes, we query them\n-right away. It lowers the lookup times at the cost of more outstanding\n-queries.
\n-\n-\n- \n-\n-name \n-type \n-default \n-dht_privacy_lookups \n-bool \n-false \n-
\n-when set, perform lookups in a way that is slightly more expensive,\n-but which minimizes the amount of information leaked about you.
\n-\n-\n- \n-\n-name \n-type \n-default \n-dht_enforce_node_id \n-bool \n-false \n-
\n-when set, node's whose IDs that are not correctly generated based on\n-its external IP are ignored. When a query arrives from such node, an\n-error message is returned with a message saying "invalid node ID".
\n-\n-\n- \n-\n-name \n-type \n-default \n-dht_ignore_dark_internet \n-bool \n-true \n-
\n-ignore DHT messages from parts of the internet we wouldn't expect to\n-see any traffic from
\n-\n-\n- \n-\n-name \n-type \n-default \n-dht_read_only \n-bool \n-false \n-
\n-when set, the other nodes won't keep this node in their routing\n-tables, it's meant for low-power and/or ephemeral devices that\n-cannot support the DHT, it is also useful for mobile devices which\n-are sensitive to network traffic and battery life.\n-this node no longer responds to 'query' messages, and will place a\n-'ro' key (value = 1) in the top-level message dictionary of outgoing\n-query messages.
\n-\n-\n- \n-\n-name \n-type \n-default \n-piece_extent_affinity \n-bool \n-false \n-
\n-when this is true, create an affinity for downloading 4 MiB extents\n-of adjacent pieces. This is an attempt to achieve better disk I/O\n-throughput by downloading larger extents of bytes, for torrents with\n-small piece sizes
\n-\n-\n- \n-\n-name \n-type \n-default \n-validate_https_trackers \n-bool \n-true \n-
\n-when set to true, the certificate of HTTPS trackers and HTTPS web\n-seeds will be validated against the system's certificate store\n-(as defined by OpenSSL). If the system does not have a\n-certificate store, this option may have to be disabled in order\n-to get trackers and web seeds to work).
\n-\n-\n- \n-\n-name \n-type \n-default \n-ssrf_mitigation \n-bool \n-true \n-
\n-when enabled, tracker and web seed requests are subject to\n-certain restrictions.
\n-An HTTP(s) tracker requests to localhost (loopback)\n-must have the request path start with "/announce". This is the\n-conventional bittorrent tracker request. Any other HTTP(S)\n-tracker request to loopback will be rejected. This applies to\n-trackers that redirect to loopback as well.
\n-Web seeds that end up on the client's local network (i.e. in a\n-private IP address range) may not include query string arguments.\n-This applies to web seeds redirecting to the local network as\n-well.
\n-Web seeds on global IPs (i.e. not local network) may not redirect\n-to a local network address
\n-\n-\n- \n-\n-name \n-type \n-default \n-allow_idna \n-bool \n-false \n-
\n-when disabled, any tracker or web seed with an IDNA hostname\n-(internationalized domain name) is ignored. This is a security\n-precaution to avoid various unicode encoding attacks that might\n-happen at the application level.
\n-\n-\n- \n-\n-name \n-type \n-default \n-enable_set_file_valid_data \n-bool \n-false \n-
\n-when set to true, enables the attempt to use SetFileValidData()\n-to pre-allocate disk space. This system call will only work when\n-running with Administrator privileges on Windows, and so this\n-setting is only relevant in that scenario. Using\n-SetFileValidData() poses a security risk, as it may reveal\n-previously deleted information from the disk.
\n-\n-\n- \n-\n-name \n-type \n-default \n-socks5_udp_send_local_ep \n-bool \n-false \n-
\n-When using a SOCKS5 proxy, UDP traffic is routed through the\n-proxy by sending a UDP ASSOCIATE command. If this option is true,\n-the UDP ASSOCIATE command will include the IP address and\n-listen port to the local UDP socket. This indicates to the proxy\n-which source endpoint to expect our packets from. The benefit is\n-that incoming packets can be forwarded correctly, before any\n-outgoing packets are sent. The risk is that if there's a NAT\n-between the client and the proxy, the IP address specified in the\n-protocol may not be valid from the proxy's point of view.
\n-\n-\n- \n-\n-name \n-type \n-default \n-tracker_completion_timeout \n-int \n-30 \n-
\n-tracker_completion_timeout is the number of seconds the tracker\n-connection will wait from when it sent the request until it\n-considers the tracker to have timed-out.
\n-\n-\n- \n-\n-name \n-type \n-default \n-tracker_receive_timeout \n-int \n-10 \n-
\n-tracker_receive_timeout is the number of seconds to wait to\n-receive any data from the tracker. If no data is received for this\n-number of seconds, the tracker will be considered as having timed\n-out. If a tracker is down, this is the kind of timeout that will\n-occur.
\n-\n-\n- \n-\n-name \n-type \n-default \n-stop_tracker_timeout \n-int \n-5 \n-
\n-stop_tracker_timeout is the number of seconds to wait when\n-sending a stopped message before considering a tracker to have\n-timed out. This is usually shorter, to make the client quit faster.\n-If the value is set to 0, the connections to trackers with the\n-stopped event are suppressed.
\n-\n-\n- \n-\n-name \n-type \n-default \n-tracker_maximum_response_length \n-int \n-1024*1024 \n-
\n-this is the maximum number of bytes in a tracker response. If a\n-response size passes this number of bytes it will be rejected and\n-the connection will be closed. On gzipped responses this size is\n-measured on the uncompressed data. So, if you get 20 bytes of gzip\n-response that'll expand to 2 megabytes, it will be interrupted\n-before the entire response has been uncompressed (assuming the\n-limit is lower than 2 MiB).
\n-\n-\n- \n-\n-name \n-type \n-default \n-piece_timeout \n-int \n-20 \n-
\n-the number of seconds from a request is sent until it times out if\n-no piece response is returned.
\n-\n-\n- \n-\n-name \n-type \n-default \n-request_timeout \n-int \n-60 \n-
\n-the number of seconds one block (16 kiB) is expected to be received\n-within. If it's not, the block is requested from a different peer
\n-\n-\n- \n-\n-name \n-type \n-default \n-request_queue_time \n-int \n-3 \n-
\n-the length of the request queue given in the number of seconds it\n-should take for the other end to send all the pieces. i.e. the\n-actual number of requests depends on the download rate and this\n-number.
\n-\n-\n- \n-\n-name \n-type \n-default \n-max_allowed_in_request_queue \n-int \n-2000 \n-
\n-the number of outstanding block requests a peer is allowed to queue\n-up in the client. If a peer sends more requests than this (before\n-the first one has been sent) the last request will be dropped. the\n-higher this is, the faster upload speeds the client can get to a\n-single peer.
\n-\n-\n- \n-\n-name \n-type \n-default \n-max_out_request_queue \n-int \n-500 \n-
\n-max_out_request_queue is the maximum number of outstanding\n-requests to send to a peer. This limit takes precedence over\n-request_queue_time. i.e. no matter the download speed, the\n-number of outstanding requests will never exceed this limit.
\n-\n-\n- \n-\n-name \n-type \n-default \n-whole_pieces_threshold \n-int \n-20 \n-
\n-if a whole piece can be downloaded in this number of seconds, or\n-less, the peer_connection will prefer to request whole pieces at a\n-time from this peer. The benefit of this is to better utilize disk\n-caches by doing localized accesses and also to make it easier to\n-identify bad peers if a piece fails the hash check.
\n-\n-\n- \n-\n-name \n-type \n-default \n-peer_timeout \n-int \n-120 \n-
\n-peer_timeout is the number of seconds the peer connection\n-should wait (for any activity on the peer connection) before\n-closing it due to time out. 120 seconds is\n-specified in the protocol specification. After half\n-the time out, a keep alive message is sent.
\n-\n-\n- \n-\n-name \n-type \n-default \n-urlseed_timeout \n-int \n-20 \n-
\n-same as peer_timeout, but only applies to url-seeds. this is\n-usually set lower, because web servers are expected to be more\n-reliable.
\n-\n-\n- \n-\n-name \n-type \n-default \n-urlseed_pipeline_size \n-int \n-5 \n-
\n-controls the pipelining size of url and http seeds. i.e. the number of HTTP\n-request to keep outstanding before waiting for the first one to\n-complete. It's common for web servers to limit this to a relatively\n-low number, like 5
\n-\n-\n- \n-\n-name \n-type \n-default \n-urlseed_wait_retry \n-int \n-30 \n-
\n-number of seconds until a new retry of a url-seed takes place.\n-Default retry value for http-seeds that don't provide\n-a valid retry-after header.
\n-\n-\n- \n-\n-name \n-type \n-default \n-file_pool_size \n-int \n-40 \n-
\n-sets the upper limit on the total number of files this session will\n-keep open. The reason why files are left open at all is that some\n-anti virus software hooks on every file close, and scans the file\n-for viruses. deferring the closing of the files will be the\n-difference between a usable system and a completely hogged down\n-system. Most operating systems also has a limit on the total number\n-of file descriptors a process may have open.
\n-\n-\n- \n-\n-name \n-type \n-default \n-max_failcount \n-int \n-3 \n-
\n-max_failcount is the maximum times we try to\n-connect to a peer before stop connecting again. If a\n-peer succeeds, the failure counter is reset. If a\n-peer is retrieved from a peer source (other than DHT)\n-the failcount is decremented by one, allowing another\n-try.
\n-\n-\n- \n-\n-name \n-type \n-default \n-min_reconnect_time \n-int \n-60 \n-
\n-the number of seconds to wait to reconnect to a peer. this time is\n-multiplied with the failcount.
\n-\n-\n- \n-\n-name \n-type \n-default \n-peer_connect_timeout \n-int \n-15 \n-
\n-peer_connect_timeout the number of seconds to wait after a\n-connection attempt is initiated to a peer until it is considered as\n-having timed out. This setting is especially important in case the\n-number of half-open connections are limited, since stale half-open\n-connection may delay the connection of other peers considerably.
\n-\n-\n- \n-\n-name \n-type \n-default \n-connection_speed \n-int \n-30 \n-
\n-connection_speed is the number of connection attempts that are\n-made per second. If a number < 0 is specified, it will default to\n-200 connections per second. If 0 is specified, it means don't make\n-outgoing connections at all.
\n-\n-\n- \n-\n-name \n-type \n-default \n-inactivity_timeout \n-int \n-600 \n-
\n-if a peer is uninteresting and uninterested for longer than this\n-number of seconds, it will be disconnected.
\n-\n-\n- \n-\n-name \n-type \n-default \n-unchoke_interval \n-int \n-15 \n-
\n-unchoke_interval is the number of seconds between\n-chokes/unchokes. On this interval, peers are re-evaluated for being\n-choked/unchoked. This is defined as 30 seconds in the protocol, and\n-it should be significantly longer than what it takes for TCP to\n-ramp up to it's max rate.
\n-\n-\n- \n-\n-name \n-type \n-default \n-optimistic_unchoke_interval \n-int \n-30 \n-
\n-optimistic_unchoke_interval is the number of seconds between\n-each optimistic unchoke. On this timer, the currently\n-optimistically unchoked peer will change.
\n-\n-\n- \n-\n-name \n-type \n-default \n-num_want \n-int \n-200 \n-
\n-num_want is the number of peers we want from each tracker\n-request. It defines what is sent as the &num_want= parameter to\n-the tracker.
\n-\n-\n- \n-\n-name \n-type \n-default \n-initial_picker_threshold \n-int \n-4 \n-
\n-initial_picker_threshold specifies the number of pieces we need\n-before we switch to rarest first picking. The first\n-initial_picker_threshold pieces in any torrent are picked at random\n-, the following pieces are picked in rarest first order.
\n-\n-\n- \n-\n-name \n-type \n-default \n-allowed_fast_set_size \n-int \n-5 \n-
\n-the number of allowed pieces to send to peers that supports the\n-fast extensions
\n-\n-\n- \n-\n-name \n-type \n-default \n-suggest_mode \n-int \n-settings_pack::no_piece_suggestions \n-
\n-suggest_mode controls whether or not libtorrent will send out\n-suggest messages to create a bias of its peers to request certain\n-pieces. The modes are:
\n+\n+peer_blocked_alert
\n+Declared in "libtorrent/alert_types.hpp"
\n+This alert is posted when an incoming peer connection, or a peer that's about to be added\n+to our peer list, is blocked for some reason. This could be any of:
\n \n-- no_piece_suggestions which will not send out suggest messages.
\n-- suggest_read_cache which will send out suggest messages for\n-the most recent pieces that are in the read cache.
\n+- the IP filter
\n+- i2p mixed mode restrictions (a normal peer is not allowed on an i2p swarm)
\n+- the port filter
\n+- the peer has a low port and no_connect_privileged_ports is enabled
\n+- the protocol of the peer is blocked (uTP/TCP blocking)
\n
\n-\n-\n- \n-\n-name \n-type \n-default \n-max_queued_disk_bytes \n-int \n-1024 * 1024 \n-
\n-max_queued_disk_bytes is the maximum number of bytes, to\n-be written to disk, that can wait in the disk I/O thread queue.\n-This queue is only for waiting for the disk I/O thread to receive\n-the job and either write it to disk or insert it in the write\n-cache. When this limit is reached, the peer connections will stop\n-reading data from their sockets, until the disk thread catches up.\n-Setting this too low will severely limit your download rate.
\n-\n-\n- \n-\n-name \n-type \n-default \n-handshake_timeout \n-int \n-10 \n-
\n-the number of seconds to wait for a handshake response from a peer.\n-If no response is received within this time, the peer is\n-disconnected.
\n-\n-\n-\n-\n- \n-\n-name \n-type \n-default \n-send_buffer_low_watermark \n-int \n-10 * 1024 \n-send_buffer_watermark \n-int \n-500 * 1024 \n-send_buffer_watermark_factor \n-int \n-50 \n-
\n-send_buffer_low_watermark the minimum send buffer target size\n-(send buffer includes bytes pending being read from disk). For good\n-and snappy seeding performance, set this fairly high, to at least\n-fit a few blocks. This is essentially the initial window size which\n-will determine how fast we can ramp up the send rate
\n-if the send buffer has fewer bytes than send_buffer_watermark,\n-we'll read another 16 kiB block onto it. If set too small, upload\n-rate capacity will suffer. If set too high, memory will be wasted.\n-The actual watermark may be lower than this in case the upload rate\n-is low, this is the upper limit.
\n-the current upload rate to a peer is multiplied by this factor to\n-get the send buffer watermark. The factor is specified as a\n-percentage. i.e. 50 -> 0.5 This product is clamped to the\n-send_buffer_watermark setting to not exceed the max. For high\n-speed upload, this should be set to a greater value than 100. For\n-high capacity connections, setting this higher can improve upload\n-performance and disk throughput. Setting it too high may waste RAM\n-and create a bias towards read jobs over write jobs.
\n-\n-\n-\n- \n-\n-name \n-type \n-default \n-choking_algorithm \n-int \n-settings_pack::fixed_slots_choker \n-seed_choking_algorithm \n-int \n-settings_pack::round_robin \n-
\n-choking_algorithm specifies which algorithm to use to determine\n-how many peers to unchoke. The unchoking algorithm for\n-downloading torrents is always "tit-for-tat", i.e. the peers we\n-download the fastest from are unchoked.
\n-The options for choking algorithms are defined in the\n-choking_algorithm_t enum.
\n-seed_choking_algorithm controls the seeding unchoke behavior.\n-i.e. How we select which peers to unchoke for seeding torrents.\n-Since a seeding torrent isn't downloading anything, the\n-tit-for-tat mechanism cannot be used. The available options are\n-defined in the seed_choking_algorithm_t enum.
\n-\n-\n-\n- \n-\n-name \n-type \n-default \n-disk_io_write_mode \n-int \n-DISK_WRITE_MODE \n-disk_io_read_mode \n-int \n-settings_pack::enable_os_cache \n-
\n-determines how files are opened when they're in read only mode\n-versus read and write mode. The options are:
\n-\n-- enable_os_cache
\n-- Files are opened normally, with the OS caching reads and writes.
\n-- disable_os_cache
\n-- This opens all files in no-cache mode. This corresponds to the\n-OS not letting blocks for the files linger in the cache. This\n-makes sense in order to avoid the bittorrent client to\n-potentially evict all other processes' cache by simply handling\n-high throughput and large files. If libtorrent's read cache is\n-disabled, enabling this may reduce performance.
\n-- write_through
\n-- flush pieces to disk as they complete validation.
\n-
\n-One reason to disable caching is that it may help the operating\n-system from growing its file cache indefinitely.
\n-\n-\n-\n- \n-\n-name \n-type \n-default \n-outgoing_port \n-int \n-0 \n-num_outgoing_ports \n-int \n-0 \n-
\n-this is the first port to use for binding outgoing connections to.\n-This is useful for users that have routers that allow QoS settings\n-based on local port. when binding outgoing connections to specific\n-ports, num_outgoing_ports is the size of the range. It should\n-be more than a few
\n-\n-Warning
\n-setting outgoing ports will limit the ability to keep\n-multiple connections to the same client, even for different\n-torrents. It is not recommended to change this setting. Its main\n-purpose is to use as an escape hatch for cheap routers with QoS\n-capability but can only classify flows based on port numbers.
\n-\n-It is a range instead of a single port because of the problems with\n-failing to reconnect to peers if a previous socket to that peer and\n-port is in TIME_WAIT state.
\n-\n-\n- \n-\n-name \n-type \n-default \n-peer_dscp \n-int \n-0x04 \n-
\n-peer_dscp determines the DSCP field in the IP header of every\n-packet sent to peers (including web seeds). 0x0 means no marking,\n-0x04 represents Lower Effort. For more details see RFC 8622.
\n-peer_tos is the backwards compatible name for this setting.
\n-\n-\n-\n-\n-\n-\n-\n-\n- \n-\n-name \n-type \n-default \n-active_downloads \n-int \n-3 \n-active_seeds \n-int \n-5 \n-active_checking \n-int \n-1 \n-active_dht_limit \n-int \n-88 \n-active_tracker_limit \n-int \n-1600 \n-active_lsd_limit \n-int \n-60 \n-active_limit \n-int \n-500 \n-
\n-for auto managed torrents, these are the limits they are subject\n-to. If there are too many torrents some of the auto managed ones\n-will be paused until some slots free up. active_downloads and\n-active_seeds controls how many active seeding and downloading\n-torrents the queuing mechanism allows. The target number of active\n-torrents is min(active_downloads + active_seeds, active_limit).\n-active_downloads and active_seeds are upper limits on the\n-number of downloading torrents and seeding torrents respectively.\n-Setting the value to -1 means unlimited.
\n-For example if there are 10 seeding torrents and 10 downloading\n-torrents, and active_downloads is 4 and active_seeds is 4,\n-there will be 4 seeds active and 4 downloading torrents. If the\n-settings are active_downloads = 2 and active_seeds = 4,\n-then there will be 2 downloading torrents and 4 seeding torrents\n-active. Torrents that are not auto managed are not counted against\n-these limits.
\n-active_checking is the limit of number of simultaneous checking\n-torrents.
\n-active_limit is a hard limit on the number of active (auto\n-managed) torrents. This limit also applies to slow torrents.
\n-active_dht_limit is the max number of torrents to announce to\n-the DHT.
\n-active_tracker_limit is the max number of torrents to announce\n-to their trackers.
\n-active_lsd_limit is the max number of torrents to announce to\n-the local network over the local service discovery protocol.
\n-You can have more torrents active, even though they are not\n-announced to the DHT, lsd or their tracker. If some peer knows\n-about you for any reason and tries to connect, it will still be\n-accepted, unless the torrent is paused, which means it won't accept\n-any connections.
\n-\n-\n- \n-\n-name \n-type \n-default \n-auto_manage_interval \n-int \n-30 \n-
\n-auto_manage_interval is the number of seconds between the\n-torrent queue is updated, and rotated.
\n-\n-\n- \n-\n-name \n-type \n-default \n-seed_time_limit \n-int \n-24 * 60 * 60 \n-
\n-this is the limit on the time a torrent has been an active seed\n-(specified in seconds) before it is considered having met the seed\n-limit criteria. See queuing.
\n-\n-\n-\n- \n-\n-name \n-type \n-default \n-auto_scrape_interval \n-int \n-1800 \n-auto_scrape_min_interval \n-int \n-300 \n-
\n-auto_scrape_interval is the number of seconds between scrapes\n-of queued torrents (auto managed and paused torrents). Auto managed\n-torrents that are paused, are scraped regularly in order to keep\n-track of their downloader/seed ratio. This ratio is used to\n-determine which torrents to seed and which to pause.
\n-auto_scrape_min_interval is the minimum number of seconds\n-between any automatic scrape (regardless of torrent). In case there\n-are a large number of paused auto managed torrents, this puts a\n-limit on how often a scrape request is sent.
\n-\n-\n-\n- \n-\n-name \n-type \n-default \n-max_peerlist_size \n-int \n-3000 \n-max_paused_peerlist_size \n-int \n-1000 \n-
\n-max_peerlist_size is the maximum number of peers in the list of\n-known peers. These peers are not necessarily connected, so this\n-number should be much greater than the maximum number of connected\n-peers. Peers are evicted from the cache when the list grows passed\n-90% of this limit, and once the size hits the limit, peers are no\n-longer added to the list. If this limit is set to 0, there is no\n-limit on how many peers we'll keep in the peer list.
\n-max_paused_peerlist_size is the max peer list size used for\n-torrents that are paused. This can be used to save memory for paused\n-torrents, since it's not as important for them to keep a large peer\n-list.
\n-\n-\n- \n-\n-name \n-type \n-default \n-min_announce_interval \n-int \n-5 * 60 \n-
\n-this is the minimum allowed announce interval for a tracker. This\n-is specified in seconds and is used as a sanity check on what is\n-returned from a tracker. It mitigates hammering mis-configured\n-trackers.
\n-\n-\n- \n-\n-name \n-type \n-default \n-auto_manage_startup \n-int \n-60 \n-
\n-this is the number of seconds a torrent is considered active after\n-it was started, regardless of upload and download speed. This is so\n-that newly started torrents are not considered inactive until they\n-have a fair chance to start downloading.
\n-\n-\n- \n-\n-name \n-type \n-default \n-seeding_piece_quota \n-int \n-20 \n-
\n-seeding_piece_quota is the number of pieces to send to a peer,\n-when seeding, before rotating in another peer to the unchoke set.
\n-\n-\n- \n-\n-name \n-type \n-default \n-max_rejects \n-int \n-50 \n-
\n-max_rejects is the number of piece requests we will reject in a\n-row while a peer is choked before the peer is considered abusive\n-and is disconnected.
\n-\n-\n-\n- \n-\n-name \n-type \n-default \n-recv_socket_buffer_size \n-int \n-0 \n-send_socket_buffer_size \n-int \n-0 \n-
\n-specifies the buffer sizes set on peer sockets. 0 means the OS\n-default (i.e. don't change the buffer sizes).\n-The socket buffer sizes are changed using setsockopt() with\n-SOL_SOCKET/SO_RCVBUF and SO_SNDBUFFER.
\n-Note that uTP peers share a single UDP socket buffer for each of the\n-listen_interfaces, along with DHT and UDP tracker traffic.\n-If the buffer size is too small for the combined traffic through the\n-socket, packets may be dropped.
\n-\n-\n- \n-\n-name \n-type \n-default \n-max_peer_recv_buffer_size \n-int \n-2 * 1024 * 1024 \n-
\n-the max number of bytes a single peer connection's receive buffer is\n-allowed to grow to.
\n-\n-\n- \n-\n-name \n-type \n-default \n-optimistic_disk_retry \n-int \n-10 * 60 \n-
\n-optimistic_disk_retry is the number of seconds from a disk\n-write errors occur on a torrent until libtorrent will take it out\n-of the upload mode, to test if the error condition has been fixed.
\n-libtorrent will only do this automatically for auto managed\n-torrents.
\n-You can explicitly take a torrent out of upload only mode using\n-set_upload_mode().
\n-\n-\n- \n-\n-name \n-type \n-default \n-max_suggest_pieces \n-int \n-16 \n-
\n-max_suggest_pieces is the max number of suggested piece indices\n-received from a peer that's remembered. If a peer floods suggest\n-messages, this limit prevents libtorrent from using too much RAM.
\n-\n-\n- \n-\n-name \n-type \n-default \n-local_service_announce_interval \n-int \n-5 * 60 \n-
\n-local_service_announce_interval is the time between local\n-network announces for a torrent.\n-This interval is specified in seconds.
\n-\n-\n- \n-\n-name \n-type \n-default \n-dht_announce_interval \n-int \n-15 * 60 \n-
\n-dht_announce_interval is the number of seconds between\n-announcing torrents to the distributed hash table (DHT).
\n-\n-\n- \n-\n-name \n-type \n-default \n-udp_tracker_token_expiry \n-int \n-60 \n-
\n-udp_tracker_token_expiry is the number of seconds libtorrent\n-will keep UDP tracker connection tokens around for. This is\n-specified to be 60 seconds. The higher this\n-value is, the fewer packets have to be sent to the UDP tracker. In\n-order for higher values to work, the tracker needs to be configured\n-to match the expiration time for tokens.
\n-\n-\n- \n-\n-name \n-type \n-default \n-num_optimistic_unchoke_slots \n-int \n-0 \n-
\n-num_optimistic_unchoke_slots is the number of optimistic\n-unchoke slots to use.\n-Having a higher number of optimistic unchoke slots mean you will\n-find the good peers faster but with the trade-off to use up more\n-bandwidth. 0 means automatic, where libtorrent opens up 20% of your\n-allowed upload slots as optimistic unchoke slots.
\n-\n-\n- \n-\n-name \n-type \n-default \n-max_pex_peers \n-int \n-50 \n-
\n-the max number of peers we accept from pex messages from a single\n-peer. this limits the number of concurrent peers any of our peers\n-claims to be connected to. If they claim to be connected to more\n-than this, we'll ignore any peer that exceeds this limit
\n-\n-\n- \n-\n-name \n-type \n-default \n-tick_interval \n-int \n-500 \n-
\n-tick_interval specifies the number of milliseconds between\n-internal ticks. This is the frequency with which bandwidth quota is\n-distributed to peers. It should not be more than one second (i.e.\n-1000 ms). Setting this to a low value (around 100) means higher\n-resolution bandwidth quota distribution, setting it to a higher\n-value saves CPU cycles.
\n-\n-\n- \n-\n-name \n-type \n-default \n-share_mode_target \n-int \n-3 \n-
\n-share_mode_target specifies the target share ratio for share\n-mode torrents. If set to 3, we'll try to upload 3\n-times as much as we download. Setting this very high, will make it\n-very conservative and you might end up not downloading anything\n-ever (and not affecting your share ratio). It does not make any\n-sense to set this any lower than 2. For instance, if only 3 peers\n-need to download the rarest piece, it's impossible to download a\n-single piece and upload it more than 3 times. If the\n-share_mode_target is set to more than 3, nothing is downloaded.
\n-\n-\n-\n- \n-\n-name \n-type \n-default \n-upload_rate_limit \n-int \n-0 \n-download_rate_limit \n-int \n-0 \n-
\n-upload_rate_limit and download_rate_limit sets\n-the session-global limits of upload and download rate limits, in\n-bytes per second. By default peers on the local network are not rate\n-limited.
\n-A value of 0 means unlimited.
\n-For fine grained control over rate limits, including making them apply\n-to local peers, see peer classes.
\n-\n-\n- \n-\n-name \n-type \n-default \n-dht_upload_rate_limit \n-int \n-8000 \n-
\n-the number of bytes per second (on average) the DHT is allowed to send.\n-If the incoming requests causes to many bytes to be sent in responses,\n-incoming requests will be dropped until the quota has been replenished.
\n-\n-\n- \n-\n-name \n-type \n-default \n-unchoke_slots_limit \n-int \n-8 \n-
\n-unchoke_slots_limit is the max number of unchoked peers in the\n-session. The number of unchoke slots may be ignored depending on\n-what choking_algorithm is set to. Setting this limit to -1\n-means unlimited, i.e. all peers will always be unchoked.
\n-\n-\n- \n-\n-name \n-type \n-default \n-connections_limit \n-int \n-200 \n-
\n-connections_limit sets a global limit on the number of\n-connections opened. The number of connections is set to a hard\n-minimum of at least two per torrent, so if you set a too low\n-connections limit, and open too many torrents, the limit will not\n-be met.
\n-\n-\n- \n-\n-name \n-type \n-default \n-connections_slack \n-int \n-10 \n-
\n-connections_slack is the number of incoming connections\n-exceeding the connection limit to accept in order to potentially\n-replace existing ones.
\n-\n-\n-\n-\n-\n-\n-\n-\n-\n- \n-\n-name \n-type \n-default \n-utp_target_delay \n-int \n-100 \n-utp_gain_factor \n-int \n-3000 \n-utp_min_timeout \n-int \n-500 \n-utp_syn_resends \n-int \n-2 \n-utp_fin_resends \n-int \n-2 \n-utp_num_resends \n-int \n-3 \n-utp_connect_timeout \n-int \n-3000 \n-utp_loss_multiplier \n-int \n-50 \n-
\n-utp_target_delay is the target delay for uTP sockets in\n-milliseconds. A high value will make uTP connections more\n-aggressive and cause longer queues in the upload bottleneck. It\n-cannot be too low, since the noise in the measurements would cause\n-it to send too slow.\n-utp_gain_factor is the number of bytes the uTP congestion\n-window can increase at the most in one RTT.\n-If this is set too high, the congestion controller reacts\n-too hard to noise and will not be stable, if it's set too low, it\n-will react slow to congestion and not back off as fast.
\n-utp_min_timeout is the shortest allowed uTP socket timeout,\n-specified in milliseconds. The\n-timeout depends on the RTT of the connection, but is never smaller\n-than this value. A connection times out when every packet in a\n-window is lost, or when a packet is lost twice in a row (i.e. the\n-resent packet is lost as well).
\n-The shorter the timeout is, the faster the connection will recover\n-from this situation, assuming the RTT is low enough.\n-utp_syn_resends is the number of SYN packets that are sent (and\n-timed out) before giving up and closing the socket.\n-utp_num_resends is the number of times a packet is sent (and\n-lost or timed out) before giving up and closing the connection.\n-utp_connect_timeout is the number of milliseconds of timeout\n-for the initial SYN packet for uTP connections. For each timed out\n-packet (in a row), the timeout is doubled. utp_loss_multiplier\n-controls how the congestion window is changed when a packet loss is\n-experienced. It's specified as a percentage multiplier for\n-cwnd. Do not change this value unless you know what you're doing.\n-Never set it higher than 100.
\n-\n-\n- \n-\n-name \n-type \n-default \n-mixed_mode_algorithm \n-int \n-settings_pack::peer_proportional \n-
\n-The mixed_mode_algorithm determines how to treat TCP\n-connections when there are uTP connections. Since uTP is designed\n-to yield to TCP, there's an inherent problem when using swarms that\n-have both TCP and uTP connections. If nothing is done, uTP\n-connections would often be starved out for bandwidth by the TCP\n-connections. This mode is prefer_tcp. The peer_proportional\n-mode simply looks at the current throughput and rate limits all TCP\n-connections to their proportional share based on how many of the\n-connections are TCP. This works best if uTP connections are not\n-rate limited by the global rate limiter (which they aren't by\n-default).
\n-\n-\n- \n-\n-name \n-type \n-default \n-listen_queue_size \n-int \n-5 \n-
\n-listen_queue_size is the value passed in to listen() for the\n-listen socket. It is the number of outstanding incoming connections\n-to queue up while we're not actively waiting for a connection to be\n-accepted. 5 should be sufficient for any\n-normal client. If this is a high performance server which expects\n-to receive a lot of connections, or used in a simulator or test, it\n-might make sense to raise this number. It will not take affect\n-until the listen_interfaces settings is updated.
\n-\n-\n- \n-\n-name \n-type \n-default \n-torrent_connect_boost \n-int \n-30 \n-
\n-torrent_connect_boost is the number of peers to try to connect\n-to immediately when the first tracker response is received for a\n-torrent. This is a boost to given to new torrents to accelerate\n-them starting up. The normal connect scheduler is run once every\n-second, this allows peers to be connected immediately instead of\n-waiting for the session tick to trigger connections.\n-This may not be set higher than 255.
\n-\n-\n- \n-\n-name \n-type \n-default \n-alert_queue_size \n-int \n-2000 \n-
\n-alert_queue_size is the maximum number of alerts queued up\n-internally. If alerts are not popped, the queue will eventually\n-fill up to this level. Once the alert queue is full, additional\n-alerts will be dropped, and not delivered to the client. Once the\n-client drains the queue, new alerts may be delivered again. In order\n-to know that alerts have been dropped, see\n-session_handle::dropped_alerts().
\n-\n-\n- \n-\n-name \n-type \n-default \n-max_metadata_size \n-int \n-3 * 1024 * 10240 \n-
\n-max_metadata_size is the maximum allowed size (in bytes) to be\n-received by the metadata extension, i.e. magnet links.
\n-\n-\n- \n-\n-name \n-type \n-default \n-hashing_threads \n-int \n-1 \n-
\n-hashing_threads is the number of disk I/O threads to use for\n-piece hash verification. These threads are in addition to the\n-regular disk I/O threads specified by settings_pack::aio_threads.\n-These threads are only used for full checking of torrents. The\n-hash checking done while downloading are done by the regular disk\n-I/O threads.\n-The hasher threads do not only compute hashes, but also perform\n-the read from disk. On storage optimal for sequential access,\n-such as hard drives, this setting should be set to 1, which is\n-also the default.
\n-\n-\n- \n-\n-name \n-type \n-default \n-checking_mem_usage \n-int \n-256 \n-
\n-the number of blocks to keep outstanding at any given time when\n-checking torrents. Higher numbers give faster re-checks but uses\n-more memory. Specified in number of 16 kiB blocks
\n-\n-\n- \n-\n-name \n-type \n-default \n-predictive_piece_announce \n-int \n-0 \n-
\n-if set to > 0, pieces will be announced to other peers before they\n-are fully downloaded (and before they are hash checked). The\n-intention is to gain 1.5 potential round trip times per downloaded\n-piece. When non-zero, this indicates how many milliseconds in\n-advance pieces should be announced, before they are expected to be\n-completed.
\n-\n-\n- \n-\n-name \n-type \n-default \n-aio_threads \n-int \n-10 \n-
\n-for some aio back-ends, aio_threads specifies the number of\n-io-threads to use.
\n-\n-\n- \n-\n-name \n-type \n-default \n-tracker_backoff \n-int \n-250 \n-
\n-tracker_backoff determines how aggressively to back off from\n-retrying failing trackers. This value determines x in the\n-following formula, determining the number of seconds to wait until\n-the next retry:
\n-\n-delay = 5 + 5 * x / 100 * fails^2
\n-This setting may be useful to make libtorrent more or less\n-aggressive in hitting trackers.
\n-\n-\n-\n- \n-\n-name \n-type \n-default \n-share_ratio_limit \n-int \n-200 \n-seed_time_ratio_limit \n-int \n-700 \n-
\n-when a seeding torrent reaches either the share ratio (bytes up /\n-bytes down) or the seed time ratio (seconds as seed / seconds as\n-downloader) or the seed time limit (seconds as seed) it is\n-considered done, and it will leave room for other torrents. These\n-are specified as percentages. Torrents that are considered done will\n-still be allowed to be seeded, they just won't have priority anymore.\n-For more, see queuing.
\n-\n-\n-\n-\n- \n-\n-name \n-type \n-default \n-peer_turnover \n-int \n-4 \n-peer_turnover_cutoff \n-int \n-90 \n-peer_turnover_interval \n-int \n-300 \n-
\n-peer_turnover is the percentage of peers to disconnect every\n-turnover peer_turnover_interval (if we're at the peer limit), this\n-is specified in percent when we are connected to more than limit *\n-peer_turnover_cutoff peers disconnect peer_turnover fraction of the\n-peers. It is specified in percent peer_turnover_interval is the\n-interval (in seconds) between optimistic disconnects if the\n-disconnects happen and how many peers are disconnected is\n-controlled by peer_turnover and peer_turnover_cutoff
\n-\n-\n- \n-\n-name \n-type \n-default \n-connect_seed_every_n_download \n-int \n-10 \n-
\n-this setting controls the priority of downloading torrents over\n-seeding or finished torrents when it comes to making peer\n-connections. Peer connections are throttled by the connection_speed\n-and the half-open connection limit. This makes peer connections a\n-limited resource. Torrents that still have pieces to download are\n-prioritized by default, to avoid having many seeding torrents use\n-most of the connection attempts and only give one peer every now\n-and then to the downloading torrent. libtorrent will loop over the\n-downloading torrents to connect a peer each, and every n:th\n-connection attempt, a finished torrent is picked to be allowed to\n-connect to a peer. This setting controls n.
\n-\n-\n- \n-\n-name \n-type \n-default \n-max_http_recv_buffer_size \n-int \n-4*1024*204 \n-
\n-the max number of bytes to allow an HTTP response to be when\n-announcing to trackers or downloading .torrent files via the\n-url provided in add_torrent_params.
\n-\n-\n- \n-\n-name \n-type \n-default \n-max_retry_port_bind \n-int \n-10 \n-
\n-if binding to a specific port fails, should the port be incremented\n-by one and tried again? This setting specifies how many times to\n-retry a failed port bind
\n-\n-\n- \n-\n-name \n-type \n-default \n-alert_mask \n-int \n-int \n-
\n-a bitmask combining flags from alert_category_t defining which\n-kinds of alerts to receive
\n-\n-\n-\n- \n-\n-name \n-type \n-default \n-out_enc_policy \n-int \n-settings_pack::pe_enabled \n-in_enc_policy \n-int \n-settings_pack::pe_enabled \n-
\n-control the settings for incoming and outgoing connections\n-respectively. see enc_policy enum for the available options.\n-Keep in mind that protocol encryption degrades performance in\n-several respects:
\n-\n-- It prevents "zero copy" disk buffers being sent to peers, since\n-each peer needs to mutate the data (i.e. encrypt it) the data\n-must be copied per peer connection rather than sending the same\n-buffer to multiple peers.
\n-- The encryption itself requires more CPU than plain bittorrent\n-protocol. The highest cost is the Diffie Hellman exchange on\n-connection setup.
\n-- The encryption handshake adds several round-trips to the\n-connection setup, and delays transferring data.
\n-
\n-\n-\n- \n-\n-name \n-type \n-default \n-allowed_enc_level \n-int \n-settings_pack::pe_both \n-
\n-determines the encryption level of the connections. This setting\n-will adjust which encryption scheme is offered to the other peer,\n-as well as which encryption scheme is selected by the client. See\n-enc_level enum for options.
\n-\n-\n-\n- \n-\n-name \n-type \n-default \n-inactive_down_rate \n-int \n-2048 \n-inactive_up_rate \n-int \n-2048 \n-
\n-the download and upload rate limits for a torrent to be considered\n-active by the queuing mechanism. A torrent whose download rate is\n-less than inactive_down_rate and whose upload rate is less than\n-inactive_up_rate for auto_manage_startup seconds, is\n-considered inactive, and another queued torrent may be started.\n-This logic is disabled if dont_count_slow_torrents is false.
\n-\n-\n- \n-\n-name \n-type \n-default \n-proxy_type \n-int \n-settings_pack::none \n-
\n-proxy to use. see proxy_type_t.
\n-\n-\n- \n-\n-name \n-type \n-default \n-proxy_port \n-int \n-0 \n-
\n-the port of the proxy server
\n-\n-\n- \n-\n-name \n-type \n-default \n-i2p_port \n-int \n-0 \n-
\n-sets the i2p SAM bridge port to connect to. set the hostname with\n-the i2p_hostname setting.
\n-\n-\n- \n-\n-name \n-type \n-default \n-urlseed_max_request_bytes \n-int \n-16 * 1024 * 1024 \n-
\n-The maximum request range of an url seed in bytes. This value\n-defines the largest possible sequential web seed request. Lower values\n-are possible but will be ignored if they are lower then piece size.\n-This value should be related to your download speed to prevent\n-libtorrent from creating too many expensive http requests per\n-second. You can select a value as high as you want but keep in mind\n-that libtorrent can't create parallel requests if the first request\n-did already select the whole file.\n-If you combine bittorrent seeds with web seeds and pick strategies\n-like rarest first you may find your web seed requests split into\n-smaller parts because we don't download already picked pieces\n-twice.
\n-\n-\n- \n-\n-name \n-type \n-default \n-web_seed_name_lookup_retry \n-int \n-1800 \n-
\n-time to wait until a new retry of a web seed name lookup
\n-\n-\n- \n-\n-name \n-type \n-default \n-close_file_interval \n-int \n-CLOSE_FILE_INTERVAL \n-
\n-the number of seconds between closing the file opened the longest\n-ago. 0 means to disable the feature. The purpose of this is to\n-periodically close files to trigger the operating system flushing\n-disk cache. Specifically it has been observed to be required on\n-windows to not have the disk cache grow indefinitely.\n-This defaults to 240 seconds on windows, and disabled on other\n-systems.
\n-\n-\n- \n-\n-name \n-type \n-default \n-utp_cwnd_reduce_timer \n-int \n-100 \n-
\n-When uTP experiences packet loss, it will reduce the congestion\n-window, and not reduce it again for this many milliseconds, even if\n-experiencing another lost packet.
\n-\n-\n- \n-\n-name \n-type \n-default \n-max_web_seed_connections \n-int \n-3 \n-
\n-the max number of web seeds to have connected per torrent at any\n-given time.
\n-\n-\n- \n-\n-name \n-type \n-default \n-resolver_cache_timeout \n-int \n-1200 \n-
\n-the number of seconds before the internal host name resolver\n-considers a cache value timed out, negative values are interpreted\n-as zero.
\n-\n-\n- \n-\n-name \n-type \n-default \n-send_not_sent_low_watermark \n-int \n-16384 \n-
\n-specify the not-sent low watermark for socket send buffers. This\n-corresponds to the, Linux-specific, TCP_NOTSENT_LOWAT TCP socket\n-option.
\n-\n-\n- \n-\n-name \n-type \n-default \n-rate_choker_initial_threshold \n-int \n-1024 \n-
\n-the rate based choker compares the upload rate to peers against a\n-threshold that increases proportionally by its size for every\n-peer it visits, visiting peers in decreasing upload rate. The\n-number of upload slots is determined by the number of peers whose\n-upload rate exceeds the threshold. This option sets the start\n-value for this threshold. A higher value leads to fewer unchoke\n-slots, a lower value leads to more.
\n-\n-\n- \n-\n-name \n-type \n-default \n-upnp_lease_duration \n-int \n-3600 \n-
\n-The expiration time of UPnP port-mappings, specified in seconds. 0\n-means permanent lease. Some routers do not support expiration times\n-on port-maps (nor correctly returning an error indicating lack of\n-support). In those cases, set this to 0. Otherwise, don't set it any\n-lower than 5 minutes.
\n-\n-\n- \n-\n-name \n-type \n-default \n-max_concurrent_http_announces \n-int \n-50 \n-
\n-limits the number of concurrent HTTP tracker announces. Once the\n-limit is hit, tracker requests are queued and issued when an\n-outstanding announce completes.
\n-\n-\n- \n-\n-name \n-type \n-default \n-dht_max_peers_reply \n-int \n-100 \n-
\n-the maximum number of peers to send in a reply to get_peers
\n-\n-\n- \n-\n-name \n-type \n-default \n-dht_search_branching \n-int \n-5 \n-
\n-the number of concurrent search request the node will send when\n-announcing and refreshing the routing table. This parameter is called\n-alpha in the kademlia paper
\n-\n-\n- \n-\n-name \n-type \n-default \n-dht_max_fail_count \n-int \n-20 \n-
\n-the maximum number of failed tries to contact a node before it is\n-removed from the routing table. If there are known working nodes that\n-are ready to replace a failing node, it will be replaced immediately,\n-this limit is only used to clear out nodes that don't have any node\n-that can replace them.
\n-\n-\n- \n-\n-name \n-type \n-default \n-dht_max_torrents \n-int \n-2000 \n-
\n-the total number of torrents to track from the DHT. This is simply an\n-upper limit to make sure malicious DHT nodes cannot make us allocate\n-an unbounded amount of memory.
\n-\n-\n- \n-\n-name \n-type \n-default \n-dht_max_dht_items \n-int \n-700 \n-
\n-max number of items the DHT will store
\n-\n-\n- \n-\n-name \n-type \n-default \n-dht_max_peers \n-int \n-500 \n-
\n-the max number of peers to store per torrent (for the DHT)
\n-\n-\n- \n-\n-name \n-type \n-default \n-dht_max_torrent_search_reply \n-int \n-20 \n-
\n-the max number of torrents to return in a torrent search query to the\n-DHT
\n-\n-\n- \n-\n-name \n-type \n-default \n-dht_block_timeout \n-int \n-5 * 60 \n-
\n-the number of seconds a DHT node is banned if it exceeds the rate\n-limit. The rate limit is averaged over 10 seconds to allow for bursts\n-above the limit.
\n-\n-\n- \n-\n-name \n-type \n-default \n-dht_block_ratelimit \n-int \n-5 \n-
\n-the max number of packets per second a DHT node is allowed to send\n-without getting banned.
\n-\n-\n- \n-\n-name \n-type \n-default \n-dht_item_lifetime \n-int \n-0 \n-
\n-the number of seconds a immutable/mutable item will be expired.\n-default is 0, means never expires.
\n-\n-\n- \n-\n-name \n-type \n-default \n-dht_sample_infohashes_interval \n-int \n-21600 \n-
\n-the info-hashes sample recomputation interval (in seconds).\n-The node will precompute a subset of the tracked info-hashes and return\n-that instead of calculating it upon each request. The permissible range\n-is between 0 and 21600 seconds (inclusive).
\n-\n-\n- \n-\n-name \n-type \n-default \n-dht_max_infohashes_sample_count \n-int \n-20 \n-
\n-the maximum number of elements in the sampled subset of info-hashes.\n-If this number is too big, expect the DHT storage implementations\n-to clamp it in order to allow UDP packets go through
\n-\n-\n- \n-\n-name \n-type \n-default \n-max_piece_count \n-int \n-0x200000 \n-
\n-max_piece_count is the maximum allowed number of pieces in\n-metadata received via magnet links. Loading large torrents (with\n-more pieces than the default limit) may also require passing in\n-a higher limit to read_resume_data() and\n-torrent_info::parse_info_section(), if those are used.
\n-\n+\n+struct peer_blocked_alert final : peer_alert\n+{\n+ std::string message () const override;\n+\n+ enum reason_t\n+ {\n+ ip_filter,\n+ port_filter,\n+ i2p_mixed,\n+ privileged_ports,\n+ utp_disabled,\n+ tcp_disabled,\n+ invalid_local_interface,\n+ ssrf_mitigation,\n+ };\n+\n+ static constexpr alert_category_t static_category = alert_category::ip_block;\n+ int const reason;\n+};\n+\n+[report issue]\n+enum reason_t
\n+Declared in "libtorrent/alert_types.hpp"
\n+\n \n- \n-\n-name \n-type \n-default \n-metadata_token_limit \n-int \n-2500000 \n-
\n-when receiving metadata (torrent file) from peers, this is the\n-max number of bencoded tokens we're willing to parse. This limit\n-is meant to prevent DoS attacks on peers. For very large\n-torrents, this limit may have to be raised.
\n-\n-\n- \n \n name \n-type \n-default \n+value \n+description \n disk_write_mode \n-int \n-settings_pack::mmap_write_mode_t::auto_mmap_write \n-
\n-controls whether disk writes will be made through a memory mapped\n-file or via normal write calls. This only affects the\n-mmap_disk_io. When saving to a non-local drive (network share,\n-NFS or NAS) using memory mapped files is most likely inferior.\n-When writing to a local SSD (especially in DAX mode) using memory\n-mapped files likely gives the best performance.\n-The values for this setting are specified as mmap_write_mode_t.
\n-\n-\n- \n-\n-name \n-type \n-default \n+ip_filter \n+0 \n+ \n mmap_file_size_cutoff \n-int \n-40 \n+port_filter \n+1 \n+ \n
\n-when using mmap_disk_io, files smaller than this number of blocks\n-will not be memory mapped, but will use normal pread/pwrite\n-operations. This file size limit is specified in 16 kiB blocks.
\n-\n-\n-\n-\n-\n- \n-\n-name \n-type \n-default \n+i2p_mixed \n+2 \n+ \n i2p_inbound_quantity \n-int \n+privileged_ports \n 3 \n+ \n i2p_outbound_quantity \n-int \n-3 \n+utp_disabled \n+4 \n+ \n i2p_inbound_length \n-int \n-3 \n+tcp_disabled \n+5 \n+ \n i2p_outbound_length \n-int \n-3 \n+invalid_local_interface \n+6 \n+ \n+ssrf_mitigation \n+7 \n+ \n
\n-Configures the SAM session\n-quantity of I2P inbound and outbound tunnels [1..16].\n-number of hops for I2P inbound and outbound tunnels [0..7]\n-Changing these will not trigger a reconnect to the SAM bridge,\n-they will take effect the next time the SAM connection is\n-re-established (by restarting or changing i2p_hostname or\n-i2p_port).
\n+[report issue]\n+- reason
\n+- the reason for the peer being blocked. Is one of the values from the\n+reason_t enum.
\n+
\n+[report issue]\n+\n+\n+dht_announce_alert
\n+Declared in "libtorrent/alert_types.hpp"
\n+This alert is generated when a DHT node announces to an info-hash on our\n+DHT node. It belongs to the alert_category::dht category.
\n \n-struct settings_pack final : settings_interface\n+struct dht_announce_alert final : alert\n {\n- friend void apply_pack_impl (settings_pack const*\n- , aux::session_settings_single_thread&\n- , std::vector<void(aux::session_impl::*)()>*);\n- void set_int (int name, int val) override;\n- void set_bool (int name, bool val) override;\n- void set_str (int name, std::string val) override;\n- void set_int (int name, flags::bitfield_flag<Type, Tag> const val);\n- bool has_val (int name) const override;\n- void clear ();\n- void clear (int name);\n- bool get_bool (int name) const override;\n- std::string const& get_str (int name) const override;\n- int get_int (int name) const override;\n- void for_each (Fun&& f) const;\n+ std::string message () const override;\n \n- enum type_bases\n- {\n- string_type_base,\n- int_type_base,\n- bool_type_base,\n- type_mask,\n- index_mask,\n- };\n+ static constexpr alert_category_t static_category = alert_category::dht;\n+ aux::noexcept_movable<address> ip;\n+ int port;\n+ sha1_hash info_hash;\n+};\n+\n+[report issue]\n+\n+dht_get_peers_alert
\n+Declared in "libtorrent/alert_types.hpp"
\n+This alert is generated when a DHT node sends a get_peers message to\n+our DHT node. It belongs to the alert_category::dht category.
\n+\n+struct dht_get_peers_alert final : alert\n+{\n+ std::string message () const override;\n \n- enum mmap_write_mode_t\n- {\n- always_pwrite,\n- always_mmap_write,\n- auto_mmap_write,\n- };\n+ static constexpr alert_category_t static_category = alert_category::dht;\n+ sha1_hash info_hash;\n+};\n+\n+[report issue]\n+\n+cache_flushed_alert
\n+Declared in "libtorrent/alert_types.hpp"
\n+This alert is posted when the disk cache has been flushed for a specific\n+torrent as a result of a call to torrent_handle::flush_cache(). This\n+alert belongs to the alert_category::storage category, which must be\n+enabled to let this alert through. The alert is also posted when removing\n+a torrent from the session, once the outstanding cache flush is complete\n+and the torrent does no longer have any files open.
\n+\n+struct cache_flushed_alert final : torrent_alert\n+{\n+ static constexpr alert_category_t static_category = alert_category::storage;\n+};\n+\n+[report issue]\n+\n+lsd_peer_alert
\n+Declared in "libtorrent/alert_types.hpp"
\n+This alert is generated when we receive a local service discovery message\n+from a peer for a torrent we're currently participating in.
\n+\n+struct lsd_peer_alert final : peer_alert\n+{\n+ std::string message () const override;\n \n- enum suggest_mode_t\n- {\n- no_piece_suggestions,\n- suggest_read_cache,\n- };\n+ static constexpr alert_category_t static_category = alert_category::peer;\n+};\n+\n+[report issue]\n+\n+trackerid_alert
\n+Declared in "libtorrent/alert_types.hpp"
\n+This alert is posted whenever a tracker responds with a trackerid.\n+The tracker ID is like a cookie. libtorrent will store the tracker ID\n+for this tracker and repeat it in subsequent announces.
\n+\n+struct trackerid_alert final : tracker_alert\n+{\n+ std::string message () const override;\n+ char const* tracker_id () const;\n \n- enum choking_algorithm_t\n- {\n- fixed_slots_choker,\n- rate_based_choker,\n- deprecated_bittyrant_choker,\n- };\n+ static constexpr alert_category_t static_category = alert_category::status;\n+};\n+\n+[report issue]\n+tracker_id()
\n+\n+char const* tracker_id () const;\n+
\n+The tracker ID returned by the tracker
\n+[report issue]\n+\n+\n+dht_bootstrap_alert
\n+Declared in "libtorrent/alert_types.hpp"
\n+This alert is posted when the initial DHT bootstrap is done.
\n+\n+struct dht_bootstrap_alert final : alert\n+{\n+ std::string message () const override;\n \n- enum seed_choking_algorithm_t\n- {\n- round_robin,\n- fastest_upload,\n- anti_leech,\n- };\n+ static constexpr alert_category_t static_category = alert_category::dht;\n+};\n+\n+[report issue]\n+\n+torrent_error_alert
\n+Declared in "libtorrent/alert_types.hpp"
\n+This is posted whenever a torrent is transitioned into the error state.\n+If the error code is duplicate_torrent (error_code_enum) error, it suggests two magnet\n+links ended up resolving to the same hybrid torrent. For more details,\n+see BitTorrent v2 torrents.
\n+\n+struct torrent_error_alert final : torrent_alert\n+{\n+ std::string message () const override;\n+ char const* filename () const;\n \n- enum io_buffer_mode_t\n- {\n- enable_os_cache,\n- deprecated_disable_os_cache_for_aligned_files,\n- disable_os_cache,\n- write_through,\n- };\n+ static constexpr alert_category_t static_category = alert_category::error | alert_category::status;\n+ error_code const error;\n+};\n+\n+[report issue]\n+filename()
\n+\n+char const* filename () const;\n+
\n+the filename (or object) the error occurred on.
\n+[report issue]\n+- error
\n+- specifies which error the torrent encountered.
\n+
\n+[report issue]\n+\n+\n+torrent_need_cert_alert
\n+Declared in "libtorrent/alert_types.hpp"
\n+This is always posted for SSL torrents. This is a reminder to the client that\n+the torrent won't work unless torrent_handle::set_ssl_certificate() is called with\n+a valid certificate. Valid certificates MUST be signed by the SSL certificate\n+in the .torrent file.
\n+\n+struct torrent_need_cert_alert final : torrent_alert\n+{\n+ std::string message () const override;\n \n- enum bandwidth_mixed_algo_t\n- {\n- prefer_tcp,\n- peer_proportional,\n- };\n+ static constexpr alert_category_t static_category = alert_category::status;\n+};\n+\n+[report issue]\n+\n+incoming_connection_alert
\n+Declared in "libtorrent/alert_types.hpp"
\n+The incoming connection alert is posted every time we successfully accept\n+an incoming connection, through any mean. The most straight-forward ways\n+of accepting incoming connections are through the TCP listen socket and\n+the UDP listen socket for uTP sockets. However, connections may also be\n+accepted through a Socks5 or i2p listen socket, or via an SSL listen\n+socket.
\n+\n+struct incoming_connection_alert final : alert\n+{\n+ std::string message () const override;\n \n- enum enc_policy\n- {\n- pe_forced,\n- pe_enabled,\n- pe_disabled,\n- };\n+ static constexpr alert_category_t static_category = alert_category::peer;\n+ socket_type_t socket_type;\n+ aux::noexcept_movable<tcp::endpoint> endpoint;\n+};\n+\n+[report issue]\n+- socket_type
\n+- tells you what kind of socket the connection was accepted
\n+
\n+[report issue]\n+- endpoint
\n+- is the IP address and port the connection came from.
\n+
\n+[report issue]\n+\n+add_torrent_alert
\n+Declared in "libtorrent/alert_types.hpp"
\n+This alert is always posted when a torrent was attempted to be added\n+and contains the return status of the add operation. The torrent handle of the new\n+torrent can be found as the handle member in the base class. If adding\n+the torrent failed, error contains the error code.
\n+\n+struct add_torrent_alert final : torrent_alert\n+{\n+ std::string message () const override;\n \n- enum enc_level\n- {\n- pe_plaintext,\n- pe_rc4,\n- pe_both,\n- };\n+ static constexpr alert_category_t static_category = alert_category::status;\n+ add_torrent_params params;\n+ error_code error;\n+};\n+\n+[report issue]\n+- params
\n+This contains copies of the most important fields from the original\n+add_torrent_params object, passed to add_torrent() or\n+async_add_torrent(). Specifically, these fields are copied:
\n+\n+- version
\n+- ti
\n+- name
\n+- save_path
\n+- userdata
\n+- tracker_id
\n+- flags
\n+- info_hash
\n+
\n+the info_hash field will be updated with the info-hash of the torrent\n+specified by ti.
\n+
\n+[report issue]\n+- error
\n+- set to the error, if one occurred while adding the torrent.
\n+
\n+[report issue]\n+\n+state_update_alert
\n+Declared in "libtorrent/alert_types.hpp"
\n+This alert is only posted when requested by the user, by calling\n+session::post_torrent_updates() on the session. It contains the torrent\n+status of all torrents that changed since last time this message was\n+posted. Its category is alert_category::status, but it's not subject to\n+filtering, since it's only manually posted anyway.
\n+\n+struct state_update_alert final : alert\n+{\n+ std::string message () const override;\n \n- enum proxy_type_t\n- {\n- none,\n- socks4,\n- socks5,\n- socks5_pw,\n- http,\n- http_pw,\n- };\n+ static constexpr alert_category_t static_category = alert_category::status;\n+ std::vector<torrent_status> status;\n };\n \n-\n-\n-[report issue]\n-set_str() set_int() set_bool()
\n+[report issue]\n+- status
\n+- contains the torrent status of all torrents that changed since last\n+time this message was posted. Note that you can map a torrent status\n+to a specific torrent via its handle member. The receiving end is\n+suggested to have all torrents sorted by the torrent_handle or hashed\n+by it, for efficient updates.
\n+
\n+[report issue]\n+\n+session_stats_alert
\n+Declared in "libtorrent/alert_types.hpp"
\n+The session_stats_alert is posted when the user requests session statistics by\n+calling post_session_stats() on the session object. This alert does not\n+have a category, since it's only posted in response to an API call. It\n+is not subject to the alert_mask filter.
\n+the message() member function returns a string representation of the values that\n+properly match the line returned in session_stats_header_alert::message().
\n+this specific output is parsed by tools/parse_session_stats.py\n+if this is changed, that parser should also be changed
\n \n-void set_int (int name, int val) override;\n-void set_bool (int name, bool val) override;\n-void set_str (int name, std::string val) override;\n-void set_int (int name, flags::bitfield_flag<Type, Tag> const val);\n+struct session_stats_alert final : alert\n+{\n+ std::string message () const override;\n+ span<std::int64_t const> counters () const;\n+\n+ static constexpr alert_category_t static_category = {};\n+};\n \n-set a configuration option in the settings_pack. name is one of\n-the enum values from string_types, int_types or bool_types. They must\n-match the respective type of the set_* function.
\n-[report issue]\n-\n-has_val()
\n+[report issue]\n+counters()
\n \n-bool has_val (int name) const override;\n+span<std::int64_t const> counters () const;\n
\n-queries whether the specified configuration option has a value set in\n-this pack. name can be any enumeration value from string_types,\n-int_types or bool_types.
\n-[report issue]\n-\n-clear()
\n+An array are a mix of counters and gauges, which meanings can be\n+queries via the session_stats_metrics() function on the session. The\n+mapping from a specific metric to an index into this array is constant\n+for a specific version of libtorrent, but may differ for other\n+versions. The intended usage is to request the mapping, i.e. call\n+session_stats_metrics(), once on startup, and then use that mapping to\n+interpret these values throughout the process' runtime.
\n+For more information, see the session statistics section.
\n+[report issue]\n+\n+\n+dht_error_alert
\n+Declared in "libtorrent/alert_types.hpp"
\n+posted when something fails in the DHT. This is not necessarily a fatal\n+error, but it could prevent proper operation
\n \n-void clear ();\n+struct dht_error_alert final : alert\n+{\n+ std::string message () const override;\n+\n+ static constexpr alert_category_t static_category = alert_category::error | alert_category::dht;\n+ error_code error;\n+ operation_t op;\n+};\n \n-clear the settings pack from all settings
\n-[report issue]\n-\n-clear()
\n+[report issue]\n+- error
\n+- the error code
\n+
\n+[report issue]\n+- op
\n+- the operation that failed
\n+
\n+[report issue]\n+\n+dht_immutable_item_alert
\n+Declared in "libtorrent/alert_types.hpp"
\n+this alert is posted as a response to a call to session::get_item(),\n+specifically the overload for looking up immutable items in the DHT.
\n \n-void clear (int name);\n+struct dht_immutable_item_alert final : alert\n+{\n+ std::string message () const override;\n+\n+ static constexpr alert_category_t static_category = alert_category::dht;\n+ sha1_hash target;\n+ entry item;\n+};\n \n-clear a specific setting from the pack
\n-\n-\n-[report issue]\n-\n-get_bool() get_str() get_int()
\n+[report issue]\n+- target
\n+- the target hash of the immutable item. This must\n+match the SHA-1 hash of the bencoded form of item.
\n+
\n+[report issue]\n+- item
\n+- the data for this item
\n+
\n+[report issue]\n+\n+dht_mutable_item_alert
\n+Declared in "libtorrent/alert_types.hpp"
\n+this alert is posted as a response to a call to session::get_item(),\n+specifically the overload for looking up mutable items in the DHT.
\n \n-bool get_bool (int name) const override;\n-std::string const& get_str (int name) const override;\n-int get_int (int name) const override;\n+struct dht_mutable_item_alert final : alert\n+{\n+ std::string message () const override;\n+\n+ static constexpr alert_category_t static_category = alert_category::dht;\n+ std::array<char, 32> key;\n+ std::array<char, 64> signature;\n+ std::int64_t seq;\n+ std::string salt;\n+ entry item;\n+ bool authoritative;\n+};\n \n-queries the current configuration option from the settings_pack.\n-name is one of the enumeration values from string_types, int_types\n-or bool_types. The enum value must match the type of the get_*\n-function. If the specified setting field has not been set, the default\n-value is returned.
\n-[report issue]\n-\n-enum type_bases
\n-Declared in "libtorrent/settings_pack.hpp"
\n+[report issue]\n+- key
\n+- the public key that was looked up
\n+
\n+[report issue]\n+- signature
\n+- the signature of the data. This is not the signature of the\n+plain encoded form of the item, but it includes the sequence number\n+and possibly the hash as well. See the dht_store document for more\n+information. This is primarily useful for echoing back in a store\n+request.
\n+
\n+[report issue]\n+- seq
\n+- the sequence number of this item
\n+
\n+[report issue]\n+- salt
\n+- the salt, if any, used to lookup and store this item. If no\n+salt was used, this is an empty string
\n+
\n+[report issue]\n+- item
\n+- the data for this item
\n+
\n+[report issue]\n+- authoritative
\n+- the last response for mutable data is authoritative.
\n+
\n+[report issue]\n+\n+dht_put_alert
\n+Declared in "libtorrent/alert_types.hpp"
\n+this is posted when a DHT put operation completes. This is useful if the\n+client is waiting for a put to complete before shutting down for instance.
\n+\n+struct dht_put_alert final : alert\n+{\n+ std::string message () const override;\n+\n+ static constexpr alert_category_t static_category = alert_category::dht;\n+ sha1_hash target;\n+ std::array<char, 32> public_key;\n+ std::array<char, 64> signature;\n+ std::string salt;\n+ std::int64_t seq;\n+ int num_success;\n+};\n+\n+[report issue]\n+- target
\n+- the target hash the item was stored under if this was an immutable\n+item.
\n+
\n+\n+\n+\n+[report issue]\n+- public_key signature salt seq
\n+- if a mutable item was stored, these are the public key, signature,\n+salt and sequence number the item was stored under.
\n+
\n+[report issue]\n+- num_success
\n+- DHT put operation usually writes item to k nodes, maybe the node\n+is stale so no response, or the node doesn't support 'put', or the\n+token for write is out of date, etc. num_success is the number of\n+successful responses we got from the puts.
\n+
\n+[report issue]\n+\n+i2p_alert
\n+Declared in "libtorrent/alert_types.hpp"
\n+this alert is used to report errors in the i2p SAM connection
\n+\n+struct i2p_alert final : alert\n+{\n+ std::string message () const override;\n+\n+ static constexpr alert_category_t static_category = alert_category::error;\n+ error_code error;\n+};\n+\n+[report issue]\n+- error
\n+- the error that occurred in the i2p SAM connection
\n+
\n+[report issue]\n+\n+dht_outgoing_get_peers_alert
\n+Declared in "libtorrent/alert_types.hpp"
\n+This alert is generated when we send a get_peers request\n+It belongs to the alert_category::dht category.
\n+\n+struct dht_outgoing_get_peers_alert final : alert\n+{\n+ std::string message () const override;\n+\n+ static constexpr alert_category_t static_category = alert_category::dht;\n+ sha1_hash info_hash;\n+ sha1_hash obfuscated_info_hash;\n+ aux::noexcept_movable<udp::endpoint> endpoint;\n+};\n+\n+[report issue]\n+- info_hash
\n+- the info_hash of the torrent we're looking for peers for.
\n+
\n+[report issue]\n+- obfuscated_info_hash
\n+- if this was an obfuscated lookup, this is the info-hash target\n+actually sent to the node.
\n+
\n+[report issue]\n+- endpoint
\n+- the endpoint we're sending this query to
\n+
\n+[report issue]\n+\n+log_alert
\n+Declared in "libtorrent/alert_types.hpp"
\n+This alert is posted by some session wide event. Its main purpose is\n+trouble shooting and debugging. It's not enabled by the default alert\n+mask and is enabled by the alert_category::session_log bit.\n+Furthermore, it's by default disabled as a build configuration.
\n+\n+struct log_alert final : alert\n+{\n+ std::string message () const override;\n+ char const* log_message () const;\n+\n+ static constexpr alert_category_t static_category = alert_category::session_log;\n+};\n+\n+[report issue]\n+log_message()
\n+\n+char const* log_message () const;\n+
\n+returns the log message
\n+[report issue]\n+\n+\n+torrent_log_alert
\n+Declared in "libtorrent/alert_types.hpp"
\n+This alert is posted by torrent wide events. It's meant to be used for\n+trouble shooting and debugging. It's not enabled by the default alert\n+mask and is enabled by the alert_category::torrent_log bit. By\n+default it is disabled as a build configuration.
\n+\n+struct torrent_log_alert final : torrent_alert\n+{\n+ std::string message () const override;\n+ char const* log_message () const;\n+\n+ static constexpr alert_category_t static_category = alert_category::torrent_log;\n+};\n+\n+[report issue]\n+log_message()
\n+\n+char const* log_message () const;\n+
\n+returns the log message
\n+[report issue]\n+\n+\n+peer_log_alert
\n+Declared in "libtorrent/alert_types.hpp"
\n+This alert is posted by events specific to a peer. It's meant to be used\n+for trouble shooting and debugging. It's not enabled by the default alert\n+mask and is enabled by the alert_category::peer_log bit. By\n+default it is disabled as a build configuration.
\n+\n+struct peer_log_alert final : peer_alert\n+{\n+ std::string message () const override;\n+ char const* log_message () const;\n+\n+ enum direction_t\n+ {\n+ incoming_message,\n+ outgoing_message,\n+ incoming,\n+ outgoing,\n+ info,\n+ };\n+\n+ static constexpr alert_category_t static_category = alert_category::peer_log;\n+ char const* event_type;\n+ direction_t direction;\n+};\n+\n+[report issue]\n+log_message()
\n+\n+char const* log_message () const;\n+
\n+returns the log message
\n+[report issue]\n+\n+enum direction_t
\n+Declared in "libtorrent/alert_types.hpp"
\n \n \n \n \n name \n value \n description \n string_type_base \n-0 \n- \n-int_type_base \n-16384 \n- \n-bool_type_base \n-32768 \n- \n-type_mask \n-49152 \n- \n-index_mask \n-16383 \n- \n-
\n-[report issue]\n-\n-enum mmap_write_mode_t
\n-Declared in "libtorrent/settings_pack.hpp"
\n-\n-\n- \n-\n-name \n-value \n-description \n-always_pwrite \n-0 \n-disable writing to disk via mmap, always use normal write calls \n-always_mmap_write \n-1 \n-prefer using memory mapped files for disk writes (at least for\n-large files where it might make sense) \n-auto_mmap_write \n-2 \n-determine whether to use pwrite or memory mapped files for disk\n-writes depending on the kind of storage behind the save path \n-
\n-[report issue]\n-\n-enum suggest_mode_t
\n-Declared in "libtorrent/settings_pack.hpp"
\n-\n-\n- \n-\n-name \n-value \n-description \n-no_piece_suggestions \n+incoming_message \n 0 \n \n suggest_read_cache \n+outgoing_message \n 1 \n \n
\n-[report issue]\n-\n-enum choking_algorithm_t
\n-Declared in "libtorrent/settings_pack.hpp"
\n-\n-\n- \n-\n-name \n-value \n-description \n-fixed_slots_choker \n-0 \n-This is the traditional choker with a fixed number of unchoke\n-slots (as specified by settings_pack::unchoke_slots_limit). \n-rate_based_choker \n+incoming \n 2 \n-This opens up unchoke slots based on the upload rate achieved to\n-peers. The more slots that are opened, the marginal upload rate\n-required to open up another slot increases. Configure the initial\n-threshold with settings_pack::rate_choker_initial_threshold.
\n-For more information, see rate based choking.
\n- \n deprecated_bittyrant_choker \n+outgoing \n 3 \n \n
\n-[report issue]\n-\n-enum seed_choking_algorithm_t
\n-Declared in "libtorrent/settings_pack.hpp"
\n-\n-\n- \n-\n-name \n-value \n-description \n-round_robin \n-0 \n-which round-robins the peers that are unchoked\n-when seeding. This distributes the upload bandwidth uniformly and\n-fairly. It minimizes the ability for a peer to download everything\n-without redistributing it. \n-fastest_upload \n-1 \n-unchokes the peers we can send to the fastest. This might be a\n-bit more reliable in utilizing all available capacity. \n-anti_leech \n-2 \n-prioritizes peers who have just started or are\n-just about to finish the download. The intention is to force\n-peers in the middle of the download to trade with each other.\n-This does not just take into account the pieces a peer is\n-reporting having downloaded, but also the pieces we have sent\n-to it. \n+info \n+4 \n+ \n
\n-[report issue]\n-\n-enum io_buffer_mode_t
\n-Declared in "libtorrent/settings_pack.hpp"
\n+[report issue]\n+- event_type
\n+- string literal indicating the kind of event. For messages, this is the\n+message name.
\n+
\n+[report issue]\n+\n+\n+lsd_error_alert
\n+Declared in "libtorrent/alert_types.hpp"
\n+posted if the local service discovery socket fails to start properly.\n+it's categorized as alert_category::error.
\n+\n+struct lsd_error_alert final : alert\n+{\n+ std::string message () const override;\n+\n+ static constexpr alert_category_t static_category = alert_category::error;\n+ aux::noexcept_movable<address> local_address;\n+ error_code error;\n+};\n+\n+[report issue]\n+- local_address
\n+- the local network the corresponding local service discovery is running\n+on
\n+
\n+[report issue]\n+- error
\n+- The error code
\n+
\n+[report issue]\n+\n+dht_lookup
\n+Declared in "libtorrent/alert_types.hpp"
\n+holds statistics about a current dht_lookup operation.\n+a DHT lookup is the traversal of nodes, looking up a\n+set of target nodes in the DHT for retrieving and possibly\n+storing information in the DHT
\n+\n+struct dht_lookup\n+{\n+ char const* type;\n+ int outstanding_requests;\n+ int timeouts;\n+ int responses;\n+ int branch_factor;\n+ int nodes_left;\n+ int last_sent;\n+ int first_timeout;\n+ sha1_hash target;\n+};\n+\n+[report issue]\n+- type
\n+- string literal indicating which kind of lookup this is
\n+
\n+[report issue]\n+- outstanding_requests
\n+- the number of outstanding request to individual nodes\n+this lookup has right now
\n+
\n+[report issue]\n+- timeouts
\n+- the total number of requests that have timed out so far\n+for this lookup
\n+
\n+[report issue]\n+- responses
\n+- the total number of responses we have received for this\n+lookup so far for this lookup
\n+
\n+[report issue]\n+- branch_factor
\n+- the branch factor for this lookup. This is the number of\n+nodes we keep outstanding requests to in parallel by default.\n+when nodes time out we may increase this.
\n+
\n+[report issue]\n+- nodes_left
\n+- the number of nodes left that could be queries for this\n+lookup. Many of these are likely to be part of the trail\n+while performing the lookup and would never end up actually\n+being queried.
\n+
\n+[report issue]\n+- last_sent
\n+- the number of seconds ago the\n+last message was sent that's still\n+outstanding
\n+
\n+[report issue]\n+- first_timeout
\n+- the number of outstanding requests\n+that have exceeded the short timeout\n+and are considered timed out in the\n+sense that they increased the branch\n+factor
\n+
\n+[report issue]\n+- target
\n+- the node-id or info-hash target for this lookup
\n+
\n+[report issue]\n+\n+dht_stats_alert
\n+Declared in "libtorrent/alert_types.hpp"
\n+contains current DHT state. Posted in response to session::post_dht_stats().
\n+\n+struct dht_stats_alert final : alert\n+{\n+ std::string message () const override;\n+\n+ static constexpr alert_category_t static_category = {};\n+ std::vector<dht_lookup> active_requests;\n+ std::vector<dht_routing_bucket> routing_table;\n+ sha1_hash nid;\n+ aux::noexcept_movable<udp::endpoint> local_endpoint;\n+};\n+\n+[report issue]\n+- active_requests
\n+- a vector of the currently running DHT lookups.
\n+
\n+[report issue]\n+- routing_table
\n+- contains information about every bucket in the DHT routing\n+table.
\n+
\n+[report issue]\n+- nid
\n+- the node ID of the DHT node instance
\n+
\n+[report issue]\n+- local_endpoint
\n+- the local socket this DHT node is running on
\n+
\n+[report issue]\n+\n+incoming_request_alert
\n+Declared in "libtorrent/alert_types.hpp"
\n+posted every time an incoming request from a peer is accepted and queued\n+up for being serviced. This alert is only posted if\n+the alert_category::incoming_request flag is enabled in the alert\n+mask.
\n+\n+struct incoming_request_alert final : peer_alert\n+{\n+ std::string message () const override;\n+\n+ static constexpr alert_category_t static_category = alert_category::incoming_request;\n+ peer_request req;\n+};\n+\n+[report issue]\n+- req
\n+- the request this peer sent to us
\n+
\n+[report issue]\n+\n+dht_log_alert
\n+Declared in "libtorrent/alert_types.hpp"
\n+debug logging of the DHT when alert_category::dht_log is set in the alert\n+mask.
\n+\n+struct dht_log_alert final : alert\n+{\n+ std::string message () const override;\n+ char const* log_message () const;\n+\n+ enum dht_module_t\n+ {\n+ tracker,\n+ node,\n+ routing_table,\n+ rpc_manager,\n+ traversal,\n+ };\n+\n+ static constexpr alert_category_t static_category = alert_category::dht_log;\n+ dht_module_t module;\n+};\n+\n+[report issue]\n+\n+enum dht_module_t
\n+Declared in "libtorrent/alert_types.hpp"
\n \n \n- \n \n name \n value \n description \n enable_os_cache \n+tracker \n 0 \n \n deprecated_disable_os_cache_for_aligned_files \n+node \n 1 \n \n disable_os_cache \n+routing_table \n 2 \n \n write_through \n+rpc_manager \n 3 \n \n
\n-[report issue]\n-\n-enum bandwidth_mixed_algo_t
\n-Declared in "libtorrent/settings_pack.hpp"
\n-\n-\n- \n-\n-name \n-value \n-description \n-prefer_tcp \n-0 \n-disables the mixed mode bandwidth balancing \n-peer_proportional \n-1 \n-does not throttle uTP, throttles TCP to the same proportion\n-of throughput as there are TCP connections \n-
\n-[report issue]\n-\n-enum enc_policy
\n-Declared in "libtorrent/settings_pack.hpp"
\n-\n-\n- \n-\n-name \n-value \n-description \n-pe_forced \n-0 \n-Only encrypted connections are allowed. Incoming connections that\n-are not encrypted are closed and if the encrypted outgoing\n-connection fails, a non-encrypted retry will not be made. \n-pe_enabled \n-1 \n-encrypted connections are enabled, but non-encrypted connections\n-are allowed. An incoming non-encrypted connection will be accepted,\n-and if an outgoing encrypted connection fails, a non- encrypted\n-connection will be tried. \n-pe_disabled \n-2 \n-only non-encrypted connections are allowed. \n-
\n-[report issue]\n-\n-enum enc_level
\n-Declared in "libtorrent/settings_pack.hpp"
\n-\n-\n- \n-\n-name \n-value \n-description \n-pe_plaintext \n-1 \n-use only plain text encryption \n-pe_rc4 \n-2 \n-use only RC4 encryption \n-pe_both \n-3 \n-allow both \n+traversal \n+4 \n+ \n
\n-[report issue]\n-\n-enum proxy_type_t
\n-Declared in "libtorrent/settings_pack.hpp"
\n+[report issue]\n+- module
\n+- the module, or part, of the DHT that produced this log message.
\n+
\n+[report issue]\n+\n+\n+dht_pkt_alert
\n+Declared in "libtorrent/alert_types.hpp"
\n+This alert is posted every time a DHT message is sent or received. It is\n+only posted if the alert_category::dht_log alert category is\n+enabled. It contains a verbatim copy of the message.
\n+\n+struct dht_pkt_alert final : alert\n+{\n+ std::string message () const override;\n+ span<char const> pkt_buf () const;\n+\n+ enum direction_t\n+ {\n+ incoming,\n+ outgoing,\n+ };\n+\n+ static constexpr alert_category_t static_category = alert_category::dht_log;\n+ direction_t direction;\n+ aux::noexcept_movable<udp::endpoint> node;\n+};\n+\n+[report issue]\n+pkt_buf()
\n+\n+span<char const> pkt_buf () const;\n+
\n+returns a pointer to the packet buffer and size of the packet,\n+respectively. This buffer is only valid for as long as the alert itself\n+is valid, which is owned by libtorrent and reclaimed whenever\n+pop_alerts() is called on the session.
\n+[report issue]\n+\n+enum direction_t
\n+Declared in "libtorrent/alert_types.hpp"
\n \n \n- \n \n name \n value \n description \n none \n+incoming \n 0 \n-No proxy server is used and all other fields are ignored. \n+ \n socks4 \n+outgoing \n 1 \n-The server is assumed to be a SOCKS4 server that requires a\n-username. \n-socks5 \n-2 \n-The server is assumed to be a SOCKS5 server (RFC 1928) that does\n-not require any authentication. The username and password are\n-ignored. \n-socks5_pw \n-3 \n-The server is assumed to be a SOCKS5 server that supports plain\n-text username and password authentication (RFC 1929). The\n-username and password specified may be sent to the proxy if it\n-requires. \n-http \n-4 \n-The server is assumed to be an HTTP proxy. If the transport used\n-for the connection is non-HTTP, the server is assumed to support\n-the CONNECT method. i.e. for web seeds and HTTP trackers, a plain\n-proxy will suffice. The proxy is assumed to not require\n-authorization. The username and password will not be used. \n-http_pw \n-5 \n-The server is assumed to be an HTTP proxy that requires user\n-authorization. The username and password will be sent to the proxy. \n+ \n
\n-\n-[report issue]\n+[report issue]\n+- direction
\n+- whether this is an incoming or outgoing packet.
\n+
\n+[report issue]\n+- node
\n+- the DHT node we received this packet from, or sent this packet to\n+(depending on direction).
\n+
\n+[report issue]\n \n-\n-min_memory_usage() high_performance_seed()
\n-Declared in "libtorrent/session.hpp"
\n+\n+dht_get_peers_reply_alert
\n+Declared in "libtorrent/alert_types.hpp"
\n+Posted when we receive a response to a DHT get_peers request.
\n \n-settings_pack min_memory_usage ();\n-settings_pack high_performance_seed ();\n+struct dht_get_peers_reply_alert final : alert\n+{\n+ std::string message () const override;\n+ int num_peers () const;\n+ std::vector<tcp::endpoint> peers () const;\n+\n+ static constexpr alert_category_t static_category = alert_category::dht_operation;\n+ sha1_hash info_hash;\n+};\n \n-The default values of the session settings are set for a regular\n-bittorrent client running on a desktop system. There are functions that\n-can set the session settings to pre set settings for other environments.\n-These can be used for the basis, and should be tweaked to fit your needs\n-better.
\n-min_memory_usage returns settings that will use the minimal amount of\n-RAM, at the potential expense of upload and download performance. It\n-adjusts the socket buffer sizes, disables the disk cache, lowers the send\n-buffer watermarks so that each connection only has at most one block in\n-use at any one time. It lowers the outstanding blocks send to the disk\n-I/O thread so that connections only have one block waiting to be flushed\n-to disk at any given time. It lowers the max number of peers in the peer\n-list for torrents. It performs multiple smaller reads when it hashes\n-pieces, instead of reading it all into memory before hashing.
\n-This configuration is intended to be the starting point for embedded\n-devices. It will significantly reduce memory usage.
\n-high_performance_seed returns settings optimized for a seed box,\n-serving many peers and that doesn't do any downloading. It has a 128 MB\n-disk cache and has a limit of 400 files in its file pool. It support fast\n-upload rates by allowing large send buffers.
\n-\n-[report issue]\n-\n-setting_by_name() name_for_setting()
\n-Declared in "libtorrent/settings_pack.hpp"
\n+[report issue]\n+\n+dht_direct_response_alert
\n+Declared in "libtorrent/alert_types.hpp"
\n+This is posted exactly once for every call to session_handle::dht_direct_request.\n+If the request failed, response() will return a default constructed bdecode_node.
\n \n-char const* name_for_setting (int s);\n-int setting_by_name (string_view name);\n+struct dht_direct_response_alert final : alert\n+{\n+ std::string message () const override;\n+ bdecode_node response () const;\n+\n+ static constexpr alert_category_t static_category = alert_category::dht;\n+ client_data_t userdata;\n+ aux::noexcept_movable<udp::endpoint> endpoint;\n+};\n \n-converts a setting integer (from the enums string_types, int_types or\n-bool_types) to a string, and vice versa.
\n-[report issue]\n-\n+\n+picker_log_alert
\n+Declared in "libtorrent/alert_types.hpp"
\n+this is posted when one or more blocks are picked by the piece picker,\n+assuming the verbose piece picker logging is enabled (see\n+alert_category::picker_log).
\n \n-settings_pack default_settings ();\n+struct picker_log_alert final : peer_alert\n+{\n+ std::string message () const override;\n+ std::vector<piece_block> blocks () const;\n+\n+ static constexpr alert_category_t static_category = alert_category::picker_log;\n+ static constexpr picker_flags_t partial_ratio = 0_bit;\n+ static constexpr picker_flags_t prioritize_partials = 1_bit;\n+ static constexpr picker_flags_t rarest_first_partials = 2_bit;\n+ static constexpr picker_flags_t rarest_first = 3_bit;\n+ static constexpr picker_flags_t reverse_rarest_first = 4_bit;\n+ static constexpr picker_flags_t suggested_pieces = 5_bit;\n+ static constexpr picker_flags_t prio_sequential_pieces = 6_bit;\n+ static constexpr picker_flags_t sequential_pieces = 7_bit;\n+ static constexpr picker_flags_t reverse_pieces = 8_bit;\n+ static constexpr picker_flags_t time_critical = 9_bit;\n+ static constexpr picker_flags_t random_pieces = 10_bit;\n+ static constexpr picker_flags_t prefer_contiguous = 11_bit;\n+ static constexpr picker_flags_t reverse_sequential = 12_bit;\n+ static constexpr picker_flags_t backup1 = 13_bit;\n+ static constexpr picker_flags_t backup2 = 14_bit;\n+ static constexpr picker_flags_t end_game = 15_bit;\n+ static constexpr picker_flags_t extent_affinity = 16_bit;\n+ picker_flags_t const picker_flags;\n+};\n \n-returns a settings_pack with every setting set to its default value
\n-[report issue]\n-\n-generate_fingerprint()
\n-Declared in "libtorrent/fingerprint.hpp"
\n+[report issue]\n+- picker_flags
\n+- this is a bitmask of which features were enabled for this particular\n+pick. The bits are defined in the picker_flags_t enum.
\n+
\n+[report issue]\n+\n+session_error_alert
\n+Declared in "libtorrent/alert_types.hpp"
\n+this alert is posted when the session encounters a serious error,\n+potentially fatal
\n \n-std::string generate_fingerprint (std::string name\n- , int major, int minor = 0, int revision = 0, int tag = 0);\n+struct session_error_alert final : alert\n+{\n+ std::string message () const override;\n+\n+ static constexpr alert_category_t static_category = alert_category::error;\n+ error_code const error;\n+};\n \n-This is a utility function to produce a client ID fingerprint formatted to\n-the most common convention. The fingerprint can be set via the\n-peer_fingerprint setting, in settings_pack.
\n-The name string should contain exactly two characters. These are the\n-characters unique to your client, used to identify it. Make sure not to\n-clash with anybody else. Here are some taken id's:
\n-\n-\n- \n-\n-id chars \n-client \n-LT \n-libtorrent (default) \n-UT \n-uTorrent \n-UM \n-uTorrent Mac \n-qB \n-qBittorrent \n-BP \n-BitTorrent Pro \n-BT \n-BitTorrent \n-DE \n-Deluge \n-AZ \n-Azureus \n-TL \n-Tribler \n-
\n-There's an informal directory of client id's here.
\n-The major, minor, revision and tag parameters are used to\n-identify the version of your client.
\n-[report issue]\n-\n-ip_filter
\n-Declared in "libtorrent/ip_filter.hpp"
\n-The ip_filter class is a set of rules that uniquely categorizes all\n-ip addresses as allowed or disallowed. The default constructor creates\n-a single rule that allows all addresses (0.0.0.0 - 255.255.255.255 for\n-the IPv4 range, and the equivalent range covering all addresses for the\n-IPv6 range).
\n-A default constructed ip_filter does not filter any address.
\n+[report issue]\n+- error
\n+- The error code, if one is associated with this error
\n+
\n+[report issue]\n+\n+dht_live_nodes_alert
\n+Declared in "libtorrent/alert_types.hpp"
\n+posted in response to a call to session::dht_live_nodes(). It contains the\n+live nodes from the DHT routing table of one of the DHT nodes running\n+locally.
\n \n-struct ip_filter\n+struct dht_live_nodes_alert final : alert\n {\n- ip_filter ();\n- ip_filter (ip_filter&&);\n- ip_filter& operator= (ip_filter&&);\n- ip_filter (ip_filter const&);\n- ip_filter& operator= (ip_filter const&);\n- ~ip_filter ();\n- bool empty () const;\n- void add_rule (address const& first, address const& last, std::uint32_t flags);\n- std::uint32_t access (address const& addr) const;\n- filter_tuple_t export_filter () const;\n+ std::string message () const override;\n+ int num_nodes () const;\n+ std::vector<std::pair<sha1_hash, udp::endpoint>> nodes () const;\n \n- enum access_flags\n- {\n- blocked,\n- };\n+ static constexpr alert_category_t static_category = alert_category::dht;\n+ sha1_hash node_id;\n };\n \n-[report issue]\n-empty()
\n+\n+[report issue]\n+num_nodes() nodes()
\n \n-bool empty () const;\n+int num_nodes () const;\n+std::vector<std::pair<sha1_hash, udp::endpoint>> nodes () const;\n
\n-returns true if the filter does not contain any rules
\n-[report issue]\n-\n-add_rule()
\n+the number of nodes in the routing table and the actual nodes.
\n+[report issue]\n+- node_id
\n+- the local DHT node's node-ID this routing table belongs to
\n+
\n+[report issue]\n+\n+\n+session_stats_header_alert
\n+Declared in "libtorrent/alert_types.hpp"
\n+The session_stats_header alert is posted the first time\n+post_session_stats() is called
\n+the message() member function returns a string representation of the\n+header that properly match the stats values string returned in\n+session_stats_alert::message().
\n+this specific output is parsed by tools/parse_session_stats.py\n+if this is changed, that parser should also be changed
\n \n-void add_rule (address const& first, address const& last, std::uint32_t flags);\n+struct session_stats_header_alert final : alert\n+{\n+ std::string message () const override;\n+\n+ static constexpr alert_category_t static_category = {};\n+};\n \n-Adds a rule to the filter. first and last defines a range of\n-ip addresses that will be marked with the given flags. The flags\n-can currently be 0, which means allowed, or ip_filter::blocked, which\n-means disallowed.
\n-precondition:\n-first.is_v4() == last.is_v4() && first.is_v6() == last.is_v6()
\n-postcondition:\n-access(x) == flags for every x in the range [first, last]
\n-This means that in a case of overlapping ranges, the last one applied takes\n-precedence.
\n-[report issue]\n-\n+\n+dht_sample_infohashes_alert
\n+Declared in "libtorrent/alert_types.hpp"
\n+posted as a response to a call to session::dht_sample_infohashes() with\n+the information from the DHT response message.
\n \n-std::uint32_t access (address const& addr) const;\n+struct dht_sample_infohashes_alert final : alert\n+{\n+ std::string message () const override;\n+ std::vector<sha1_hash> samples () const;\n+ int num_samples () const;\n+ int num_nodes () const;\n+ std::vector<std::pair<sha1_hash, udp::endpoint>> nodes () const;\n+\n+ static constexpr alert_category_t static_category = alert_category::dht_operation;\n+ sha1_hash node_id;\n+ aux::noexcept_movable<udp::endpoint> endpoint;\n+ time_duration const interval;\n+ int const num_infohashes;\n+};\n \n-Returns the access permissions for the given address (addr). The permission\n-can currently be 0 or ip_filter::blocked. The complexity of this operation\n-is O(log n), where n is the minimum number of non-overlapping ranges to describe\n-the current filter.
\n-[report issue]\n-\n-export_filter()
\n+\n+[report issue]\n+samples() num_samples()
\n \n-filter_tuple_t export_filter () const;\n+std::vector<sha1_hash> samples () const;\n+int num_samples () const;\n
\n-This function will return the current state of the filter in the minimum number of\n-ranges possible. They are sorted from ranges in low addresses to high addresses. Each\n-entry in the returned vector is a range with the access control specified in its\n-flags field.
\n-The return value is a tuple containing two range-lists. One for IPv4 addresses\n-and one for IPv6 addresses.
\n-[report issue]\n-\n-enum access_flags
\n-Declared in "libtorrent/ip_filter.hpp"
\n-\n-\n- \n-\n-name \n-value \n-description \n-blocked \n-1 \n-indicates that IPs in this range should not be connected\n-to nor accepted as incoming connections \n-
\n-[report issue]\n+returns the number of info-hashes returned by the node, as well as the\n+actual info-hashes. num_samples() is more efficient than\n+samples().size().
\n+[report issue]\n+\n+num_nodes()
\n+\n+int num_nodes () const;\n+
\n+The total number of nodes returned by nodes().
\n+[report issue]\n+\n+nodes()
\n+\n+std::vector<std::pair<sha1_hash, udp::endpoint>> nodes () const;\n+
\n+This is the set of more DHT nodes returned by the request.
\n+The information is included so that indexing nodes can perform a key\n+space traversal with a single RPC per node by adjusting the target\n+value for each RPC.
\n+[report issue]\n+- node_id
\n+- id of the node the request was sent to (and this response was received from)
\n+
\n+[report issue]\n+- endpoint
\n+- the node the request was sent to (and this response was received from)
\n+
\n+[report issue]\n+- interval
\n+- the interval to wait before making another request to this node
\n+
\n+[report issue]\n+- num_infohashes
\n+- This field indicates how many info-hash keys are currently in the node's storage.\n+If the value is larger than the number of returned samples it indicates that the\n+indexer may obtain additional samples after waiting out the interval.
\n+
\n+[report issue]\n \n-\n-port_filter
\n-Declared in "libtorrent/ip_filter.hpp"
\n-the port filter maps non-overlapping port ranges to flags. This\n-is primarily used to indicate whether a range of ports should\n-be connected to or not. The default is to have the full port\n-range (0-65535) set to flag 0.
\n+\n+block_uploaded_alert
\n+Declared in "libtorrent/alert_types.hpp"
\n+This alert is posted when a block intended to be sent to a peer is placed in the\n+send buffer. Note that if the connection is closed before the send buffer is sent,\n+the alert may be posted without the bytes having been sent to the peer.\n+It belongs to the alert_category::upload category.
\n \n-class port_filter\n+struct block_uploaded_alert final : peer_alert\n {\n- port_filter& operator= (port_filter&&);\n- port_filter (port_filter&&);\n- port_filter (port_filter const&);\n- port_filter& operator= (port_filter const&);\n- ~port_filter ();\n- port_filter ();\n- void add_rule (std::uint16_t first, std::uint16_t last, std::uint32_t flags);\n- std::uint32_t access (std::uint16_t port) const;\n+ std::string message () const override;\n \n- enum access_flags\n- {\n- blocked,\n- };\n+ int const block_index;\n+ piece_index_t const piece_index;\n };\n \n-[report issue]\n+\n+alerts_dropped_alert
\n+Declared in "libtorrent/alert_types.hpp"
\n+this alert is posted to indicate to the client that some alerts were\n+dropped. Dropped meaning that the alert failed to be delivered to the\n+client. The most common cause of such failure is that the internal alert\n+queue grew too big (controlled by alert_queue_size).
\n \n-void add_rule (std::uint16_t first, std::uint16_t last, std::uint32_t flags);\n+struct alerts_dropped_alert final : alert\n+{\n+ static_assert (num_alert_types <= abi_alert_count, "need to increase bitset. This is an ABI break");\n+ std::string message () const override;\n+\n+ static constexpr alert_category_t static_category = alert_category::error;\n+ std::bitset<abi_alert_count> dropped_alerts;\n+};\n \n-set the flags for the specified port range (first, last) to\n-flags overwriting any existing rule for those ports. The range\n-is inclusive, i.e. the port last also has the flag set on it.
\n-[report issue]\n-\n-access()
\n+[report issue]\n+- dropped_alerts
\n+- a bitmask indicating which alerts were dropped. Each bit represents the\n+alert type ID, where bit 0 represents whether any alert of type 0 has\n+been dropped, and so on.
\n+
\n+[report issue]\n+\n+socks5_alert
\n+Declared in "libtorrent/alert_types.hpp"
\n+this alert is posted with SOCKS5 related errors, when a SOCKS5 proxy is\n+configured. It's enabled with the alert_category::error alert category.
\n \n-std::uint32_t access (std::uint16_t port) const;\n+struct socks5_alert final : alert\n+{\n+ std::string message () const override;\n+\n+ static constexpr alert_category_t static_category = alert_category::error;\n+ error_code error;\n+ operation_t op;\n+ aux::noexcept_movable<tcp::endpoint> ip;\n+};\n \n-test the specified port (port) for whether it is blocked\n-or not. The returned value is the flags set for this port.\n-see access_flags.
\n-[report issue]\n-\n-enum access_flags
\n-Declared in "libtorrent/ip_filter.hpp"
\n-\n-\n- \n-\n-name \n-value \n-description \n-blocked \n-1 \n-this flag indicates that destination ports in the\n-range should not be connected to \n-
\n-[report issue]\n-\n-\n-peer_class_type_filter
\n-Declared in "libtorrent/peer_class_type_filter.hpp"
\n-peer_class_type_filter is a simple container for rules for adding and subtracting\n-peer-classes from peers. It is applied after the peer class filter is applied (which\n-is based on the peer's IP address).
\n+[report issue]\n+- error
\n+- the error
\n+
\n+[report issue]\n+- op
\n+- the operation that failed
\n+
\n+[report issue]\n+- ip
\n+- the endpoint configured as the proxy
\n+
\n+[report issue]\n+\n+file_prio_alert
\n+Declared in "libtorrent/alert_types.hpp"
\n+posted when a prioritize_files() or file_priority() update of the file\n+priorities complete, which requires a round-trip to the disk thread.
\n+If the disk operation fails this alert won't be posted, but a\n+file_error_alert is posted instead, and the torrent is stopped.
\n \n-struct peer_class_type_filter\n+struct file_prio_alert final : torrent_alert\n {\n- void add (socket_type_t const st, peer_class_t const peer_class);\n- void remove (socket_type_t const st, peer_class_t const peer_class);\n- void disallow (socket_type_t const st, peer_class_t const peer_class);\n- void allow (socket_type_t const st, peer_class_t const peer_class);\n- std::uint32_t apply (socket_type_t const st, std::uint32_t peer_class_mask);\n- friend bool operator== (peer_class_type_filter const& lhs\n- , peer_class_type_filter const& rhs);\n+ std::string message () const override;\n \n- enum socket_type_t\n- {\n- tcp_socket,\n- utp_socket,\n- ssl_tcp_socket,\n- ssl_utp_socket,\n- i2p_socket,\n- num_socket_types,\n- };\n+ static constexpr alert_category_t static_category = alert_category::storage;\n+ error_code error;\n+ operation_t op;\n };\n \n-\n-[report issue]\n-remove() add()
\n+[report issue]\n+- error
\n+- the error
\n+
\n+[report issue]\n+- op
\n+- the operation that failed
\n+
\n+[report issue]\n+\n+oversized_file_alert
\n+Declared in "libtorrent/alert_types.hpp"
\n+this alert may be posted when the initial checking of resume data and files\n+on disk (just existence, not piece hashes) completes. If a file belonging\n+to the torrent is found on disk, but is larger than the file in the\n+torrent, that's when this alert is posted.\n+the client may want to call truncate_files() in that case, or perhaps\n+interpret it as a sign that some other file is in the way, that shouldn't\n+be overwritten.
\n \n-void add (socket_type_t const st, peer_class_t const peer_class);\n-void remove (socket_type_t const st, peer_class_t const peer_class);\n+struct oversized_file_alert final : torrent_alert\n+{\n+ std::string message () const override;\n+\n+ static constexpr alert_category_t static_category = alert_category::storage;\n+};\n \n-add() and remove() adds and removes a peer class to be added\n-to new peers based on socket type.
\n-\n-[report issue]\n-\n+\n+torrent_conflict_alert
\n+Declared in "libtorrent/alert_types.hpp"
\n+this alert is posted when two separate torrents (magnet links) resolve to\n+the same torrent, thus causing the same torrent being added twice. In\n+that case, both torrents enter an error state with duplicate_torrent\n+as the error code. This alert is posted containing the metadata. For more\n+information, see BitTorrent v2 torrents.\n+The torrent this alert originated from was the one that downloaded the
\n+metadata (i.e. the handle member from the torrent_alert base class).
\n \n-void disallow (socket_type_t const st, peer_class_t const peer_class);\n-void allow (socket_type_t const st, peer_class_t const peer_class);\n+struct torrent_conflict_alert final : torrent_alert\n+{\n+ std::string message () const override;\n+\n+ static constexpr alert_category_t static_category = alert_category::error;\n+ torrent_handle conflicting_torrent;\n+ std::shared_ptr<torrent_info> metadata;\n+};\n \n-disallow() and allow() adds and removes a peer class to be\n-removed from new peers based on socket type.
\n-The peer_class argument cannot be greater than 31. The bitmasks representing\n-peer classes in the peer_class_type_filter are 32 bits.
\n-[report issue]\n-\n-apply()
\n+[report issue]\n+- conflicting_torrent
\n+- the handle to the torrent in conflict. The swarm associated with this\n+torrent handle did not download the metadata, but the downloaded\n+metadata collided with this swarm's info-hash.
\n+
\n+[report issue]\n+- metadata
\n+- the metadata that was received by one of the torrents in conflict.\n+One way to resolve the conflict is to remove both failing torrents\n+and re-add it using this metadata
\n+
\n+[report issue]\n+\n+peer_info_alert
\n+Declared in "libtorrent/alert_types.hpp"
\n+posted when torrent_handle::post_peer_info() is called
\n \n-std::uint32_t apply (socket_type_t const st, std::uint32_t peer_class_mask);\n+struct peer_info_alert final : torrent_alert\n+{\n+ std::string message () const override;\n+\n+ static constexpr alert_category_t static_category = alert_category::status;\n+ std::vector<lt::peer_info> peer_info;\n+};\n \n-takes a bitmask of peer classes and returns a new bitmask of\n-peer classes after the rules have been applied, based on the socket type argument\n-(st).
\n-[report issue]\n-\n-enum socket_type_t
\n-Declared in "libtorrent/peer_class_type_filter.hpp"
\n+[report issue]\n+- peer_info
\n+- the list of the currently connected peers
\n+
\n+[report issue]\n+\n+file_progress_alert
\n+Declared in "libtorrent/alert_types.hpp"
\n+posted when torrent_handle::post_file_progress() is called
\n+\n+struct file_progress_alert final : torrent_alert\n+{\n+ std::string message () const override;\n+\n+ static constexpr alert_category_t static_category = alert_category::file_progress;\n+ aux::vector<std::int64_t, file_index_t> files;\n+};\n+\n+[report issue]\n+- files
\n+- the list of the files in the torrent
\n+
\n+[report issue]\n+\n+piece_info_alert
\n+Declared in "libtorrent/alert_types.hpp"
\n+posted when torrent_handle::post_download_queue() is called
\n+\n+struct piece_info_alert final : torrent_alert\n+{\n+ std::string message () const override;\n+\n+ static constexpr alert_category_t static_category = alert_category::piece_progress;\n+ std::vector<partial_piece_info> piece_info;\n+ std::vector<block_info> block_data;\n+};\n+\n+[report issue]\n+- piece_info
\n+- info about pieces being downloaded for the torrent
\n+
\n+[report issue]\n+- block_data
\n+- storage for block_info pointers in partial_piece_info objects
\n+
\n+[report issue]\n+\n+piece_availability_alert
\n+Declared in "libtorrent/alert_types.hpp"
\n+posted when torrent_handle::post_piece_availability() is called
\n+\n+struct piece_availability_alert final : torrent_alert\n+{\n+ std::string message () const override;\n+\n+ static constexpr alert_category_t static_category = alert_category::status;\n+ std::vector<int> piece_availability;\n+};\n+\n+[report issue]\n+- piece_availability
\n+- info about pieces being downloaded for the torrent
\n+
\n+[report issue]\n+\n+tracker_list_alert
\n+Declared in "libtorrent/alert_types.hpp"
\n+posted when torrent_handle::post_trackers() is called
\n+\n+struct tracker_list_alert final : torrent_alert\n+{\n+ std::string message () const override;\n+\n+ static constexpr alert_category_t static_category = alert_category::status;\n+ std::vector<announce_entry> trackers;\n+};\n+\n+[report issue]\n+- trackers
\n+- list of trackers and their status for the torrent
\n+
\n+[report issue]\n+\n+alert
\n+Declared in "libtorrent/alert.hpp"
\n+The alert class is the base class that specific messages are derived from.\n+alert types are not copyable, and cannot be constructed by the client. The\n+pointers returned by libtorrent are short lived (the details are described\n+under session_handle::pop_alerts())
\n+\n+struct alert\n+{\n+ time_point timestamp () const;\n+ virtual int type () const noexcept = 0;\n+ virtual char const* what () const noexcept = 0;\n+ virtual std::string message () const = 0;\n+ virtual alert_category_t category () const noexcept = 0;\n+\n+ static constexpr alert_category_t error_notification = 0_bit;\n+ static constexpr alert_category_t peer_notification = 1_bit;\n+ static constexpr alert_category_t port_mapping_notification = 2_bit;\n+ static constexpr alert_category_t storage_notification = 3_bit;\n+ static constexpr alert_category_t tracker_notification = 4_bit;\n+ static constexpr alert_category_t connect_notification = 5_bit;\n+ static constexpr alert_category_t status_notification = 6_bit;\n+ static constexpr alert_category_t ip_block_notification = 8_bit;\n+ static constexpr alert_category_t performance_warning = 9_bit;\n+ static constexpr alert_category_t dht_notification = 10_bit;\n+ static constexpr alert_category_t session_log_notification = 13_bit;\n+ static constexpr alert_category_t torrent_log_notification = 14_bit;\n+ static constexpr alert_category_t peer_log_notification = 15_bit;\n+ static constexpr alert_category_t incoming_request_notification = 16_bit;\n+ static constexpr alert_category_t dht_log_notification = 17_bit;\n+ static constexpr alert_category_t dht_operation_notification = 18_bit;\n+ static constexpr alert_category_t port_mapping_log_notification = 19_bit;\n+ static constexpr alert_category_t picker_log_notification = 20_bit;\n+ static constexpr alert_category_t file_progress_notification = 21_bit;\n+ static constexpr alert_category_t piece_progress_notification = 22_bit;\n+ static constexpr alert_category_t upload_notification = 23_bit;\n+ static constexpr alert_category_t block_progress_notification = 24_bit;\n+ static constexpr alert_category_t all_categories = alert_category_t::all();\n+};\n+\n+[report issue]\n+timestamp()
\n+\n+time_point timestamp () const;\n+
\n+a timestamp is automatically created in the constructor
\n+[report issue]\n+\n+type()
\n+\n+virtual int type () const noexcept = 0;\n+
\n+returns an integer that is unique to this alert type. It can be\n+compared against a specific alert by querying a static constant called alert_type\n+in the alert. It can be used to determine the run-time type of an alert* in\n+order to cast to that alert type and access specific members.
\n+e.g:
\n+\n+std::vector<alert*> alerts;\n+ses.pop_alerts(&alerts);\n+for (alert* a : alerts) {\n+ switch (a->type()) {\n+\n+ case read_piece_alert::alert_type:\n+ {\n+ auto* p = static_cast<read_piece_alert*>(a);\n+ if (p->ec) {\n+ // read_piece failed\n+ break;\n+ }\n+ // use p\n+ break;\n+ }\n+ case file_renamed_alert::alert_type:\n+ {\n+ // etc...\n+ }\n+ }\n+}\n+
\n+[report issue]\n+\n+what()
\n+\n+virtual char const* what () const noexcept = 0;\n+
\n+returns a string literal describing the type of the alert. It does\n+not include any information that might be bundled with the alert.
\n+[report issue]\n+\n+message()
\n+\n+virtual std::string message () const = 0;\n+
\n+generate a string describing the alert and the information bundled\n+with it. This is mainly intended for debug and development use. It is not suitable\n+to use this for applications that may be localized. Instead, handle each alert\n+type individually and extract and render the information from the alert depending\n+on the locale.
\n+[report issue]\n+\n+category()
\n+\n+virtual alert_category_t category () const noexcept = 0;\n+
\n+returns a bitmask specifying which categories this alert belong to.
\n+[report issue]\n+\n+\n+operation_name()
\n+Declared in "libtorrent/operations.hpp"
\n+\n+char const* operation_name (operation_t op);\n+
\n+maps an operation id (from peer_error_alert and peer_disconnected_alert)\n+to its name. See operation_t for the constants
\n+[report issue]\n+\n+alert_cast()
\n+Declared in "libtorrent/alert.hpp"
\n+\n+template <typename T> T* alert_cast (alert* a);\n+template <typename T> T const* alert_cast (alert const* a);\n+
\n+When you get an alert, you can use alert_cast<> to attempt to cast the\n+pointer to a specific alert type, in order to query it for more\n+information.
\n+\n+Note
\n+alert_cast<> can only cast to an exact alert type, not a base class
\n+\n+[report issue]\n+\n+enum operation_t
\n+Declared in "libtorrent/operations.hpp"
\n \n \n- \n \n name \n value \n description \n tcp_socket \n+unknown \n 0 \n-these match the socket types from socket_type.hpp\n-shifted one down \n+the error was unexpected and it is unknown which operation caused it \n utp_socket \n+bittorrent \n 1 \n- \n+this is used when the bittorrent logic\n+determines to disconnect \n ssl_tcp_socket \n+iocontrol \n 2 \n- \n+a call to iocontrol failed \n ssl_utp_socket \n+getpeername \n 3 \n- \n+a call to getpeername() failed (querying the remote IP of a\n+connection) \n i2p_socket \n+getname \n 4 \n- \n+a call to getname failed (querying the local IP of a\n+connection) \n num_socket_types \n+alloc_recvbuf \n 5 \n- \n+an attempt to allocate a receive buffer failed \n+alloc_sndbuf \n+6 \n+an attempt to allocate a send buffer failed \n+file_write \n+7 \n+writing to a file failed \n+file_read \n+8 \n+reading from a file failed \n+file \n+9 \n+a non-read and non-write file operation failed \n+sock_write \n+10 \n+a socket write operation failed \n+sock_read \n+11 \n+a socket read operation failed \n+sock_open \n+12 \n+a call to open(), to create a socket socket failed \n+sock_bind \n+13 \n+a call to bind() on a socket failed \n+available \n+14 \n+an attempt to query the number of bytes available to read from a socket\n+failed \n+encryption \n+15 \n+a call related to bittorrent protocol encryption failed \n+connect \n+16 \n+an attempt to connect a socket failed \n+ssl_handshake \n+17 \n+establishing an SSL connection failed \n+get_interface \n+18 \n+a connection failed to satisfy the bind interface setting \n+sock_listen \n+19 \n+a call to listen() on a socket \n+sock_bind_to_device \n+20 \n+a call to the ioctl to bind a socket to a specific network device or\n+adapter \n+sock_accept \n+21 \n+a call to accept() on a socket \n+parse_address \n+22 \n+convert a string into a valid network address \n+enum_if \n+23 \n+enumeration network devices or adapters \n+file_stat \n+24 \n+invoking stat() on a file \n+file_copy \n+25 \n+copying a file \n+file_fallocate \n+26 \n+allocating storage for a file \n+file_hard_link \n+27 \n+creating a hard link \n+file_remove \n+28 \n+removing a file \n+file_rename \n+29 \n+renaming a file \n+file_open \n+30 \n+opening a file \n+mkdir \n+31 \n+creating a directory \n+check_resume \n+32 \n+check fast resume data against files on disk \n+exception \n+33 \n+an unknown exception \n+alloc_cache_piece \n+34 \n+allocate space for a piece in the cache \n+partfile_move \n+35 \n+move a part-file \n+partfile_read \n+36 \n+read from a part file \n+partfile_write \n+37 \n+write to a part-file \n+hostname_lookup \n+38 \n+a hostname lookup \n+symlink \n+39 \n+create or read a symlink \n+handshake \n+40 \n+handshake with a peer or server \n+sock_option \n+41 \n+set socket option \n+enum_route \n+42 \n+enumeration of network routes \n+file_seek \n+43 \n+moving read/write position in a file, operation_t::hostname_lookup \n+timer \n+44 \n+an async wait operation on a timer \n+file_mmap \n+45 \n+call to mmap() (or windows counterpart) \n+file_truncate \n+46 \n+call to ftruncate() (or SetEndOfFile() on windows) \n
\n-[report issue]\n-\n-\n-peer_class_info
\n-Declared in "libtorrent/peer_class.hpp"
\n-holds settings for a peer class. Used in set_peer_class() and\n-get_peer_class() calls.
\n-\n-struct peer_class_info\n-{\n- bool ignore_unchoke_slots;\n- int connection_limit_factor;\n- std::string label;\n- int upload_limit;\n- int download_limit;\n- int upload_priority;\n- int download_priority;\n-};\n-\n-[report issue]\n-- ignore_unchoke_slots
\n-- ignore_unchoke_slots determines whether peers should always\n-unchoke a peer, regardless of the choking algorithm, or if it should\n-honor the unchoke slot limits. It's used for local peers by default.\n-If any of the peer classes a peer belongs to has this set to true,\n-that peer will be unchoked at all times.
\n+[report issue]
\n+\n+int
\n+Declared in "libtorrent/alert_types.hpp"
\n+\n+- user_alert_id
\n+- user defined alerts should use IDs greater than this
\n
\n-[report issue]\n-- connection_limit_factor
\n-- adjusts the connection limit (global and per torrent) that applies to\n-this peer class. By default, local peers are allowed to exceed the\n-normal connection limit for instance. This is specified as a percent\n-factor. 100 makes the peer class apply normally to the limit. 200\n-means as long as there are fewer connections than twice the limit, we\n-accept this peer. This factor applies both to the global connection\n-limit and the per-torrent limit. Note that if not used carefully one\n-peer class can potentially completely starve out all other over time.
\n+\n+- num_alert_types
\n+- this constant represents "max_alert_index" + 1
\n
\n-[report issue]\n-- label
\n-- not used by libtorrent. It's intended as a potentially user-facing\n-identifier of this peer class.
\n+[report issue]
\n+\n+alert_category_t
\n+Declared in "libtorrent/alert.hpp"
\n+\n+- error
\n+Enables alerts that report an error. This includes:
\n+\n+- tracker errors
\n+- tracker warnings
\n+- file errors
\n+- resume data failures
\n+- web seed errors
\n+- .torrent files errors
\n+- listen socket errors
\n+- port mapping errors
\n+
\n+
\n-\n-[report issue]\n-- upload_limit download_limit
\n-- transfer rates limits for the whole peer class. They are specified in\n-bytes per second and apply to the sum of all peers that are members of\n-this class.
\n+\n+- peer
\n+- Enables alerts when peers send invalid requests, get banned or\n+snubbed.
\n
\n-\n-[report issue]\n-- upload_priority download_priority
\n-- relative priorities used by the bandwidth allocator in the rate\n-limiter. If no rate limits are in use, the priority is not used\n-either. Priorities start at 1 (0 is not a valid priority) and may not\n-exceed 255.
\n+\n+- port_mapping
\n+- Enables alerts for port mapping events. For NAT-PMP and UPnP.
\n+
\n+\n+- storage
\n+- Enables alerts for events related to the storage. File errors and\n+synchronization events for moving the storage, renaming files etc.
\n+
\n+\n+- tracker
\n+- Enables all tracker events. Includes announcing to trackers,\n+receiving responses, warnings and errors.
\n+
\n+\n+- connect
\n+- Low level alerts for when peers are connected and disconnected.
\n+
\n+\n+- status
\n+- Enables alerts for when a torrent or the session changes state.
\n+
\n+\n+- ip_block
\n+- Alerts when a peer is blocked by the ip blocker or port blocker.
\n+
\n+\n+- performance_warning
\n+- Alerts when some limit is reached that might limit the download\n+or upload rate.
\n+
\n+\n+- dht
\n+- Alerts on events in the DHT node. For incoming searches or\n+bootstrapping being done etc.
\n+
\n+\n+- stats
\n+- If you enable these alerts, you will receive a stats_alert\n+approximately once every second, for every active torrent.\n+These alerts contain all statistics counters for the interval since\n+the lasts stats alert.
\n+
\n+\n+- session_log
\n+- Enables debug logging alerts. These are available unless libtorrent\n+was built with logging disabled (TORRENT_DISABLE_LOGGING). The\n+alerts being posted are log_alert and are session wide.
\n+
\n+\n+- torrent_log
\n+- Enables debug logging alerts for torrents. These are available\n+unless libtorrent was built with logging disabled\n+(TORRENT_DISABLE_LOGGING). The alerts being posted are\n+torrent_log_alert and are torrent wide debug events.
\n+
\n+\n+- peer_log
\n+- Enables debug logging alerts for peers. These are available unless\n+libtorrent was built with logging disabled\n+(TORRENT_DISABLE_LOGGING). The alerts being posted are\n+peer_log_alert and low-level peer events and messages.
\n+
\n+\n+- incoming_request
\n+- enables the incoming_request_alert.
\n+
\n+\n+- dht_log
\n+- enables dht_log_alert, debug logging for the DHT
\n+
\n+\n+- dht_operation
\n+- enable events from pure dht operations not related to torrents
\n+
\n+\n+- port_mapping_log
\n+- enables port mapping log events. This log is useful\n+for debugging the UPnP or NAT-PMP implementation
\n+
\n+\n+- picker_log
\n+- enables verbose logging from the piece picker.
\n+
\n+\n+- file_progress
\n+- alerts when files complete downloading
\n+
\n+\n+- piece_progress
\n+- alerts when pieces complete downloading or fail hash check
\n+
\n+\n+- upload
\n+- alerts when we upload blocks to other peers
\n+
\n+\n+- block_progress
\n+- alerts on individual blocks being requested, downloading, finished,\n+rejected, time-out and cancelled. This is likely to post alerts at a\n+high rate.
\n+
\n+\n+- all
\n+The full bitmask, representing all available categories.
\n+since the enum is signed, make sure this isn't\n+interpreted as -1. For instance, boost.python\n+does that and fails when assigning it to an\n+unsigned parameter.
\n+
\n [report issue]
\n \n block_info
\n Declared in "libtorrent/torrent_handle.hpp"
\n holds the state of a block in a piece. Who we requested\n it from and how far along we are at downloading it.
\n \n struct block_info\n {\n- tcp::endpoint peer () const;\n void set_peer (tcp::endpoint const& ep);\n+ tcp::endpoint peer () const;\n \n enum block_state_t\n {\n none,\n requested,\n writing,\n finished,\n@@ -18577,20 +17794,20 @@\n \n unsigned bytes_progress:15;\n unsigned block_size:15;\n unsigned state:2;\n unsigned num_peers:14;\n };\n \n-\n-[report issue]\n-set_peer() peer()
\n+\n+[report issue]\n+peer() set_peer()
\n \n-tcp::endpoint peer () const;\n void set_peer (tcp::endpoint const& ep);\n+tcp::endpoint peer () const;\n
\n The peer is the ip address of the peer this block was downloaded from.
\n [report issue]\n \n enum block_state_t
\n Declared in "libtorrent/torrent_handle.hpp"
\n \n@@ -18720,119 +17937,119 @@\n Which means you cannot perform any operation on it, unless you first\n assign it a valid handle. If you try to perform any operation on an\n uninitialized handle, it will throw invalid_handle.\n \n Warning
\n All operations on a torrent_handle may throw system_error\n exception, in case the handle is no longer referring to a torrent.\n-There is one exception is_valid() will never throw. Since the torrents\n+There is one exception is_valid() will never throw. Since the torrents\n are processed by a background thread, there is no guarantee that a\n handle will remain valid between two calls.
\n \n \n struct torrent_handle\n {\n friend std::size_t hash_value (torrent_handle const& th);\n torrent_handle () noexcept = default;\n void add_piece (piece_index_t piece, std::vector<char> data, add_piece_flags_t flags = {}) const;\n void add_piece (piece_index_t piece, char const* data, add_piece_flags_t flags = {}) const;\n void read_piece (piece_index_t piece) const;\n bool have_piece (piece_index_t piece) const;\n void post_peer_info () const;\n void get_peer_info (std::vector<peer_info>& v) const;\n- torrent_status status (status_flags_t flags = status_flags_t::all()) const;\n void post_status (status_flags_t flags = status_flags_t::all()) const;\n- std::vector<partial_piece_info> get_download_queue () const;\n+ torrent_status status (status_flags_t flags = status_flags_t::all()) const;\n void post_download_queue () const;\n+ std::vector<partial_piece_info> get_download_queue () const;\n void get_download_queue (std::vector<partial_piece_info>& queue) const;\n void set_piece_deadline (piece_index_t index, int deadline, deadline_flags_t flags = {}) const;\n- void clear_piece_deadlines () const;\n void reset_piece_deadline (piece_index_t index) const;\n+ void clear_piece_deadlines () const;\n void file_progress (std::vector<std::int64_t>& progress, file_progress_flags_t flags = {}) const;\n- std::vector<std::int64_t> file_progress (file_progress_flags_t flags = {}) const;\n void post_file_progress (file_progress_flags_t flags) const;\n+ std::vector<std::int64_t> file_progress (file_progress_flags_t flags = {}) const;\n std::vector<open_file_state> file_status () const;\n void clear_error () const;\n void replace_trackers (std::vector<announce_entry> const&) const;\n- void post_trackers () const;\n void add_tracker (announce_entry const&) const;\n std::vector<announce_entry> trackers () const;\n- void add_url_seed (std::string const& url) const;\n+ void post_trackers () const;\n void remove_url_seed (std::string const& url) const;\n std::set<std::string> url_seeds () const;\n+ void add_url_seed (std::string const& url) const;\n std::set<std::string> http_seeds () const;\n void add_http_seed (std::string const& url) const;\n void remove_http_seed (std::string const& url) const;\n void add_extension (\n std::function<std::shared_ptr<torrent_plugin>(torrent_handle const&, client_data_t)> const& ext\n , client_data_t userdata = client_data_t{});\n bool set_metadata (span<char const> metadata) const;\n bool is_valid () const;\n- void pause (pause_flags_t flags = {}) const;\n void resume () const;\n+ void pause (pause_flags_t flags = {}) const;\n void set_flags (torrent_flags_t flags) const;\n+ void unset_flags (torrent_flags_t flags) const;\n void set_flags (torrent_flags_t flags, torrent_flags_t mask) const;\n torrent_flags_t flags () const;\n- void unset_flags (torrent_flags_t flags) const;\n void flush_cache () const;\n void force_recheck () const;\n void save_resume_data (resume_data_flags_t flags = {}) const;\n- bool need_save_resume_data (resume_data_flags_t flags) const;\n bool need_save_resume_data () const;\n- void queue_position_down () const;\n- void queue_position_top () const;\n- void queue_position_bottom () const;\n+ bool need_save_resume_data (resume_data_flags_t flags) const;\n queue_position_t queue_position () const;\n void queue_position_up () const;\n+ void queue_position_down () const;\n+ void queue_position_bottom () const;\n+ void queue_position_top () const;\n void queue_position_set (queue_position_t p) const;\n- void set_ssl_certificate_buffer (std::string const& certificate\n- , std::string const& private_key\n- , std::string const& dh_params);\n void set_ssl_certificate (std::string const& certificate\n , std::string const& private_key\n , std::string const& dh_params\n , std::string const& passphrase = "");\n- std::shared_ptr<torrent_info> torrent_file_with_hashes () const;\n+ void set_ssl_certificate_buffer (std::string const& certificate\n+ , std::string const& private_key\n+ , std::string const& dh_params);\n std::shared_ptr<const torrent_info> torrent_file () const;\n+ std::shared_ptr<torrent_info> torrent_file_with_hashes () const;\n std::vector<std::vector<sha256_hash>> piece_layers () const;\n void post_piece_availability () const;\n void piece_availability (std::vector<int>& avail) const;\n void piece_priority (piece_index_t index, download_priority_t priority) const;\n- void prioritize_pieces (std::vector<std::pair<piece_index_t, download_priority_t>> const& pieces) const;\n download_priority_t piece_priority (piece_index_t index) const;\n- void prioritize_pieces (std::vector<download_priority_t> const& pieces) const;\n std::vector<download_priority_t> get_piece_priorities () const;\n+ void prioritize_pieces (std::vector<download_priority_t> const& pieces) const;\n+ void prioritize_pieces (std::vector<std::pair<piece_index_t, download_priority_t>> const& pieces) const;\n download_priority_t file_priority (file_index_t index) const;\n void prioritize_files (std::vector<download_priority_t> const& files) const;\n std::vector<download_priority_t> get_file_priorities () const;\n void file_priority (file_index_t index, download_priority_t priority) const;\n- void force_lsd_announce () const;\n void force_dht_announce () const;\n void force_reannounce (int seconds = 0, int idx = -1, reannounce_flags_t = {}) const;\n+ void force_lsd_announce () const;\n void scrape_tracker (int idx = -1) const;\n- int upload_limit () const;\n- int download_limit () const;\n void set_upload_limit (int limit) const;\n void set_download_limit (int limit) const;\n+ int upload_limit () const;\n+ int download_limit () const;\n void connect_peer (tcp::endpoint const& adr, peer_source_flags_t source = {}\n , pex_flags_t flags = pex_encryption | pex_utp | pex_holepunch) const;\n void clear_peers ();\n int max_uploads () const;\n void set_max_uploads (int max_uploads) const;\n int max_connections () const;\n void set_max_connections (int max_connections) const;\n void move_storage (std::string const& save_path\n , move_flags_t flags = move_flags_t::always_replace_files\n ) const;\n void rename_file (file_index_t index, std::string const& new_name) const;\n- sha1_hash info_hash () const;\n info_hash_t info_hashes () const;\n+ sha1_hash info_hash () const;\n+ bool operator== (const torrent_handle& h) const;\n bool operator!= (const torrent_handle& h) const;\n bool operator< (const torrent_handle& h) const;\n- bool operator== (const torrent_handle& h) const;\n std::uint32_t id () const;\n std::shared_ptr<torrent> native_handle () const;\n client_data_t userdata () const;\n bool in_session () const;\n \n static constexpr add_piece_flags_t overwrite_existing = 0_bit;\n static constexpr status_flags_t query_distributed_copies = 0_bit;\n@@ -18859,15 +18076,15 @@\n \n [report issue]\n torrent_handle()
\n \n torrent_handle () noexcept = default;\n
\n constructs a torrent handle that does not refer to a torrent.\n-i.e. is_valid() will return false.
\n+i.e. is_valid() will return false.\n [report issue]\n \n add_piece()
\n \n void add_piece (piece_index_t piece, std::vector<char> data, add_piece_flags_t flags = {}) const;\n void add_piece (piece_index_t piece, char const* data, add_piece_flags_t flags = {}) const;\n \n@@ -18910,39 +18127,39 @@\n \n have_piece()
\n \n bool have_piece (piece_index_t piece) const;\n
\n Returns true if this piece has been completely downloaded and written\n to disk, and false otherwise.
\n-\n-[report issue]\n-\n+\n+get_peer_info() post_peer_info()
\n \n void post_peer_info () const;\n void get_peer_info (std::vector<peer_info>& v) const;\n
\n Query information about connected peers for this torrent. If the\n torrent_handle is invalid, it will throw a system_error exception.
\n post_peer_info() is asynchronous and will trigger the posting of\n a peer_info_alert. The alert contain a list of peer_info objects, one\n for each connected peer.
\n get_peer_info() is synchronous and takes a reference to a vector\n that will be cleared and filled with one entry for each peer\n connected to this torrent, given the handle is valid. Each entry in\n the vector contains information about that particular peer. See\n peer_info.
\n-\n-[report issue]\n-\n+\n+status() post_status()
\n \n-torrent_status status (status_flags_t flags = status_flags_t::all()) const;\n void post_status (status_flags_t flags = status_flags_t::all()) const;\n+torrent_status status (status_flags_t flags = status_flags_t::all()) const;\n
\n status() will return a structure with information about the status\n of this torrent. If the torrent_handle is invalid, it will throw\n system_error exception. See torrent_status. The flags\n argument filters what information is returned in the torrent_status.\n Some information in there is relatively expensive to calculate, and if\n you're not interested in it (and see performance issues), you can\n@@ -18957,33 +18174,33 @@\n
By default everything is included. The flags you can use to decide\n what to include are defined in this class.
\n \n [report issue]\n \n post_download_queue() get_download_queue()
\n \n-std::vector<partial_piece_info> get_download_queue () const;\n void post_download_queue () const;\n+std::vector<partial_piece_info> get_download_queue () const;\n void get_download_queue (std::vector<partial_piece_info>& queue) const;\n
\n post_download_queue() triggers a download_queue_alert to be\n posted.\n get_download_queue() is a synchronous call and returns a vector\n with information about pieces that are partially downloaded or not\n downloaded but partially requested. See partial_piece_info for the\n fields in the returned vector.
\n-\n+\n \n-[report issue]\n-\n+\n+clear_piece_deadlines() set_piece_deadline() reset_piece_deadline()
\n \n void set_piece_deadline (piece_index_t index, int deadline, deadline_flags_t flags = {}) const;\n-void clear_piece_deadlines () const;\n void reset_piece_deadline (piece_index_t index) const;\n+void clear_piece_deadlines () const;\n \n This function sets or resets the deadline associated with a specific\n piece index (index). libtorrent will attempt to download this\n entire piece before the deadline expires. This is not necessarily\n possible, but pieces with a more recent deadline will always be\n prioritized over pieces with a deadline further ahead in time. The\n deadline (and flags) of a piece can be changed by calling this\n@@ -18994,22 +18211,22 @@\n
deadline is the number of milliseconds until this piece should be\n completed.
\n reset_piece_deadline removes the deadline from the piece. If it\n hasn't already been downloaded, it will no longer be considered a\n priority.
\n clear_piece_deadlines() removes deadlines on all pieces in\n the torrent. As if reset_piece_deadline() was called on all pieces.
\n-\n-[report issue]\n-\n+\n+post_file_progress() file_progress()
\n \n void file_progress (std::vector<std::int64_t>& progress, file_progress_flags_t flags = {}) const;\n-std::vector<std::int64_t> file_progress (file_progress_flags_t flags = {}) const;\n void post_file_progress (file_progress_flags_t flags) const;\n+std::vector<std::int64_t> file_progress (file_progress_flags_t flags = {}) const;\n \n This function fills in the supplied vector, or returns a vector, with\n the number of bytes downloaded of each file in this torrent. The\n progress values are ordered the same as the files in the\n torrent_info.
\n This operation is not very cheap. Its complexity is O(n + mj).\n Where n is the number of files, m is the number of currently\n@@ -19038,25 +18255,25 @@\n
\n clear_error()
\n \n void clear_error () const;\n
\n If the torrent is in an error state (i.e. torrent_status::error is\n non-empty), this will clear the error and start the torrent again.
\n-\n-\n+\n \n-[report issue]\n-\n+\n+post_trackers() replace_trackers() trackers() add_tracker()
\n \n void replace_trackers (std::vector<announce_entry> const&) const;\n-void post_trackers () const;\n void add_tracker (announce_entry const&) const;\n std::vector<announce_entry> trackers () const;\n+void post_trackers () const;\n
\n trackers() returns the list of trackers for this torrent. The\n announce entry contains both a string url which specify the\n announce url for the tracker as well as an int tier, which is\n specifies the order in which this tracker is tried. If you want\n libtorrent to use another list of trackers for this torrent, you can\n use replace_trackers() which takes a list of the same form as the\n@@ -19068,38 +18285,38 @@\n
add_tracker() will look if the specified tracker is already in the\n set. If it is, it doesn't do anything. If it's not in the current set\n of trackers, it will insert it in the tier specified in the\n announce_entry.
\n The updated set of trackers will be saved in the resume data, and when\n a torrent is started with resume data, the trackers from the resume\n data will replace the original ones.
\n-\n \n-[report issue]\n-\n+\n+remove_url_seed() add_url_seed() url_seeds()
\n \n-void add_url_seed (std::string const& url) const;\n void remove_url_seed (std::string const& url) const;\n std::set<std::string> url_seeds () const;\n+void add_url_seed (std::string const& url) const;\n
\n add_url_seed() adds another url to the torrent's list of url\n seeds. If the given url already exists in that list, the call has no\n effect. The torrent will connect to the server and try to download\n pieces from it, unless it's paused, queued, checking or seeding.\n remove_url_seed() removes the given url if it exists already.\n url_seeds() return a set of the url seeds currently in this\n torrent. Note that URLs that fails may be removed automatically from\n the list.
\n See http seeding for more information.
\n \n-\n-[report issue]\n-\n+\n+add_http_seed() remove_http_seed() http_seeds()
\n \n std::set<std::string> http_seeds () const;\n void add_http_seed (std::string const& url) const;\n void remove_http_seed (std::string const& url) const;\n
\n These functions are identical as the *_url_seed() variants, but\n they operate on BEP 17 web seeds instead of BEP 19.
\n@@ -19139,27 +18356,27 @@\n Returns true if this handle refers to a valid torrent and false if it\n hasn't been initialized or if the torrent it refers to has been\n removed from the session AND destructed.
\n To tell if the torrent_handle is in the session, use\n torrent_handle::in_session(). This will return true before\n session_handle::remove_torrent() is called, and false\n afterward.
\n-Clients should only use is_valid() to determine if the result of\n+
Clients should only use is_valid() to determine if the result of\n session::find_torrent() was successful.
\n-Unlike other member functions which return a value, is_valid()\n+
Unlike other member functions which return a value, is_valid()\n completes immediately, without blocking on a result from the\n network thread. Also unlike other functions, it never throws\n the system_error exception.
\n-\n-[report issue]\n-\n+\n+resume() pause()
\n \n-void pause (pause_flags_t flags = {}) const;\n void resume () const;\n+void pause (pause_flags_t flags = {}) const;\n \n pause(), and resume() will disconnect all peers and reconnect\n all peers respectively. When a torrent is paused, it will however\n remember all share ratios to all peers and remember all potential (not\n connected) peers. Torrents may be paused automatically if there is a\n file error (e.g. disk full) or something similar. See\n file_error_alert.
\n@@ -19170,24 +18387,24 @@\n \n Note
\n Torrents that are auto-managed may be automatically resumed again. It\n does not make sense to pause an auto-managed torrent without making it\n not auto-managed first. Torrents are auto-managed by default when added\n to the session. For more information, see queuing.
\n \n-\n+\n \n-[report issue]\n-\n+\n+unset_flags() set_flags() flags()
\n \n void set_flags (torrent_flags_t flags) const;\n+void unset_flags (torrent_flags_t flags) const;\n void set_flags (torrent_flags_t flags, torrent_flags_t mask) const;\n torrent_flags_t flags () const;\n-void unset_flags (torrent_flags_t flags) const;\n
\n sets and gets the torrent state flags. See torrent_flags_t.\n The set_flags overload that take a mask will affect all\n flags part of the mask, and set their values to what the\n flags argument is set to. This allows clearing and\n setting flags in a single function call.\n The set_flags overload that just takes flags, sets all\n@@ -19246,15 +18463,15 @@\n
- No torrent state has changed since the last saving of resume\n data, and the only_if_modified flag is set.\n metadata (see libtorrent's metadata from peers extension)
\n \n \n Note that some counters may be outdated by the time you receive the fast resume data
\n When saving resume data because of shutting down, make sure not to\n-remove_torrent() before you receive the save_resume_data_alert.\n+remove_torrent() before you receive the save_resume_data_alert.\n There's no need to pause the session or torrent when saving resume\n data.
\n The paused state of a torrent is saved in the resume data, so pausing\n all torrents before saving resume data will all torrents be restored\n in a paused state.
\n \n Note
\n@@ -19324,16 +18541,16 @@\n report that they don't need to save resume data again, and skipped by\n the initial loop, and thwart the counter otherwise.\n \n [report issue]\n \n need_save_resume_data()
\n \n-bool need_save_resume_data (resume_data_flags_t flags) const;\n bool need_save_resume_data () const;\n+bool need_save_resume_data (resume_data_flags_t flags) const;\n
\n This function returns true if anything that is stored in the resume\n data has changed since the last time resume data was saved.\n The overload that takes flags let you ask if specific categories\n of properties have changed. These flags have the same behavior as in\n the save_resume_data() call.
\n This is a blocking call. It will wait for a response from\n@@ -19343,27 +18560,27 @@\n
\n Note
\n A torrent's resume data is considered saved as soon as the\n save_resume_data_alert is posted. It is important to make sure this\n alert is received and handled in order for this function to be\n meaningful.
\n \n+\n+\n \n \n-\n-\n-[report issue]\n-\n-queue_position_bottom() queue_position() queue_position_up() queue_position_top() queue_position_down()
\n+[report issue]\n+\n+queue_position_top() queue_position_down() queue_position_bottom() queue_position() queue_position_up()
\n \n-void queue_position_down () const;\n-void queue_position_top () const;\n-void queue_position_bottom () const;\n queue_position_t queue_position () const;\n void queue_position_up () const;\n+void queue_position_down () const;\n+void queue_position_bottom () const;\n+void queue_position_top () const;\n
\n Every torrent that is added is assigned a queue position exactly one\n greater than the greatest queue position of all existing torrents.\n Torrents that are being seeded have -1 as their queue position, since\n they're no longer in line to be downloaded.
\n When a torrent is removed or turns into a seed, all torrents with\n greater queue positions have their positions decreased to fill in the\n@@ -19387,21 +18604,21 @@\n of all other torrents remain intact but their numerical queue position\n shifts to make space for this torrent's new position
\n \n [report issue]\n \n set_ssl_certificate_buffer() set_ssl_certificate()
\n \n-void set_ssl_certificate_buffer (std::string const& certificate\n- , std::string const& private_key\n- , std::string const& dh_params);\n void set_ssl_certificate (std::string const& certificate\n , std::string const& private_key\n , std::string const& dh_params\n , std::string const& passphrase = "");\n+void set_ssl_certificate_buffer (std::string const& certificate\n+ , std::string const& private_key\n+ , std::string const& dh_params);\n
\n For SSL torrents, use this to specify a path to a .pem file to use as\n this client's certificate. The certificate must be signed by the\n certificate in the .torrent file to be valid.
\n The set_ssl_certificate_buffer() overload takes the actual certificate,\n private key and DH params as strings, rather than paths to files.
\n cert is a path to the (signed) certificate in .pem format\n@@ -19422,16 +18639,16 @@\n provide a valid cert. If you don't have a cert you won't be allowed to\n connect to any peers.
\n \n [report issue]\n \n torrent_file_with_hashes() torrent_file()
\n \n-std::shared_ptr<torrent_info> torrent_file_with_hashes () const;\n std::shared_ptr<const torrent_info> torrent_file () const;\n+std::shared_ptr<torrent_info> torrent_file_with_hashes () const;\n
\n torrent_file() returns a pointer to the torrent_info object\n associated with this torrent. The torrent_info object may be a copy\n of the internal object. If the torrent doesn't have metadata, the\n pointer will not be initialized (i.e. a nullptr). The torrent may be\n in a state without metadata only if it was started without a .torrent\n file, e.g. by being added by magnet link.
\n@@ -19481,24 +18698,24 @@\n post_piece_availability() will trigger a piece_availability_alert\n to be posted.
\n piece_availability() fills the specified std::vector<int>\n with the availability for each piece in this torrent. libtorrent does\n not keep track of availability for seeds, so if the torrent is\n seeding the availability for all pieces is reported as 0.
\n \n-\n-[report issue]\n-\n+\n+get_piece_priorities() prioritize_pieces() piece_priority()
\n \n void piece_priority (piece_index_t index, download_priority_t priority) const;\n-void prioritize_pieces (std::vector<std::pair<piece_index_t, download_priority_t>> const& pieces) const;\n download_priority_t piece_priority (piece_index_t index) const;\n-void prioritize_pieces (std::vector<download_priority_t> const& pieces) const;\n std::vector<download_priority_t> get_piece_priorities () const;\n+void prioritize_pieces (std::vector<download_priority_t> const& pieces) const;\n+void prioritize_pieces (std::vector<std::pair<piece_index_t, download_priority_t>> const& pieces) const;\n
\n These functions are used to set and get the priority of individual\n pieces. By default all pieces have priority 4. That means that the\n random rarest first algorithm is effectively active for all pieces.\n You may however change the priority of individual pieces. There are 8\n priority levels. 0 means not to download the piece at all. Otherwise,\n lower priority values means less likely to be picked. Piece priority\n@@ -19561,22 +18778,22 @@\n
When combining file- and piece priorities, the resume file will record\n both. When loading the resume data, the file priorities will be applied\n first, then the piece priorities.
\n Moving data from a file into the part file is currently not\n supported. If a file has its priority set to 0 after it has already\n been created, it will not be moved into the partfile.
\n \n-\n-[report issue]\n-\n+\n+force_reannounce() force_dht_announce() force_lsd_announce()
\n \n-void force_lsd_announce () const;\n void force_dht_announce () const;\n void force_reannounce (int seconds = 0, int idx = -1, reannounce_flags_t = {}) const;\n+void force_lsd_announce () const;\n \n force_reannounce() will force this torrent to do another tracker\n request, to receive new peers. The seconds argument specifies how\n many seconds from now to issue the tracker announces.
\n If the tracker's min_interval has not passed since the last\n announce, the forced announce will be scheduled to happen immediately\n as the min_interval expires. This is to honor trackers minimum\n@@ -19600,25 +18817,25 @@\n idx is >= 0, the tracker with the specified index will scraped.
\n A scrape request queries the tracker for statistics such as total\n number of incomplete peers, complete peers, number of downloads etc.
\n This request will specifically update the num_complete and\n num_incomplete fields in the torrent_status struct once it\n completes. When it completes, it will generate a scrape_reply_alert.\n If it fails, it will generate a scrape_failed_alert.
\n-\n+\n \n \n-[report issue]\n-\n+\n+set_upload_limit() upload_limit() set_download_limit() download_limit()
\n \n-int upload_limit () const;\n-int download_limit () const;\n void set_upload_limit (int limit) const;\n void set_download_limit (int limit) const;\n+int upload_limit () const;\n+int download_limit () const;\n
\n set_upload_limit will limit the upload bandwidth used by this\n particular torrent to the limit you set. It is given as the number of\n bytes per second the torrent is allowed to upload.\n set_download_limit works the same way but for download bandwidth\n instead of upload bandwidth. Note that setting a higher limit on a\n torrent then the global limit\n@@ -19741,37 +18958,37 @@\n
rename_file()
\n \n void rename_file (file_index_t index, std::string const& new_name) const;\n
\n Renames the file with the given index asynchronously. The rename\n operation is complete when either a file_renamed_alert or\n file_rename_failed_alert is posted.
\n-\n-[report issue]\n-\n+\n+info_hashes() info_hash()
\n \n-sha1_hash info_hash () const;\n info_hash_t info_hashes () const;\n+sha1_hash info_hash () const;\n
\n returns the info-hash(es) of the torrent. If this handle is to a\n torrent that hasn't loaded yet (for instance by being added) by a\n URL, the returned value is undefined.\n The info_hash() returns the SHA-1 info-hash for v1 torrents and a\n truncated hash for v2 torrents. For the full v2 info-hash, use\n info_hashes() instead.
\n \n-\n-[report issue]\n+\n+[report issue]\n \n-operator==() operator!=() operator<()
\n+operator==() operator<() operator!=()
\n \n+bool operator== (const torrent_handle& h) const;\n bool operator!= (const torrent_handle& h) const;\n bool operator< (const torrent_handle& h) const;\n-bool operator== (const torrent_handle& h) const;\n
\n comparison operators. The order of the torrents is unspecified\n but stable.
\n [report issue]\n \n id()
\n \n@@ -19960,366 +19177,1123 @@\n \n hash_value()
\n Declared in "libtorrent/torrent_handle.hpp"
\n \n std::size_t hash_value (torrent_handle const& h);\n
\n for std::hash (and to support using this type in unordered_map etc.)
\n-[report issue]\n-\n-bdecode_node
\n-Declared in "libtorrent/bdecode.hpp"
\n-Sometimes it's important to get a non-owning reference to the root node (\n-to be able to copy it as a reference for instance). For that, use the\n-non_owning() member function.
\n-There are 5 different types of nodes, see type_t.
\n+[report issue]\n+\n+torrent_status
\n+Declared in "libtorrent/torrent_status.hpp"
\n+holds a snapshot of the status of a torrent, as queried by\n+torrent_handle::status().
\n \n-struct bdecode_node\n+struct torrent_status\n {\n- bdecode_node () = default;\n- bdecode_node& operator= (bdecode_node&&) & = default;\n- bdecode_node (bdecode_node&&) noexcept;\n- bdecode_node (bdecode_node const&);\n- bdecode_node& operator= (bdecode_node const&) &;\n- type_t type () const noexcept;\n- explicit operator bool () const noexcept;\n- bdecode_node non_owning () const;\n- std::ptrdiff_t data_offset () const noexcept;\n- span<char const> data_section () const noexcept;\n- int list_size () const;\n- std::int64_t list_int_value_at (int i\n- , std::int64_t default_val = 0) const;\n- bdecode_node list_at (int i) const;\n- string_view list_string_value_at (int i\n- , string_view default_val = string_view()) const;\n- int dict_size () const;\n- bdecode_node dict_find_list (string_view key) const;\n- std::pair<string_view, bdecode_node> dict_at (int i) const;\n- bdecode_node dict_find_dict (string_view key) const;\n- bdecode_node dict_find_string (string_view key) const;\n- std::pair<bdecode_node, bdecode_node> dict_at_node (int i) const;\n- string_view dict_find_string_value (string_view key\n- , string_view default_value = string_view()) const;\n- std::int64_t dict_find_int_value (string_view key\n- , std::int64_t default_val = 0) const;\n- bdecode_node dict_find_int (string_view key) const;\n- bdecode_node dict_find (string_view key) const;\n- std::int64_t int_value () const;\n- string_view string_value () const;\n- int string_length () const;\n- std::ptrdiff_t string_offset () const;\n- char const* string_ptr () const;\n- void clear ();\n- void swap (bdecode_node& n);\n- void reserve (int tokens);\n- void switch_underlying_buffer (char const* buf) noexcept;\n- bool has_soft_error (span<char> error) const;\n+ bool operator== (torrent_status const& st) const;\n \n- enum type_t\n+ enum state_t\n {\n- none_t,\n- dict_t,\n- list_t,\n- string_t,\n- int_t,\n+ checking_files,\n+ downloading_metadata,\n+ downloading,\n+ finished,\n+ seeding,\n+ unused_enum_for_backwards_compatibility_allocating,\n+ checking_resume_data,\n };\n+\n+ torrent_handle handle;\n+ error_code errc;\n+ file_index_t error_file = torrent_status::error_file_none;\n+ static constexpr file_index_t error_file_none {-1};\n+ static constexpr file_index_t error_file_ssl_ctx {-3};\n+ static constexpr file_index_t error_file_metadata {-4};\n+ static constexpr file_index_t error_file_exception {-5};\n+ static constexpr file_index_t error_file_partfile {-6};\n+ std::string save_path;\n+ std::string name;\n+ std::weak_ptr<const torrent_info> torrent_file;\n+ time_duration next_announce = seconds{0};\n+ std::string current_tracker;\n+ std::int64_t total_download = 0;\n+ std::int64_t total_upload = 0;\n+ std::int64_t total_payload_download = 0;\n+ std::int64_t total_payload_upload = 0;\n+ std::int64_t total_failed_bytes = 0;\n+ std::int64_t total_redundant_bytes = 0;\n+ typed_bitfield<piece_index_t> pieces;\n+ typed_bitfield<piece_index_t> verified_pieces;\n+ std::int64_t total_done = 0;\n+ std::int64_t total = 0;\n+ std::int64_t total_wanted_done = 0;\n+ std::int64_t total_wanted = 0;\n+ std::int64_t all_time_upload = 0;\n+ std::int64_t all_time_download = 0;\n+ std::time_t added_time = 0;\n+ std::time_t completed_time = 0;\n+ std::time_t last_seen_complete = 0;\n+ storage_mode_t storage_mode = storage_mode_sparse;\n+ float progress = 0.f;\n+ int progress_ppm = 0;\n+ queue_position_t queue_position {};\n+ int download_rate = 0;\n+ int upload_rate = 0;\n+ int download_payload_rate = 0;\n+ int upload_payload_rate = 0;\n+ int num_seeds = 0;\n+ int num_peers = 0;\n+ int num_complete = -1;\n+ int num_incomplete = -1;\n+ int list_seeds = 0;\n+ int list_peers = 0;\n+ int connect_candidates = 0;\n+ int num_pieces = 0;\n+ int distributed_full_copies = 0;\n+ int distributed_fraction = 0;\n+ float distributed_copies = 0.f;\n+ int block_size = 0;\n+ int num_uploads = 0;\n+ int num_connections = 0;\n+ int uploads_limit = 0;\n+ int connections_limit = 0;\n+ int up_bandwidth_queue = 0;\n+ int down_bandwidth_queue = 0;\n+ int seed_rank = 0;\n+ state_t state = checking_resume_data;\n+ bool need_save_resume = false;\n+ bool is_seeding = false;\n+ bool is_finished = false;\n+ bool has_metadata = false;\n+ bool has_incoming = false;\n+ bool moving_storage = false;\n+ bool announcing_to_trackers = false;\n+ bool announcing_to_lsd = false;\n+ bool announcing_to_dht = false;\n+ info_hash_t info_hashes;\n+ time_point last_upload;\n+ time_point last_download;\n+ seconds active_duration;\n+ seconds finished_duration;\n+ seconds seeding_duration;\n+ torrent_flags_t flags {};\n };\n \n-[report issue]\n-bdecode_node()
\n-\n-bdecode_node () = default;\n-
\n-creates a default constructed node, it will have the type none_t.
\n-\n-[report issue]\n-\n-operator=() bdecode_node()
\n-\n-bdecode_node& operator= (bdecode_node&&) & = default;\n-bdecode_node (bdecode_node&&) noexcept;\n-bdecode_node (bdecode_node const&);\n-bdecode_node& operator= (bdecode_node const&) &;\n-
\n-For owning nodes, the copy will create a copy of the tree, but the\n-underlying buffer remains the same.
\n-[report issue]\n-\n-type()
\n-\n-type_t type () const noexcept;\n-
\n-the type of this node. See type_t.
\n-[report issue]\n-\n-bool()
\n-\n-explicit operator bool () const noexcept;\n-
\n-returns true if type() != none_t.
\n-[report issue]\n-\n-non_owning()
\n-\n-bdecode_node non_owning () const;\n-
\n-return a non-owning reference to this node. This is useful to refer to\n-the root node without copying it in assignments.
\n-\n-[report issue]\n-\n-data_section() data_offset()
\n-\n-std::ptrdiff_t data_offset () const noexcept;\n-span<char const> data_section () const noexcept;\n-
\n-returns the buffer and length of the section in the original bencoded\n-buffer where this node is defined. For a dictionary for instance, this\n-starts with d and ends with e, and has all the content of the\n-dictionary in between.\n-the data_offset() function returns the byte-offset to this node in,\n-starting from the beginning of the buffer that was parsed.
\n-\n-\n-\n-[report issue]\n-\n-list_int_value_at() list_string_value_at() list_size() list_at()
\n+[report issue]\n+operator==()
\n \n-int list_size () const;\n-std::int64_t list_int_value_at (int i\n- , std::int64_t default_val = 0) const;\n-bdecode_node list_at (int i) const;\n-string_view list_string_value_at (int i\n- , string_view default_val = string_view()) const;\n+bool operator== (torrent_status const& st) const;\n
\n-functions with the list_ prefix operate on lists. These functions are\n-only valid if type() == list_t. list_at() returns the item\n-in the list at index i. i may not be greater than or equal to the\n-size of the list. size() returns the size of the list.
\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-[report issue]\n-\n-dict_size() dict_find_int() dict_find_list() dict_at() dict_find_dict() dict_find_int_value() dict_find_string() dict_find() dict_find_string_value() dict_at_node()
\n+compares if the torrent status objects come from the same torrent. i.e.\n+only the torrent_handle field is compared.
\n+[report issue]\n+\n+enum state_t
\n+Declared in "libtorrent/torrent_status.hpp"
\n+\n+\n+ \n+\n+name \n+value \n+description \n+checking_files \n+1 \n+The torrent has not started its download yet, and is\n+currently checking existing files. \n+downloading_metadata \n+2 \n+The torrent is trying to download metadata from peers.\n+This implies the ut_metadata extension is in use. \n+downloading \n+3 \n+The torrent is being downloaded. This is the state\n+most torrents will be in most of the time. The progress\n+meter will tell how much of the files that has been\n+downloaded. \n+finished \n+4 \n+In this state the torrent has finished downloading but\n+still doesn't have the entire torrent. i.e. some pieces\n+are filtered and won't get downloaded. \n+seeding \n+5 \n+In this state the torrent has finished downloading and\n+is a pure seeder. \n+unused_enum_for_backwards_compatibility_allocating \n+6 \n+If the torrent was started in full allocation mode, this\n+indicates that the (disk) storage for the torrent is\n+allocated. \n+checking_resume_data \n+7 \n+The torrent is currently checking the fast resume data and\n+comparing it to the files on disk. This is typically\n+completed in a fraction of a second, but if you add a\n+large number of torrents at once, they will queue up. \n+
\n+[report issue]\n+- handle
\n+- a handle to the torrent whose status the object represents.
\n+
\n+[report issue]\n+- errc
\n+- may be set to an error code describing why the torrent was paused, in\n+case it was paused by an error. If the torrent is not paused or if it's\n+paused but not because of an error, this error_code is not set.\n+if the error is attributed specifically to a file, error_file is set to\n+the index of that file in the .torrent file.
\n+
\n+[report issue]\n+- error_file
\n+- if the torrent is stopped because of an disk I/O error, this field\n+contains the index of the file in the torrent that encountered the\n+error. If the error did not originate in a file in the torrent, there\n+are a few special values this can be set to: error_file_none,\n+error_file_ssl_ctx, error_file_exception, error_file_partfile or\n+error_file_metadata;
\n+
\n+[report issue]\n+- error_file_none
\n+- special values for error_file to describe which file or component\n+encountered the error (errc).\n+the error did not occur on a file
\n+
\n+[report issue]\n+- error_file_ssl_ctx
\n+- the error occurred setting up the SSL context
\n+
\n+[report issue]\n+- error_file_metadata
\n+- the error occurred while loading the metadata for the torrent
\n+
\n+[report issue]\n+- error_file_exception
\n+- there was a serious error reported in this torrent. The error code\n+or a torrent log alert may provide more information.
\n+
\n+[report issue]\n+- error_file_partfile
\n+- the error occurred with the partfile
\n+
\n+[report issue]\n+- save_path
\n+- the path to the directory where this torrent's files are stored.\n+It's typically the path as was given to async_add_torrent() or\n+add_torrent() when this torrent was started. This field is only\n+included if the torrent status is queried with\n+torrent_handle::query_save_path.
\n+
\n+[report issue]\n+- name
\n+- the name of the torrent. Typically this is derived from the\n+.torrent file. In case the torrent was started without metadata,\n+and hasn't completely received it yet, it returns the name given\n+to it when added to the session. See session::add_torrent.\n+This field is only included if the torrent status is queried\n+with torrent_handle::query_name.
\n+
\n+[report issue]\n+- torrent_file
\n+- set to point to the torrent_info object for this torrent. It's\n+only included if the torrent status is queried with\n+torrent_handle::query_torrent_file.
\n+
\n+[report issue]\n+- next_announce
\n+- the time until the torrent will announce itself to the tracker.
\n+
\n+[report issue]\n+- current_tracker
\n+- the URL of the last working tracker. If no tracker request has\n+been successful yet, it's set to an empty string.
\n+
\n+\n+[report issue]\n+- total_download total_upload
\n+- the number of bytes downloaded and uploaded to all peers, accumulated,\n+this session only. The session is considered to restart when a\n+torrent is paused and restarted again. When a torrent is paused, these\n+counters are reset to 0. If you want complete, persistent, stats, see\n+all_time_upload and all_time_download.
\n+
\n+\n+[report issue]\n+- total_payload_download total_payload_upload
\n+- counts the amount of bytes send and received this session, but only\n+the actual payload data (i.e the interesting data), these counters\n+ignore any protocol overhead. The session is considered to restart\n+when a torrent is paused and restarted again. When a torrent is\n+paused, these counters are reset to 0.
\n+
\n+[report issue]\n+- total_failed_bytes
\n+- the number of bytes that has been downloaded and that has failed the\n+piece hash test. In other words, this is just how much crap that has\n+been downloaded since the torrent was last started. If a torrent is\n+paused and then restarted again, this counter will be reset.
\n+
\n+[report issue]\n+- total_redundant_bytes
\n+- the number of bytes that has been downloaded even though that data\n+already was downloaded. The reason for this is that in some situations\n+the same data can be downloaded by mistake. When libtorrent sends\n+requests to a peer, and the peer doesn't send a response within a\n+certain timeout, libtorrent will re-request that block. Another\n+situation when libtorrent may re-request blocks is when the requests\n+it sends out are not replied in FIFO-order (it will re-request blocks\n+that are skipped by an out of order block). This is supposed to be as\n+low as possible. This only counts bytes since the torrent was last\n+started. If a torrent is paused and then restarted again, this counter\n+will be reset.
\n+
\n+[report issue]\n+- pieces
\n+- a bitmask that represents which pieces we have (set to true) and the\n+pieces we don't have. It's a pointer and may be set to 0 if the\n+torrent isn't downloading or seeding.
\n+
\n+[report issue]\n+- verified_pieces
\n+- a bitmask representing which pieces has had their hash checked. This\n+only applies to torrents in seed mode. If the torrent is not in seed\n+mode, this bitmask may be empty.
\n+
\n+[report issue]\n+- total_done
\n+- the total number of bytes of the file(s) that we have. All this does\n+not necessarily has to be downloaded during this session (that's\n+total_payload_download).
\n+
\n+[report issue]\n+- total
\n+- the total number of bytes to download for this torrent. This\n+may be less than the size of the torrent in case there are\n+pad files. This number only counts bytes that will actually\n+be requested from peers.
\n+
\n+[report issue]\n+- total_wanted_done
\n+- the number of bytes we have downloaded, only counting the pieces that\n+we actually want to download. i.e. excluding any pieces that we have\n+but have priority 0 (i.e. not wanted).\n+Once a torrent becomes seed, any piece- and file priorities are\n+forgotten and all bytes are considered "wanted".
\n+
\n+[report issue]\n+- total_wanted
\n+- The total number of bytes we want to download. This may be smaller\n+than the total torrent size in case any pieces are prioritized to 0,\n+i.e. not wanted.\n+Once a torrent becomes seed, any piece- and file priorities are\n+forgotten and all bytes are considered "wanted".
\n+
\n+\n+[report issue]\n+- all_time_upload all_time_download
\n+- are accumulated upload and download payload byte counters. They are\n+saved in and restored from resume data to keep totals across sessions.
\n+
\n+[report issue]\n+- added_time
\n+- the posix-time when this torrent was added. i.e. what time(nullptr)\n+returned at the time.
\n+
\n+[report issue]\n+- completed_time
\n+- the posix-time when this torrent was finished. If the torrent is not\n+yet finished, this is 0.
\n+
\n+[report issue]\n+- last_seen_complete
\n+- the time when we, or one of our peers, last saw a complete copy of\n+this torrent.
\n+
\n+[report issue]\n+- storage_mode
\n+- The allocation mode for the torrent. See storage_mode_t for the\n+options. For more information, see storage allocation.
\n+
\n+[report issue]\n+- progress
\n+- a value in the range [0, 1], that represents the progress of the\n+torrent's current task. It may be checking files or downloading.
\n+
\n+[report issue]\n+- progress_ppm
\n+progress parts per million (progress * 1000000) when disabling\n+floating point operations, this is the only option to query progress
\n+reflects the same value as progress, but instead in a range [0,\n+1000000] (ppm = parts per million). When floating point operations are\n+disabled, this is the only alternative to the floating point value in\n+progress.
\n+
\n+[report issue]\n+- queue_position
\n+- the position this torrent has in the download\n+queue. If the torrent is a seed or finished, this is -1.
\n+
\n+\n+[report issue]\n+- download_rate upload_rate
\n+- the total rates for all peers for this torrent. These will usually\n+have better precision than summing the rates from all peers. The rates\n+are given as the number of bytes per second.
\n+
\n+\n+[report issue]\n+- download_payload_rate upload_payload_rate
\n+- the total transfer rate of payload only, not counting protocol\n+chatter. This might be slightly smaller than the other rates, but if\n+projected over a long time (e.g. when calculating ETA:s) the\n+difference may be noticeable.
\n+
\n+[report issue]\n+- num_seeds
\n+- the number of peers that are seeding that this client is\n+currently connected to.
\n+
\n+[report issue]\n+- num_peers
\n+- the number of peers this torrent currently is connected to. Peer\n+connections that are in the half-open state (is attempting to connect)\n+or are queued for later connection attempt do not count. Although they\n+are visible in the peer list when you call get_peer_info().
\n+
\n+\n+[report issue]\n+- num_complete num_incomplete
\n+- if the tracker sends scrape info in its announce reply, these fields\n+will be set to the total number of peers that have the whole file and\n+the total number of peers that are still downloading. set to -1 if the\n+tracker did not send any scrape data in its announce reply.
\n+
\n+\n+[report issue]\n+- list_seeds list_peers
\n+- the number of seeds in our peer list and the total number of peers\n+(including seeds). We are not necessarily connected to all the peers\n+in our peer list. This is the number of peers we know of in total,\n+including banned peers and peers that we have failed to connect to.
\n+
\n+[report issue]\n+- connect_candidates
\n+- the number of peers in this torrent's peer list that is a candidate to\n+be connected to. i.e. It has fewer connect attempts than the max fail\n+count, it is not a seed if we are a seed, it is not banned etc. If\n+this is 0, it means we don't know of any more peers that we can try.
\n+
\n+[report issue]\n+- num_pieces
\n+- the number of pieces that has been downloaded. It is equivalent to:\n+std::accumulate(pieces->begin(), pieces->end()). So you don't have\n+to count yourself. This can be used to see if anything has updated\n+since last time if you want to keep a graph of the pieces up to date.
\n+
\n+[report issue]\n+- distributed_full_copies
\n+- the number of distributed copies of the torrent. Note that one copy\n+may be spread out among many peers. It tells how many copies there are\n+currently of the rarest piece(s) among the peers this client is\n+connected to.
\n+
\n+[report issue]\n+- distributed_fraction
\n+tells the share of pieces that have more copies than the rarest\n+piece(s). Divide this number by 1000 to get the fraction.
\n+For example, if distributed_full_copies is 2 and\n+distributed_fraction is 500, it means that the rarest pieces have\n+only 2 copies among the peers this torrent is connected to, and that\n+50% of all the pieces have more than two copies.
\n+If we are a seed, the piece picker is deallocated as an optimization,\n+and piece availability is no longer tracked. In this case the\n+distributed copies members are set to -1.
\n+
\n+[report issue]\n+- distributed_copies
\n+the number of distributed copies of the file. note that one copy may\n+be spread out among many peers. This is a floating point\n+representation of the distributed copies.
\n+\n+- the integer part tells how many copies
\n+- there are of the rarest piece(s)
\n+- the fractional part tells the fraction of pieces that
\n+- have more copies than the rarest piece(s).
\n+
\n+
\n+[report issue]\n+- block_size
\n+- the size of a block, in bytes. A block is a sub piece, it is the\n+number of bytes that each piece request asks for and the number of\n+bytes that each bit in the partial_piece_info's bitset represents,\n+see get_download_queue(). This is typically 16 kB, but it may be\n+smaller, if the pieces are smaller.
\n+
\n+[report issue]\n+- num_uploads
\n+- the number of unchoked peers in this torrent.
\n+
\n+[report issue]\n+- num_connections
\n+- the number of peer connections this torrent has, including half-open\n+connections that hasn't completed the bittorrent handshake yet. This\n+is always >= num_peers.
\n+
\n+[report issue]\n+- uploads_limit
\n+- the set limit of upload slots (unchoked peers) for this torrent.
\n+
\n+[report issue]\n+- connections_limit
\n+- the set limit of number of connections for this torrent.
\n+
\n+\n+[report issue]\n+- up_bandwidth_queue down_bandwidth_queue
\n+- the number of peers in this torrent that are waiting for more\n+bandwidth quota from the torrent rate limiter. This can determine if\n+the rate you get from this torrent is bound by the torrents limit or\n+not. If there is no limit set on this torrent, the peers might still\n+be waiting for bandwidth quota from the global limiter, but then they\n+are counted in the session_status object.
\n+
\n+[report issue]\n+- seed_rank
\n+- A rank of how important it is to seed the torrent, it is used to\n+determine which torrents to seed and which to queue. It is based on\n+the peer to seed ratio from the tracker scrape. For more information,\n+see queuing. Higher value means more important to seed
\n+
\n+[report issue]\n+- state
\n+- the main state the torrent is in. See torrent_status::state_t.
\n+
\n+[report issue]\n+- need_save_resume
\n+- true if this torrent has unsaved changes\n+to its download state and statistics since the last resume data\n+was saved.
\n+
\n+[report issue]\n+- is_seeding
\n+- true if all pieces have been downloaded.
\n+
\n+[report issue]\n+- is_finished
\n+- true if all pieces that have a priority > 0 are downloaded. There is\n+only a distinction between finished and seeding if some pieces or\n+files have been set to priority 0, i.e. are not downloaded.
\n+
\n+[report issue]\n+- has_metadata
\n+- true if this torrent has metadata (either it was started from a\n+.torrent file or the metadata has been downloaded). The only scenario\n+where this can be false is when the torrent was started torrent-less\n+(i.e. with just an info-hash and tracker ip, a magnet link for\n+instance).
\n+
\n+[report issue]\n+- has_incoming
\n+- true if there has ever been an incoming connection attempt to this\n+torrent.
\n+
\n+[report issue]\n+- moving_storage
\n+- this is true if this torrent's storage is currently being moved from\n+one location to another. This may potentially be a long operation\n+if a large file ends up being copied from one drive to another.
\n+
\n+\n+\n+[report issue]\n+- announcing_to_trackers announcing_to_lsd announcing_to_dht
\n+- these are set to true if this torrent is allowed to announce to the\n+respective peer source. Whether they are true or false is determined by\n+the queue logic/auto manager. Torrents that are not auto managed will\n+always be allowed to announce to all peer sources.
\n+
\n+[report issue]\n+- info_hashes
\n+- the info-hash for this torrent
\n+
\n+\n+[report issue]\n+- last_upload last_download
\n+- the timestamps of the last time this torrent uploaded or downloaded\n+payload to any peer.
\n+
\n+\n+\n+[report issue]\n+- active_duration finished_duration seeding_duration
\n+- these are cumulative counters of for how long the torrent has been in\n+different states. active means not paused and added to session. Whether\n+it has found any peers or not is not relevant.\n+finished means all selected files/pieces were downloaded and available\n+to other peers (this is always a subset of active time).\n+seeding means all files/pieces were downloaded and available to\n+peers. Being available to peers does not imply there are other peers\n+asking for the payload.
\n+
\n+[report issue]\n+- flags
\n+- reflects several of the torrent's flags. For more\n+information, see torrent_handle::flags().
\n+
\n+[report issue]\n+\n+\n+ip_filter
\n+Declared in "libtorrent/ip_filter.hpp"
\n+The ip_filter class is a set of rules that uniquely categorizes all\n+ip addresses as allowed or disallowed. The default constructor creates\n+a single rule that allows all addresses (0.0.0.0 - 255.255.255.255 for\n+the IPv4 range, and the equivalent range covering all addresses for the\n+IPv6 range).
\n+A default constructed ip_filter does not filter any address.
\n \n-int dict_size () const;\n-bdecode_node dict_find_list (string_view key) const;\n-std::pair<string_view, bdecode_node> dict_at (int i) const;\n-bdecode_node dict_find_dict (string_view key) const;\n-bdecode_node dict_find_string (string_view key) const;\n-std::pair<bdecode_node, bdecode_node> dict_at_node (int i) const;\n-string_view dict_find_string_value (string_view key\n- , string_view default_value = string_view()) const;\n-std::int64_t dict_find_int_value (string_view key\n- , std::int64_t default_val = 0) const;\n-bdecode_node dict_find_int (string_view key) const;\n-bdecode_node dict_find (string_view key) const;\n+struct ip_filter\n+{\n+ ip_filter ();\n+ ~ip_filter ();\n+ ip_filter& operator= (ip_filter&&);\n+ ip_filter& operator= (ip_filter const&);\n+ ip_filter (ip_filter const&);\n+ ip_filter (ip_filter&&);\n+ bool empty () const;\n+ void add_rule (address const& first, address const& last, std::uint32_t flags);\n+ std::uint32_t access (address const& addr) const;\n+ filter_tuple_t export_filter () const;\n+\n+ enum access_flags\n+ {\n+ blocked,\n+ };\n+};\n \n-Functions with the dict_ prefix operates on dictionaries. They are\n-only valid if type() == dict_t. In case a key you're looking up\n-contains a 0 byte, you cannot use the 0-terminated string overloads,\n-but have to use string_view instead. dict_find_list will return a\n-valid bdecode_node if the key is found _and_ it is a list. Otherwise\n-it will return a default-constructed bdecode_node.
\n-Functions with the _value suffix return the value of the node\n-directly, rather than the nodes. In case the node is not found, or it has\n-a different type, a default value is returned (which can be specified).
\n-dict_at() returns the (key, value)-pair at the specified index in a\n-dictionary. Keys are only allowed to be strings. dict_at_node() also\n-returns the (key, value)-pair, but the key is returned as a\n-bdecode_node (and it will always be a string).
\n-[report issue]\n-\n-int_value()
\n+[report issue]\n+empty()
\n \n-std::int64_t int_value () const;\n+bool empty () const;\n
\n-this function is only valid if type() == int_t. It returns the\n-value of the integer.
\n-\n-\n-\n-[report issue]\n-\n-string_ptr() string_offset() string_value() string_length()
\n+returns true if the filter does not contain any rules
\n+[report issue]\n+\n+add_rule()
\n \n-string_view string_value () const;\n-int string_length () const;\n-std::ptrdiff_t string_offset () const;\n-char const* string_ptr () const;\n+void add_rule (address const& first, address const& last, std::uint32_t flags);\n
\n-these functions are only valid if type() == string_t. They return\n-the string values. Note that string_ptr() is not 0-terminated.\n-string_length() returns the number of bytes in the string.\n-string_offset() returns the byte offset from the start of the parsed\n-bencoded buffer this string can be found.
\n-[report issue]\n-\n-clear()
\n+Adds a rule to the filter. first and last defines a range of\n+ip addresses that will be marked with the given flags. The flags\n+can currently be 0, which means allowed, or ip_filter::blocked, which\n+means disallowed.
\n+precondition:\n+first.is_v4() == last.is_v4() && first.is_v6() == last.is_v6()
\n+postcondition:\n+access(x) == flags for every x in the range [first, last]
\n+This means that in a case of overlapping ranges, the last one applied takes\n+precedence.
\n+[report issue]\n+\n+access()
\n \n-void clear ();\n+std::uint32_t access (address const& addr) const;\n
\n-resets the bdecoded_node to a default constructed state. If this is\n-an owning node, the tree is freed and all child nodes are invalidated.
\n-[report issue]\n-\n-swap()
\n+Returns the access permissions for the given address (addr). The permission\n+can currently be 0 or ip_filter::blocked. The complexity of this operation\n+is O(log n), where n is the minimum number of non-overlapping ranges to describe\n+the current filter.
\n+[report issue]\n+\n+export_filter()
\n \n-void swap (bdecode_node& n);\n+filter_tuple_t export_filter () const;\n
\n-Swap contents.
\n-[report issue]\n-\n-reserve()
\n+This function will return the current state of the filter in the minimum number of\n+ranges possible. They are sorted from ranges in low addresses to high addresses. Each\n+entry in the returned vector is a range with the access control specified in its\n+flags field.
\n+The return value is a tuple containing two range-lists. One for IPv4 addresses\n+and one for IPv6 addresses.
\n+[report issue]\n+\n+enum access_flags
\n+Declared in "libtorrent/ip_filter.hpp"
\n+\n+\n+ \n+\n+name \n+value \n+description \n+blocked \n+1 \n+indicates that IPs in this range should not be connected\n+to nor accepted as incoming connections \n+
\n+[report issue]\n+\n+\n+port_filter
\n+Declared in "libtorrent/ip_filter.hpp"
\n+the port filter maps non-overlapping port ranges to flags. This\n+is primarily used to indicate whether a range of ports should\n+be connected to or not. The default is to have the full port\n+range (0-65535) set to flag 0.
\n \n-void reserve (int tokens);\n+class port_filter\n+{\n+ ~port_filter ();\n+ port_filter& operator= (port_filter const&);\n+ port_filter (port_filter&&);\n+ port_filter (port_filter const&);\n+ port_filter ();\n+ port_filter& operator= (port_filter&&);\n+ void add_rule (std::uint16_t first, std::uint16_t last, std::uint32_t flags);\n+ std::uint32_t access (std::uint16_t port) const;\n+\n+ enum access_flags\n+ {\n+ blocked,\n+ };\n+};\n \n-preallocate memory for the specified numbers of tokens. This is\n-useful if you know approximately how many tokens are in the file\n-you are about to parse. Doing so will save realloc operations\n-while parsing. You should only call this on the root node, before\n-passing it in to bdecode().
\n-[report issue]\n-\n-switch_underlying_buffer()
\n+[report issue]\n+add_rule()
\n \n-void switch_underlying_buffer (char const* buf) noexcept;\n+void add_rule (std::uint16_t first, std::uint16_t last, std::uint32_t flags);\n
\n-this buffer MUST be identical to the one originally parsed. This\n-operation is only defined on owning root nodes, i.e. the one passed in to\n-decode().
\n-[report issue]\n-\n-has_soft_error()
\n+set the flags for the specified port range (first, last) to\n+flags overwriting any existing rule for those ports. The range\n+is inclusive, i.e. the port last also has the flag set on it.
\n+[report issue]\n+\n+access()
\n \n-bool has_soft_error (span<char> error) const;\n+std::uint32_t access (std::uint16_t port) const;\n
\n-returns true if there is a non-fatal error in the bencoding of this node\n-or its children
\n-[report issue]\n-\n-enum type_t
\n-Declared in "libtorrent/bdecode.hpp"
\n+test the specified port (port) for whether it is blocked\n+or not. The returned value is the flags set for this port.\n+see access_flags.
\n+[report issue]\n+\n+enum access_flags
\n+Declared in "libtorrent/ip_filter.hpp"
\n \n \n \n \n name \n value \n description \n none_t \n-0 \n-uninitialized or default constructed. This is also used\n-to indicate that a node was not found in some cases. \n-dict_t \n+blocked \n 1 \n-a dictionary node. The dict_find_ functions are valid. \n-list_t \n-2 \n-a list node. The list_ functions are valid. \n-string_t \n-3 \n-a string node, the string_ functions are valid. \n-int_t \n-4 \n-an integer node. The int_ functions are valid. \n+this flag indicates that destination ports in the\n+range should not be connected to \n
\n-[report issue]\n+[report issue]\n \n-\n-print_entry()
\n-Declared in "libtorrent/bdecode.hpp"
\n-\n-std::string print_entry (bdecode_node const& e\n- , bool single_line = false, int indent = 0);\n-
\n-print the bencoded structure in a human-readable format to a string\n-that's returned.
\n-[report issue]\n-\n-bdecode()
\n-Declared in "libtorrent/bdecode.hpp"
\n+\n+add_torrent_params
\n+Declared in "libtorrent/add_torrent_params.hpp"
\n+The add_torrent_params contains all the information in a .torrent file\n+along with all information necessary to add that torrent to a session.\n+The key fields when adding a torrent are:
\n+\n+- ti - the immutable info-dict part of the torrent
\n+- info_hash - when you don't have the metadata (.torrent file). This\n+uniquely identifies the torrent and can validate the info-dict when\n+received from the swarm.
\n+
\n+In order to add a torrent to a session, one of those fields must be set\n+in addition to save_path. The add_torrent_params object can then be\n+passed into one of the session::add_torrent() overloads or\n+session::async_add_torrent().
\n+If you only specify the info-hash, the torrent file will be downloaded\n+from peers, which requires them to support the metadata extension. For\n+the metadata extension to work, libtorrent must be built with extensions\n+enabled (TORRENT_DISABLE_EXTENSIONS must not be defined). It also\n+takes an optional name argument. This may be left empty in case no\n+name should be assigned to the torrent. In case it's not, the name is\n+used for the torrent as long as it doesn't have metadata. See\n+torrent_handle::name.
\n+The add_torrent_params is also used when requesting resume data for a\n+torrent. It can be saved to and restored from a file and added back to a\n+new session. For serialization and de-serialization of\n+add_torrent_params objects, see read_resume_data() and\n+write_resume_data().
\n+The add_torrent_params is also used to represent a parsed .torrent\n+file. It can be loaded via load_torrent_file(), load_torrent_buffer() and\n+load_torrent_parsed(). It can be saved via write_torrent_file().
\n \n-bdecode_node bdecode (span<char const> buffer\n- , int depth_limit = 100, int token_limit = 2000000);\n-int bdecode (char const* start, char const* end, bdecode_node& ret\n- , error_code& ec, int* error_pos = nullptr, int depth_limit = 100\n- , int token_limit = 2000000);\n-bdecode_node bdecode (span<char const> buffer\n- , error_code& ec, int* error_pos = nullptr, int depth_limit = 100\n- , int token_limit = 2000000);\n+struct add_torrent_params\n+{\n+ int version = LIBTORRENT_VERSION_NUM;\n+ std::shared_ptr<torrent_info> ti;\n+ aux::noexcept_movable<std::vector<std::string>> trackers;\n+ aux::noexcept_movable<std::vector<int>> tracker_tiers;\n+ aux::noexcept_movable<std::vector<std::pair<std::string, int>>> dht_nodes;\n+ std::string name;\n+ std::string save_path;\n+ storage_mode_t storage_mode = storage_mode_sparse;\n+ client_data_t userdata;\n+ aux::noexcept_movable<std::vector<download_priority_t>> file_priorities;\n+ std::string trackerid;\n+ torrent_flags_t flags = torrent_flags::default_flags;\n+ info_hash_t info_hashes;\n+ int max_uploads = -1;\n+ int max_connections = -1;\n+ int upload_limit = -1;\n+ int download_limit = -1;\n+ std::int64_t total_uploaded = 0;\n+ std::int64_t total_downloaded = 0;\n+ int active_time = 0;\n+ int finished_time = 0;\n+ int seeding_time = 0;\n+ std::time_t added_time = 0;\n+ std::time_t completed_time = 0;\n+ std::time_t last_seen_complete = 0;\n+ int num_complete = -1;\n+ int num_incomplete = -1;\n+ int num_downloaded = -1;\n+ aux::noexcept_movable<std::vector<std::string>> http_seeds;\n+ aux::noexcept_movable<std::vector<std::string>> url_seeds;\n+ aux::noexcept_movable<std::vector<tcp::endpoint>> peers;\n+ aux::noexcept_movable<std::vector<tcp::endpoint>> banned_peers;\n+ aux::noexcept_movable<std::map<piece_index_t, bitfield>> unfinished_pieces;\n+ typed_bitfield<piece_index_t> have_pieces;\n+ typed_bitfield<piece_index_t> verified_pieces;\n+ aux::noexcept_movable<std::vector<download_priority_t>> piece_priorities;\n+ aux::vector<std::vector<sha256_hash>, file_index_t> merkle_trees;\n+ aux::vector<std::vector<bool>, file_index_t> merkle_tree_mask;\n+ aux::vector<std::vector<bool>, file_index_t> verified_leaf_hashes;\n+ aux::noexcept_movable<std::map<file_index_t, std::string>> renamed_files;\n+ std::time_t last_download = 0;\n+ std::time_t last_upload = 0;\n+};\n \n-This function decodes/parses bdecoded data (for example a .torrent file).\n-The data structure is returned in the ret argument. the buffer to parse\n-is specified by the start of the buffer as well as the end, i.e. one\n-byte past the end. If the buffer fails to parse, the function returns a\n-non-zero value and fills in ec with the error code. The optional\n-argument error_pos, if set to non-nullptr, will be set to the byte offset\n-into the buffer where the parse failure occurred.
\n-depth_limit specifies the max number of nested lists or dictionaries are\n-allowed in the data structure. (This affects the stack usage of the\n-function, be careful not to set it too high).
\n-token_limit is the max number of tokens allowed to be parsed from the\n-buffer. This is simply a sanity check to not have unbounded memory usage.
\n-The resulting bdecode_node is an owning node. That means it will\n-be holding the whole parsed tree. When iterating lists and dictionaries,\n-those bdecode_node objects will simply have references to the root or\n-owning bdecode_node. If the root node is destructed, all other nodes\n-that refer to anything in that tree become invalid.
\n-However, the underlying buffer passed in to this function (start, end)\n-must also remain valid while the bdecoded tree is used. The parsed tree\n-produced by this function does not copy any data out of the buffer, but\n-simply produces references back into it.
\n-[report issue]\n-\n-dht_state
\n-Declared in "libtorrent/kademlia/dht_state.hpp"
\n-This structure helps to store and load the state\n-of the dht_tracker.\n-At this moment the library is only a dual stack\n-implementation of the DHT. See BEP 32
\n+[report issue]\n+- version
\n+- filled in by the constructor and should be left untouched. It is used\n+for forward binary compatibility.
\n+
\n+[report issue]\n+- ti
\n+- torrent_info object with the torrent to add. Unless the\n+info_hash is set, this is required to be initialized.
\n+
\n+[report issue]\n+- trackers
\n+- If the torrent doesn't have a tracker, but relies on the DHT to find\n+peers, the trackers can specify tracker URLs for the torrent.
\n+
\n+[report issue]\n+- tracker_tiers
\n+- the tiers the URLs in trackers belong to. Trackers belonging to\n+different tiers may be treated differently, as defined by the multi\n+tracker extension. This is optional, if not specified trackers are\n+assumed to be part of tier 0, or whichever the last tier was as\n+iterating over the trackers.
\n+
\n+[report issue]\n+- dht_nodes
\n+- a list of hostname and port pairs, representing DHT nodes to be added\n+to the session (if DHT is enabled). The hostname may be an IP address.
\n+
\n+[report issue]\n+- name
\n+- in case there's no other name in this torrent, this name will be used.\n+The name out of the torrent_info object takes precedence if available.
\n+
\n+[report issue]\n+- save_path
\n+the path where the torrent is or will be stored.
\n+\n+Note
\n+On windows this path (and other paths) are interpreted as UNC\n+paths. This means they must use backslashes as directory separators\n+and may not contain the special directories "." or "..".
\n+\n+Setting this to an absolute path performs slightly better than a\n+relative path.
\n+
\n+[report issue]\n+- storage_mode
\n+- One of the values from storage_mode_t. For more information, see\n+storage allocation.
\n+
\n+[report issue]\n+- userdata
\n+- The userdata parameter is optional and will be passed on to the\n+extension constructor functions, if any\n+(see torrent_handle::add_extension()). It will also be stored in the\n+torrent object and can be retrieved by calling userdata().
\n+
\n+[report issue]\n+- file_priorities
\n+- can be set to control the initial file priorities when adding a\n+torrent. The semantics are the same as for\n+torrent_handle::prioritize_files(). The file priorities specified\n+in here take precedence over those specified in the resume data, if\n+any.\n+If this vector of file priorities is shorter than the number of files\n+in the torrent, the remaining files (not covered by this) will still\n+have the default download priority. This default can be changed by\n+setting the default_dont_download torrent_flag.
\n+
\n+[report issue]\n+- trackerid
\n+- the default tracker id to be used when announcing to trackers. By\n+default this is empty, and no tracker ID is used, since this is an\n+optional argument. If a tracker returns a tracker ID, that ID is used\n+instead of this.
\n+
\n+[report issue]\n+- flags
\n+flags controlling aspects of this torrent and how it's added. See\n+torrent_flags_t for details.
\n+\n+Note
\n+The flags field is initialized with default flags by the\n+constructor. In order to preserve default behavior when clearing or\n+setting other flags, make sure to bitwise OR or in a flag or bitwise\n+AND the inverse of a flag to clear it.
\n+\n+
\n+[report issue]\n+- info_hashes
\n+- set this to the info hash of the torrent to add in case the info-hash\n+is the only known property of the torrent. i.e. you don't have a\n+.torrent file nor a magnet link.\n+To add a magnet link, use parse_magnet_uri() to populate fields in the\n+add_torrent_params object.
\n+
\n+\n+[report issue]\n+- max_uploads max_connections
\n+max_uploads, max_connections, upload_limit,\n+download_limit correspond to the set_max_uploads(),\n+set_max_connections(), set_upload_limit() and\n+set_download_limit() functions on torrent_handle. These values let\n+you initialize these settings when the torrent is added, instead of\n+calling these functions immediately following adding it.
\n+-1 means unlimited on these settings just like their counterpart\n+functions on torrent_handle
\n+For fine grained control over rate limits, including making them apply\n+to local peers, see peer classes.
\n+
\n+\n+[report issue]\n+- upload_limit download_limit
\n+- the upload and download rate limits for this torrent, specified in\n+bytes per second. -1 means unlimited.
\n+
\n+\n+[report issue]\n+- total_uploaded total_downloaded
\n+- the total number of bytes uploaded and downloaded by this torrent so\n+far.
\n+
\n+\n+\n+[report issue]\n+- active_time finished_time seeding_time
\n+- the number of seconds this torrent has spent in started, finished and\n+seeding state so far, respectively.
\n+
\n+\n+[report issue]\n+- added_time completed_time
\n+- if set to a non-zero value, this is the posix time of when this torrent\n+was first added, including previous runs/sessions. If set to zero, the\n+internal added_time will be set to the time of when add_torrent() is\n+called.
\n+
\n+[report issue]\n+- last_seen_complete
\n+- if set to non-zero, initializes the time (expressed in posix time) when\n+we last saw a seed or peers that together formed a complete copy of the\n+torrent. If left set to zero, the internal counterpart to this field\n+will be updated when we see a seed or a distributed copies >= 1.0.
\n+
\n+\n+\n+[report issue]\n+- num_complete num_incomplete num_downloaded
\n+these field can be used to initialize the torrent's cached scrape data.\n+The scrape data is high level metadata about the current state of the\n+swarm, as returned by the tracker (either when announcing to it or by\n+sending a specific scrape request). num_complete is the number of\n+peers in the swarm that are seeds, or have every piece in the torrent.\n+num_incomplete is the number of peers in the swarm that do not have\n+every piece. num_downloaded is the number of times the torrent has\n+been downloaded (not initiated, but the number of times a download has\n+completed).
\n+Leaving any of these values set to -1 indicates we don't know, or we\n+have not received any scrape data.
\n+
\n+\n+[report issue]\n+- http_seeds url_seeds
\n+URLs can be added to these two lists to specify additional web\n+seeds to be used by the torrent. If the flag_override_web_seeds\n+is set, these will be the _only_ ones to be used. i.e. any web seeds\n+found in the .torrent file will be overridden.
\n+http_seeds expects URLs to web servers implementing the original HTTP\n+seed specification BEP 17.
\n+url_seeds expects URLs to regular web servers, aka "get right" style,\n+specified in BEP 19.
\n+
\n+[report issue]\n+- peers
\n+- peers to add to the torrent, to be tried to be connected to as\n+bittorrent peers.
\n+
\n+[report issue]\n+- banned_peers
\n+- peers banned from this torrent. The will not be connected to
\n+
\n+[report issue]\n+- unfinished_pieces
\n+- this is a map of partially downloaded piece. The key is the piece index\n+and the value is a bitfield where each bit represents a 16 kiB block.\n+A set bit means we have that block.
\n+
\n+[report issue]\n+- have_pieces
\n+- this is a bitfield indicating which pieces we already have of this\n+torrent.
\n+
\n+[report issue]\n+- verified_pieces
\n+- when in seed_mode, pieces with a set bit in this bitfield have been\n+verified to be valid. Other pieces will be verified the first time a\n+peer requests it.
\n+
\n+[report issue]\n+- piece_priorities
\n+- this sets the priorities for each individual piece in the torrent. Each\n+element in the vector represent the piece with the same index. If you\n+set both file- and piece priorities, file priorities will take\n+precedence.
\n+
\n+[report issue]\n+- merkle_trees
\n+- v2 hashes, if known
\n+
\n+[report issue]\n+- merkle_tree_mask
\n+- if set, indicates which hashes are included in the corresponding\n+vector of merkle_trees. These bitmasks always cover the full\n+tree, a cleared bit means the hash is all zeros (i.e. not set) and\n+set bit means the next hash in the corresponding vector in\n+merkle_trees is the hash for that node. This is an optimization\n+to avoid storing a lot of zeros.
\n+
\n+[report issue]\n+- verified_leaf_hashes
\n+- bit-fields indicating which v2 leaf hashes have been verified\n+against the root hash. If this vector is empty and merkle_trees is\n+non-empty it implies that all hashes in merkle_trees are verified.
\n+
\n+[report issue]\n+- renamed_files
\n+- this is a map of file indices in the torrent and new filenames to be\n+applied before the torrent is added.
\n+
\n+\n+[report issue]\n+- last_download last_upload
\n+- the posix time of the last time payload was received or sent for this\n+torrent, respectively. A value of 0 means we don't know when we last\n+uploaded or downloaded, or we have never uploaded or downloaded any\n+payload for this torrent.
\n+
\n+[report issue]\n+\n+client_data_t
\n+Declared in "libtorrent/client_data.hpp"
\n+A thin wrapper around a void pointer used as "user data". i.e. an opaque\n+cookie passed in to libtorrent and returned on demand. It adds type-safety by\n+requiring the same type be requested out of it as was assigned to it.
\n \n-struct dht_state\n+struct client_data_t\n {\n- void clear ();\n+ client_data_t () = default;\n+ explicit client_data_t (T* v);\n+ client_data_t& operator= (T* v);\n+ explicit operator T () const;\n+ T* get () const;\n+ client_data_t& operator= (void const*) = delete;\n+ operator void const* () const = delete;\n+ operator void* () const = delete;\n+ client_data_t& operator= (void*) = delete;\n \n- node_ids_t nids;\n- std::vector<udp::endpoint> nodes;\n- std::vector<udp::endpoint> nodes6;\n+ template <typename T, typename U = typename std::enable_if<std::is_pointer<T>::value>::type>\n };\n \n-[report issue]\n-- nodes
\n-- the bootstrap nodes saved from the buckets node
\n-
\n-[report issue]\n-- nodes6
\n-- the bootstrap nodes saved from the IPv6 buckets node
\n-
\n+[report issue]\n+client_data_t()
\n+\n+client_data_t () = default;\n+
\n+construct a nullptr client data
\n+\n+\n+[report issue]\n+\n+const*() void*() operator=()
\n+\n+client_data_t& operator= (void const*) = delete;\n+operator void const* () const = delete;\n+operator void* () const = delete;\n+client_data_t& operator= (void*) = delete;\n+
\n+we don't allow type-unsafe operations
\n [report issue]\n+\n \n dht_storage_counters
\n Declared in "libtorrent/kademlia/dht_storage.hpp"
\n This structure hold the relevant counters for the storage
\n \n struct dht_storage_counters\n {\n@@ -20542,16 +20516,42 @@\n [report issue]\n \n counters()
\n \n virtual dht_storage_counters counters () const = 0;\n
\n return stats counters for the store
\n-[report issue]\n+[report issue]\n
\n+\n+dht_state
\n+Declared in "libtorrent/kademlia/dht_state.hpp"
\n+This structure helps to store and load the state\n+of the dht_tracker.\n+At this moment the library is only a dual stack\n+implementation of the DHT. See BEP 32
\n+\n+struct dht_state\n+{\n+ void clear ();\n+\n+ node_ids_t nids;\n+ std::vector<udp::endpoint> nodes;\n+ std::vector<udp::endpoint> nodes6;\n+};\n+\n+[report issue]\n+- nodes
\n+- the bootstrap nodes saved from the buckets node
\n+
\n+[report issue]\n+- nodes6
\n+- the bootstrap nodes saved from the IPv6 buckets node
\n+
\n+[report issue]\n \n dht_default_storage_constructor()
\n Declared in "libtorrent/kademlia/dht_storage.hpp"
\n \n std::unique_ptr<dht_storage_interface> dht_default_storage_constructor (\n settings_interface const& settings);\n
\n@@ -20590,74 +20590,74 @@\n your source UDP port as your listen port, rather than the one specified in\n the message. This may improve the chances of traversing NATs when using uTP.\n \n \n - ssl_torrent
\n - Specify the port number for the SSL listen socket in the DHT announce.
\n
\n-[report issue]\n-\n-read_resume_data()
\n-Declared in "libtorrent/read_resume_data.hpp"
\n-\n-add_torrent_params read_resume_data (span<char const> buffer\n- , load_torrent_limits const& cfg = {});\n-add_torrent_params read_resume_data (bdecode_node const& rd\n- , int piece_limit = 0x200000);\n-add_torrent_params read_resume_data (span<char const> buffer\n- , error_code& ec, load_torrent_limits const& cfg = {});\n-add_torrent_params read_resume_data (bdecode_node const& rd\n- , error_code& ec, int piece_limit = 0x200000);\n-\n-these functions are used to parse resume data and populate the appropriate\n-fields in an add_torrent_params object. This object can then be used to add\n-the actual torrent_info object to and pass to session::add_torrent() or\n-session::async_add_torrent().
\n-If the client wants to override any field that was loaded from the resume\n-data, e.g. save_path, those fields must be changed after loading resume\n-data but before adding the torrent.
\n-The piece_limit parameter determines the largest number of pieces\n-allowed in the torrent that may be loaded as part of the resume data, if\n-it contains an info field. The overloads that take a flat buffer are\n-instead configured with limits on torrent sizes via load_torrent limits.
\n-In order to support large torrents, it may also be necessary to raise the\n-settings_pack::max_piece_count setting and pass a higher limit to calls\n-to torrent_info::parse_info_section().
\n \n [report issue]\n \n write_resume_data() write_resume_data_buf()
\n Declared in "libtorrent/write_resume_data.hpp"
\n \n-entry write_resume_data (add_torrent_params const& atp);\n std::vector<char> write_resume_data_buf (add_torrent_params const& atp);\n+entry write_resume_data (add_torrent_params const& atp);\n
\n this function turns the resume data in an add_torrent_params object\n into a bencoded structure
\n \n [report issue]\n \n write_torrent_file() write_torrent_file_buf()
\n Declared in "libtorrent/write_resume_data.hpp"
\n \n+entry write_torrent_file (add_torrent_params const& atp, write_torrent_flags_t flags);\n+entry write_torrent_file (add_torrent_params const& atp);\n std::vector<char> write_torrent_file_buf (add_torrent_params const& atp\n , write_torrent_flags_t flags);\n-entry write_torrent_file (add_torrent_params const& atp);\n-entry write_torrent_file (add_torrent_params const& atp, write_torrent_flags_t flags);\n
\n writes only the fields to create a .torrent file. This function may fail\n with a std::system_error exception if:
\n \n - The add_torrent_params object passed to this function does not contain the\n info dictionary (the ti field)
\n - The piece layers are not complete for all files that need them
\n
\n The write_torrent_file_buf() overload returns the torrent file in\n bencoded buffer form. This overload may be faster at the expense of lost\n flexibility to add custom fields.
\n+[report issue]\n+\n+read_resume_data()
\n+Declared in "libtorrent/read_resume_data.hpp"
\n+\n+add_torrent_params read_resume_data (bdecode_node const& rd\n+ , int piece_limit = 0x200000);\n+add_torrent_params read_resume_data (span<char const> buffer\n+ , error_code& ec, load_torrent_limits const& cfg = {});\n+add_torrent_params read_resume_data (bdecode_node const& rd\n+ , error_code& ec, int piece_limit = 0x200000);\n+add_torrent_params read_resume_data (span<char const> buffer\n+ , load_torrent_limits const& cfg = {});\n+\n+these functions are used to parse resume data and populate the appropriate\n+fields in an add_torrent_params object. This object can then be used to add\n+the actual torrent_info object to and pass to session::add_torrent() or\n+session::async_add_torrent().
\n+If the client wants to override any field that was loaded from the resume\n+data, e.g. save_path, those fields must be changed after loading resume\n+data but before adding the torrent.
\n+The piece_limit parameter determines the largest number of pieces\n+allowed in the torrent that may be loaded as part of the resume data, if\n+it contains an info field. The overloads that take a flat buffer are\n+instead configured with limits on torrent sizes via load_torrent limits.
\n+In order to support large torrents, it may also be necessary to raise the\n+settings_pack::max_piece_count setting and pass a higher limit to calls\n+to torrent_info::parse_info_section().
\n [report issue]\n \n write_torrent_flags_t
\n Declared in "libtorrent/write_resume_data.hpp"
\n \n - allow_missing_piece_layer
\n - this makes write_torrent_file() not fail when attempting to write a\n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,106 +1,281 @@\n >\n _\b[_\bl_\bi_\bb_\bt_\bo_\br_\br_\be_\bn_\bt_\b _\bl_\bo_\bg_\bo_\b]\n V\bVe\ber\brs\bsi\bio\bon\bn:\b: 2.0.10\n _\bh_\bo_\bm_\be\n Table of contents\n- * _\bs_\bt_\bo_\br_\ba_\bg_\be_\b__\be_\br_\br_\bo_\br\n+ * _\bc_\bo_\bu_\bn_\bt_\be_\br_\bs\n+ o _\bi_\bn_\bc_\b__\bs_\bt_\ba_\bt_\bs_\b__\bc_\bo_\bu_\bn_\bt_\be_\br_\b(_\b)_\b _\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b[_\b]_\b(_\b)\n+ * _\bs_\bt_\ba_\bt_\bs_\b__\bm_\be_\bt_\br_\bi_\bc\n+ * _\bs_\be_\bs_\bs_\bi_\bo_\bn_\b__\bs_\bt_\ba_\bt_\bs_\b__\bm_\be_\bt_\br_\bi_\bc_\bs_\b(_\b)\n+ * _\bf_\bi_\bn_\bd_\b__\bm_\be_\bt_\br_\bi_\bc_\b__\bi_\bd_\bx_\b(_\b)\n+ * _\be_\bn_\bu_\bm_\b _\bm_\be_\bt_\br_\bi_\bc_\b__\bt_\by_\bp_\be_\b__\bt\n+ * _\bs_\be_\bt_\bt_\bi_\bn_\bg_\bs_\b__\bi_\bn_\bt_\be_\br_\bf_\ba_\bc_\be\n+ * _\bb_\bu_\bf_\bf_\be_\br_\b__\ba_\bl_\bl_\bo_\bc_\ba_\bt_\bo_\br_\b__\bi_\bn_\bt_\be_\br_\bf_\ba_\bc_\be\n+ * _\bd_\bi_\bs_\bk_\b__\bb_\bu_\bf_\bf_\be_\br_\b__\bh_\bo_\bl_\bd_\be_\br\n+ o _\bd_\bi_\bs_\bk_\b__\bb_\bu_\bf_\bf_\be_\br_\b__\bh_\bo_\bl_\bd_\be_\br_\b(_\b)\n+ o _\bd_\bi_\bs_\bk_\b__\bb_\bu_\bf_\bf_\be_\br_\b__\bh_\bo_\bl_\bd_\be_\br_\b(_\b)\n+ o _\b~_\bd_\bi_\bs_\bk_\b__\bb_\bu_\bf_\bf_\be_\br_\b__\bh_\bo_\bl_\bd_\be_\br_\b(_\b)\n+ o _\bd_\ba_\bt_\ba_\b(_\b)\n+ o _\br_\be_\bs_\be_\bt_\b(_\b)\n+ o _\bs_\bw_\ba_\bp_\b(_\b)\n+ o _\bi_\bs_\b__\bm_\bu_\bt_\ba_\bb_\bl_\be_\b(_\b)\n o _\bb_\bo_\bo_\bl_\b(_\b)\n- o _\bf_\bi_\bl_\be_\b(_\b)\n- * _\bl_\bi_\bb_\bt_\bo_\br_\br_\be_\bn_\bt_\b__\bc_\ba_\bt_\be_\bg_\bo_\br_\by_\b(_\b)\n- * _\bh_\bt_\bt_\bp_\b__\bc_\ba_\bt_\be_\bg_\bo_\br_\by_\b(_\b)\n- * _\bp_\bc_\bp_\b__\bc_\ba_\bt_\be_\bg_\bo_\br_\by_\b(_\b)\n- * _\bs_\bo_\bc_\bk_\bs_\b__\bc_\ba_\bt_\be_\bg_\bo_\br_\by_\b(_\b)\n- * _\bg_\bz_\bi_\bp_\b__\bc_\ba_\bt_\be_\bg_\bo_\br_\by_\b(_\b)\n- * _\bu_\bp_\bn_\bp_\b__\bc_\ba_\bt_\be_\bg_\bo_\br_\by_\b(_\b)\n- * _\bb_\bd_\be_\bc_\bo_\bd_\be_\b__\bc_\ba_\bt_\be_\bg_\bo_\br_\by_\b(_\b)\n- * _\bi_\b2_\bp_\b__\bc_\ba_\bt_\be_\bg_\bo_\br_\by_\b(_\b)\n- * _\be_\bn_\bu_\bm_\b _\be_\br_\br_\bo_\br_\b__\bc_\bo_\bd_\be_\b__\be_\bn_\bu_\bm\n- * _\be_\bn_\bu_\bm_\b _\bh_\bt_\bt_\bp_\b__\be_\br_\br_\bo_\br_\bs\n- * _\be_\bn_\bu_\bm_\b _\bp_\bc_\bp_\b__\be_\br_\br_\bo_\br_\bs\n- * _\be_\bn_\bu_\bm_\b _\bs_\bo_\bc_\bk_\bs_\b__\be_\br_\br_\bo_\br_\b__\bc_\bo_\bd_\be\n- * _\be_\bn_\bu_\bm_\b _\be_\br_\br_\bo_\br_\b__\bc_\bo_\bd_\be_\b__\be_\bn_\bu_\bm\n- * _\be_\bn_\bu_\bm_\b _\be_\br_\br_\bo_\br_\b__\bc_\bo_\bd_\be_\b__\be_\bn_\bu_\bm\n- * _\be_\bn_\bu_\bm_\b _\be_\br_\br_\bo_\br_\b__\bc_\bo_\bd_\be_\b__\be_\bn_\bu_\bm\n- * _\be_\bn_\bu_\bm_\b _\bi_\b2_\bp_\b__\be_\br_\br_\bo_\br_\b__\bc_\bo_\bd_\be\n+ * _\bd_\bi_\bs_\bk_\b__\bo_\bb_\bs_\be_\br_\bv_\be_\br\n+ o _\bo_\bn_\b__\bd_\bi_\bs_\bk_\b(_\b)\n+ * _\bo_\bp_\be_\bn_\b__\bf_\bi_\bl_\be_\b__\bs_\bt_\ba_\bt_\be\n+ * _\bd_\bi_\bs_\bk_\b__\bi_\bn_\bt_\be_\br_\bf_\ba_\bc_\be\n+ o _\bn_\be_\bw_\b__\bt_\bo_\br_\br_\be_\bn_\bt_\b(_\b)\n+ o _\br_\be_\bm_\bo_\bv_\be_\b__\bt_\bo_\br_\br_\be_\bn_\bt_\b(_\b)\n+ o _\ba_\bs_\by_\bn_\bc_\b__\br_\be_\ba_\bd_\b(_\b)_\b _\ba_\bs_\by_\bn_\bc_\b__\bw_\br_\bi_\bt_\be_\b(_\b)\n+ o _\ba_\bs_\by_\bn_\bc_\b__\bh_\ba_\bs_\bh_\b(_\b)\n+ o _\ba_\bs_\by_\bn_\bc_\b__\bh_\ba_\bs_\bh_\b2_\b(_\b)\n+ o _\ba_\bs_\by_\bn_\bc_\b__\bm_\bo_\bv_\be_\b__\bs_\bt_\bo_\br_\ba_\bg_\be_\b(_\b)\n+ o _\ba_\bs_\by_\bn_\bc_\b__\br_\be_\bl_\be_\ba_\bs_\be_\b__\bf_\bi_\bl_\be_\bs_\b(_\b)\n+ o _\ba_\bs_\by_\bn_\bc_\b__\bc_\bh_\be_\bc_\bk_\b__\bf_\bi_\bl_\be_\bs_\b(_\b)\n+ o _\ba_\bs_\by_\bn_\bc_\b__\bs_\bt_\bo_\bp_\b__\bt_\bo_\br_\br_\be_\bn_\bt_\b(_\b)\n+ o _\ba_\bs_\by_\bn_\bc_\b__\br_\be_\bn_\ba_\bm_\be_\b__\bf_\bi_\bl_\be_\b(_\b)\n+ o _\ba_\bs_\by_\bn_\bc_\b__\bd_\be_\bl_\be_\bt_\be_\b__\bf_\bi_\bl_\be_\bs_\b(_\b)\n+ o _\ba_\bs_\by_\bn_\bc_\b__\bs_\be_\bt_\b__\bf_\bi_\bl_\be_\b__\bp_\br_\bi_\bo_\br_\bi_\bt_\by_\b(_\b)\n+ o _\ba_\bs_\by_\bn_\bc_\b__\bc_\bl_\be_\ba_\br_\b__\bp_\bi_\be_\bc_\be_\b(_\b)\n+ o _\bu_\bp_\bd_\ba_\bt_\be_\b__\bs_\bt_\ba_\bt_\bs_\b__\bc_\bo_\bu_\bn_\bt_\be_\br_\bs_\b(_\b)\n+ o _\bg_\be_\bt_\b__\bs_\bt_\ba_\bt_\bu_\bs_\b(_\b)\n+ o _\ba_\bb_\bo_\br_\bt_\b(_\b)\n+ o _\bs_\bu_\bb_\bm_\bi_\bt_\b__\bj_\bo_\bb_\bs_\b(_\b)\n+ o _\bs_\be_\bt_\bt_\bi_\bn_\bg_\bs_\b__\bu_\bp_\bd_\ba_\bt_\be_\bd_\b(_\b)\n+ * _\bs_\bt_\bo_\br_\ba_\bg_\be_\b__\bh_\bo_\bl_\bd_\be_\br\n+ * _\bf_\bi_\bl_\be_\b__\bo_\bp_\be_\bn_\b__\bm_\bo_\bd_\be_\b__\bt\n+ * _\bs_\be_\bt_\bt_\bi_\bn_\bg_\bs_\b__\bp_\ba_\bc_\bk\n+ o _\bs_\be_\bt_\b__\bs_\bt_\br_\b(_\b)_\b _\bs_\be_\bt_\b__\bi_\bn_\bt_\b(_\b)_\b _\bs_\be_\bt_\b__\bb_\bo_\bo_\bl_\b(_\b)\n+ o _\bh_\ba_\bs_\b__\bv_\ba_\bl_\b(_\b)\n+ o _\bc_\bl_\be_\ba_\br_\b(_\b)\n+ o _\bc_\bl_\be_\ba_\br_\b(_\b)\n+ o _\bg_\be_\bt_\b__\bb_\bo_\bo_\bl_\b(_\b)_\b _\bg_\be_\bt_\b__\bs_\bt_\br_\b(_\b)_\b _\bg_\be_\bt_\b__\bi_\bn_\bt_\b(_\b)\n+ o _\be_\bn_\bu_\bm_\b _\bt_\by_\bp_\be_\b__\bb_\ba_\bs_\be_\bs\n+ o _\be_\bn_\bu_\bm_\b _\bm_\bm_\ba_\bp_\b__\bw_\br_\bi_\bt_\be_\b__\bm_\bo_\bd_\be_\b__\bt\n+ o _\be_\bn_\bu_\bm_\b _\bs_\bu_\bg_\bg_\be_\bs_\bt_\b__\bm_\bo_\bd_\be_\b__\bt\n+ o _\be_\bn_\bu_\bm_\b _\bc_\bh_\bo_\bk_\bi_\bn_\bg_\b__\ba_\bl_\bg_\bo_\br_\bi_\bt_\bh_\bm_\b__\bt\n+ o _\be_\bn_\bu_\bm_\b _\bs_\be_\be_\bd_\b__\bc_\bh_\bo_\bk_\bi_\bn_\bg_\b__\ba_\bl_\bg_\bo_\br_\bi_\bt_\bh_\bm_\b__\bt\n+ o _\be_\bn_\bu_\bm_\b _\bi_\bo_\b__\bb_\bu_\bf_\bf_\be_\br_\b__\bm_\bo_\bd_\be_\b__\bt\n+ o _\be_\bn_\bu_\bm_\b _\bb_\ba_\bn_\bd_\bw_\bi_\bd_\bt_\bh_\b__\bm_\bi_\bx_\be_\bd_\b__\ba_\bl_\bg_\bo_\b__\bt\n+ o _\be_\bn_\bu_\bm_\b _\be_\bn_\bc_\b__\bp_\bo_\bl_\bi_\bc_\by\n+ o _\be_\bn_\bu_\bm_\b _\be_\bn_\bc_\b__\bl_\be_\bv_\be_\bl\n+ o _\be_\bn_\bu_\bm_\b _\bp_\br_\bo_\bx_\by_\b__\bt_\by_\bp_\be_\b__\bt\n+ * _\bn_\ba_\bm_\be_\b__\bf_\bo_\br_\b__\bs_\be_\bt_\bt_\bi_\bn_\bg_\b(_\b)_\b _\bs_\be_\bt_\bt_\bi_\bn_\bg_\b__\bb_\by_\b__\bn_\ba_\bm_\be_\b(_\b)\n+ * _\bd_\be_\bf_\ba_\bu_\bl_\bt_\b__\bs_\be_\bt_\bt_\bi_\bn_\bg_\bs_\b(_\b)\n+ * _\bh_\bi_\bg_\bh_\b__\bp_\be_\br_\bf_\bo_\br_\bm_\ba_\bn_\bc_\be_\b__\bs_\be_\be_\bd_\b(_\b)_\b _\bm_\bi_\bn_\b__\bm_\be_\bm_\bo_\br_\by_\b__\bu_\bs_\ba_\bg_\be_\b(_\b)\n+ * _\bg_\be_\bn_\be_\br_\ba_\bt_\be_\b__\bf_\bi_\bn_\bg_\be_\br_\bp_\br_\bi_\bn_\bt_\b(_\b)\n+ * _\bb_\bd_\be_\bc_\bo_\bd_\be_\b__\bn_\bo_\bd_\be\n+ o _\bb_\bd_\be_\bc_\bo_\bd_\be_\b__\bn_\bo_\bd_\be_\b(_\b)\n+ o _\bb_\bd_\be_\bc_\bo_\bd_\be_\b__\bn_\bo_\bd_\be_\b(_\b)_\b _\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b=_\b(_\b)\n+ o _\bt_\by_\bp_\be_\b(_\b)\n+ o _\bb_\bo_\bo_\bl_\b(_\b)\n+ o _\bn_\bo_\bn_\b__\bo_\bw_\bn_\bi_\bn_\bg_\b(_\b)\n+ o _\bd_\ba_\bt_\ba_\b__\bo_\bf_\bf_\bs_\be_\bt_\b(_\b)_\b _\bd_\ba_\bt_\ba_\b__\bs_\be_\bc_\bt_\bi_\bo_\bn_\b(_\b)\n+ o _\bl_\bi_\bs_\bt_\b__\ba_\bt_\b(_\b)_\b _\bl_\bi_\bs_\bt_\b__\bs_\bt_\br_\bi_\bn_\bg_\b__\bv_\ba_\bl_\bu_\be_\b__\ba_\bt_\b(_\b)_\b _\bl_\bi_\bs_\bt_\b__\bs_\bi_\bz_\be_\b(_\b)_\b _\bl_\bi_\bs_\bt_\b__\bi_\bn_\bt_\b__\bv_\ba_\bl_\bu_\be_\b__\ba_\bt_\b(_\b)\n+ o _\bd_\bi_\bc_\bt_\b__\bs_\bi_\bz_\be_\b(_\b)_\b _\bd_\bi_\bc_\bt_\b__\bf_\bi_\bn_\bd_\b__\bd_\bi_\bc_\bt_\b(_\b)_\b _\bd_\bi_\bc_\bt_\b__\ba_\bt_\b(_\b)_\b _\bd_\bi_\bc_\bt_\b__\bf_\bi_\bn_\bd_\b__\bi_\bn_\bt_\b(_\b)_\b _\bd_\bi_\bc_\bt_\b__\bf_\bi_\bn_\bd_\b(_\b)\n+ _\bd_\bi_\bc_\bt_\b__\bf_\bi_\bn_\bd_\b__\bl_\bi_\bs_\bt_\b(_\b)_\b _\bd_\bi_\bc_\bt_\b__\bf_\bi_\bn_\bd_\b__\bi_\bn_\bt_\b__\bv_\ba_\bl_\bu_\be_\b(_\b)_\b _\bd_\bi_\bc_\bt_\b__\bf_\bi_\bn_\bd_\b__\bs_\bt_\br_\bi_\bn_\bg_\b(_\b)\n+ _\bd_\bi_\bc_\bt_\b__\ba_\bt_\b__\bn_\bo_\bd_\be_\b(_\b)_\b _\bd_\bi_\bc_\bt_\b__\bf_\bi_\bn_\bd_\b__\bs_\bt_\br_\bi_\bn_\bg_\b__\bv_\ba_\bl_\bu_\be_\b(_\b)\n+ o _\bi_\bn_\bt_\b__\bv_\ba_\bl_\bu_\be_\b(_\b)\n+ o _\bs_\bt_\br_\bi_\bn_\bg_\b__\bl_\be_\bn_\bg_\bt_\bh_\b(_\b)_\b _\bs_\bt_\br_\bi_\bn_\bg_\b__\bp_\bt_\br_\b(_\b)_\b _\bs_\bt_\br_\bi_\bn_\bg_\b__\bo_\bf_\bf_\bs_\be_\bt_\b(_\b)_\b _\bs_\bt_\br_\bi_\bn_\bg_\b__\bv_\ba_\bl_\bu_\be_\b(_\b)\n+ o _\bc_\bl_\be_\ba_\br_\b(_\b)\n+ o _\bs_\bw_\ba_\bp_\b(_\b)\n+ o _\br_\be_\bs_\be_\br_\bv_\be_\b(_\b)\n+ o _\bs_\bw_\bi_\bt_\bc_\bh_\b__\bu_\bn_\bd_\be_\br_\bl_\by_\bi_\bn_\bg_\b__\bb_\bu_\bf_\bf_\be_\br_\b(_\b)\n+ o _\bh_\ba_\bs_\b__\bs_\bo_\bf_\bt_\b__\be_\br_\br_\bo_\br_\b(_\b)\n+ o _\be_\bn_\bu_\bm_\b _\bt_\by_\bp_\be_\b__\bt\n+ * _\bp_\br_\bi_\bn_\bt_\b__\be_\bn_\bt_\br_\by_\b(_\b)\n+ * _\bb_\bd_\be_\bc_\bo_\bd_\be_\b(_\b)\n+ * _\bs_\be_\bs_\bs_\bi_\bo_\bn_\b__\bp_\br_\bo_\bx_\by\n+ o _\b~_\bs_\be_\bs_\bs_\bi_\bo_\bn_\b__\bp_\br_\bo_\bx_\by_\b(_\b)_\b _\bs_\be_\bs_\bs_\bi_\bo_\bn_\b__\bp_\br_\bo_\bx_\by_\b(_\b)_\b _\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b=_\b(_\b)\n+ * _\bs_\be_\bs_\bs_\bi_\bo_\bn\n+ o _\bs_\be_\bs_\bs_\bi_\bo_\bn_\b(_\b)\n+ o _\bs_\be_\bs_\bs_\bi_\bo_\bn_\b(_\b)\n+ o _\b~_\bs_\be_\bs_\bs_\bi_\bo_\bn_\b(_\b)\n+ o _\ba_\bb_\bo_\br_\bt_\b(_\b)\n+ * _\bs_\be_\bs_\bs_\bi_\bo_\bn_\b__\bp_\ba_\br_\ba_\bm_\bs\n+ o _\bs_\be_\bs_\bs_\bi_\bo_\bn_\b__\bp_\ba_\br_\ba_\bm_\bs_\b(_\b)\n+ o _\bs_\be_\bs_\bs_\bi_\bo_\bn_\b__\bp_\ba_\br_\ba_\bm_\bs_\b(_\b)\n+ * _\bs_\be_\bs_\bs_\bi_\bo_\bn_\b__\bh_\ba_\bn_\bd_\bl_\be\n+ o _\bi_\bs_\b__\bv_\ba_\bl_\bi_\bd_\b(_\b)\n+ o _\bs_\be_\bs_\bs_\bi_\bo_\bn_\b__\bs_\bt_\ba_\bt_\be_\b(_\b)\n+ o _\br_\be_\bf_\br_\be_\bs_\bh_\b__\bt_\bo_\br_\br_\be_\bn_\bt_\b__\bs_\bt_\ba_\bt_\bu_\bs_\b(_\b)_\b _\bg_\be_\bt_\b__\bt_\bo_\br_\br_\be_\bn_\bt_\b__\bs_\bt_\ba_\bt_\bu_\bs_\b(_\b)\n+ o _\bp_\bo_\bs_\bt_\b__\bt_\bo_\br_\br_\be_\bn_\bt_\b__\bu_\bp_\bd_\ba_\bt_\be_\bs_\b(_\b)\n+ o _\bp_\bo_\bs_\bt_\b__\bs_\be_\bs_\bs_\bi_\bo_\bn_\b__\bs_\bt_\ba_\bt_\bs_\b(_\b)\n+ o _\bp_\bo_\bs_\bt_\b__\bd_\bh_\bt_\b__\bs_\bt_\ba_\bt_\bs_\b(_\b)\n+ o _\bs_\be_\bt_\b__\bd_\bh_\bt_\b__\bs_\bt_\ba_\bt_\be_\b(_\b)\n+ o _\bg_\be_\bt_\b__\bt_\bo_\br_\br_\be_\bn_\bt_\bs_\b(_\b)_\b _\bf_\bi_\bn_\bd_\b__\bt_\bo_\br_\br_\be_\bn_\bt_\b(_\b)\n+ o _\ba_\bs_\by_\bn_\bc_\b__\ba_\bd_\bd_\b__\bt_\bo_\br_\br_\be_\bn_\bt_\b(_\b)_\b _\ba_\bd_\bd_\b__\bt_\bo_\br_\br_\be_\bn_\bt_\b(_\b)\n+ o _\bi_\bs_\b__\bp_\ba_\bu_\bs_\be_\bd_\b(_\b)_\b _\br_\be_\bs_\bu_\bm_\be_\b(_\b)_\b _\bp_\ba_\bu_\bs_\be_\b(_\b)\n+ o _\bi_\bs_\b__\bd_\bh_\bt_\b__\br_\bu_\bn_\bn_\bi_\bn_\bg_\b(_\b)\n+ o _\bs_\be_\bt_\b__\bd_\bh_\bt_\b__\bs_\bt_\bo_\br_\ba_\bg_\be_\b(_\b)\n+ o _\ba_\bd_\bd_\b__\bd_\bh_\bt_\b__\bn_\bo_\bd_\be_\b(_\b)\n+ o _\bd_\bh_\bt_\b__\bg_\be_\bt_\b__\bi_\bt_\be_\bm_\b(_\b)\n+ o _\bd_\bh_\bt_\b__\bg_\be_\bt_\b__\bi_\bt_\be_\bm_\b(_\b)\n+ o _\bd_\bh_\bt_\b__\bp_\bu_\bt_\b__\bi_\bt_\be_\bm_\b(_\b)\n+ o _\bd_\bh_\bt_\b__\bp_\bu_\bt_\b__\bi_\bt_\be_\bm_\b(_\b)\n+ o _\bd_\bh_\bt_\b__\bg_\be_\bt_\b__\bp_\be_\be_\br_\bs_\b(_\b)_\b _\bd_\bh_\bt_\b__\ba_\bn_\bn_\bo_\bu_\bn_\bc_\be_\b(_\b)\n+ o _\bd_\bh_\bt_\b__\bl_\bi_\bv_\be_\b__\bn_\bo_\bd_\be_\bs_\b(_\b)\n+ o _\bd_\bh_\bt_\b__\bs_\ba_\bm_\bp_\bl_\be_\b__\bi_\bn_\bf_\bo_\bh_\ba_\bs_\bh_\be_\bs_\b(_\b)\n+ o _\bd_\bh_\bt_\b__\bd_\bi_\br_\be_\bc_\bt_\b__\br_\be_\bq_\bu_\be_\bs_\bt_\b(_\b)\n+ o _\ba_\bd_\bd_\b__\be_\bx_\bt_\be_\bn_\bs_\bi_\bo_\bn_\b(_\b)\n+ o _\bs_\be_\bt_\b__\bi_\bp_\b__\bf_\bi_\bl_\bt_\be_\br_\b(_\b)_\b _\bg_\be_\bt_\b__\bi_\bp_\b__\bf_\bi_\bl_\bt_\be_\br_\b(_\b)\n+ o _\bs_\be_\bt_\b__\bp_\bo_\br_\bt_\b__\bf_\bi_\bl_\bt_\be_\br_\b(_\b)\n+ o _\bi_\bs_\b__\bl_\bi_\bs_\bt_\be_\bn_\bi_\bn_\bg_\b(_\b)_\b _\bl_\bi_\bs_\bt_\be_\bn_\b__\bp_\bo_\br_\bt_\b(_\b)_\b _\bs_\bs_\bl_\b__\bl_\bi_\bs_\bt_\be_\bn_\b__\bp_\bo_\br_\bt_\b(_\b)\n+ o _\bs_\be_\bt_\b__\bp_\be_\be_\br_\b__\bc_\bl_\ba_\bs_\bs_\b__\bf_\bi_\bl_\bt_\be_\br_\b(_\b)_\b _\bg_\be_\bt_\b__\bp_\be_\be_\br_\b__\bc_\bl_\ba_\bs_\bs_\b__\bf_\bi_\bl_\bt_\be_\br_\b(_\b)\n+ o _\bs_\be_\bt_\b__\bp_\be_\be_\br_\b__\bc_\bl_\ba_\bs_\bs_\b__\bt_\by_\bp_\be_\b__\bf_\bi_\bl_\bt_\be_\br_\b(_\b)_\b _\bg_\be_\bt_\b__\bp_\be_\be_\br_\b__\bc_\bl_\ba_\bs_\bs_\b__\bt_\by_\bp_\be_\b__\bf_\bi_\bl_\bt_\be_\br_\b(_\b)\n+ o _\bc_\br_\be_\ba_\bt_\be_\b__\bp_\be_\be_\br_\b__\bc_\bl_\ba_\bs_\bs_\b(_\b)\n+ o _\bd_\be_\bl_\be_\bt_\be_\b__\bp_\be_\be_\br_\b__\bc_\bl_\ba_\bs_\bs_\b(_\b)\n+ o _\bg_\be_\bt_\b__\bp_\be_\be_\br_\b__\bc_\bl_\ba_\bs_\bs_\b(_\b)_\b _\bs_\be_\bt_\b__\bp_\be_\be_\br_\b__\bc_\bl_\ba_\bs_\bs_\b(_\b)\n+ o _\br_\be_\bm_\bo_\bv_\be_\b__\bt_\bo_\br_\br_\be_\bn_\bt_\b(_\b)\n+ o _\bg_\be_\bt_\b__\bs_\be_\bt_\bt_\bi_\bn_\bg_\bs_\b(_\b)_\b _\ba_\bp_\bp_\bl_\by_\b__\bs_\be_\bt_\bt_\bi_\bn_\bg_\bs_\b(_\b)\n+ o _\bp_\bo_\bp_\b__\ba_\bl_\be_\br_\bt_\bs_\b(_\b)_\b _\bs_\be_\bt_\b__\ba_\bl_\be_\br_\bt_\b__\bn_\bo_\bt_\bi_\bf_\by_\b(_\b)_\b _\bw_\ba_\bi_\bt_\b__\bf_\bo_\br_\b__\ba_\bl_\be_\br_\bt_\b(_\b)\n+ o _\ba_\bd_\bd_\b__\bp_\bo_\br_\bt_\b__\bm_\ba_\bp_\bp_\bi_\bn_\bg_\b(_\b)_\b _\bd_\be_\bl_\be_\bt_\be_\b__\bp_\bo_\br_\bt_\b__\bm_\ba_\bp_\bp_\bi_\bn_\bg_\b(_\b)\n+ o _\br_\be_\bo_\bp_\be_\bn_\b__\bn_\be_\bt_\bw_\bo_\br_\bk_\b__\bs_\bo_\bc_\bk_\be_\bt_\bs_\b(_\b)\n+ o _\bn_\ba_\bt_\bi_\bv_\be_\b__\bh_\ba_\bn_\bd_\bl_\be_\b(_\b)\n+ * _\br_\be_\ba_\bd_\b__\bs_\be_\bs_\bs_\bi_\bo_\bn_\b__\bp_\ba_\br_\ba_\bm_\bs_\b(_\b)_\b _\bw_\br_\bi_\bt_\be_\b__\bs_\be_\bs_\bs_\bi_\bo_\bn_\b__\bp_\ba_\br_\ba_\bm_\bs_\b__\bb_\bu_\bf_\b(_\b)_\b _\bw_\br_\bi_\bt_\be_\b__\bs_\be_\bs_\bs_\bi_\bo_\bn_\b__\bp_\ba_\br_\ba_\bm_\bs_\b(_\b)\n+ * _\bp_\be_\be_\br_\b__\bi_\bn_\bf_\bo\n+ o _\bi_\b2_\bp_\b__\bd_\be_\bs_\bt_\bi_\bn_\ba_\bt_\bi_\bo_\bn_\b(_\b)\n+ * _\bi_\bn_\bf_\bo_\b__\bh_\ba_\bs_\bh_\b__\bt\n+ o _\bi_\bn_\bf_\bo_\b__\bh_\ba_\bs_\bh_\b__\bt_\b(_\b)\n+ o _\bh_\ba_\bs_\b__\bv_\b2_\b(_\b)_\b _\bh_\ba_\bs_\b(_\b)_\b _\bh_\ba_\bs_\b__\bv_\b1_\b(_\b)\n+ o _\bg_\be_\bt_\b(_\b)\n+ o _\bg_\be_\bt_\b__\bb_\be_\bs_\bt_\b(_\b)\n+ o _\bf_\bo_\br_\b__\be_\ba_\bc_\bh_\b(_\b)\n+ * _\bp_\be_\be_\br_\b__\br_\be_\bq_\bu_\be_\bs_\bt\n+ o _\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b=_\b=_\b(_\b)\n+ * _\bp_\bi_\be_\bc_\be_\b__\bb_\bl_\bo_\bc_\bk\n+ * _\bt_\br_\bu_\bn_\bc_\ba_\bt_\be_\b__\bf_\bi_\bl_\be_\bs_\b(_\b)\n+ * _\bl_\bo_\ba_\bd_\b__\bt_\bo_\br_\br_\be_\bn_\bt_\b__\bp_\ba_\br_\bs_\be_\bd_\b(_\b)_\b _\bl_\bo_\ba_\bd_\b__\bt_\bo_\br_\br_\be_\bn_\bt_\b__\bf_\bi_\bl_\be_\b(_\b)_\b _\bl_\bo_\ba_\bd_\b__\bt_\bo_\br_\br_\be_\bn_\bt_\b__\bb_\bu_\bf_\bf_\be_\br_\b(_\b)\n+ * _\bt_\bo_\br_\br_\be_\bn_\bt_\b__\bp_\be_\be_\br_\b__\be_\bq_\bu_\ba_\bl_\b(_\b)\n+ * _\bm_\ba_\bk_\be_\b__\bm_\ba_\bg_\bn_\be_\bt_\b__\bu_\br_\bi_\b(_\b)\n+ * _\bp_\ba_\br_\bs_\be_\b__\bm_\ba_\bg_\bn_\be_\bt_\b__\bu_\br_\bi_\b(_\b)\n+ * _\bv_\be_\br_\bs_\bi_\bo_\bn_\b(_\b)\n+ * _\be_\bn_\bu_\bm_\b _\bp_\br_\bo_\bt_\bo_\bc_\bo_\bl_\b__\bv_\be_\br_\bs_\bi_\bo_\bn\n+ * _\be_\bn_\bu_\bm_\b _\bc_\bo_\bn_\bn_\be_\bc_\bt_\bi_\bo_\bn_\b__\bt_\by_\bp_\be\n+ * _\be_\bn_\bu_\bm_\b _\bs_\bo_\bc_\bk_\be_\bt_\b__\bt_\by_\bp_\be_\b__\bt\n+ * _\be_\bn_\bu_\bm_\b _\be_\bv_\be_\bn_\bt_\b__\bt\n+ * _\be_\bn_\bu_\bm_\b _\bp_\bo_\br_\bt_\bm_\ba_\bp_\b__\bt_\br_\ba_\bn_\bs_\bp_\bo_\br_\bt\n+ * _\be_\bn_\bu_\bm_\b _\bp_\bo_\br_\bt_\bm_\ba_\bp_\b__\bp_\br_\bo_\bt_\bo_\bc_\bo_\bl\n+ * _\bp_\be_\bx_\b__\bf_\bl_\ba_\bg_\bs_\b__\bt\n+ * _\bt_\bo_\br_\br_\be_\bn_\bt_\b__\bf_\bl_\ba_\bg_\bs_\b__\bt\n+ * _\bi_\bn_\bt\n+ * _\bd_\bo_\bw_\bn_\bl_\bo_\ba_\bd_\b__\bp_\br_\bi_\bo_\br_\bi_\bt_\by_\b__\bt\n+ * _\bc_\bh_\ba_\br_\b _\bc_\bo_\bn_\bs_\bt_\b*\n+ * _\bs_\bt_\bd_\b:_\b:_\bu_\bi_\bn_\bt_\b6_\b4_\b__\bt\n * _\bh_\ba_\bs_\bh_\be_\br\n- o _\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b=_\b(_\b)_\b _\bh_\ba_\bs_\bh_\be_\br_\b(_\b)\n+ o _\bh_\ba_\bs_\bh_\be_\br_\b(_\b)_\b _\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b=_\b(_\b)\n o _\bu_\bp_\bd_\ba_\bt_\be_\b(_\b)\n o _\bf_\bi_\bn_\ba_\bl_\b(_\b)\n o _\br_\be_\bs_\be_\bt_\b(_\b)\n * _\bh_\ba_\bs_\bh_\be_\br_\b2_\b5_\b6\n o _\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b=_\b(_\b)_\b _\bh_\ba_\bs_\bh_\be_\br_\b2_\b5_\b6_\b(_\b)\n o _\bu_\bp_\bd_\ba_\bt_\be_\b(_\b)\n o _\bf_\bi_\bn_\ba_\bl_\b(_\b)\n o _\br_\be_\bs_\be_\bt_\b(_\b)\n * _\bb_\bi_\bt_\bf_\bi_\be_\bl_\bd\n o _\bb_\bi_\bt_\bf_\bi_\be_\bl_\bd_\b(_\b)\n o _\ba_\bs_\bs_\bi_\bg_\bn_\b(_\b)\n o _\bg_\be_\bt_\b__\bb_\bi_\bt_\b(_\b)_\b _\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b[_\b]_\b(_\b)\n- o _\bc_\bl_\be_\ba_\br_\b__\bb_\bi_\bt_\b(_\b)_\b _\bs_\be_\bt_\b__\bb_\bi_\bt_\b(_\b)\n+ o _\bs_\be_\bt_\b__\bb_\bi_\bt_\b(_\b)_\b _\bc_\bl_\be_\ba_\br_\b__\bb_\bi_\bt_\b(_\b)\n o _\ba_\bl_\bl_\b__\bs_\be_\bt_\b(_\b)\n o _\bn_\bo_\bn_\be_\b__\bs_\be_\bt_\b(_\b)\n o _\bs_\bi_\bz_\be_\b(_\b)\n o _\bn_\bu_\bm_\b__\bw_\bo_\br_\bd_\bs_\b(_\b)\n o _\bn_\bu_\bm_\b__\bb_\by_\bt_\be_\bs_\b(_\b)\n o _\be_\bm_\bp_\bt_\by_\b(_\b)\n o _\bd_\ba_\bt_\ba_\b(_\b)\n o _\bs_\bw_\ba_\bp_\b(_\b)\n o _\bc_\bo_\bu_\bn_\bt_\b(_\b)\n o _\bf_\bi_\bn_\bd_\b__\bf_\bi_\br_\bs_\bt_\b__\bs_\be_\bt_\b(_\b)\n o _\bf_\bi_\bn_\bd_\b__\bl_\ba_\bs_\bt_\b__\bc_\bl_\be_\ba_\br_\b(_\b)\n- * _\bc_\bo_\bu_\bn_\bt_\be_\br_\bs\n- o _\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b[_\b]_\b(_\b)_\b _\bi_\bn_\bc_\b__\bs_\bt_\ba_\bt_\bs_\b__\bc_\bo_\bu_\bn_\bt_\be_\br_\b(_\b)\n- * _\bs_\bt_\ba_\bt_\bs_\b__\bm_\be_\bt_\br_\bi_\bc\n- * _\bs_\be_\bs_\bs_\bi_\bo_\bn_\b__\bs_\bt_\ba_\bt_\bs_\b__\bm_\be_\bt_\br_\bi_\bc_\bs_\b(_\b)\n- * _\bf_\bi_\bn_\bd_\b__\bm_\be_\bt_\br_\bi_\bc_\b__\bi_\bd_\bx_\b(_\b)\n- * _\be_\bn_\bu_\bm_\b _\bm_\be_\bt_\br_\bi_\bc_\b__\bt_\by_\bp_\be_\b__\bt\n- * _\bc_\br_\be_\ba_\bt_\be_\b__\bt_\bo_\br_\br_\be_\bn_\bt\n- o _\bc_\br_\be_\ba_\bt_\be_\b__\bt_\bo_\br_\br_\be_\bn_\bt_\b(_\b)\n- o _\bg_\be_\bn_\be_\br_\ba_\bt_\be_\b(_\b)_\b _\bg_\be_\bn_\be_\br_\ba_\bt_\be_\b__\bb_\bu_\bf_\b(_\b)\n- o _\bf_\bi_\bl_\be_\bs_\b(_\b)\n- o _\bs_\be_\bt_\b__\bc_\bo_\bm_\bm_\be_\bn_\bt_\b(_\b)\n- o _\bs_\be_\bt_\b__\bc_\br_\be_\ba_\bt_\bo_\br_\b(_\b)\n- o _\bs_\be_\bt_\b__\bc_\br_\be_\ba_\bt_\bi_\bo_\bn_\b__\bd_\ba_\bt_\be_\b(_\b)\n- o _\bs_\be_\bt_\b__\bh_\ba_\bs_\bh_\b(_\b)\n- o _\bs_\be_\bt_\b__\bh_\ba_\bs_\bh_\b2_\b(_\b)\n- o _\ba_\bd_\bd_\b__\bh_\bt_\bt_\bp_\b__\bs_\be_\be_\bd_\b(_\b)_\b _\ba_\bd_\bd_\b__\bu_\br_\bl_\b__\bs_\be_\be_\bd_\b(_\b)\n- o _\ba_\bd_\bd_\b__\bn_\bo_\bd_\be_\b(_\b)\n- o _\ba_\bd_\bd_\b__\bt_\br_\ba_\bc_\bk_\be_\br_\b(_\b)\n- o _\bs_\be_\bt_\b__\br_\bo_\bo_\bt_\b__\bc_\be_\br_\bt_\b(_\b)\n- o _\bs_\be_\bt_\b__\bp_\br_\bi_\bv_\b(_\b)_\b _\bp_\br_\bi_\bv_\b(_\b)\n- o _\bn_\bu_\bm_\b__\bp_\bi_\be_\bc_\be_\bs_\b(_\b)\n- o _\bp_\bi_\be_\bc_\be_\b__\br_\ba_\bn_\bg_\be_\b(_\b)\n+ * _\bs_\bt_\bo_\br_\ba_\bg_\be_\b__\be_\br_\br_\bo_\br\n+ o _\bb_\bo_\bo_\bl_\b(_\b)\n+ o _\bf_\bi_\bl_\be_\b(_\b)\n+ * _\bb_\bd_\be_\bc_\bo_\bd_\be_\b__\bc_\ba_\bt_\be_\bg_\bo_\br_\by_\b(_\b)\n+ * _\bg_\bz_\bi_\bp_\b__\bc_\ba_\bt_\be_\bg_\bo_\br_\by_\b(_\b)\n+ * _\bl_\bi_\bb_\bt_\bo_\br_\br_\be_\bn_\bt_\b__\bc_\ba_\bt_\be_\bg_\bo_\br_\by_\b(_\b)\n+ * _\bh_\bt_\bt_\bp_\b__\bc_\ba_\bt_\be_\bg_\bo_\br_\by_\b(_\b)\n+ * _\bs_\bo_\bc_\bk_\bs_\b__\bc_\ba_\bt_\be_\bg_\bo_\br_\by_\b(_\b)\n+ * _\bu_\bp_\bn_\bp_\b__\bc_\ba_\bt_\be_\bg_\bo_\br_\by_\b(_\b)\n+ * _\bi_\b2_\bp_\b__\bc_\ba_\bt_\be_\bg_\bo_\br_\by_\b(_\b)\n+ * _\bp_\bc_\bp_\b__\bc_\ba_\bt_\be_\bg_\bo_\br_\by_\b(_\b)\n+ * _\be_\bn_\bu_\bm_\b _\be_\br_\br_\bo_\br_\b__\bc_\bo_\bd_\be_\b__\be_\bn_\bu_\bm\n+ * _\be_\bn_\bu_\bm_\b _\be_\br_\br_\bo_\br_\b__\bc_\bo_\bd_\be_\b__\be_\bn_\bu_\bm\n+ * _\be_\bn_\bu_\bm_\b _\be_\br_\br_\bo_\br_\b__\bc_\bo_\bd_\be_\b__\be_\bn_\bu_\bm\n+ * _\be_\bn_\bu_\bm_\b _\bh_\bt_\bt_\bp_\b__\be_\br_\br_\bo_\br_\bs\n+ * _\be_\bn_\bu_\bm_\b _\bs_\bo_\bc_\bk_\bs_\b__\be_\br_\br_\bo_\br_\b__\bc_\bo_\bd_\be\n+ * _\be_\bn_\bu_\bm_\b _\be_\br_\br_\bo_\br_\b__\bc_\bo_\bd_\be_\b__\be_\bn_\bu_\bm\n+ * _\be_\bn_\bu_\bm_\b _\bi_\b2_\bp_\b__\be_\br_\br_\bo_\br_\b__\bc_\bo_\bd_\be\n+ * _\be_\bn_\bu_\bm_\b _\bp_\bc_\bp_\b__\be_\br_\br_\bo_\br_\bs\n+ * _\bf_\bi_\bl_\be_\b__\bs_\bl_\bi_\bc_\be\n+ * _\bf_\bi_\bl_\be_\b__\bs_\bt_\bo_\br_\ba_\bg_\be\n+ o _\bi_\bs_\b__\bv_\ba_\bl_\bi_\bd_\b(_\b)\n+ o _\br_\be_\bs_\be_\br_\bv_\be_\b(_\b)\n+ o _\ba_\bd_\bd_\b__\bf_\bi_\bl_\be_\b(_\b)_\b _\ba_\bd_\bd_\b__\bf_\bi_\bl_\be_\b__\bb_\bo_\br_\br_\bo_\bw_\b(_\b)\n+ o _\br_\be_\bn_\ba_\bm_\be_\b__\bf_\bi_\bl_\be_\b(_\b)\n+ o _\bm_\ba_\bp_\b__\bb_\bl_\bo_\bc_\bk_\b(_\b)\n+ o _\bm_\ba_\bp_\b__\bf_\bi_\bl_\be_\b(_\b)\n+ o _\bn_\bu_\bm_\b__\bf_\bi_\bl_\be_\bs_\b(_\b)\n+ o _\be_\bn_\bd_\b__\bf_\bi_\bl_\be_\b(_\b)\n o _\bf_\bi_\bl_\be_\b__\br_\ba_\bn_\bg_\be_\b(_\b)\n- o _\bf_\bi_\bl_\be_\b__\bp_\bi_\be_\bc_\be_\b__\br_\ba_\bn_\bg_\be_\b(_\b)\n o _\bt_\bo_\bt_\ba_\bl_\b__\bs_\bi_\bz_\be_\b(_\b)\n- o _\bp_\bi_\be_\bc_\be_\b__\bs_\bi_\bz_\be_\b(_\b)_\b _\bp_\bi_\be_\bc_\be_\b__\bl_\be_\bn_\bg_\bt_\bh_\b(_\b)\n- o _\ba_\bd_\bd_\b__\bs_\bi_\bm_\bi_\bl_\ba_\br_\b__\bt_\bo_\br_\br_\be_\bn_\bt_\b(_\b)_\b _\ba_\bd_\bd_\b__\bc_\bo_\bl_\bl_\be_\bc_\bt_\bi_\bo_\bn_\b(_\b)\n- * _\ba_\bd_\bd_\b__\bf_\bi_\bl_\be_\bs_\b(_\b)\n- * _\bs_\be_\bt_\b__\bp_\bi_\be_\bc_\be_\b__\bh_\ba_\bs_\bh_\be_\bs_\b(_\b)\n+ o _\bn_\bu_\bm_\b__\bp_\bi_\be_\bc_\be_\bs_\b(_\b)_\b _\bs_\be_\bt_\b__\bn_\bu_\bm_\b__\bp_\bi_\be_\bc_\be_\bs_\b(_\b)\n+ o _\be_\bn_\bd_\b__\bp_\bi_\be_\bc_\be_\b(_\b)\n+ o _\bl_\ba_\bs_\bt_\b__\bp_\bi_\be_\bc_\be_\b(_\b)\n+ o _\bp_\bi_\be_\bc_\be_\b__\br_\ba_\bn_\bg_\be_\b(_\b)\n+ o _\bp_\bi_\be_\bc_\be_\b__\bl_\be_\bn_\bg_\bt_\bh_\b(_\b)_\b _\bs_\be_\bt_\b__\bp_\bi_\be_\bc_\be_\b__\bl_\be_\bn_\bg_\bt_\bh_\b(_\b)\n+ o _\bp_\bi_\be_\bc_\be_\b__\bs_\bi_\bz_\be_\b(_\b)\n+ o _\bp_\bi_\be_\bc_\be_\b__\bs_\bi_\bz_\be_\b2_\b(_\b)\n+ o _\bb_\bl_\bo_\bc_\bk_\bs_\b__\bi_\bn_\b__\bp_\bi_\be_\bc_\be_\b2_\b(_\b)\n+ o _\bb_\bl_\bo_\bc_\bk_\bs_\b__\bp_\be_\br_\b__\bp_\bi_\be_\bc_\be_\b(_\b)\n+ o _\bn_\ba_\bm_\be_\b(_\b)_\b _\bs_\be_\bt_\b__\bn_\ba_\bm_\be_\b(_\b)\n+ o _\bs_\bw_\ba_\bp_\b(_\b)\n+ o _\bc_\ba_\bn_\bo_\bn_\bi_\bc_\ba_\bl_\bi_\bz_\be_\b(_\b)\n+ o _\bp_\ba_\bd_\b__\bf_\bi_\bl_\be_\b__\ba_\bt_\b(_\b)_\b _\bm_\bt_\bi_\bm_\be_\b(_\b)_\b _\bf_\bi_\bl_\be_\b__\bn_\ba_\bm_\be_\b(_\b)_\b _\bf_\bi_\bl_\be_\b__\bo_\bf_\bf_\bs_\be_\bt_\b(_\b)_\b _\bh_\ba_\bs_\bh_\b(_\b)_\b _\bs_\by_\bm_\bl_\bi_\bn_\bk_\b(_\b)\n+ _\bf_\bi_\bl_\be_\b__\bp_\ba_\bt_\bh_\b(_\b)_\b _\bf_\bi_\bl_\be_\b__\bs_\bi_\bz_\be_\b(_\b)_\b _\br_\bo_\bo_\bt_\b(_\b)_\b _\br_\bo_\bo_\bt_\b__\bp_\bt_\br_\b(_\b)\n+ o _\bf_\bi_\bl_\be_\b__\bn_\bu_\bm_\b__\bp_\bi_\be_\bc_\be_\bs_\b(_\b)_\b _\bf_\bi_\bl_\be_\b__\bn_\bu_\bm_\b__\bb_\bl_\bo_\bc_\bk_\bs_\b(_\b)_\b _\bf_\bi_\bl_\be_\b__\bp_\bi_\be_\bc_\be_\b__\br_\ba_\bn_\bg_\be_\b(_\b)\n+ o _\bf_\bi_\bl_\be_\b__\bf_\bi_\br_\bs_\bt_\b__\bb_\bl_\bo_\bc_\bk_\b__\bn_\bo_\bd_\be_\b(_\b)_\b _\bf_\bi_\bl_\be_\b__\bf_\bi_\br_\bs_\bt_\b__\bp_\bi_\be_\bc_\be_\b__\bn_\bo_\bd_\be_\b(_\b)\n+ o _\bf_\bi_\bl_\be_\b__\bp_\ba_\bt_\bh_\b__\bh_\ba_\bs_\bh_\b(_\b)\n+ o _\ba_\bl_\bl_\b__\bp_\ba_\bt_\bh_\b__\bh_\ba_\bs_\bh_\be_\bs_\b(_\b)\n+ o _\bf_\bi_\bl_\be_\b__\bf_\bl_\ba_\bg_\bs_\b(_\b)\n+ o _\bf_\bi_\bl_\be_\b__\ba_\bb_\bs_\bo_\bl_\bu_\bt_\be_\b__\bp_\ba_\bt_\bh_\b(_\b)\n+ o _\bf_\bi_\bl_\be_\b__\bi_\bn_\bd_\be_\bx_\b__\ba_\bt_\b__\bo_\bf_\bf_\bs_\be_\bt_\b(_\b)_\b _\bf_\bi_\bl_\be_\b__\bi_\bn_\bd_\be_\bx_\b__\ba_\bt_\b__\bp_\bi_\be_\bc_\be_\b(_\b)\n+ o _\bf_\bi_\bl_\be_\b__\bi_\bn_\bd_\be_\bx_\b__\bf_\bo_\br_\b__\br_\bo_\bo_\bt_\b(_\b)\n+ o _\bp_\bi_\be_\bc_\be_\b__\bi_\bn_\bd_\be_\bx_\b__\ba_\bt_\b__\bf_\bi_\bl_\be_\b(_\b)\n+ o _\bs_\ba_\bn_\bi_\bt_\bi_\bz_\be_\b__\bs_\by_\bm_\bl_\bi_\bn_\bk_\bs_\b(_\b)\n+ o _\bv_\b2_\b(_\b)\n+ * _\bs_\bt_\bo_\br_\ba_\bg_\be_\b__\bp_\ba_\br_\ba_\bm_\bs\n+ * _\bp_\bo_\bs_\bi_\bx_\b__\bd_\bi_\bs_\bk_\b__\bi_\bo_\b__\bc_\bo_\bn_\bs_\bt_\br_\bu_\bc_\bt_\bo_\br_\b(_\b)\n+ * _\bd_\be_\bf_\ba_\bu_\bl_\bt_\b__\bd_\bi_\bs_\bk_\b__\bi_\bo_\b__\bc_\bo_\bn_\bs_\bt_\br_\bu_\bc_\bt_\bo_\br_\b(_\b)\n+ * _\bm_\bm_\ba_\bp_\b__\bd_\bi_\bs_\bk_\b__\bi_\bo_\b__\bc_\bo_\bn_\bs_\bt_\br_\bu_\bc_\bt_\bo_\br_\b(_\b)\n+ * _\bd_\bi_\bs_\ba_\bb_\bl_\be_\bd_\b__\bd_\bi_\bs_\bk_\b__\bi_\bo_\b__\bc_\bo_\bn_\bs_\bt_\br_\bu_\bc_\bt_\bo_\br_\b(_\b)\n+ * _\be_\bn_\bu_\bm_\b _\bs_\bt_\bo_\br_\ba_\bg_\be_\b__\bm_\bo_\bd_\be_\b__\bt\n+ * _\be_\bn_\bu_\bm_\b _\bs_\bt_\ba_\bt_\bu_\bs_\b__\bt\n+ * _\be_\bn_\bu_\bm_\b _\bm_\bo_\bv_\be_\b__\bf_\bl_\ba_\bg_\bs_\b__\bt\n * _\bw_\be_\bb_\b__\bs_\be_\be_\bd_\b__\be_\bn_\bt_\br_\by\n o _\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b=_\b=_\b(_\b)\n o _\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b<_\b(_\b)\n o _\be_\bn_\bu_\bm_\b _\bt_\by_\bp_\be_\b__\bt\n * _\bl_\bo_\ba_\bd_\b__\bt_\bo_\br_\br_\be_\bn_\bt_\b__\bl_\bi_\bm_\bi_\bt_\bs\n * _\bt_\bo_\br_\br_\be_\bn_\bt_\b__\bi_\bn_\bf_\bo\n o _\bt_\bo_\br_\br_\be_\bn_\bt_\b__\bi_\bn_\bf_\bo_\b(_\b)\n o _\b~_\bt_\bo_\br_\br_\be_\bn_\bt_\b__\bi_\bn_\bf_\bo_\b(_\b)\n o _\bo_\br_\bi_\bg_\b__\bf_\bi_\bl_\be_\bs_\b(_\b)_\b _\bf_\bi_\bl_\be_\bs_\b(_\b)\n o _\br_\be_\bn_\ba_\bm_\be_\b__\bf_\bi_\bl_\be_\b(_\b)\n o _\br_\be_\bm_\ba_\bp_\b__\bf_\bi_\bl_\be_\bs_\b(_\b)\n- o _\ba_\bd_\bd_\b__\bt_\br_\ba_\bc_\bk_\be_\br_\b(_\b)_\b _\bt_\br_\ba_\bc_\bk_\be_\br_\bs_\b(_\b)_\b _\bc_\bl_\be_\ba_\br_\b__\bt_\br_\ba_\bc_\bk_\be_\br_\bs_\b(_\b)\n- o _\bc_\bo_\bl_\bl_\be_\bc_\bt_\bi_\bo_\bn_\bs_\b(_\b)_\b _\bs_\bi_\bm_\bi_\bl_\ba_\br_\b__\bt_\bo_\br_\br_\be_\bn_\bt_\bs_\b(_\b)\n- o _\bs_\be_\bt_\b__\bw_\be_\bb_\b__\bs_\be_\be_\bd_\bs_\b(_\b)_\b _\bw_\be_\bb_\b__\bs_\be_\be_\bd_\bs_\b(_\b)_\b _\ba_\bd_\bd_\b__\bh_\bt_\bt_\bp_\b__\bs_\be_\be_\bd_\b(_\b)_\b _\ba_\bd_\bd_\b__\bu_\br_\bl_\b__\bs_\be_\be_\bd_\b(_\b)\n+ o _\ba_\bd_\bd_\b__\bt_\br_\ba_\bc_\bk_\be_\br_\b(_\b)_\b _\bc_\bl_\be_\ba_\br_\b__\bt_\br_\ba_\bc_\bk_\be_\br_\bs_\b(_\b)_\b _\bt_\br_\ba_\bc_\bk_\be_\br_\bs_\b(_\b)\n+ o _\bs_\bi_\bm_\bi_\bl_\ba_\br_\b__\bt_\bo_\br_\br_\be_\bn_\bt_\bs_\b(_\b)_\b _\bc_\bo_\bl_\bl_\be_\bc_\bt_\bi_\bo_\bn_\bs_\b(_\b)\n+ o _\ba_\bd_\bd_\b__\bu_\br_\bl_\b__\bs_\be_\be_\bd_\b(_\b)_\b _\bs_\be_\bt_\b__\bw_\be_\bb_\b__\bs_\be_\be_\bd_\bs_\b(_\b)_\b _\bw_\be_\bb_\b__\bs_\be_\be_\bd_\bs_\b(_\b)_\b _\ba_\bd_\bd_\b__\bh_\bt_\bt_\bp_\b__\bs_\be_\be_\bd_\b(_\b)\n o _\bt_\bo_\bt_\ba_\bl_\b__\bs_\bi_\bz_\be_\b(_\b)\n o _\bp_\bi_\be_\bc_\be_\b__\bl_\be_\bn_\bg_\bt_\bh_\b(_\b)_\b _\bn_\bu_\bm_\b__\bp_\bi_\be_\bc_\be_\bs_\b(_\b)\n o _\bb_\bl_\bo_\bc_\bk_\bs_\b__\bp_\be_\br_\b__\bp_\bi_\be_\bc_\be_\b(_\b)\n- o _\bl_\ba_\bs_\bt_\b__\bp_\bi_\be_\bc_\be_\b(_\b)_\b _\be_\bn_\bd_\b__\bp_\bi_\be_\bc_\be_\b(_\b)_\b _\bp_\bi_\be_\bc_\be_\b__\br_\ba_\bn_\bg_\be_\b(_\b)\n- o _\bi_\bn_\bf_\bo_\b__\bh_\ba_\bs_\bh_\b(_\b)_\b _\bi_\bn_\bf_\bo_\b__\bh_\ba_\bs_\bh_\be_\bs_\b(_\b)\n- o _\bv_\b1_\b(_\b)_\b _\bv_\b2_\b(_\b)\n+ o _\be_\bn_\bd_\b__\bp_\bi_\be_\bc_\be_\b(_\b)_\b _\bp_\bi_\be_\bc_\be_\b__\br_\ba_\bn_\bg_\be_\b(_\b)_\b _\bl_\ba_\bs_\bt_\b__\bp_\bi_\be_\bc_\be_\b(_\b)\n+ o _\bi_\bn_\bf_\bo_\b__\bh_\ba_\bs_\bh_\be_\bs_\b(_\b)_\b _\bi_\bn_\bf_\bo_\b__\bh_\ba_\bs_\bh_\b(_\b)\n+ o _\bv_\b2_\b(_\b)_\b _\bv_\b1_\b(_\b)\n o _\bn_\bu_\bm_\b__\bf_\bi_\bl_\be_\bs_\b(_\b)\n o _\bm_\ba_\bp_\b__\bb_\bl_\bo_\bc_\bk_\b(_\b)\n o _\bm_\ba_\bp_\b__\bf_\bi_\bl_\be_\b(_\b)\n o _\bs_\bs_\bl_\b__\bc_\be_\br_\bt_\b(_\b)\n o _\bi_\bs_\b__\bv_\ba_\bl_\bi_\bd_\b(_\b)\n o _\bp_\br_\bi_\bv_\b(_\b)\n o _\bi_\bs_\b__\bi_\b2_\bp_\b(_\b)\n@@ -113,28 +288,111 @@\n o _\bn_\bo_\bd_\be_\bs_\b(_\b)\n o _\ba_\bd_\bd_\b__\bn_\bo_\bd_\be_\b(_\b)\n o _\bp_\ba_\br_\bs_\be_\b__\bi_\bn_\bf_\bo_\b__\bs_\be_\bc_\bt_\bi_\bo_\bn_\b(_\b)\n o _\bi_\bn_\bf_\bo_\b(_\b)\n o _\bi_\bn_\bf_\bo_\b__\bs_\be_\bc_\bt_\bi_\bo_\bn_\b(_\b)\n o _\bp_\bi_\be_\bc_\be_\b__\bl_\ba_\by_\be_\br_\b(_\b)\n o _\bf_\br_\be_\be_\b__\bp_\bi_\be_\bc_\be_\b__\bl_\ba_\by_\be_\br_\bs_\b(_\b)\n+ * _\ba_\bn_\bn_\bo_\bu_\bn_\bc_\be_\b__\bi_\bn_\bf_\bo_\bh_\ba_\bs_\bh\n+ * _\ba_\bn_\bn_\bo_\bu_\bn_\bc_\be_\b__\be_\bn_\bd_\bp_\bo_\bi_\bn_\bt\n+ * _\ba_\bn_\bn_\bo_\bu_\bn_\bc_\be_\b__\be_\bn_\bt_\br_\by\n+ o _\ba_\bn_\bn_\bo_\bu_\bn_\bc_\be_\b__\be_\bn_\bt_\br_\by_\b(_\b)_\b _\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b=_\b(_\b)_\b _\b~_\ba_\bn_\bn_\bo_\bu_\bn_\bc_\be_\b__\be_\bn_\bt_\br_\by_\b(_\b)\n+ o _\be_\bn_\bu_\bm_\b _\bt_\br_\ba_\bc_\bk_\be_\br_\b__\bs_\bo_\bu_\br_\bc_\be\n+ * _\ba_\b _\bw_\bo_\br_\bd_\b _\bo_\bf_\b _\bc_\ba_\bu_\bt_\bi_\bo_\bn\n+ * _\bp_\bl_\bu_\bg_\bi_\bn_\b-_\bi_\bn_\bt_\be_\br_\bf_\ba_\bc_\be\n+ * _\bc_\bu_\bs_\bt_\bo_\bm_\b _\ba_\bl_\be_\br_\bt_\bs\n+ * _\bp_\bl_\bu_\bg_\bi_\bn\n+ o _\bi_\bm_\bp_\bl_\be_\bm_\be_\bn_\bt_\be_\bd_\b__\bf_\be_\ba_\bt_\bu_\br_\be_\bs_\b(_\b)\n+ o _\bn_\be_\bw_\b__\bt_\bo_\br_\br_\be_\bn_\bt_\b(_\b)\n+ o _\ba_\bd_\bd_\be_\bd_\b(_\b)\n+ o _\ba_\bb_\bo_\br_\bt_\b(_\b)\n+ o _\bo_\bn_\b__\bd_\bh_\bt_\b__\br_\be_\bq_\bu_\be_\bs_\bt_\b(_\b)\n+ o _\bo_\bn_\b__\ba_\bl_\be_\br_\bt_\b(_\b)\n+ o _\bo_\bn_\b__\bu_\bn_\bk_\bn_\bo_\bw_\bn_\b__\bt_\bo_\br_\br_\be_\bn_\bt_\b(_\b)\n+ o _\bo_\bn_\b__\bt_\bi_\bc_\bk_\b(_\b)\n+ o _\bg_\be_\bt_\b__\bu_\bn_\bc_\bh_\bo_\bk_\be_\b__\bp_\br_\bi_\bo_\br_\bi_\bt_\by_\b(_\b)\n+ o _\bl_\bo_\ba_\bd_\b__\bs_\bt_\ba_\bt_\be_\b(_\b)\n+ * _\bt_\bo_\br_\br_\be_\bn_\bt_\b__\bp_\bl_\bu_\bg_\bi_\bn\n+ o _\bn_\be_\bw_\b__\bc_\bo_\bn_\bn_\be_\bc_\bt_\bi_\bo_\bn_\b(_\b)\n+ o _\bo_\bn_\b__\bp_\bi_\be_\bc_\be_\b__\bp_\ba_\bs_\bs_\b(_\b)_\b _\bo_\bn_\b__\bp_\bi_\be_\bc_\be_\b__\bf_\ba_\bi_\bl_\be_\bd_\b(_\b)\n+ o _\bt_\bi_\bc_\bk_\b(_\b)\n+ o _\bo_\bn_\b__\bp_\ba_\bu_\bs_\be_\b(_\b)_\b _\bo_\bn_\b__\br_\be_\bs_\bu_\bm_\be_\b(_\b)\n+ o _\bo_\bn_\b__\bf_\bi_\bl_\be_\bs_\b__\bc_\bh_\be_\bc_\bk_\be_\bd_\b(_\b)\n+ o _\bo_\bn_\b__\bs_\bt_\ba_\bt_\be_\b(_\b)\n+ o _\bo_\bn_\b__\ba_\bd_\bd_\b__\bp_\be_\be_\br_\b(_\b)\n+ * _\bp_\be_\be_\br_\b__\bp_\bl_\bu_\bg_\bi_\bn\n+ o _\bt_\by_\bp_\be_\b(_\b)\n+ o _\ba_\bd_\bd_\b__\bh_\ba_\bn_\bd_\bs_\bh_\ba_\bk_\be_\b(_\b)\n+ o _\bo_\bn_\b__\bd_\bi_\bs_\bc_\bo_\bn_\bn_\be_\bc_\bt_\b(_\b)\n+ o _\bo_\bn_\b__\bc_\bo_\bn_\bn_\be_\bc_\bt_\be_\bd_\b(_\b)\n+ o _\bo_\bn_\b__\bh_\ba_\bn_\bd_\bs_\bh_\ba_\bk_\be_\b(_\b)\n+ o _\bo_\bn_\b__\be_\bx_\bt_\be_\bn_\bs_\bi_\bo_\bn_\b__\bh_\ba_\bn_\bd_\bs_\bh_\ba_\bk_\be_\b(_\b)\n+ o _\bo_\bn_\b__\bb_\bi_\bt_\bf_\bi_\be_\bl_\bd_\b(_\b)_\b _\bo_\bn_\b__\br_\be_\bq_\bu_\be_\bs_\bt_\b(_\b)_\b _\bo_\bn_\b__\bh_\ba_\bv_\be_\b__\ba_\bl_\bl_\b(_\b)_\b _\bo_\bn_\b__\bc_\bh_\bo_\bk_\be_\b(_\b)_\b _\bo_\bn_\b__\bi_\bn_\bt_\be_\br_\be_\bs_\bt_\be_\bd_\b(_\b)\n+ _\bo_\bn_\b__\bd_\bo_\bn_\bt_\b__\bh_\ba_\bv_\be_\b(_\b)_\b _\bo_\bn_\b__\bh_\ba_\bv_\be_\b__\bn_\bo_\bn_\be_\b(_\b)_\b _\bo_\bn_\b__\ba_\bl_\bl_\bo_\bw_\be_\bd_\b__\bf_\ba_\bs_\bt_\b(_\b)_\b _\bo_\bn_\b__\bh_\ba_\bv_\be_\b(_\b)\n+ _\bo_\bn_\b__\bn_\bo_\bt_\b__\bi_\bn_\bt_\be_\br_\be_\bs_\bt_\be_\bd_\b(_\b)_\b _\bo_\bn_\b__\bu_\bn_\bc_\bh_\bo_\bk_\be_\b(_\b)\n+ o _\bo_\bn_\b__\bp_\bi_\be_\bc_\be_\b(_\b)\n+ o _\bs_\be_\bn_\bt_\b__\bu_\bn_\bc_\bh_\bo_\bk_\be_\b(_\b)_\b _\bs_\be_\bn_\bt_\b__\bh_\ba_\bv_\be_\b(_\b)_\b _\bs_\be_\bn_\bt_\b__\bi_\bn_\bt_\be_\br_\be_\bs_\bt_\be_\bd_\b(_\b)_\b _\bs_\be_\bn_\bt_\b__\bn_\bo_\bt_\b__\bi_\bn_\bt_\be_\br_\be_\bs_\bt_\be_\bd_\b(_\b)\n+ _\bs_\be_\bn_\bt_\b__\bp_\bi_\be_\bc_\be_\b(_\b)\n+ o _\bs_\be_\bn_\bt_\b__\bp_\ba_\by_\bl_\bo_\ba_\bd_\b(_\b)\n+ o _\bc_\ba_\bn_\b__\bd_\bi_\bs_\bc_\bo_\bn_\bn_\be_\bc_\bt_\b(_\b)\n+ o _\bo_\bn_\b__\be_\bx_\bt_\be_\bn_\bd_\be_\bd_\b(_\b)\n+ o _\bo_\bn_\b__\bu_\bn_\bk_\bn_\bo_\bw_\bn_\b__\bm_\be_\bs_\bs_\ba_\bg_\be_\b(_\b)\n+ o _\bo_\bn_\b__\bp_\bi_\be_\bc_\be_\b__\bp_\ba_\bs_\bs_\b(_\b)_\b _\bo_\bn_\b__\bp_\bi_\be_\bc_\be_\b__\bf_\ba_\bi_\bl_\be_\bd_\b(_\b)\n+ o _\bt_\bi_\bc_\bk_\b(_\b)\n+ o _\bw_\br_\bi_\bt_\be_\b__\br_\be_\bq_\bu_\be_\bs_\bt_\b(_\b)\n+ * _\bc_\br_\by_\bp_\bt_\bo_\b__\bp_\bl_\bu_\bg_\bi_\bn\n+ o _\bd_\be_\bc_\br_\by_\bp_\bt_\b(_\b)\n+ * _\bp_\be_\be_\br_\b__\bc_\bo_\bn_\bn_\be_\bc_\bt_\bi_\bo_\bn_\b__\bh_\ba_\bn_\bd_\bl_\be\n+ * _\bb_\bt_\b__\bp_\be_\be_\br_\b__\bc_\bo_\bn_\bn_\be_\bc_\bt_\bi_\bo_\bn_\b__\bh_\ba_\bn_\bd_\bl_\be\n+ * _\bc_\br_\be_\ba_\bt_\be_\b__\bu_\bt_\b__\bp_\be_\bx_\b__\bp_\bl_\bu_\bg_\bi_\bn_\b(_\b)\n+ * _\bc_\br_\be_\ba_\bt_\be_\b__\bs_\bm_\ba_\br_\bt_\b__\bb_\ba_\bn_\b__\bp_\bl_\bu_\bg_\bi_\bn_\b(_\b)\n+ * _\bc_\br_\be_\ba_\bt_\be_\b__\bu_\bt_\b__\bm_\be_\bt_\ba_\bd_\ba_\bt_\ba_\b__\bp_\bl_\bu_\bg_\bi_\bn_\b(_\b)\n+ * _\bc_\br_\be_\ba_\bt_\be_\b__\bt_\bo_\br_\br_\be_\bn_\bt\n+ o _\bc_\br_\be_\ba_\bt_\be_\b__\bt_\bo_\br_\br_\be_\bn_\bt_\b(_\b)\n+ o _\bg_\be_\bn_\be_\br_\ba_\bt_\be_\b(_\b)_\b _\bg_\be_\bn_\be_\br_\ba_\bt_\be_\b__\bb_\bu_\bf_\b(_\b)\n+ o _\bf_\bi_\bl_\be_\bs_\b(_\b)\n+ o _\bs_\be_\bt_\b__\bc_\bo_\bm_\bm_\be_\bn_\bt_\b(_\b)\n+ o _\bs_\be_\bt_\b__\bc_\br_\be_\ba_\bt_\bo_\br_\b(_\b)\n+ o _\bs_\be_\bt_\b__\bc_\br_\be_\ba_\bt_\bi_\bo_\bn_\b__\bd_\ba_\bt_\be_\b(_\b)\n+ o _\bs_\be_\bt_\b__\bh_\ba_\bs_\bh_\b(_\b)\n+ o _\bs_\be_\bt_\b__\bh_\ba_\bs_\bh_\b2_\b(_\b)\n+ o _\ba_\bd_\bd_\b__\bu_\br_\bl_\b__\bs_\be_\be_\bd_\b(_\b)_\b _\ba_\bd_\bd_\b__\bh_\bt_\bt_\bp_\b__\bs_\be_\be_\bd_\b(_\b)\n+ o _\ba_\bd_\bd_\b__\bn_\bo_\bd_\be_\b(_\b)\n+ o _\ba_\bd_\bd_\b__\bt_\br_\ba_\bc_\bk_\be_\br_\b(_\b)\n+ o _\bs_\be_\bt_\b__\br_\bo_\bo_\bt_\b__\bc_\be_\br_\bt_\b(_\b)\n+ o _\bp_\br_\bi_\bv_\b(_\b)_\b _\bs_\be_\bt_\b__\bp_\br_\bi_\bv_\b(_\b)\n+ o _\bn_\bu_\bm_\b__\bp_\bi_\be_\bc_\be_\bs_\b(_\b)\n+ o _\bp_\bi_\be_\bc_\be_\b__\br_\ba_\bn_\bg_\be_\b(_\b)\n+ o _\bf_\bi_\bl_\be_\b__\br_\ba_\bn_\bg_\be_\b(_\b)\n+ o _\bf_\bi_\bl_\be_\b__\bp_\bi_\be_\bc_\be_\b__\br_\ba_\bn_\bg_\be_\b(_\b)\n+ o _\bt_\bo_\bt_\ba_\bl_\b__\bs_\bi_\bz_\be_\b(_\b)\n+ o _\bp_\bi_\be_\bc_\be_\b__\bl_\be_\bn_\bg_\bt_\bh_\b(_\b)_\b _\bp_\bi_\be_\bc_\be_\b__\bs_\bi_\bz_\be_\b(_\b)\n+ o _\ba_\bd_\bd_\b__\bs_\bi_\bm_\bi_\bl_\ba_\br_\b__\bt_\bo_\br_\br_\be_\bn_\bt_\b(_\b)_\b _\ba_\bd_\bd_\b__\bc_\bo_\bl_\bl_\be_\bc_\bt_\bi_\bo_\bn_\b(_\b)\n+ * _\ba_\bd_\bd_\b__\bf_\bi_\bl_\be_\bs_\b(_\b)\n+ * _\bs_\be_\bt_\b__\bp_\bi_\be_\bc_\be_\b__\bh_\ba_\bs_\bh_\be_\bs_\b(_\b)\n * _\be_\bn_\bt_\br_\by\n o _\bt_\by_\bp_\be_\b(_\b)\n o _\be_\bn_\bt_\br_\by_\b(_\b)\n o _\be_\bn_\bt_\br_\by_\b(_\b)\n o _\be_\bn_\bt_\br_\by_\b(_\b)\n o _\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b=_\b(_\b)\n- o _\bs_\bt_\br_\bi_\bn_\bg_\b(_\b)_\b _\bi_\bn_\bt_\be_\bg_\be_\br_\b(_\b)_\b _\bl_\bi_\bs_\bt_\b(_\b)_\b _\bp_\br_\be_\bf_\bo_\br_\bm_\ba_\bt_\bt_\be_\bd_\b(_\b)_\b _\bd_\bi_\bc_\bt_\b(_\b)\n+ o _\bd_\bi_\bc_\bt_\b(_\b)_\b _\bp_\br_\be_\bf_\bo_\br_\bm_\ba_\bt_\bt_\be_\bd_\b(_\b)_\b _\bi_\bn_\bt_\be_\bg_\be_\br_\b(_\b)_\b _\bs_\bt_\br_\bi_\bn_\bg_\b(_\b)_\b _\bl_\bi_\bs_\bt_\b(_\b)\n o _\bs_\bw_\ba_\bp_\b(_\b)\n o _\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b[_\b]_\b(_\b)\n o _\bf_\bi_\bn_\bd_\b__\bk_\be_\by_\b(_\b)\n o _\bt_\bo_\b__\bs_\bt_\br_\bi_\bn_\bg_\b(_\b)\n o _\be_\bn_\bu_\bm_\b _\bd_\ba_\bt_\ba_\b__\bt_\by_\bp_\be\n * _\bb_\be_\bn_\bc_\bo_\bd_\be_\b(_\b)\n * _\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b<_\b<_\b(_\b)\n+ * _\bp_\be_\be_\br_\b__\bc_\bl_\ba_\bs_\bs_\b__\bt_\by_\bp_\be_\b__\bf_\bi_\bl_\bt_\be_\br\n+ o _\br_\be_\bm_\bo_\bv_\be_\b(_\b)_\b _\ba_\bd_\bd_\b(_\b)\n+ o _\ba_\bl_\bl_\bo_\bw_\b(_\b)_\b _\bd_\bi_\bs_\ba_\bl_\bl_\bo_\bw_\b(_\b)\n+ o _\ba_\bp_\bp_\bl_\by_\b(_\b)\n+ o _\be_\bn_\bu_\bm_\b _\bs_\bo_\bc_\bk_\be_\bt_\b__\bt_\by_\bp_\be_\b__\bt\n+ * _\bp_\be_\be_\br_\b__\bc_\bl_\ba_\bs_\bs_\b__\bi_\bn_\bf_\bo\n * _\bd_\bh_\bt_\b__\br_\bo_\bu_\bt_\bi_\bn_\bg_\b__\bb_\bu_\bc_\bk_\be_\bt\n * _\bt_\bo_\br_\br_\be_\bn_\bt_\b__\ba_\bl_\be_\br_\bt\n o _\bm_\be_\bs_\bs_\ba_\bg_\be_\b(_\b)\n * _\bp_\be_\be_\br_\b__\ba_\bl_\be_\br_\bt\n * _\bt_\br_\ba_\bc_\bk_\be_\br_\b__\ba_\bl_\be_\br_\bt\n o _\bt_\br_\ba_\bc_\bk_\be_\br_\b__\bu_\br_\bl_\b(_\b)\n * _\bt_\bo_\br_\br_\be_\bn_\bt_\b__\br_\be_\bm_\bo_\bv_\be_\bd_\b__\ba_\bl_\be_\br_\bt\n@@ -169,15 +427,15 @@\n * _\bp_\bi_\be_\bc_\be_\b__\bf_\bi_\bn_\bi_\bs_\bh_\be_\bd_\b__\ba_\bl_\be_\br_\bt\n * _\br_\be_\bq_\bu_\be_\bs_\bt_\b__\bd_\br_\bo_\bp_\bp_\be_\bd_\b__\ba_\bl_\be_\br_\bt\n * _\bb_\bl_\bo_\bc_\bk_\b__\bt_\bi_\bm_\be_\bo_\bu_\bt_\b__\ba_\bl_\be_\br_\bt\n * _\bb_\bl_\bo_\bc_\bk_\b__\bf_\bi_\bn_\bi_\bs_\bh_\be_\bd_\b__\ba_\bl_\be_\br_\bt\n * _\bb_\bl_\bo_\bc_\bk_\b__\bd_\bo_\bw_\bn_\bl_\bo_\ba_\bd_\bi_\bn_\bg_\b__\ba_\bl_\be_\br_\bt\n * _\bu_\bn_\bw_\ba_\bn_\bt_\be_\bd_\b__\bb_\bl_\bo_\bc_\bk_\b__\ba_\bl_\be_\br_\bt\n * _\bs_\bt_\bo_\br_\ba_\bg_\be_\b__\bm_\bo_\bv_\be_\bd_\b__\ba_\bl_\be_\br_\bt\n- o _\bs_\bt_\bo_\br_\ba_\bg_\be_\b__\bp_\ba_\bt_\bh_\b(_\b)_\b _\bo_\bl_\bd_\b__\bp_\ba_\bt_\bh_\b(_\b)\n+ o _\bo_\bl_\bd_\b__\bp_\ba_\bt_\bh_\b(_\b)_\b _\bs_\bt_\bo_\br_\ba_\bg_\be_\b__\bp_\ba_\bt_\bh_\b(_\b)\n * _\bs_\bt_\bo_\br_\ba_\bg_\be_\b__\bm_\bo_\bv_\be_\bd_\b__\bf_\ba_\bi_\bl_\be_\bd_\b__\ba_\bl_\be_\br_\bt\n o _\bf_\bi_\bl_\be_\b__\bp_\ba_\bt_\bh_\b(_\b)\n * _\bt_\bo_\br_\br_\be_\bn_\bt_\b__\bd_\be_\bl_\be_\bt_\be_\bd_\b__\ba_\bl_\be_\br_\bt\n * _\bt_\bo_\br_\br_\be_\bn_\bt_\b__\bd_\be_\bl_\be_\bt_\be_\b__\bf_\ba_\bi_\bl_\be_\bd_\b__\ba_\bl_\be_\br_\bt\n * _\bs_\ba_\bv_\be_\b__\br_\be_\bs_\bu_\bm_\be_\b__\bd_\ba_\bt_\ba_\b__\ba_\bl_\be_\br_\bt\n * _\bs_\ba_\bv_\be_\b__\br_\be_\bs_\bu_\bm_\be_\b__\bd_\ba_\bt_\ba_\b__\bf_\ba_\bi_\bl_\be_\bd_\b__\ba_\bl_\be_\br_\bt\n * _\bt_\bo_\br_\br_\be_\bn_\bt_\b__\bp_\ba_\bu_\bs_\be_\bd_\b__\ba_\bl_\be_\br_\bt\n@@ -245,15 +503,15 @@\n * _\bd_\bh_\bt_\b__\bd_\bi_\br_\be_\bc_\bt_\b__\br_\be_\bs_\bp_\bo_\bn_\bs_\be_\b__\ba_\bl_\be_\br_\bt\n * _\bp_\bi_\bc_\bk_\be_\br_\b__\bl_\bo_\bg_\b__\ba_\bl_\be_\br_\bt\n * _\bs_\be_\bs_\bs_\bi_\bo_\bn_\b__\be_\br_\br_\bo_\br_\b__\ba_\bl_\be_\br_\bt\n * _\bd_\bh_\bt_\b__\bl_\bi_\bv_\be_\b__\bn_\bo_\bd_\be_\bs_\b__\ba_\bl_\be_\br_\bt\n o _\bn_\bu_\bm_\b__\bn_\bo_\bd_\be_\bs_\b(_\b)_\b _\bn_\bo_\bd_\be_\bs_\b(_\b)\n * _\bs_\be_\bs_\bs_\bi_\bo_\bn_\b__\bs_\bt_\ba_\bt_\bs_\b__\bh_\be_\ba_\bd_\be_\br_\b__\ba_\bl_\be_\br_\bt\n * _\bd_\bh_\bt_\b__\bs_\ba_\bm_\bp_\bl_\be_\b__\bi_\bn_\bf_\bo_\bh_\ba_\bs_\bh_\be_\bs_\b__\ba_\bl_\be_\br_\bt\n- o _\bn_\bu_\bm_\b__\bs_\ba_\bm_\bp_\bl_\be_\bs_\b(_\b)_\b _\bs_\ba_\bm_\bp_\bl_\be_\bs_\b(_\b)\n+ o _\bs_\ba_\bm_\bp_\bl_\be_\bs_\b(_\b)_\b _\bn_\bu_\bm_\b__\bs_\ba_\bm_\bp_\bl_\be_\bs_\b(_\b)\n o _\bn_\bu_\bm_\b__\bn_\bo_\bd_\be_\bs_\b(_\b)\n o _\bn_\bo_\bd_\be_\bs_\b(_\b)\n * _\bb_\bl_\bo_\bc_\bk_\b__\bu_\bp_\bl_\bo_\ba_\bd_\be_\bd_\b__\ba_\bl_\be_\br_\bt\n * _\ba_\bl_\be_\br_\bt_\bs_\b__\bd_\br_\bo_\bp_\bp_\be_\bd_\b__\ba_\bl_\be_\br_\bt\n * _\bs_\bo_\bc_\bk_\bs_\b5_\b__\ba_\bl_\be_\br_\bt\n * _\bf_\bi_\bl_\be_\b__\bp_\br_\bi_\bo_\b__\ba_\bl_\be_\br_\bt\n * _\bo_\bv_\be_\br_\bs_\bi_\bz_\be_\bd_\b__\bf_\bi_\bl_\be_\b__\ba_\bl_\be_\br_\bt\n@@ -270,1185 +528,128 @@\n o _\bm_\be_\bs_\bs_\ba_\bg_\be_\b(_\b)\n o _\bc_\ba_\bt_\be_\bg_\bo_\br_\by_\b(_\b)\n * _\bo_\bp_\be_\br_\ba_\bt_\bi_\bo_\bn_\b__\bn_\ba_\bm_\be_\b(_\b)\n * _\ba_\bl_\be_\br_\bt_\b__\bc_\ba_\bs_\bt_\b(_\b)\n * _\be_\bn_\bu_\bm_\b _\bo_\bp_\be_\br_\ba_\bt_\bi_\bo_\bn_\b__\bt\n * _\bi_\bn_\bt\n * _\ba_\bl_\be_\br_\bt_\b__\bc_\ba_\bt_\be_\bg_\bo_\br_\by_\b__\bt\n- * _\bt_\bo_\br_\br_\be_\bn_\bt_\b__\bs_\bt_\ba_\bt_\bu_\bs\n- o _\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b=_\b=_\b(_\b)\n- o _\be_\bn_\bu_\bm_\b _\bs_\bt_\ba_\bt_\be_\b__\bt\n- * _\bs_\be_\bs_\bs_\bi_\bo_\bn_\b__\bp_\br_\bo_\bx_\by\n- o _\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b=_\b(_\b)_\b _\b~_\bs_\be_\bs_\bs_\bi_\bo_\bn_\b__\bp_\br_\bo_\bx_\by_\b(_\b)_\b _\bs_\be_\bs_\bs_\bi_\bo_\bn_\b__\bp_\br_\bo_\bx_\by_\b(_\b)\n- * _\bs_\be_\bs_\bs_\bi_\bo_\bn\n- o _\bs_\be_\bs_\bs_\bi_\bo_\bn_\b(_\b)\n- o _\bs_\be_\bs_\bs_\bi_\bo_\bn_\b(_\b)\n- o _\b~_\bs_\be_\bs_\bs_\bi_\bo_\bn_\b(_\b)\n- o _\ba_\bb_\bo_\br_\bt_\b(_\b)\n- * _\bs_\be_\bs_\bs_\bi_\bo_\bn_\b__\bh_\ba_\bn_\bd_\bl_\be\n- o _\bi_\bs_\b__\bv_\ba_\bl_\bi_\bd_\b(_\b)\n- o _\bs_\be_\bs_\bs_\bi_\bo_\bn_\b__\bs_\bt_\ba_\bt_\be_\b(_\b)\n- o _\br_\be_\bf_\br_\be_\bs_\bh_\b__\bt_\bo_\br_\br_\be_\bn_\bt_\b__\bs_\bt_\ba_\bt_\bu_\bs_\b(_\b)_\b _\bg_\be_\bt_\b__\bt_\bo_\br_\br_\be_\bn_\bt_\b__\bs_\bt_\ba_\bt_\bu_\bs_\b(_\b)\n- o _\bp_\bo_\bs_\bt_\b__\bt_\bo_\br_\br_\be_\bn_\bt_\b__\bu_\bp_\bd_\ba_\bt_\be_\bs_\b(_\b)\n- o _\bp_\bo_\bs_\bt_\b__\bs_\be_\bs_\bs_\bi_\bo_\bn_\b__\bs_\bt_\ba_\bt_\bs_\b(_\b)\n- o _\bp_\bo_\bs_\bt_\b__\bd_\bh_\bt_\b__\bs_\bt_\ba_\bt_\bs_\b(_\b)\n- o _\bs_\be_\bt_\b__\bd_\bh_\bt_\b__\bs_\bt_\ba_\bt_\be_\b(_\b)\n- o _\bf_\bi_\bn_\bd_\b__\bt_\bo_\br_\br_\be_\bn_\bt_\b(_\b)_\b _\bg_\be_\bt_\b__\bt_\bo_\br_\br_\be_\bn_\bt_\bs_\b(_\b)\n- o _\ba_\bd_\bd_\b__\bt_\bo_\br_\br_\be_\bn_\bt_\b(_\b)_\b _\ba_\bs_\by_\bn_\bc_\b__\ba_\bd_\bd_\b__\bt_\bo_\br_\br_\be_\bn_\bt_\b(_\b)\n- o _\bp_\ba_\bu_\bs_\be_\b(_\b)_\b _\bi_\bs_\b__\bp_\ba_\bu_\bs_\be_\bd_\b(_\b)_\b _\br_\be_\bs_\bu_\bm_\be_\b(_\b)\n- o _\bi_\bs_\b__\bd_\bh_\bt_\b__\br_\bu_\bn_\bn_\bi_\bn_\bg_\b(_\b)\n- o _\bs_\be_\bt_\b__\bd_\bh_\bt_\b__\bs_\bt_\bo_\br_\ba_\bg_\be_\b(_\b)\n- o _\ba_\bd_\bd_\b__\bd_\bh_\bt_\b__\bn_\bo_\bd_\be_\b(_\b)\n- o _\bd_\bh_\bt_\b__\bg_\be_\bt_\b__\bi_\bt_\be_\bm_\b(_\b)\n- o _\bd_\bh_\bt_\b__\bg_\be_\bt_\b__\bi_\bt_\be_\bm_\b(_\b)\n- o _\bd_\bh_\bt_\b__\bp_\bu_\bt_\b__\bi_\bt_\be_\bm_\b(_\b)\n- o _\bd_\bh_\bt_\b__\bp_\bu_\bt_\b__\bi_\bt_\be_\bm_\b(_\b)\n- o _\bd_\bh_\bt_\b__\bg_\be_\bt_\b__\bp_\be_\be_\br_\bs_\b(_\b)_\b _\bd_\bh_\bt_\b__\ba_\bn_\bn_\bo_\bu_\bn_\bc_\be_\b(_\b)\n- o _\bd_\bh_\bt_\b__\bl_\bi_\bv_\be_\b__\bn_\bo_\bd_\be_\bs_\b(_\b)\n- o _\bd_\bh_\bt_\b__\bs_\ba_\bm_\bp_\bl_\be_\b__\bi_\bn_\bf_\bo_\bh_\ba_\bs_\bh_\be_\bs_\b(_\b)\n- o _\bd_\bh_\bt_\b__\bd_\bi_\br_\be_\bc_\bt_\b__\br_\be_\bq_\bu_\be_\bs_\bt_\b(_\b)\n- o _\ba_\bd_\bd_\b__\be_\bx_\bt_\be_\bn_\bs_\bi_\bo_\bn_\b(_\b)\n- o _\bs_\be_\bt_\b__\bi_\bp_\b__\bf_\bi_\bl_\bt_\be_\br_\b(_\b)_\b _\bg_\be_\bt_\b__\bi_\bp_\b__\bf_\bi_\bl_\bt_\be_\br_\b(_\b)\n- o _\bs_\be_\bt_\b__\bp_\bo_\br_\bt_\b__\bf_\bi_\bl_\bt_\be_\br_\b(_\b)\n- o _\bl_\bi_\bs_\bt_\be_\bn_\b__\bp_\bo_\br_\bt_\b(_\b)_\b _\bi_\bs_\b__\bl_\bi_\bs_\bt_\be_\bn_\bi_\bn_\bg_\b(_\b)_\b _\bs_\bs_\bl_\b__\bl_\bi_\bs_\bt_\be_\bn_\b__\bp_\bo_\br_\bt_\b(_\b)\n- o _\bs_\be_\bt_\b__\bp_\be_\be_\br_\b__\bc_\bl_\ba_\bs_\bs_\b__\bf_\bi_\bl_\bt_\be_\br_\b(_\b)_\b _\bg_\be_\bt_\b__\bp_\be_\be_\br_\b__\bc_\bl_\ba_\bs_\bs_\b__\bf_\bi_\bl_\bt_\be_\br_\b(_\b)\n- o _\bg_\be_\bt_\b__\bp_\be_\be_\br_\b__\bc_\bl_\ba_\bs_\bs_\b__\bt_\by_\bp_\be_\b__\bf_\bi_\bl_\bt_\be_\br_\b(_\b)_\b _\bs_\be_\bt_\b__\bp_\be_\be_\br_\b__\bc_\bl_\ba_\bs_\bs_\b__\bt_\by_\bp_\be_\b__\bf_\bi_\bl_\bt_\be_\br_\b(_\b)\n- o _\bc_\br_\be_\ba_\bt_\be_\b__\bp_\be_\be_\br_\b__\bc_\bl_\ba_\bs_\bs_\b(_\b)\n- o _\bd_\be_\bl_\be_\bt_\be_\b__\bp_\be_\be_\br_\b__\bc_\bl_\ba_\bs_\bs_\b(_\b)\n- o _\bg_\be_\bt_\b__\bp_\be_\be_\br_\b__\bc_\bl_\ba_\bs_\bs_\b(_\b)_\b _\bs_\be_\bt_\b__\bp_\be_\be_\br_\b__\bc_\bl_\ba_\bs_\bs_\b(_\b)\n- o _\br_\be_\bm_\bo_\bv_\be_\b__\bt_\bo_\br_\br_\be_\bn_\bt_\b(_\b)\n- o _\bg_\be_\bt_\b__\bs_\be_\bt_\bt_\bi_\bn_\bg_\bs_\b(_\b)_\b _\ba_\bp_\bp_\bl_\by_\b__\bs_\be_\bt_\bt_\bi_\bn_\bg_\bs_\b(_\b)\n- o _\bw_\ba_\bi_\bt_\b__\bf_\bo_\br_\b__\ba_\bl_\be_\br_\bt_\b(_\b)_\b _\bs_\be_\bt_\b__\ba_\bl_\be_\br_\bt_\b__\bn_\bo_\bt_\bi_\bf_\by_\b(_\b)_\b _\bp_\bo_\bp_\b__\ba_\bl_\be_\br_\bt_\bs_\b(_\b)\n- o _\bd_\be_\bl_\be_\bt_\be_\b__\bp_\bo_\br_\bt_\b__\bm_\ba_\bp_\bp_\bi_\bn_\bg_\b(_\b)_\b _\ba_\bd_\bd_\b__\bp_\bo_\br_\bt_\b__\bm_\ba_\bp_\bp_\bi_\bn_\bg_\b(_\b)\n- o _\br_\be_\bo_\bp_\be_\bn_\b__\bn_\be_\bt_\bw_\bo_\br_\bk_\b__\bs_\bo_\bc_\bk_\be_\bt_\bs_\b(_\b)\n- o _\bn_\ba_\bt_\bi_\bv_\be_\b__\bh_\ba_\bn_\bd_\bl_\be_\b(_\b)\n- * _\bs_\be_\bs_\bs_\bi_\bo_\bn_\b__\bp_\ba_\br_\ba_\bm_\bs\n- o _\bs_\be_\bs_\bs_\bi_\bo_\bn_\b__\bp_\ba_\br_\ba_\bm_\bs_\b(_\b)\n- o _\bs_\be_\bs_\bs_\bi_\bo_\bn_\b__\bp_\ba_\br_\ba_\bm_\bs_\b(_\b)\n- * _\bw_\br_\bi_\bt_\be_\b__\bs_\be_\bs_\bs_\bi_\bo_\bn_\b__\bp_\ba_\br_\ba_\bm_\bs_\b__\bb_\bu_\bf_\b(_\b)_\b _\bw_\br_\bi_\bt_\be_\b__\bs_\be_\bs_\bs_\bi_\bo_\bn_\b__\bp_\ba_\br_\ba_\bm_\bs_\b(_\b)_\b _\br_\be_\ba_\bd_\b__\bs_\be_\bs_\bs_\bi_\bo_\bn_\b__\bp_\ba_\br_\ba_\bm_\bs_\b(_\b)\n- * _\bd_\bi_\bs_\bk_\b__\bo_\bb_\bs_\be_\br_\bv_\be_\br\n- o _\bo_\bn_\b__\bd_\bi_\bs_\bk_\b(_\b)\n- * _\bb_\bu_\bf_\bf_\be_\br_\b__\ba_\bl_\bl_\bo_\bc_\ba_\bt_\bo_\br_\b__\bi_\bn_\bt_\be_\br_\bf_\ba_\bc_\be\n- * _\bd_\bi_\bs_\bk_\b__\bb_\bu_\bf_\bf_\be_\br_\b__\bh_\bo_\bl_\bd_\be_\br\n- o _\bd_\bi_\bs_\bk_\b__\bb_\bu_\bf_\bf_\be_\br_\b__\bh_\bo_\bl_\bd_\be_\br_\b(_\b)\n- o _\bd_\bi_\bs_\bk_\b__\bb_\bu_\bf_\bf_\be_\br_\b__\bh_\bo_\bl_\bd_\be_\br_\b(_\b)\n- o _\b~_\bd_\bi_\bs_\bk_\b__\bb_\bu_\bf_\bf_\be_\br_\b__\bh_\bo_\bl_\bd_\be_\br_\b(_\b)\n- o _\bd_\ba_\bt_\ba_\b(_\b)\n- o _\br_\be_\bs_\be_\bt_\b(_\b)\n- o _\bs_\bw_\ba_\bp_\b(_\b)\n- o _\bi_\bs_\b__\bm_\bu_\bt_\ba_\bb_\bl_\be_\b(_\b)\n- o _\bb_\bo_\bo_\bl_\b(_\b)\n- * _\bs_\be_\bt_\bt_\bi_\bn_\bg_\bs_\b__\bi_\bn_\bt_\be_\br_\bf_\ba_\bc_\be\n- * _\bo_\bp_\be_\bn_\b__\bf_\bi_\bl_\be_\b__\bs_\bt_\ba_\bt_\be\n- * _\bd_\bi_\bs_\bk_\b__\bi_\bn_\bt_\be_\br_\bf_\ba_\bc_\be\n- o _\bn_\be_\bw_\b__\bt_\bo_\br_\br_\be_\bn_\bt_\b(_\b)\n- o _\br_\be_\bm_\bo_\bv_\be_\b__\bt_\bo_\br_\br_\be_\bn_\bt_\b(_\b)\n- o _\ba_\bs_\by_\bn_\bc_\b__\bw_\br_\bi_\bt_\be_\b(_\b)_\b _\ba_\bs_\by_\bn_\bc_\b__\br_\be_\ba_\bd_\b(_\b)\n- o _\ba_\bs_\by_\bn_\bc_\b__\bh_\ba_\bs_\bh_\b(_\b)\n- o _\ba_\bs_\by_\bn_\bc_\b__\bh_\ba_\bs_\bh_\b2_\b(_\b)\n- o _\ba_\bs_\by_\bn_\bc_\b__\bm_\bo_\bv_\be_\b__\bs_\bt_\bo_\br_\ba_\bg_\be_\b(_\b)\n- o _\ba_\bs_\by_\bn_\bc_\b__\br_\be_\bl_\be_\ba_\bs_\be_\b__\bf_\bi_\bl_\be_\bs_\b(_\b)\n- o _\ba_\bs_\by_\bn_\bc_\b__\bc_\bh_\be_\bc_\bk_\b__\bf_\bi_\bl_\be_\bs_\b(_\b)\n- o _\ba_\bs_\by_\bn_\bc_\b__\bs_\bt_\bo_\bp_\b__\bt_\bo_\br_\br_\be_\bn_\bt_\b(_\b)\n- o _\ba_\bs_\by_\bn_\bc_\b__\br_\be_\bn_\ba_\bm_\be_\b__\bf_\bi_\bl_\be_\b(_\b)\n- o _\ba_\bs_\by_\bn_\bc_\b__\bd_\be_\bl_\be_\bt_\be_\b__\bf_\bi_\bl_\be_\bs_\b(_\b)\n- o _\ba_\bs_\by_\bn_\bc_\b__\bs_\be_\bt_\b__\bf_\bi_\bl_\be_\b__\bp_\br_\bi_\bo_\br_\bi_\bt_\by_\b(_\b)\n- o _\ba_\bs_\by_\bn_\bc_\b__\bc_\bl_\be_\ba_\br_\b__\bp_\bi_\be_\bc_\be_\b(_\b)\n- o _\bu_\bp_\bd_\ba_\bt_\be_\b__\bs_\bt_\ba_\bt_\bs_\b__\bc_\bo_\bu_\bn_\bt_\be_\br_\bs_\b(_\b)\n- o _\bg_\be_\bt_\b__\bs_\bt_\ba_\bt_\bu_\bs_\b(_\b)\n- o _\ba_\bb_\bo_\br_\bt_\b(_\b)\n- o _\bs_\bu_\bb_\bm_\bi_\bt_\b__\bj_\bo_\bb_\bs_\b(_\b)\n- o _\bs_\be_\bt_\bt_\bi_\bn_\bg_\bs_\b__\bu_\bp_\bd_\ba_\bt_\be_\bd_\b(_\b)\n- * _\bs_\bt_\bo_\br_\ba_\bg_\be_\b__\bh_\bo_\bl_\bd_\be_\br\n- * _\bf_\bi_\bl_\be_\b__\bo_\bp_\be_\bn_\b__\bm_\bo_\bd_\be_\b__\bt\n- * _\ba_\bd_\bd_\b__\bt_\bo_\br_\br_\be_\bn_\bt_\b__\bp_\ba_\br_\ba_\bm_\bs\n- * _\bc_\bl_\bi_\be_\bn_\bt_\b__\bd_\ba_\bt_\ba_\b__\bt\n- o _\bc_\bl_\bi_\be_\bn_\bt_\b__\bd_\ba_\bt_\ba_\b__\bt_\b(_\b)\n- o _\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b=_\b(_\b)_\b _\bv_\bo_\bi_\bd_\b*_\b(_\b)_\b _\bc_\bo_\bn_\bs_\bt_\b*_\b(_\b)\n- * _\bf_\bi_\bl_\be_\b__\bs_\bl_\bi_\bc_\be\n- * _\bf_\bi_\bl_\be_\b__\bs_\bt_\bo_\br_\ba_\bg_\be\n- o _\bi_\bs_\b__\bv_\ba_\bl_\bi_\bd_\b(_\b)\n- o _\br_\be_\bs_\be_\br_\bv_\be_\b(_\b)\n- o _\ba_\bd_\bd_\b__\bf_\bi_\bl_\be_\b__\bb_\bo_\br_\br_\bo_\bw_\b(_\b)_\b _\ba_\bd_\bd_\b__\bf_\bi_\bl_\be_\b(_\b)\n- o _\br_\be_\bn_\ba_\bm_\be_\b__\bf_\bi_\bl_\be_\b(_\b)\n- o _\bm_\ba_\bp_\b__\bb_\bl_\bo_\bc_\bk_\b(_\b)\n- o _\bm_\ba_\bp_\b__\bf_\bi_\bl_\be_\b(_\b)\n- o _\bn_\bu_\bm_\b__\bf_\bi_\bl_\be_\bs_\b(_\b)\n- o _\be_\bn_\bd_\b__\bf_\bi_\bl_\be_\b(_\b)\n- o _\bf_\bi_\bl_\be_\b__\br_\ba_\bn_\bg_\be_\b(_\b)\n- o _\bt_\bo_\bt_\ba_\bl_\b__\bs_\bi_\bz_\be_\b(_\b)\n- o _\bs_\be_\bt_\b__\bn_\bu_\bm_\b__\bp_\bi_\be_\bc_\be_\bs_\b(_\b)_\b _\bn_\bu_\bm_\b__\bp_\bi_\be_\bc_\be_\bs_\b(_\b)\n- o _\be_\bn_\bd_\b__\bp_\bi_\be_\bc_\be_\b(_\b)\n- o _\bl_\ba_\bs_\bt_\b__\bp_\bi_\be_\bc_\be_\b(_\b)\n- o _\bp_\bi_\be_\bc_\be_\b__\br_\ba_\bn_\bg_\be_\b(_\b)\n- o _\bp_\bi_\be_\bc_\be_\b__\bl_\be_\bn_\bg_\bt_\bh_\b(_\b)_\b _\bs_\be_\bt_\b__\bp_\bi_\be_\bc_\be_\b__\bl_\be_\bn_\bg_\bt_\bh_\b(_\b)\n- o _\bp_\bi_\be_\bc_\be_\b__\bs_\bi_\bz_\be_\b(_\b)\n- o _\bp_\bi_\be_\bc_\be_\b__\bs_\bi_\bz_\be_\b2_\b(_\b)\n- o _\bb_\bl_\bo_\bc_\bk_\bs_\b__\bi_\bn_\b__\bp_\bi_\be_\bc_\be_\b2_\b(_\b)\n- o _\bb_\bl_\bo_\bc_\bk_\bs_\b__\bp_\be_\br_\b__\bp_\bi_\be_\bc_\be_\b(_\b)\n- o _\bn_\ba_\bm_\be_\b(_\b)_\b _\bs_\be_\bt_\b__\bn_\ba_\bm_\be_\b(_\b)\n- o _\bs_\bw_\ba_\bp_\b(_\b)\n- o _\bc_\ba_\bn_\bo_\bn_\bi_\bc_\ba_\bl_\bi_\bz_\be_\b(_\b)\n- o _\bh_\ba_\bs_\bh_\b(_\b)_\b _\br_\bo_\bo_\bt_\b(_\b)_\b _\bf_\bi_\bl_\be_\b__\bp_\ba_\bt_\bh_\b(_\b)_\b _\bf_\bi_\bl_\be_\b__\bn_\ba_\bm_\be_\b(_\b)_\b _\bp_\ba_\bd_\b__\bf_\bi_\bl_\be_\b__\ba_\bt_\b(_\b)_\b _\bf_\bi_\bl_\be_\b__\bo_\bf_\bf_\bs_\be_\bt_\b(_\b)\n- _\bm_\bt_\bi_\bm_\be_\b(_\b)_\b _\bs_\by_\bm_\bl_\bi_\bn_\bk_\b(_\b)_\b _\br_\bo_\bo_\bt_\b__\bp_\bt_\br_\b(_\b)_\b _\bf_\bi_\bl_\be_\b__\bs_\bi_\bz_\be_\b(_\b)\n- o _\bf_\bi_\bl_\be_\b__\bn_\bu_\bm_\b__\bp_\bi_\be_\bc_\be_\bs_\b(_\b)_\b _\bf_\bi_\bl_\be_\b__\bp_\bi_\be_\bc_\be_\b__\br_\ba_\bn_\bg_\be_\b(_\b)_\b _\bf_\bi_\bl_\be_\b__\bn_\bu_\bm_\b__\bb_\bl_\bo_\bc_\bk_\bs_\b(_\b)\n- o _\bf_\bi_\bl_\be_\b__\bf_\bi_\br_\bs_\bt_\b__\bb_\bl_\bo_\bc_\bk_\b__\bn_\bo_\bd_\be_\b(_\b)_\b _\bf_\bi_\bl_\be_\b__\bf_\bi_\br_\bs_\bt_\b__\bp_\bi_\be_\bc_\be_\b__\bn_\bo_\bd_\be_\b(_\b)\n- o _\bf_\bi_\bl_\be_\b__\bp_\ba_\bt_\bh_\b__\bh_\ba_\bs_\bh_\b(_\b)\n- o _\ba_\bl_\bl_\b__\bp_\ba_\bt_\bh_\b__\bh_\ba_\bs_\bh_\be_\bs_\b(_\b)\n- o _\bf_\bi_\bl_\be_\b__\bf_\bl_\ba_\bg_\bs_\b(_\b)\n- o _\bf_\bi_\bl_\be_\b__\ba_\bb_\bs_\bo_\bl_\bu_\bt_\be_\b__\bp_\ba_\bt_\bh_\b(_\b)\n- o _\bf_\bi_\bl_\be_\b__\bi_\bn_\bd_\be_\bx_\b__\ba_\bt_\b__\bp_\bi_\be_\bc_\be_\b(_\b)_\b _\bf_\bi_\bl_\be_\b__\bi_\bn_\bd_\be_\bx_\b__\ba_\bt_\b__\bo_\bf_\bf_\bs_\be_\bt_\b(_\b)\n- o _\bf_\bi_\bl_\be_\b__\bi_\bn_\bd_\be_\bx_\b__\bf_\bo_\br_\b__\br_\bo_\bo_\bt_\b(_\b)\n- o _\bp_\bi_\be_\bc_\be_\b__\bi_\bn_\bd_\be_\bx_\b__\ba_\bt_\b__\bf_\bi_\bl_\be_\b(_\b)\n- o _\bs_\ba_\bn_\bi_\bt_\bi_\bz_\be_\b__\bs_\by_\bm_\bl_\bi_\bn_\bk_\bs_\b(_\b)\n- o _\bv_\b2_\b(_\b)\n- * _\bs_\bt_\bo_\br_\ba_\bg_\be_\b__\bp_\ba_\br_\ba_\bm_\bs\n- * _\bm_\bm_\ba_\bp_\b__\bd_\bi_\bs_\bk_\b__\bi_\bo_\b__\bc_\bo_\bn_\bs_\bt_\br_\bu_\bc_\bt_\bo_\br_\b(_\b)\n- * _\bd_\be_\bf_\ba_\bu_\bl_\bt_\b__\bd_\bi_\bs_\bk_\b__\bi_\bo_\b__\bc_\bo_\bn_\bs_\bt_\br_\bu_\bc_\bt_\bo_\br_\b(_\b)\n- * _\bd_\bi_\bs_\ba_\bb_\bl_\be_\bd_\b__\bd_\bi_\bs_\bk_\b__\bi_\bo_\b__\bc_\bo_\bn_\bs_\bt_\br_\bu_\bc_\bt_\bo_\br_\b(_\b)\n- * _\bp_\bo_\bs_\bi_\bx_\b__\bd_\bi_\bs_\bk_\b__\bi_\bo_\b__\bc_\bo_\bn_\bs_\bt_\br_\bu_\bc_\bt_\bo_\br_\b(_\b)\n- * _\be_\bn_\bu_\bm_\b _\bs_\bt_\bo_\br_\ba_\bg_\be_\b__\bm_\bo_\bd_\be_\b__\bt\n- * _\be_\bn_\bu_\bm_\b _\bs_\bt_\ba_\bt_\bu_\bs_\b__\bt\n- * _\be_\bn_\bu_\bm_\b _\bm_\bo_\bv_\be_\b__\bf_\bl_\ba_\bg_\bs_\b__\bt\n- * _\bp_\be_\be_\br_\b__\br_\be_\bq_\bu_\be_\bs_\bt\n- o _\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b=_\b=_\b(_\b)\n- * _\bp_\be_\be_\br_\b__\bi_\bn_\bf_\bo\n- o _\bi_\b2_\bp_\b__\bd_\be_\bs_\bt_\bi_\bn_\ba_\bt_\bi_\bo_\bn_\b(_\b)\n- * _\bi_\bn_\bf_\bo_\b__\bh_\ba_\bs_\bh_\b__\bt\n- o _\bi_\bn_\bf_\bo_\b__\bh_\ba_\bs_\bh_\b__\bt_\b(_\b)\n- o _\bh_\ba_\bs_\b(_\b)_\b _\bh_\ba_\bs_\b__\bv_\b2_\b(_\b)_\b _\bh_\ba_\bs_\b__\bv_\b1_\b(_\b)\n- o _\bg_\be_\bt_\b(_\b)\n- o _\bg_\be_\bt_\b__\bb_\be_\bs_\bt_\b(_\b)\n- o _\bf_\bo_\br_\b__\be_\ba_\bc_\bh_\b(_\b)\n- * _\bp_\bi_\be_\bc_\be_\b__\bb_\bl_\bo_\bc_\bk\n- * _\bt_\br_\bu_\bn_\bc_\ba_\bt_\be_\b__\bf_\bi_\bl_\be_\bs_\b(_\b)\n- * _\bm_\ba_\bk_\be_\b__\bm_\ba_\bg_\bn_\be_\bt_\b__\bu_\br_\bi_\b(_\b)\n- * _\bp_\ba_\br_\bs_\be_\b__\bm_\ba_\bg_\bn_\be_\bt_\b__\bu_\br_\bi_\b(_\b)\n- * _\bl_\bo_\ba_\bd_\b__\bt_\bo_\br_\br_\be_\bn_\bt_\b__\bf_\bi_\bl_\be_\b(_\b)_\b _\bl_\bo_\ba_\bd_\b__\bt_\bo_\br_\br_\be_\bn_\bt_\b__\bp_\ba_\br_\bs_\be_\bd_\b(_\b)_\b _\bl_\bo_\ba_\bd_\b__\bt_\bo_\br_\br_\be_\bn_\bt_\b__\bb_\bu_\bf_\bf_\be_\br_\b(_\b)\n- * _\bt_\bo_\br_\br_\be_\bn_\bt_\b__\bp_\be_\be_\br_\b__\be_\bq_\bu_\ba_\bl_\b(_\b)\n- * _\bv_\be_\br_\bs_\bi_\bo_\bn_\b(_\b)\n- * _\be_\bn_\bu_\bm_\b _\bs_\bo_\bc_\bk_\be_\bt_\b__\bt_\by_\bp_\be_\b__\bt\n- * _\be_\bn_\bu_\bm_\b _\bp_\bo_\br_\bt_\bm_\ba_\bp_\b__\bt_\br_\ba_\bn_\bs_\bp_\bo_\br_\bt\n- * _\be_\bn_\bu_\bm_\b _\bp_\bo_\br_\bt_\bm_\ba_\bp_\b__\bp_\br_\bo_\bt_\bo_\bc_\bo_\bl\n- * _\be_\bn_\bu_\bm_\b _\bp_\br_\bo_\bt_\bo_\bc_\bo_\bl_\b__\bv_\be_\br_\bs_\bi_\bo_\bn\n- * _\be_\bn_\bu_\bm_\b _\be_\bv_\be_\bn_\bt_\b__\bt\n- * _\be_\bn_\bu_\bm_\b _\bc_\bo_\bn_\bn_\be_\bc_\bt_\bi_\bo_\bn_\b__\bt_\by_\bp_\be\n- * _\bt_\bo_\br_\br_\be_\bn_\bt_\b__\bf_\bl_\ba_\bg_\bs_\b__\bt\n- * _\bi_\bn_\bt\n- * _\bd_\bo_\bw_\bn_\bl_\bo_\ba_\bd_\b__\bp_\br_\bi_\bo_\br_\bi_\bt_\by_\b__\bt\n- * _\bp_\be_\bx_\b__\bf_\bl_\ba_\bg_\bs_\b__\bt\n- * _\bc_\bh_\ba_\br_\b _\bc_\bo_\bn_\bs_\bt_\b*\n- * _\bs_\bt_\bd_\b:_\b:_\bu_\bi_\bn_\bt_\b6_\b4_\b__\bt\n- * _\ba_\b _\bw_\bo_\br_\bd_\b _\bo_\bf_\b _\bc_\ba_\bu_\bt_\bi_\bo_\bn\n- * _\bp_\bl_\bu_\bg_\bi_\bn_\b-_\bi_\bn_\bt_\be_\br_\bf_\ba_\bc_\be\n- * _\bc_\bu_\bs_\bt_\bo_\bm_\b _\ba_\bl_\be_\br_\bt_\bs\n- * _\bp_\be_\be_\br_\b__\bc_\bo_\bn_\bn_\be_\bc_\bt_\bi_\bo_\bn_\b__\bh_\ba_\bn_\bd_\bl_\be\n- * _\bb_\bt_\b__\bp_\be_\be_\br_\b__\bc_\bo_\bn_\bn_\be_\bc_\bt_\bi_\bo_\bn_\b__\bh_\ba_\bn_\bd_\bl_\be\n- * _\bp_\bl_\bu_\bg_\bi_\bn\n- o _\bi_\bm_\bp_\bl_\be_\bm_\be_\bn_\bt_\be_\bd_\b__\bf_\be_\ba_\bt_\bu_\br_\be_\bs_\b(_\b)\n- o _\bn_\be_\bw_\b__\bt_\bo_\br_\br_\be_\bn_\bt_\b(_\b)\n- o _\ba_\bd_\bd_\be_\bd_\b(_\b)\n- o _\ba_\bb_\bo_\br_\bt_\b(_\b)\n- o _\bo_\bn_\b__\bd_\bh_\bt_\b__\br_\be_\bq_\bu_\be_\bs_\bt_\b(_\b)\n- o _\bo_\bn_\b__\ba_\bl_\be_\br_\bt_\b(_\b)\n- o _\bo_\bn_\b__\bu_\bn_\bk_\bn_\bo_\bw_\bn_\b__\bt_\bo_\br_\br_\be_\bn_\bt_\b(_\b)\n- o _\bo_\bn_\b__\bt_\bi_\bc_\bk_\b(_\b)\n- o _\bg_\be_\bt_\b__\bu_\bn_\bc_\bh_\bo_\bk_\be_\b__\bp_\br_\bi_\bo_\br_\bi_\bt_\by_\b(_\b)\n- o _\bl_\bo_\ba_\bd_\b__\bs_\bt_\ba_\bt_\be_\b(_\b)\n- * _\bt_\bo_\br_\br_\be_\bn_\bt_\b__\bp_\bl_\bu_\bg_\bi_\bn\n- o _\bn_\be_\bw_\b__\bc_\bo_\bn_\bn_\be_\bc_\bt_\bi_\bo_\bn_\b(_\b)\n- o _\bo_\bn_\b__\bp_\bi_\be_\bc_\be_\b__\bf_\ba_\bi_\bl_\be_\bd_\b(_\b)_\b _\bo_\bn_\b__\bp_\bi_\be_\bc_\be_\b__\bp_\ba_\bs_\bs_\b(_\b)\n- o _\bt_\bi_\bc_\bk_\b(_\b)\n- o _\bo_\bn_\b__\bp_\ba_\bu_\bs_\be_\b(_\b)_\b _\bo_\bn_\b__\br_\be_\bs_\bu_\bm_\be_\b(_\b)\n- o _\bo_\bn_\b__\bf_\bi_\bl_\be_\bs_\b__\bc_\bh_\be_\bc_\bk_\be_\bd_\b(_\b)\n- o _\bo_\bn_\b__\bs_\bt_\ba_\bt_\be_\b(_\b)\n- o _\bo_\bn_\b__\ba_\bd_\bd_\b__\bp_\be_\be_\br_\b(_\b)\n- * _\bp_\be_\be_\br_\b__\bp_\bl_\bu_\bg_\bi_\bn\n- o _\bt_\by_\bp_\be_\b(_\b)\n- o _\ba_\bd_\bd_\b__\bh_\ba_\bn_\bd_\bs_\bh_\ba_\bk_\be_\b(_\b)\n- o _\bo_\bn_\b__\bd_\bi_\bs_\bc_\bo_\bn_\bn_\be_\bc_\bt_\b(_\b)\n- o _\bo_\bn_\b__\bc_\bo_\bn_\bn_\be_\bc_\bt_\be_\bd_\b(_\b)\n- o _\bo_\bn_\b__\bh_\ba_\bn_\bd_\bs_\bh_\ba_\bk_\be_\b(_\b)\n- o _\bo_\bn_\b__\be_\bx_\bt_\be_\bn_\bs_\bi_\bo_\bn_\b__\bh_\ba_\bn_\bd_\bs_\bh_\ba_\bk_\be_\b(_\b)\n- o _\bo_\bn_\b__\br_\be_\bq_\bu_\be_\bs_\bt_\b(_\b)_\b _\bo_\bn_\b__\bi_\bn_\bt_\be_\br_\be_\bs_\bt_\be_\bd_\b(_\b)_\b _\bo_\bn_\b__\ba_\bl_\bl_\bo_\bw_\be_\bd_\b__\bf_\ba_\bs_\bt_\b(_\b)_\b _\bo_\bn_\b__\bh_\ba_\bv_\be_\b__\ba_\bl_\bl_\b(_\b)\n- _\bo_\bn_\b__\bc_\bh_\bo_\bk_\be_\b(_\b)_\b _\bo_\bn_\b__\bu_\bn_\bc_\bh_\bo_\bk_\be_\b(_\b)_\b _\bo_\bn_\b__\bh_\ba_\bv_\be_\b__\bn_\bo_\bn_\be_\b(_\b)_\b _\bo_\bn_\b__\bh_\ba_\bv_\be_\b(_\b)_\b _\bo_\bn_\b__\bb_\bi_\bt_\bf_\bi_\be_\bl_\bd_\b(_\b)\n- _\bo_\bn_\b__\bd_\bo_\bn_\bt_\b__\bh_\ba_\bv_\be_\b(_\b)_\b _\bo_\bn_\b__\bn_\bo_\bt_\b__\bi_\bn_\bt_\be_\br_\be_\bs_\bt_\be_\bd_\b(_\b)\n- o _\bo_\bn_\b__\bp_\bi_\be_\bc_\be_\b(_\b)\n- o _\bs_\be_\bn_\bt_\b__\bi_\bn_\bt_\be_\br_\be_\bs_\bt_\be_\bd_\b(_\b)_\b _\bs_\be_\bn_\bt_\b__\bu_\bn_\bc_\bh_\bo_\bk_\be_\b(_\b)_\b _\bs_\be_\bn_\bt_\b__\bn_\bo_\bt_\b__\bi_\bn_\bt_\be_\br_\be_\bs_\bt_\be_\bd_\b(_\b)_\b _\bs_\be_\bn_\bt_\b__\bp_\bi_\be_\bc_\be_\b(_\b)\n- _\bs_\be_\bn_\bt_\b__\bh_\ba_\bv_\be_\b(_\b)\n- o _\bs_\be_\bn_\bt_\b__\bp_\ba_\by_\bl_\bo_\ba_\bd_\b(_\b)\n- o _\bc_\ba_\bn_\b__\bd_\bi_\bs_\bc_\bo_\bn_\bn_\be_\bc_\bt_\b(_\b)\n- o _\bo_\bn_\b__\be_\bx_\bt_\be_\bn_\bd_\be_\bd_\b(_\b)\n- o _\bo_\bn_\b__\bu_\bn_\bk_\bn_\bo_\bw_\bn_\b__\bm_\be_\bs_\bs_\ba_\bg_\be_\b(_\b)\n- o _\bo_\bn_\b__\bp_\bi_\be_\bc_\be_\b__\bf_\ba_\bi_\bl_\be_\bd_\b(_\b)_\b _\bo_\bn_\b__\bp_\bi_\be_\bc_\be_\b__\bp_\ba_\bs_\bs_\b(_\b)\n- o _\bt_\bi_\bc_\bk_\b(_\b)\n- o _\bw_\br_\bi_\bt_\be_\b__\br_\be_\bq_\bu_\be_\bs_\bt_\b(_\b)\n- * _\bc_\br_\by_\bp_\bt_\bo_\b__\bp_\bl_\bu_\bg_\bi_\bn\n- o _\bd_\be_\bc_\br_\by_\bp_\bt_\b(_\b)\n- * _\bc_\br_\be_\ba_\bt_\be_\b__\bu_\bt_\b__\bp_\be_\bx_\b__\bp_\bl_\bu_\bg_\bi_\bn_\b(_\b)\n- * _\bc_\br_\be_\ba_\bt_\be_\b__\bu_\bt_\b__\bm_\be_\bt_\ba_\bd_\ba_\bt_\ba_\b__\bp_\bl_\bu_\bg_\bi_\bn_\b(_\b)\n- * _\bc_\br_\be_\ba_\bt_\be_\b__\bs_\bm_\ba_\br_\bt_\b__\bb_\ba_\bn_\b__\bp_\bl_\bu_\bg_\bi_\bn_\b(_\b)\n- * _\ba_\bn_\bn_\bo_\bu_\bn_\bc_\be_\b__\bi_\bn_\bf_\bo_\bh_\ba_\bs_\bh\n- * _\ba_\bn_\bn_\bo_\bu_\bn_\bc_\be_\b__\be_\bn_\bd_\bp_\bo_\bi_\bn_\bt\n- * _\ba_\bn_\bn_\bo_\bu_\bn_\bc_\be_\b__\be_\bn_\bt_\br_\by\n- o _\ba_\bn_\bn_\bo_\bu_\bn_\bc_\be_\b__\be_\bn_\bt_\br_\by_\b(_\b)_\b _\b~_\ba_\bn_\bn_\bo_\bu_\bn_\bc_\be_\b__\be_\bn_\bt_\br_\by_\b(_\b)_\b _\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b=_\b(_\b)\n- o _\be_\bn_\bu_\bm_\b _\bt_\br_\ba_\bc_\bk_\be_\br_\b__\bs_\bo_\bu_\br_\bc_\be\n- * _\bs_\be_\bt_\bt_\bi_\bn_\bg_\bs_\b__\bp_\ba_\bc_\bk\n- o _\bs_\be_\bt_\b__\bs_\bt_\br_\b(_\b)_\b _\bs_\be_\bt_\b__\bi_\bn_\bt_\b(_\b)_\b _\bs_\be_\bt_\b__\bb_\bo_\bo_\bl_\b(_\b)\n- o _\bh_\ba_\bs_\b__\bv_\ba_\bl_\b(_\b)\n- o _\bc_\bl_\be_\ba_\br_\b(_\b)\n- o _\bc_\bl_\be_\ba_\br_\b(_\b)\n- o _\bg_\be_\bt_\b__\bb_\bo_\bo_\bl_\b(_\b)_\b _\bg_\be_\bt_\b__\bs_\bt_\br_\b(_\b)_\b _\bg_\be_\bt_\b__\bi_\bn_\bt_\b(_\b)\n- o _\be_\bn_\bu_\bm_\b _\bt_\by_\bp_\be_\b__\bb_\ba_\bs_\be_\bs\n- o _\be_\bn_\bu_\bm_\b _\bm_\bm_\ba_\bp_\b__\bw_\br_\bi_\bt_\be_\b__\bm_\bo_\bd_\be_\b__\bt\n- o _\be_\bn_\bu_\bm_\b _\bs_\bu_\bg_\bg_\be_\bs_\bt_\b__\bm_\bo_\bd_\be_\b__\bt\n- o _\be_\bn_\bu_\bm_\b _\bc_\bh_\bo_\bk_\bi_\bn_\bg_\b__\ba_\bl_\bg_\bo_\br_\bi_\bt_\bh_\bm_\b__\bt\n- o _\be_\bn_\bu_\bm_\b _\bs_\be_\be_\bd_\b__\bc_\bh_\bo_\bk_\bi_\bn_\bg_\b__\ba_\bl_\bg_\bo_\br_\bi_\bt_\bh_\bm_\b__\bt\n- o _\be_\bn_\bu_\bm_\b _\bi_\bo_\b__\bb_\bu_\bf_\bf_\be_\br_\b__\bm_\bo_\bd_\be_\b__\bt\n- o _\be_\bn_\bu_\bm_\b _\bb_\ba_\bn_\bd_\bw_\bi_\bd_\bt_\bh_\b__\bm_\bi_\bx_\be_\bd_\b__\ba_\bl_\bg_\bo_\b__\bt\n- o _\be_\bn_\bu_\bm_\b _\be_\bn_\bc_\b__\bp_\bo_\bl_\bi_\bc_\by\n- o _\be_\bn_\bu_\bm_\b _\be_\bn_\bc_\b__\bl_\be_\bv_\be_\bl\n- o _\be_\bn_\bu_\bm_\b _\bp_\br_\bo_\bx_\by_\b__\bt_\by_\bp_\be_\b__\bt\n- * _\bm_\bi_\bn_\b__\bm_\be_\bm_\bo_\br_\by_\b__\bu_\bs_\ba_\bg_\be_\b(_\b)_\b _\bh_\bi_\bg_\bh_\b__\bp_\be_\br_\bf_\bo_\br_\bm_\ba_\bn_\bc_\be_\b__\bs_\be_\be_\bd_\b(_\b)\n- * _\bs_\be_\bt_\bt_\bi_\bn_\bg_\b__\bb_\by_\b__\bn_\ba_\bm_\be_\b(_\b)_\b _\bn_\ba_\bm_\be_\b__\bf_\bo_\br_\b__\bs_\be_\bt_\bt_\bi_\bn_\bg_\b(_\b)\n- * _\bd_\be_\bf_\ba_\bu_\bl_\bt_\b__\bs_\be_\bt_\bt_\bi_\bn_\bg_\bs_\b(_\b)\n- * _\bg_\be_\bn_\be_\br_\ba_\bt_\be_\b__\bf_\bi_\bn_\bg_\be_\br_\bp_\br_\bi_\bn_\bt_\b(_\b)\n- * _\bi_\bp_\b__\bf_\bi_\bl_\bt_\be_\br\n- o _\be_\bm_\bp_\bt_\by_\b(_\b)\n- o _\ba_\bd_\bd_\b__\br_\bu_\bl_\be_\b(_\b)\n- o _\ba_\bc_\bc_\be_\bs_\bs_\b(_\b)\n- o _\be_\bx_\bp_\bo_\br_\bt_\b__\bf_\bi_\bl_\bt_\be_\br_\b(_\b)\n- o _\be_\bn_\bu_\bm_\b _\ba_\bc_\bc_\be_\bs_\bs_\b__\bf_\bl_\ba_\bg_\bs\n- * _\bp_\bo_\br_\bt_\b__\bf_\bi_\bl_\bt_\be_\br\n- o _\ba_\bd_\bd_\b__\br_\bu_\bl_\be_\b(_\b)\n- o _\ba_\bc_\bc_\be_\bs_\bs_\b(_\b)\n- o _\be_\bn_\bu_\bm_\b _\ba_\bc_\bc_\be_\bs_\bs_\b__\bf_\bl_\ba_\bg_\bs\n- * _\bp_\be_\be_\br_\b__\bc_\bl_\ba_\bs_\bs_\b__\bt_\by_\bp_\be_\b__\bf_\bi_\bl_\bt_\be_\br\n- o _\br_\be_\bm_\bo_\bv_\be_\b(_\b)_\b _\ba_\bd_\bd_\b(_\b)\n- o _\bd_\bi_\bs_\ba_\bl_\bl_\bo_\bw_\b(_\b)_\b _\ba_\bl_\bl_\bo_\bw_\b(_\b)\n- o _\ba_\bp_\bp_\bl_\by_\b(_\b)\n- o _\be_\bn_\bu_\bm_\b _\bs_\bo_\bc_\bk_\be_\bt_\b__\bt_\by_\bp_\be_\b__\bt\n- * _\bp_\be_\be_\br_\b__\bc_\bl_\ba_\bs_\bs_\b__\bi_\bn_\bf_\bo\n * _\bb_\bl_\bo_\bc_\bk_\b__\bi_\bn_\bf_\bo\n- o _\bs_\be_\bt_\b__\bp_\be_\be_\br_\b(_\b)_\b _\bp_\be_\be_\br_\b(_\b)\n+ o _\bp_\be_\be_\br_\b(_\b)_\b _\bs_\be_\bt_\b__\bp_\be_\be_\br_\b(_\b)\n o _\be_\bn_\bu_\bm_\b _\bb_\bl_\bo_\bc_\bk_\b__\bs_\bt_\ba_\bt_\be_\b__\bt\n * _\bp_\ba_\br_\bt_\bi_\ba_\bl_\b__\bp_\bi_\be_\bc_\be_\b__\bi_\bn_\bf_\bo\n * _\bt_\bo_\br_\br_\be_\bn_\bt_\b__\bh_\ba_\bn_\bd_\bl_\be\n o _\bt_\bo_\br_\br_\be_\bn_\bt_\b__\bh_\ba_\bn_\bd_\bl_\be_\b(_\b)\n o _\ba_\bd_\bd_\b__\bp_\bi_\be_\bc_\be_\b(_\b)\n o _\br_\be_\ba_\bd_\b__\bp_\bi_\be_\bc_\be_\b(_\b)\n o _\bh_\ba_\bv_\be_\b__\bp_\bi_\be_\bc_\be_\b(_\b)\n- o _\bp_\bo_\bs_\bt_\b__\bp_\be_\be_\br_\b__\bi_\bn_\bf_\bo_\b(_\b)_\b _\bg_\be_\bt_\b__\bp_\be_\be_\br_\b__\bi_\bn_\bf_\bo_\b(_\b)\n- o _\bp_\bo_\bs_\bt_\b__\bs_\bt_\ba_\bt_\bu_\bs_\b(_\b)_\b _\bs_\bt_\ba_\bt_\bu_\bs_\b(_\b)\n+ o _\bg_\be_\bt_\b__\bp_\be_\be_\br_\b__\bi_\bn_\bf_\bo_\b(_\b)_\b _\bp_\bo_\bs_\bt_\b__\bp_\be_\be_\br_\b__\bi_\bn_\bf_\bo_\b(_\b)\n+ o _\bs_\bt_\ba_\bt_\bu_\bs_\b(_\b)_\b _\bp_\bo_\bs_\bt_\b__\bs_\bt_\ba_\bt_\bu_\bs_\b(_\b)\n o _\bp_\bo_\bs_\bt_\b__\bd_\bo_\bw_\bn_\bl_\bo_\ba_\bd_\b__\bq_\bu_\be_\bu_\be_\b(_\b)_\b _\bg_\be_\bt_\b__\bd_\bo_\bw_\bn_\bl_\bo_\ba_\bd_\b__\bq_\bu_\be_\bu_\be_\b(_\b)\n- o _\br_\be_\bs_\be_\bt_\b__\bp_\bi_\be_\bc_\be_\b__\bd_\be_\ba_\bd_\bl_\bi_\bn_\be_\b(_\b)_\b _\bs_\be_\bt_\b__\bp_\bi_\be_\bc_\be_\b__\bd_\be_\ba_\bd_\bl_\bi_\bn_\be_\b(_\b)_\b _\bc_\bl_\be_\ba_\br_\b__\bp_\bi_\be_\bc_\be_\b__\bd_\be_\ba_\bd_\bl_\bi_\bn_\be_\bs_\b(_\b)\n- o _\bf_\bi_\bl_\be_\b__\bp_\br_\bo_\bg_\br_\be_\bs_\bs_\b(_\b)_\b _\bp_\bo_\bs_\bt_\b__\bf_\bi_\bl_\be_\b__\bp_\br_\bo_\bg_\br_\be_\bs_\bs_\b(_\b)\n+ o _\bc_\bl_\be_\ba_\br_\b__\bp_\bi_\be_\bc_\be_\b__\bd_\be_\ba_\bd_\bl_\bi_\bn_\be_\bs_\b(_\b)_\b _\bs_\be_\bt_\b__\bp_\bi_\be_\bc_\be_\b__\bd_\be_\ba_\bd_\bl_\bi_\bn_\be_\b(_\b)_\b _\br_\be_\bs_\be_\bt_\b__\bp_\bi_\be_\bc_\be_\b__\bd_\be_\ba_\bd_\bl_\bi_\bn_\be_\b(_\b)\n+ o _\bp_\bo_\bs_\bt_\b__\bf_\bi_\bl_\be_\b__\bp_\br_\bo_\bg_\br_\be_\bs_\bs_\b(_\b)_\b _\bf_\bi_\bl_\be_\b__\bp_\br_\bo_\bg_\br_\be_\bs_\bs_\b(_\b)\n o _\bf_\bi_\bl_\be_\b__\bs_\bt_\ba_\bt_\bu_\bs_\b(_\b)\n o _\bc_\bl_\be_\ba_\br_\b__\be_\br_\br_\bo_\br_\b(_\b)\n- o _\ba_\bd_\bd_\b__\bt_\br_\ba_\bc_\bk_\be_\br_\b(_\b)_\b _\bt_\br_\ba_\bc_\bk_\be_\br_\bs_\b(_\b)_\b _\br_\be_\bp_\bl_\ba_\bc_\be_\b__\bt_\br_\ba_\bc_\bk_\be_\br_\bs_\b(_\b)_\b _\bp_\bo_\bs_\bt_\b__\bt_\br_\ba_\bc_\bk_\be_\br_\bs_\b(_\b)\n- o _\bu_\br_\bl_\b__\bs_\be_\be_\bd_\bs_\b(_\b)_\b _\br_\be_\bm_\bo_\bv_\be_\b__\bu_\br_\bl_\b__\bs_\be_\be_\bd_\b(_\b)_\b _\ba_\bd_\bd_\b__\bu_\br_\bl_\b__\bs_\be_\be_\bd_\b(_\b)\n- o _\ba_\bd_\bd_\b__\bh_\bt_\bt_\bp_\b__\bs_\be_\be_\bd_\b(_\b)_\b _\bh_\bt_\bt_\bp_\b__\bs_\be_\be_\bd_\bs_\b(_\b)_\b _\br_\be_\bm_\bo_\bv_\be_\b__\bh_\bt_\bt_\bp_\b__\bs_\be_\be_\bd_\b(_\b)\n+ o _\bp_\bo_\bs_\bt_\b__\bt_\br_\ba_\bc_\bk_\be_\br_\bs_\b(_\b)_\b _\br_\be_\bp_\bl_\ba_\bc_\be_\b__\bt_\br_\ba_\bc_\bk_\be_\br_\bs_\b(_\b)_\b _\bt_\br_\ba_\bc_\bk_\be_\br_\bs_\b(_\b)_\b _\ba_\bd_\bd_\b__\bt_\br_\ba_\bc_\bk_\be_\br_\b(_\b)\n+ o _\br_\be_\bm_\bo_\bv_\be_\b__\bu_\br_\bl_\b__\bs_\be_\be_\bd_\b(_\b)_\b _\ba_\bd_\bd_\b__\bu_\br_\bl_\b__\bs_\be_\be_\bd_\b(_\b)_\b _\bu_\br_\bl_\b__\bs_\be_\be_\bd_\bs_\b(_\b)\n+ o _\ba_\bd_\bd_\b__\bh_\bt_\bt_\bp_\b__\bs_\be_\be_\bd_\b(_\b)_\b _\br_\be_\bm_\bo_\bv_\be_\b__\bh_\bt_\bt_\bp_\b__\bs_\be_\be_\bd_\b(_\b)_\b _\bh_\bt_\bt_\bp_\b__\bs_\be_\be_\bd_\bs_\b(_\b)\n o _\ba_\bd_\bd_\b__\be_\bx_\bt_\be_\bn_\bs_\bi_\bo_\bn_\b(_\b)\n o _\bs_\be_\bt_\b__\bm_\be_\bt_\ba_\bd_\ba_\bt_\ba_\b(_\b)\n o _\bi_\bs_\b__\bv_\ba_\bl_\bi_\bd_\b(_\b)\n- o _\bp_\ba_\bu_\bs_\be_\b(_\b)_\b _\br_\be_\bs_\bu_\bm_\be_\b(_\b)\n- o _\bf_\bl_\ba_\bg_\bs_\b(_\b)_\b _\bs_\be_\bt_\b__\bf_\bl_\ba_\bg_\bs_\b(_\b)_\b _\bu_\bn_\bs_\be_\bt_\b__\bf_\bl_\ba_\bg_\bs_\b(_\b)\n+ o _\br_\be_\bs_\bu_\bm_\be_\b(_\b)_\b _\bp_\ba_\bu_\bs_\be_\b(_\b)\n+ o _\bu_\bn_\bs_\be_\bt_\b__\bf_\bl_\ba_\bg_\bs_\b(_\b)_\b _\bs_\be_\bt_\b__\bf_\bl_\ba_\bg_\bs_\b(_\b)_\b _\bf_\bl_\ba_\bg_\bs_\b(_\b)\n o _\bf_\bl_\bu_\bs_\bh_\b__\bc_\ba_\bc_\bh_\be_\b(_\b)\n o _\bf_\bo_\br_\bc_\be_\b__\br_\be_\bc_\bh_\be_\bc_\bk_\b(_\b)\n o _\bs_\ba_\bv_\be_\b__\br_\be_\bs_\bu_\bm_\be_\b__\bd_\ba_\bt_\ba_\b(_\b)\n o _\bn_\be_\be_\bd_\b__\bs_\ba_\bv_\be_\b__\br_\be_\bs_\bu_\bm_\be_\b__\bd_\ba_\bt_\ba_\b(_\b)\n- o _\bq_\bu_\be_\bu_\be_\b__\bp_\bo_\bs_\bi_\bt_\bi_\bo_\bn_\b__\bb_\bo_\bt_\bt_\bo_\bm_\b(_\b)_\b _\bq_\bu_\be_\bu_\be_\b__\bp_\bo_\bs_\bi_\bt_\bi_\bo_\bn_\b(_\b)_\b _\bq_\bu_\be_\bu_\be_\b__\bp_\bo_\bs_\bi_\bt_\bi_\bo_\bn_\b__\bu_\bp_\b(_\b)\n- _\bq_\bu_\be_\bu_\be_\b__\bp_\bo_\bs_\bi_\bt_\bi_\bo_\bn_\b__\bt_\bo_\bp_\b(_\b)_\b _\bq_\bu_\be_\bu_\be_\b__\bp_\bo_\bs_\bi_\bt_\bi_\bo_\bn_\b__\bd_\bo_\bw_\bn_\b(_\b)\n+ o _\bq_\bu_\be_\bu_\be_\b__\bp_\bo_\bs_\bi_\bt_\bi_\bo_\bn_\b__\bt_\bo_\bp_\b(_\b)_\b _\bq_\bu_\be_\bu_\be_\b__\bp_\bo_\bs_\bi_\bt_\bi_\bo_\bn_\b__\bd_\bo_\bw_\bn_\b(_\b)_\b _\bq_\bu_\be_\bu_\be_\b__\bp_\bo_\bs_\bi_\bt_\bi_\bo_\bn_\b__\bb_\bo_\bt_\bt_\bo_\bm_\b(_\b)\n+ _\bq_\bu_\be_\bu_\be_\b__\bp_\bo_\bs_\bi_\bt_\bi_\bo_\bn_\b(_\b)_\b _\bq_\bu_\be_\bu_\be_\b__\bp_\bo_\bs_\bi_\bt_\bi_\bo_\bn_\b__\bu_\bp_\b(_\b)\n o _\bq_\bu_\be_\bu_\be_\b__\bp_\bo_\bs_\bi_\bt_\bi_\bo_\bn_\b__\bs_\be_\bt_\b(_\b)\n o _\bs_\be_\bt_\b__\bs_\bs_\bl_\b__\bc_\be_\br_\bt_\bi_\bf_\bi_\bc_\ba_\bt_\be_\b__\bb_\bu_\bf_\bf_\be_\br_\b(_\b)_\b _\bs_\be_\bt_\b__\bs_\bs_\bl_\b__\bc_\be_\br_\bt_\bi_\bf_\bi_\bc_\ba_\bt_\be_\b(_\b)\n o _\bt_\bo_\br_\br_\be_\bn_\bt_\b__\bf_\bi_\bl_\be_\b__\bw_\bi_\bt_\bh_\b__\bh_\ba_\bs_\bh_\be_\bs_\b(_\b)_\b _\bt_\bo_\br_\br_\be_\bn_\bt_\b__\bf_\bi_\bl_\be_\b(_\b)\n o _\bp_\bi_\be_\bc_\be_\b__\bl_\ba_\by_\be_\br_\bs_\b(_\b)\n o _\bp_\bi_\be_\bc_\be_\b__\ba_\bv_\ba_\bi_\bl_\ba_\bb_\bi_\bl_\bi_\bt_\by_\b(_\b)_\b _\bp_\bo_\bs_\bt_\b__\bp_\bi_\be_\bc_\be_\b__\ba_\bv_\ba_\bi_\bl_\ba_\bb_\bi_\bl_\bi_\bt_\by_\b(_\b)\n- o _\bg_\be_\bt_\b__\bp_\bi_\be_\bc_\be_\b__\bp_\br_\bi_\bo_\br_\bi_\bt_\bi_\be_\bs_\b(_\b)_\b _\bp_\bi_\be_\bc_\be_\b__\bp_\br_\bi_\bo_\br_\bi_\bt_\by_\b(_\b)_\b _\bp_\br_\bi_\bo_\br_\bi_\bt_\bi_\bz_\be_\b__\bp_\bi_\be_\bc_\be_\bs_\b(_\b)\n+ o _\bg_\be_\bt_\b__\bp_\bi_\be_\bc_\be_\b__\bp_\br_\bi_\bo_\br_\bi_\bt_\bi_\be_\bs_\b(_\b)_\b _\bp_\br_\bi_\bo_\br_\bi_\bt_\bi_\bz_\be_\b__\bp_\bi_\be_\bc_\be_\bs_\b(_\b)_\b _\bp_\bi_\be_\bc_\be_\b__\bp_\br_\bi_\bo_\br_\bi_\bt_\by_\b(_\b)\n o _\bf_\bi_\bl_\be_\b__\bp_\br_\bi_\bo_\br_\bi_\bt_\by_\b(_\b)_\b _\bg_\be_\bt_\b__\bf_\bi_\bl_\be_\b__\bp_\br_\bi_\bo_\br_\bi_\bt_\bi_\be_\bs_\b(_\b)_\b _\bp_\br_\bi_\bo_\br_\bi_\bt_\bi_\bz_\be_\b__\bf_\bi_\bl_\be_\bs_\b(_\b)\n- o _\bf_\bo_\br_\bc_\be_\b__\br_\be_\ba_\bn_\bn_\bo_\bu_\bn_\bc_\be_\b(_\b)_\b _\bf_\bo_\br_\bc_\be_\b__\bl_\bs_\bd_\b__\ba_\bn_\bn_\bo_\bu_\bn_\bc_\be_\b(_\b)_\b _\bf_\bo_\br_\bc_\be_\b__\bd_\bh_\bt_\b__\ba_\bn_\bn_\bo_\bu_\bn_\bc_\be_\b(_\b)\n+ o _\bf_\bo_\br_\bc_\be_\b__\br_\be_\ba_\bn_\bn_\bo_\bu_\bn_\bc_\be_\b(_\b)_\b _\bf_\bo_\br_\bc_\be_\b__\bd_\bh_\bt_\b__\ba_\bn_\bn_\bo_\bu_\bn_\bc_\be_\b(_\b)_\b _\bf_\bo_\br_\bc_\be_\b__\bl_\bs_\bd_\b__\ba_\bn_\bn_\bo_\bu_\bn_\bc_\be_\b(_\b)\n o _\bs_\bc_\br_\ba_\bp_\be_\b__\bt_\br_\ba_\bc_\bk_\be_\br_\b(_\b)\n- o _\bd_\bo_\bw_\bn_\bl_\bo_\ba_\bd_\b__\bl_\bi_\bm_\bi_\bt_\b(_\b)_\b _\bu_\bp_\bl_\bo_\ba_\bd_\b__\bl_\bi_\bm_\bi_\bt_\b(_\b)_\b _\bs_\be_\bt_\b__\bd_\bo_\bw_\bn_\bl_\bo_\ba_\bd_\b__\bl_\bi_\bm_\bi_\bt_\b(_\b)\n- _\bs_\be_\bt_\b__\bu_\bp_\bl_\bo_\ba_\bd_\b__\bl_\bi_\bm_\bi_\bt_\b(_\b)\n+ o _\bs_\be_\bt_\b__\bu_\bp_\bl_\bo_\ba_\bd_\b__\bl_\bi_\bm_\bi_\bt_\b(_\b)_\b _\bu_\bp_\bl_\bo_\ba_\bd_\b__\bl_\bi_\bm_\bi_\bt_\b(_\b)_\b _\bs_\be_\bt_\b__\bd_\bo_\bw_\bn_\bl_\bo_\ba_\bd_\b__\bl_\bi_\bm_\bi_\bt_\b(_\b)\n+ _\bd_\bo_\bw_\bn_\bl_\bo_\ba_\bd_\b__\bl_\bi_\bm_\bi_\bt_\b(_\b)\n o _\bc_\bo_\bn_\bn_\be_\bc_\bt_\b__\bp_\be_\be_\br_\b(_\b)\n o _\bc_\bl_\be_\ba_\br_\b__\bp_\be_\be_\br_\bs_\b(_\b)\n o _\bs_\be_\bt_\b__\bm_\ba_\bx_\b__\bu_\bp_\bl_\bo_\ba_\bd_\bs_\b(_\b)_\b _\bm_\ba_\bx_\b__\bu_\bp_\bl_\bo_\ba_\bd_\bs_\b(_\b)\n o _\bm_\ba_\bx_\b__\bc_\bo_\bn_\bn_\be_\bc_\bt_\bi_\bo_\bn_\bs_\b(_\b)_\b _\bs_\be_\bt_\b__\bm_\ba_\bx_\b__\bc_\bo_\bn_\bn_\be_\bc_\bt_\bi_\bo_\bn_\bs_\b(_\b)\n o _\bm_\bo_\bv_\be_\b__\bs_\bt_\bo_\br_\ba_\bg_\be_\b(_\b)\n o _\br_\be_\bn_\ba_\bm_\be_\b__\bf_\bi_\bl_\be_\b(_\b)\n- o _\bi_\bn_\bf_\bo_\b__\bh_\ba_\bs_\bh_\b(_\b)_\b _\bi_\bn_\bf_\bo_\b__\bh_\ba_\bs_\bh_\be_\bs_\b(_\b)\n- o _\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b=_\b=_\b(_\b)_\b _\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b!_\b=_\b(_\b)_\b _\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b<_\b(_\b)\n+ o _\bi_\bn_\bf_\bo_\b__\bh_\ba_\bs_\bh_\be_\bs_\b(_\b)_\b _\bi_\bn_\bf_\bo_\b__\bh_\ba_\bs_\bh_\b(_\b)\n+ o _\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b=_\b=_\b(_\b)_\b _\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b<_\b(_\b)_\b _\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b!_\b=_\b(_\b)\n o _\bi_\bd_\b(_\b)\n o _\bn_\ba_\bt_\bi_\bv_\be_\b__\bh_\ba_\bn_\bd_\bl_\be_\b(_\b)\n o _\bu_\bs_\be_\br_\bd_\ba_\bt_\ba_\b(_\b)\n o _\bi_\bn_\b__\bs_\be_\bs_\bs_\bi_\bo_\bn_\b(_\b)\n * _\bh_\ba_\bs_\bh_\b__\bv_\ba_\bl_\bu_\be_\b(_\b)\n- * _\bb_\bd_\be_\bc_\bo_\bd_\be_\b__\bn_\bo_\bd_\be\n- o _\bb_\bd_\be_\bc_\bo_\bd_\be_\b__\bn_\bo_\bd_\be_\b(_\b)\n- o _\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b=_\b(_\b)_\b _\bb_\bd_\be_\bc_\bo_\bd_\be_\b__\bn_\bo_\bd_\be_\b(_\b)\n- o _\bt_\by_\bp_\be_\b(_\b)\n- o _\bb_\bo_\bo_\bl_\b(_\b)\n- o _\bn_\bo_\bn_\b__\bo_\bw_\bn_\bi_\bn_\bg_\b(_\b)\n- o _\bd_\ba_\bt_\ba_\b__\bs_\be_\bc_\bt_\bi_\bo_\bn_\b(_\b)_\b _\bd_\ba_\bt_\ba_\b__\bo_\bf_\bf_\bs_\be_\bt_\b(_\b)\n- o _\bl_\bi_\bs_\bt_\b__\bi_\bn_\bt_\b__\bv_\ba_\bl_\bu_\be_\b__\ba_\bt_\b(_\b)_\b _\bl_\bi_\bs_\bt_\b__\bs_\bt_\br_\bi_\bn_\bg_\b__\bv_\ba_\bl_\bu_\be_\b__\ba_\bt_\b(_\b)_\b _\bl_\bi_\bs_\bt_\b__\bs_\bi_\bz_\be_\b(_\b)_\b _\bl_\bi_\bs_\bt_\b__\ba_\bt_\b(_\b)\n- o _\bd_\bi_\bc_\bt_\b__\bs_\bi_\bz_\be_\b(_\b)_\b _\bd_\bi_\bc_\bt_\b__\bf_\bi_\bn_\bd_\b__\bi_\bn_\bt_\b(_\b)_\b _\bd_\bi_\bc_\bt_\b__\bf_\bi_\bn_\bd_\b__\bl_\bi_\bs_\bt_\b(_\b)_\b _\bd_\bi_\bc_\bt_\b__\ba_\bt_\b(_\b)\n- _\bd_\bi_\bc_\bt_\b__\bf_\bi_\bn_\bd_\b__\bd_\bi_\bc_\bt_\b(_\b)_\b _\bd_\bi_\bc_\bt_\b__\bf_\bi_\bn_\bd_\b__\bi_\bn_\bt_\b__\bv_\ba_\bl_\bu_\be_\b(_\b)_\b _\bd_\bi_\bc_\bt_\b__\bf_\bi_\bn_\bd_\b__\bs_\bt_\br_\bi_\bn_\bg_\b(_\b)_\b _\bd_\bi_\bc_\bt_\b__\bf_\bi_\bn_\bd\n- _\b(_\b)_\b _\bd_\bi_\bc_\bt_\b__\bf_\bi_\bn_\bd_\b__\bs_\bt_\br_\bi_\bn_\bg_\b__\bv_\ba_\bl_\bu_\be_\b(_\b)_\b _\bd_\bi_\bc_\bt_\b__\ba_\bt_\b__\bn_\bo_\bd_\be_\b(_\b)\n- o _\bi_\bn_\bt_\b__\bv_\ba_\bl_\bu_\be_\b(_\b)\n- o _\bs_\bt_\br_\bi_\bn_\bg_\b__\bp_\bt_\br_\b(_\b)_\b _\bs_\bt_\br_\bi_\bn_\bg_\b__\bo_\bf_\bf_\bs_\be_\bt_\b(_\b)_\b _\bs_\bt_\br_\bi_\bn_\bg_\b__\bv_\ba_\bl_\bu_\be_\b(_\b)_\b _\bs_\bt_\br_\bi_\bn_\bg_\b__\bl_\be_\bn_\bg_\bt_\bh_\b(_\b)\n- o _\bc_\bl_\be_\ba_\br_\b(_\b)\n- o _\bs_\bw_\ba_\bp_\b(_\b)\n- o _\br_\be_\bs_\be_\br_\bv_\be_\b(_\b)\n- o _\bs_\bw_\bi_\bt_\bc_\bh_\b__\bu_\bn_\bd_\be_\br_\bl_\by_\bi_\bn_\bg_\b__\bb_\bu_\bf_\bf_\be_\br_\b(_\b)\n- o _\bh_\ba_\bs_\b__\bs_\bo_\bf_\bt_\b__\be_\br_\br_\bo_\br_\b(_\b)\n- o _\be_\bn_\bu_\bm_\b _\bt_\by_\bp_\be_\b__\bt\n- * _\bp_\br_\bi_\bn_\bt_\b__\be_\bn_\bt_\br_\by_\b(_\b)\n- * _\bb_\bd_\be_\bc_\bo_\bd_\be_\b(_\b)\n- * _\bd_\bh_\bt_\b__\bs_\bt_\ba_\bt_\be\n+ * _\bt_\bo_\br_\br_\be_\bn_\bt_\b__\bs_\bt_\ba_\bt_\bu_\bs\n+ o _\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b=_\b=_\b(_\b)\n+ o _\be_\bn_\bu_\bm_\b _\bs_\bt_\ba_\bt_\be_\b__\bt\n+ * _\bi_\bp_\b__\bf_\bi_\bl_\bt_\be_\br\n+ o _\be_\bm_\bp_\bt_\by_\b(_\b)\n+ o _\ba_\bd_\bd_\b__\br_\bu_\bl_\be_\b(_\b)\n+ o _\ba_\bc_\bc_\be_\bs_\bs_\b(_\b)\n+ o _\be_\bx_\bp_\bo_\br_\bt_\b__\bf_\bi_\bl_\bt_\be_\br_\b(_\b)\n+ o _\be_\bn_\bu_\bm_\b _\ba_\bc_\bc_\be_\bs_\bs_\b__\bf_\bl_\ba_\bg_\bs\n+ * _\bp_\bo_\br_\bt_\b__\bf_\bi_\bl_\bt_\be_\br\n+ o _\ba_\bd_\bd_\b__\br_\bu_\bl_\be_\b(_\b)\n+ o _\ba_\bc_\bc_\be_\bs_\bs_\b(_\b)\n+ o _\be_\bn_\bu_\bm_\b _\ba_\bc_\bc_\be_\bs_\bs_\b__\bf_\bl_\ba_\bg_\bs\n+ * _\ba_\bd_\bd_\b__\bt_\bo_\br_\br_\be_\bn_\bt_\b__\bp_\ba_\br_\ba_\bm_\bs\n+ * _\bc_\bl_\bi_\be_\bn_\bt_\b__\bd_\ba_\bt_\ba_\b__\bt\n+ o _\bc_\bl_\bi_\be_\bn_\bt_\b__\bd_\ba_\bt_\ba_\b__\bt_\b(_\b)\n+ o _\bc_\bo_\bn_\bs_\bt_\b*_\b(_\b)_\b _\bv_\bo_\bi_\bd_\b*_\b(_\b)_\b _\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b=_\b(_\b)\n * _\bd_\bh_\bt_\b__\bs_\bt_\bo_\br_\ba_\bg_\be_\b__\bc_\bo_\bu_\bn_\bt_\be_\br_\bs\n o _\br_\be_\bs_\be_\bt_\b(_\b)\n * _\bd_\bh_\bt_\b__\bs_\bt_\bo_\br_\ba_\bg_\be_\b__\bi_\bn_\bt_\be_\br_\bf_\ba_\bc_\be\n o _\bu_\bp_\bd_\ba_\bt_\be_\b__\bn_\bo_\bd_\be_\b__\bi_\bd_\bs_\b(_\b)\n o _\bg_\be_\bt_\b__\bp_\be_\be_\br_\bs_\b(_\b)\n o _\ba_\bn_\bn_\bo_\bu_\bn_\bc_\be_\b__\bp_\be_\be_\br_\b(_\b)\n o _\bg_\be_\bt_\b__\bi_\bm_\bm_\bu_\bt_\ba_\bb_\bl_\be_\b__\bi_\bt_\be_\bm_\b(_\b)\n o _\bp_\bu_\bt_\b__\bi_\bm_\bm_\bu_\bt_\ba_\bb_\bl_\be_\b__\bi_\bt_\be_\bm_\b(_\b)\n o _\bg_\be_\bt_\b__\bm_\bu_\bt_\ba_\bb_\bl_\be_\b__\bi_\bt_\be_\bm_\b__\bs_\be_\bq_\b(_\b)\n o _\bg_\be_\bt_\b__\bm_\bu_\bt_\ba_\bb_\bl_\be_\b__\bi_\bt_\be_\bm_\b(_\b)\n o _\bp_\bu_\bt_\b__\bm_\bu_\bt_\ba_\bb_\bl_\be_\b__\bi_\bt_\be_\bm_\b(_\b)\n o _\bg_\be_\bt_\b__\bi_\bn_\bf_\bo_\bh_\ba_\bs_\bh_\be_\bs_\b__\bs_\ba_\bm_\bp_\bl_\be_\b(_\b)\n o _\bt_\bi_\bc_\bk_\b(_\b)\n o _\bc_\bo_\bu_\bn_\bt_\be_\br_\bs_\b(_\b)\n+ * _\bd_\bh_\bt_\b__\bs_\bt_\ba_\bt_\be\n * _\bd_\bh_\bt_\b__\bd_\be_\bf_\ba_\bu_\bl_\bt_\b__\bs_\bt_\bo_\br_\ba_\bg_\be_\b__\bc_\bo_\bn_\bs_\bt_\br_\bu_\bc_\bt_\bo_\br_\b(_\b)\n * _\bs_\bi_\bg_\bn_\b__\bm_\bu_\bt_\ba_\bb_\bl_\be_\b__\bi_\bt_\be_\bm_\b(_\b)\n * _\ba_\bn_\bn_\bo_\bu_\bn_\bc_\be_\b__\bf_\bl_\ba_\bg_\bs_\b__\bt\n- * _\br_\be_\ba_\bd_\b__\br_\be_\bs_\bu_\bm_\be_\b__\bd_\ba_\bt_\ba_\b(_\b)\n * _\bw_\br_\bi_\bt_\be_\b__\br_\be_\bs_\bu_\bm_\be_\b__\bd_\ba_\bt_\ba_\b(_\b)_\b _\bw_\br_\bi_\bt_\be_\b__\br_\be_\bs_\bu_\bm_\be_\b__\bd_\ba_\bt_\ba_\b__\bb_\bu_\bf_\b(_\b)\n * _\bw_\br_\bi_\bt_\be_\b__\bt_\bo_\br_\br_\be_\bn_\bt_\b__\bf_\bi_\bl_\be_\b(_\b)_\b _\bw_\br_\bi_\bt_\be_\b__\bt_\bo_\br_\br_\be_\bn_\bt_\b__\bf_\bi_\bl_\be_\b__\bb_\bu_\bf_\b(_\b)\n+ * _\br_\be_\ba_\bd_\b__\br_\be_\bs_\bu_\bm_\be_\b__\bd_\ba_\bt_\ba_\b(_\b)\n * _\bw_\br_\bi_\bt_\be_\b__\bt_\bo_\br_\br_\be_\bn_\bt_\b__\bf_\bl_\ba_\bg_\bs_\b__\bt\n * _\be_\bd_\b2_\b5_\b5_\b1_\b9_\b__\bc_\br_\be_\ba_\bt_\be_\b__\bs_\be_\be_\bd_\b(_\b)\n * _\be_\bd_\b2_\b5_\b5_\b1_\b9_\b__\bc_\br_\be_\ba_\bt_\be_\b__\bk_\be_\by_\bp_\ba_\bi_\br_\b(_\b)\n * _\be_\bd_\b2_\b5_\b5_\b1_\b9_\b__\bs_\bi_\bg_\bn_\b(_\b)\n * _\be_\bd_\b2_\b5_\b5_\b1_\b9_\b__\bv_\be_\br_\bi_\bf_\by_\b(_\b)\n * _\be_\bd_\b2_\b5_\b5_\b1_\b9_\b__\ba_\bd_\bd_\b__\bs_\bc_\ba_\bl_\ba_\br_\b(_\b)\n * _\be_\bd_\b2_\b5_\b5_\b1_\b9_\b__\bk_\be_\by_\b__\be_\bx_\bc_\bh_\ba_\bn_\bg_\be_\b(_\b)\n [_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b**\b* s\bst\bto\bor\bra\bag\bge\be_\b_e\ber\brr\bro\bor\br *\b**\b**\b**\b**\b**\b*\n-Declared in \"_\bl_\bi_\bb_\bt_\bo_\br_\br_\be_\bn_\bt_\b/_\be_\br_\br_\bo_\br_\b__\bc_\bo_\bd_\be_\b._\bh_\bp_\bp\"\n-used by storage to return errors also includes which underlying file the error\n-happened on\n-struct storage_error\n-{\n- explicit operator b\bbo\boo\bol\bl () const;\n- void f\bfi\bil\ble\be (file_index_t f);\n- file_index_t f\bfi\bil\ble\be () const;\n-\n- error_code ec;\n- operation_t operation;\n-};\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b* b\bbo\boo\bol\bl(\b()\b) *\b**\b**\b**\b**\b*\n-explicit operator b\bbo\boo\bol\bl () const;\n-explicitly converts to true if this object represents an error, and false if it\n-does not.\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b* f\bfi\bil\ble\be(\b()\b) *\b**\b**\b**\b**\b*\n-void f\bfi\bil\ble\be (file_index_t f);\n-file_index_t f\bfi\bil\ble\be () const;\n-set and query the index (in the torrent) of the file this error occurred on.\n-This may also have special values defined in _\bt_\bo_\br_\br_\be_\bn_\bt_\b__\bs_\bt_\ba_\bt_\bu_\bs.\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n- ec\n- the error that occurred\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n- operation\n- A code from _\bo_\bp_\be_\br_\ba_\bt_\bi_\bo_\bn_\b__\bt enum, indicating what kind of operation failed.\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b**\b* l\bli\bib\bbt\bto\bor\brr\bre\ben\bnt\bt_\b_c\bca\bat\bte\beg\bgo\bor\bry\by(\b()\b) *\b**\b**\b**\b**\b**\b*\n-Declared in \"_\bl_\bi_\bb_\bt_\bo_\br_\br_\be_\bn_\bt_\b/_\be_\br_\br_\bo_\br_\b__\bc_\bo_\bd_\be_\b._\bh_\bp_\bp\"\n-boost::system::error_category& l\bli\bib\bbt\bto\bor\brr\bre\ben\bnt\bt_\b_c\bca\bat\bte\beg\bgo\bor\bry\by ();\n-return the instance of the libtorrent_error_category which maps libtorrent\n-error codes to human readable error messages.\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b**\b* h\bht\btt\btp\bp_\b_c\bca\bat\bte\beg\bgo\bor\bry\by(\b()\b) *\b**\b**\b**\b**\b**\b*\n-Declared in \"_\bl_\bi_\bb_\bt_\bo_\br_\br_\be_\bn_\bt_\b/_\be_\br_\br_\bo_\br_\b__\bc_\bo_\bd_\be_\b._\bh_\bp_\bp\"\n-boost::system::error_category& h\bht\btt\btp\bp_\b_c\bca\bat\bte\beg\bgo\bor\bry\by ();\n-returns the error_category for HTTP errors\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b**\b* p\bpc\bcp\bp_\b_c\bca\bat\bte\beg\bgo\bor\bry\by(\b()\b) *\b**\b**\b**\b**\b**\b*\n-Declared in \"_\bl_\bi_\bb_\bt_\bo_\br_\br_\be_\bn_\bt_\b/_\bn_\ba_\bt_\bp_\bm_\bp_\b._\bh_\bp_\bp\"\n-boost::system::error_category& p\bpc\bcp\bp_\b_c\bca\bat\bte\beg\bgo\bor\bry\by ();\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b**\b* s\bso\boc\bck\bks\bs_\b_c\bca\bat\bte\beg\bgo\bor\bry\by(\b()\b) *\b**\b**\b**\b**\b**\b*\n-Declared in \"_\bl_\bi_\bb_\bt_\bo_\br_\br_\be_\bn_\bt_\b/_\bs_\bo_\bc_\bk_\bs_\b5_\b__\bs_\bt_\br_\be_\ba_\bm_\b._\bh_\bp_\bp\"\n-boost::system::error_category& s\bso\boc\bck\bks\bs_\b_c\bca\bat\bte\beg\bgo\bor\bry\by ();\n-returns the error_category for SOCKS5 errors\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b**\b* g\bgz\bzi\bip\bp_\b_c\bca\bat\bte\beg\bgo\bor\bry\by(\b()\b) *\b**\b**\b**\b**\b**\b*\n-Declared in \"_\bl_\bi_\bb_\bt_\bo_\br_\br_\be_\bn_\bt_\b/_\bg_\bz_\bi_\bp_\b._\bh_\bp_\bp\"\n-boost::system::error_category& g\bgz\bzi\bip\bp_\b_c\bca\bat\bte\beg\bgo\bor\bry\by ();\n-get the error_category for zip errors\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b**\b* u\bup\bpn\bnp\bp_\b_c\bca\bat\bte\beg\bgo\bor\bry\by(\b()\b) *\b**\b**\b**\b**\b**\b*\n-Declared in \"_\bl_\bi_\bb_\bt_\bo_\br_\br_\be_\bn_\bt_\b/_\bu_\bp_\bn_\bp_\b._\bh_\bp_\bp\"\n-boost::system::error_category& u\bup\bpn\bnp\bp_\b_c\bca\bat\bte\beg\bgo\bor\bry\by ();\n-the boost.system error category for UPnP errors\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b**\b* b\bbd\bde\bec\bco\bod\bde\be_\b_c\bca\bat\bte\beg\bgo\bor\bry\by(\b()\b) *\b**\b**\b**\b**\b**\b*\n-Declared in \"_\bl_\bi_\bb_\bt_\bo_\br_\br_\be_\bn_\bt_\b/_\bb_\bd_\be_\bc_\bo_\bd_\be_\b._\bh_\bp_\bp\"\n-boost::system::error_category& b\bbd\bde\bec\bco\bod\bde\be_\b_c\bca\bat\bte\beg\bgo\bor\bry\by ();\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b**\b* i\bi2\b2p\bp_\b_c\bca\bat\bte\beg\bgo\bor\bry\by(\b()\b) *\b**\b**\b**\b**\b**\b*\n-Declared in \"_\bl_\bi_\bb_\bt_\bo_\br_\br_\be_\bn_\bt_\b/_\bi_\b2_\bp_\b__\bs_\bt_\br_\be_\ba_\bm_\b._\bh_\bp_\bp\"\n-boost::system::error_category& i\bi2\b2p\bp_\b_c\bca\bat\bte\beg\bgo\bor\bry\by ();\n-returns the error category for I2P errors\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b**\b* e\ben\bnu\bum\bm e\ber\brr\bro\bor\br_\b_c\bco\bod\bde\be_\b_e\ben\bnu\bum\bm *\b**\b**\b**\b**\b**\b*\n-Declared in \"_\bl_\bi_\bb_\bt_\bo_\br_\br_\be_\bn_\bt_\b/_\be_\br_\br_\bo_\br_\b__\bc_\bo_\bd_\be_\b._\bh_\bp_\bp\"\n- _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b \n-|_\bn\bn_\ba\ba_\bm\bm_\be\be_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\bv\bv_\ba\ba_\bl\bl_\bu\bu_\be\be_\b|_\bd\bd_\be\be_\bs\bs_\bc\bc_\br\br_\bi\bi_\bp\bp_\bt\bt_\bi\bi_\bo\bo_\bn\bn_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|_\bn_\bo_\b__\be_\br_\br_\bo_\br_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b0_\b _\b _\b _\b _\b|_\bN_\bo_\bt_\b _\ba_\bn_\b _\be_\br_\br_\bo_\br_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|file_collision |1 |Two torrents has files which end |\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\bu_\bp_\b _\bo_\bv_\be_\br_\bw_\br_\bi_\bt_\bi_\bn_\bg_\b _\be_\ba_\bc_\bh_\b _\bo_\bt_\bh_\be_\br_\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|failed_hash_check |2 |A piece did not match its piece |\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\bh_\ba_\bs_\bh_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-| | |The .torrent file does not contain|\n-|torrent_is_no_dict |3 |a bencoded dictionary at its top |\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\bl_\be_\bv_\be_\bl_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|torrent_missing_info |4 |The .torrent file does not have an|\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\bi_\bn_\bf_\bo_\b _\bd_\bi_\bc_\bt_\bi_\bo_\bn_\ba_\br_\by_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|torrent_info_no_dict |5 |The .torrent file's info _\be_\bn_\bt_\br_\by is |\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\bn_\bo_\bt_\b _\ba_\b _\bd_\bi_\bc_\bt_\bi_\bo_\bn_\ba_\br_\by_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|torrent_missing_piece_length |6 |The .torrent file does not have a |\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\bp_\bi_\be_\bc_\be_\b _\bl_\be_\bn_\bg_\bt_\bh_\b _\be_\bn_\bt_\br_\by_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|torrent_missing_name |7 |The .torrent file does not have a |\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\bn_\ba_\bm_\be_\b _\be_\bn_\bt_\br_\by_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|torrent_invalid_name |8 |The .torrent file's name _\be_\bn_\bt_\br_\by is |\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\bi_\bn_\bv_\ba_\bl_\bi_\bd_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-| | |The length of a file, or of the |\n-|torrent_invalid_length |9 |whole .torrent file is invalid. |\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\bE_\bi_\bt_\bh_\be_\br_\b _\bn_\be_\bg_\ba_\bt_\bi_\bv_\be_\b _\bo_\br_\b _\bn_\bo_\bt_\b _\ba_\bn_\b _\bi_\bn_\bt_\be_\bg_\be_\br_\b |\n-|torrent_file_parse_failed |10 |Failed to parse a file _\be_\bn_\bt_\br_\by in |\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\bt_\bh_\be_\b _\b._\bt_\bo_\br_\br_\be_\bn_\bt_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|torrent_missing_pieces |11 |The pieces field is missing or |\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\bi_\bn_\bv_\ba_\bl_\bi_\bd_\b _\bi_\bn_\b _\bt_\bh_\be_\b _\b._\bt_\bo_\br_\br_\be_\bn_\bt_\b _\bf_\bi_\bl_\be_\b _\b _\b _\b _\b _\b |\n-|torrent_invalid_hashes |12 |The pieces string has incorrect |\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\bl_\be_\bn_\bg_\bt_\bh_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|too_many_pieces_in_torrent |13 |The .torrent file has more pieces |\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\bt_\bh_\ba_\bn_\b _\bi_\bs_\b _\bs_\bu_\bp_\bp_\bo_\br_\bt_\be_\bd_\b _\bb_\by_\b _\bl_\bi_\bb_\bt_\bo_\br_\br_\be_\bn_\bt_\b _\b _\b |\n-| | |The metadata (.torrent file) that |\n-|invalid_swarm_metadata |14 |was received from the swarm |\n-| | |matched the info-hash, but failed |\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\bt_\bo_\b _\bb_\be_\b _\bp_\ba_\br_\bs_\be_\bd_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|invalid_bencoding |15 |The file or buffer is not |\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\bc_\bo_\br_\br_\be_\bc_\bt_\bl_\by_\b _\bb_\be_\bn_\bc_\bo_\bd_\be_\bd_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|no_files_in_torrent |16 |The .torrent file does not contain|\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\ba_\bn_\by_\b _\bf_\bi_\bl_\be_\bs_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|invalid_escaped_string |17 |The string was not properly url- |\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\be_\bn_\bc_\bo_\bd_\be_\bd_\b _\ba_\bs_\b _\be_\bx_\bp_\be_\bc_\bt_\be_\bd_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|session_is_closing |18 |Operation is not permitted since |\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\bt_\bh_\be_\b _\bs_\be_\bs_\bs_\bi_\bo_\bn_\b _\bi_\bs_\b _\bs_\bh_\bu_\bt_\bt_\bi_\bn_\bg_\b _\bd_\bo_\bw_\bn_\b _\b _\b _\b _\b _\b |\n-| | |There's already a torrent with |\n-|duplicate_torrent |19 |that info-hash added to the |\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\bs_\be_\bs_\bs_\bi_\bo_\bn_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|invalid_torrent_handle |20 |The supplied _\bt_\bo_\br_\br_\be_\bn_\bt_\b__\bh_\ba_\bn_\bd_\bl_\be is not|\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\br_\be_\bf_\be_\br_\br_\bi_\bn_\bg_\b _\bt_\bo_\b _\ba_\b _\bv_\ba_\bl_\bi_\bd_\b _\bt_\bo_\br_\br_\be_\bn_\bt_\b _\b _\b _\b _\b _\b |\n-|invalid_entry_type |21 |The type requested from the _\be_\bn_\bt_\br_\by |\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\bd_\bi_\bd_\b _\bn_\bo_\bt_\b _\bm_\ba_\bt_\bc_\bh_\b _\bi_\bt_\bs_\b _\bt_\by_\bp_\be_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|missing_info_hash_in_uri |22 |The specified URI does not contain|\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\ba_\b _\bv_\ba_\bl_\bi_\bd_\b _\bi_\bn_\bf_\bo_\b-_\bh_\ba_\bs_\bh_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-| | |One of the files in the torrent |\n-|file_too_short |23 |was unexpectedly small. This might|\n-| | |be caused by files being changed |\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\bb_\by_\b _\ba_\bn_\b _\be_\bx_\bt_\be_\br_\bn_\ba_\bl_\b _\bp_\br_\bo_\bc_\be_\bs_\bs_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-| | |The URL used an unknown protocol. |\n-| | |Currently http and https (if built|\n-|unsupported_url_protocol |24 |with openssl support) are |\n-| | |recognized. For trackers udp is |\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\br_\be_\bc_\bo_\bg_\bn_\bi_\bz_\be_\bd_\b _\ba_\bs_\b _\bw_\be_\bl_\bl_\b._\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|url_parse_error |25 |The URL did not conform to URL |\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\bs_\by_\bn_\bt_\ba_\bx_\b _\ba_\bn_\bd_\b _\bf_\ba_\bi_\bl_\be_\bd_\b _\bt_\bo_\b _\bb_\be_\b _\bp_\ba_\br_\bs_\be_\bd_\b _\b _\b _\b |\n-|peer_sent_empty_piece |26 |The peer sent a piece message of |\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\bl_\be_\bn_\bg_\bt_\bh_\b _\b0_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|parse_failed |27 |A bencoded structure was corrupt |\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\ba_\bn_\bd_\b _\bf_\ba_\bi_\bl_\be_\bd_\b _\bt_\bo_\b _\bb_\be_\b _\bp_\ba_\br_\bs_\be_\bd_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|invalid_file_tag |28 |The fast resume file was missing |\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\bo_\br_\b _\bh_\ba_\bd_\b _\ba_\bn_\b _\bi_\bn_\bv_\ba_\bl_\bi_\bd_\b _\bf_\bi_\bl_\be_\b _\bv_\be_\br_\bs_\bi_\bo_\bn_\b _\bt_\ba_\bg|\n-|missing_info_hash |29 |The fast resume file was missing |\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\bo_\br_\b _\bh_\ba_\bd_\b _\ba_\bn_\b _\bi_\bn_\bv_\ba_\bl_\bi_\bd_\b _\bi_\bn_\bf_\bo_\b-_\bh_\ba_\bs_\bh_\b _\b _\b _\b _\b _\b _\b |\n-|mismatching_info_hash |30 |The info-hash did not match the |\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\bt_\bo_\br_\br_\be_\bn_\bt_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|invalid_hostname |31 |The URL contained an invalid |\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\bh_\bo_\bs_\bt_\bn_\ba_\bm_\be_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|_\bi_\bn_\bv_\ba_\bl_\bi_\bd_\b__\bp_\bo_\br_\bt_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b3_\b2_\b _\b _\b _\b|_\bT_\bh_\be_\b _\bU_\bR_\bL_\b _\bh_\ba_\bd_\b _\ba_\bn_\b _\bi_\bn_\bv_\ba_\bl_\bi_\bd_\b _\bp_\bo_\br_\bt_\b _\b _\b _\b _\b _\b _\b |\n-| | |The port is blocked by the port- |\n-|port_blocked |33 |filter, and prevented the |\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\bc_\bo_\bn_\bn_\be_\bc_\bt_\bi_\bo_\bn_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|expected_close_bracket_in_address |34 |The IPv6 address was expected to |\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\be_\bn_\bd_\b _\bw_\bi_\bt_\bh_\b _\b\"_\b]_\b\"_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-| | |The torrent is being destructed, |\n-|destructing_torrent |35 |preventing the operation to |\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\bs_\bu_\bc_\bc_\be_\be_\bd_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|_\bt_\bi_\bm_\be_\bd_\b__\bo_\bu_\bt_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b3_\b6_\b _\b _\b _\b|_\bT_\bh_\be_\b _\bc_\bo_\bn_\bn_\be_\bc_\bt_\bi_\bo_\bn_\b _\bt_\bi_\bm_\be_\bd_\b _\bo_\bu_\bt_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-| | |The peer is upload only, and we |\n-|upload_upload_connection |37 |are upload only. There's no point |\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\bi_\bn_\b _\bk_\be_\be_\bp_\bi_\bn_\bg_\b _\bt_\bh_\be_\b _\bc_\bo_\bn_\bn_\be_\bc_\bt_\bi_\bo_\bn_\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-| | |The peer is upload only, and we're|\n-|uninteresting_upload_peer |38 |not interested in it. There's no |\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\bp_\bo_\bi_\bn_\bt_\b _\bi_\bn_\b _\bk_\be_\be_\bp_\bi_\bn_\bg_\b _\bt_\bh_\be_\b _\bc_\bo_\bn_\bn_\be_\bc_\bt_\bi_\bo_\bn_\b _\b _\b |\n-|_\bi_\bn_\bv_\ba_\bl_\bi_\bd_\b__\bi_\bn_\bf_\bo_\b__\bh_\ba_\bs_\bh_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b3_\b9_\b _\b _\b _\b|_\bT_\bh_\be_\b _\bp_\be_\be_\br_\b _\bs_\be_\bn_\bt_\b _\ba_\bn_\b _\bu_\bn_\bk_\bn_\bo_\bw_\bn_\b _\bi_\bn_\bf_\bo_\b-_\bh_\ba_\bs_\bh|\n-|torrent_paused |40 |The torrent is paused, preventing |\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\bt_\bh_\be_\b _\bo_\bp_\be_\br_\ba_\bt_\bi_\bo_\bn_\b _\bf_\br_\bo_\bm_\b _\bs_\bu_\bc_\bc_\be_\be_\bd_\bi_\bn_\bg_\b _\b _\b _\b _\b |\n-| | |The peer sent an invalid have |\n-|invalid_have |41 |message, either wrong size or |\n-| | |referring to a piece that doesn't |\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\be_\bx_\bi_\bs_\bt_\b _\bi_\bn_\b _\bt_\bh_\be_\b _\bt_\bo_\br_\br_\be_\bn_\bt_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|invalid_bitfield_size |42 |The _\bb_\bi_\bt_\bf_\bi_\be_\bl_\bd message had the |\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\bi_\bn_\bc_\bo_\br_\br_\be_\bc_\bt_\b _\bs_\bi_\bz_\be_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-| | |The peer kept requesting pieces |\n-|too_many_requests_when_choked |43 |after it was choked, possible |\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\ba_\bb_\bu_\bs_\be_\b _\ba_\bt_\bt_\be_\bm_\bp_\bt_\b._\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-| | |The peer sent a piece message that|\n-|invalid_piece |44 |does not correspond to a piece |\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\br_\be_\bq_\bu_\be_\bs_\bt_\b _\bs_\be_\bn_\bt_\b _\bb_\by_\b _\bt_\bh_\be_\b _\bc_\bl_\bi_\be_\bn_\bt_\b _\b _\b _\b _\b _\b _\b _\b |\n-|_\bn_\bo_\b__\bm_\be_\bm_\bo_\br_\by_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b4_\b5_\b _\b _\b _\b|_\bm_\be_\bm_\bo_\br_\by_\b _\ba_\bl_\bl_\bo_\bc_\ba_\bt_\bi_\bo_\bn_\b _\bf_\ba_\bi_\bl_\be_\bd_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|torrent_aborted |46 |The torrent is aborted, preventing|\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\bt_\bh_\be_\b _\bo_\bp_\be_\br_\ba_\bt_\bi_\bo_\bn_\b _\bt_\bo_\b _\bs_\bu_\bc_\bc_\be_\be_\bd_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|self_connection |47 |The peer is a connection to |\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\bo_\bu_\br_\bs_\be_\bl_\bf_\b,_\b _\bn_\bo_\b _\bp_\bo_\bi_\bn_\bt_\b _\bi_\bn_\b _\bk_\be_\be_\bp_\bi_\bn_\bg_\b _\bi_\bt_\b _\b _\b |\n-| | |The peer sent a piece message with|\n-|invalid_piece_size |48 |invalid size, either negative or |\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\bg_\br_\be_\ba_\bt_\be_\br_\b _\bt_\bh_\ba_\bn_\b _\bo_\bn_\be_\b _\bb_\bl_\bo_\bc_\bk_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-| | |The peer has not been interesting |\n-|timed_out_no_interest |49 |or interested in us for too long, |\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\bn_\bo_\b _\bp_\bo_\bi_\bn_\bt_\b _\bi_\bn_\b _\bk_\be_\be_\bp_\bi_\bn_\bg_\b _\bi_\bt_\b _\ba_\br_\bo_\bu_\bn_\bd_\b _\b _\b _\b _\b |\n-|timed_out_inactivity |50 |The peer has not said anything in |\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\ba_\b _\bl_\bo_\bn_\bg_\b _\bt_\bi_\bm_\be_\b,_\b _\bp_\bo_\bs_\bs_\bi_\bb_\bl_\by_\b _\bd_\be_\ba_\bd_\b _\b _\b _\b _\b _\b _\b _\b |\n-| | |The peer did not send a handshake |\n-|timed_out_no_handshake |51 |within a reasonable amount of |\n-| | |time, it might not be a bittorrent|\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\bp_\be_\be_\br_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-| | |The peer has been unchoked for too|\n-|timed_out_no_request |52 |long without requesting any data. |\n-| | |It might be lying about its |\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\bi_\bn_\bt_\be_\br_\be_\bs_\bt_\b _\bi_\bn_\b _\bu_\bs_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|invalid_choke |53 |The peer sent an invalid choke |\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\bm_\be_\bs_\bs_\ba_\bg_\be_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|invalid_unchoke |54 |The peer send an invalid unchoke |\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\bm_\be_\bs_\bs_\ba_\bg_\be_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|invalid_interested |55 |The peer sent an invalid |\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\bi_\bn_\bt_\be_\br_\be_\bs_\bt_\be_\bd_\b _\bm_\be_\bs_\bs_\ba_\bg_\be_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|invalid_not_interested |56 |The peer sent an invalid not- |\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\bi_\bn_\bt_\be_\br_\be_\bs_\bt_\be_\bd_\b _\bm_\be_\bs_\bs_\ba_\bg_\be_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|invalid_request |57 |The peer sent an invalid piece |\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\br_\be_\bq_\bu_\be_\bs_\bt_\b _\bm_\be_\bs_\bs_\ba_\bg_\be_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-| | |The peer sent an invalid hash-list|\n-|invalid_hash_list |58 |message (this is part of the |\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\bm_\be_\br_\bk_\bl_\be_\b-_\bt_\bo_\br_\br_\be_\bn_\bt_\b _\be_\bx_\bt_\be_\bn_\bs_\bi_\bo_\bn_\b)_\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-| | |The peer sent an invalid hash- |\n-|invalid_hash_piece |59 |piece message (this is part of the|\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\bm_\be_\br_\bk_\bl_\be_\b-_\bt_\bo_\br_\br_\be_\bn_\bt_\b _\be_\bx_\bt_\be_\bn_\bs_\bi_\bo_\bn_\b)_\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|invalid_cancel |60 |The peer sent an invalid cancel |\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\bm_\be_\bs_\bs_\ba_\bg_\be_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|invalid_dht_port |61 |The peer sent an invalid DHT port-|\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\bm_\be_\bs_\bs_\ba_\bg_\be_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|invalid_suggest |62 |The peer sent an invalid suggest |\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\bp_\bi_\be_\bc_\be_\b-_\bm_\be_\bs_\bs_\ba_\bg_\be_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|invalid_have_all |63 |The peer sent an invalid have all-|\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\bm_\be_\bs_\bs_\ba_\bg_\be_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|invalid_have_none |64 |The peer sent an invalid have |\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\bn_\bo_\bn_\be_\b-_\bm_\be_\bs_\bs_\ba_\bg_\be_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|invalid_reject |65 |The peer sent an invalid reject |\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\bm_\be_\bs_\bs_\ba_\bg_\be_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|invalid_allow_fast |66 |The peer sent an invalid allow |\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\bf_\ba_\bs_\bt_\b-_\bm_\be_\bs_\bs_\ba_\bg_\be_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|invalid_extended |67 |The peer sent an invalid extension|\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\bm_\be_\bs_\bs_\ba_\bg_\be_\b _\bI_\bD_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|invalid_message |68 |The peer sent an invalid message |\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\bI_\bD_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|sync_hash_not_found |69 |The synchronization hash was not |\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\bf_\bo_\bu_\bn_\bd_\b _\bi_\bn_\b _\bt_\bh_\be_\b _\be_\bn_\bc_\br_\by_\bp_\bt_\be_\bd_\b _\bh_\ba_\bn_\bd_\bs_\bh_\ba_\bk_\be_\b _\b |\n-|invalid_encryption_constant |70 |The encryption constant in the |\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\bh_\ba_\bn_\bd_\bs_\bh_\ba_\bk_\be_\b _\bi_\bs_\b _\bi_\bn_\bv_\ba_\bl_\bi_\bd_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|no_plaintext_mode |71 |The peer does not support plain |\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\bt_\be_\bx_\bt_\b,_\b _\bw_\bh_\bi_\bc_\bh_\b _\bi_\bs_\b _\bt_\bh_\be_\b _\bs_\be_\bl_\be_\bc_\bt_\be_\bd_\b _\bm_\bo_\bd_\be_\b _\b |\n-|no_rc4_mode |72 |The peer does not support RC4, |\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\bw_\bh_\bi_\bc_\bh_\b _\bi_\bs_\b _\bt_\bh_\be_\b _\bs_\be_\bl_\be_\bc_\bt_\be_\bd_\b _\bm_\bo_\bd_\be_\b _\b _\b _\b _\b _\b _\b _\b |\n-| | |The peer does not support any of |\n-|unsupported_encryption_mode |73 |the encryption modes that the |\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\bc_\bl_\bi_\be_\bn_\bt_\b _\bs_\bu_\bp_\bp_\bo_\br_\bt_\bs_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-| | |The peer selected an encryption |\n-|unsupported_encryption_mode_selected|74 |mode that the client did not |\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\ba_\bd_\bv_\be_\br_\bt_\bi_\bs_\be_\b _\ba_\bn_\bd_\b _\bd_\bo_\be_\bs_\b _\bn_\bo_\bt_\b _\bs_\bu_\bp_\bp_\bo_\br_\bt_\b _\b _\b _\b |\n-| | |The pad size used in the |\n-|invalid_pad_size |75 |encryption handshake is of invalid|\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\bs_\bi_\bz_\be_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|invalid_encrypt_handshake |76 |The encryption handshake is |\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\bi_\bn_\bv_\ba_\bl_\bi_\bd_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-| | |The client is set to not support |\n-|no_incoming_encrypted |77 |incoming encrypted connections and|\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\bt_\bh_\bi_\bs_\b _\bi_\bs_\b _\ba_\bn_\b _\be_\bn_\bc_\br_\by_\bp_\bt_\be_\bd_\b _\bc_\bo_\bn_\bn_\be_\bc_\bt_\bi_\bo_\bn_\b _\b _\b |\n-| | |The client is set to not support |\n-|no_incoming_regular |78 |incoming regular bittorrent |\n-| | |connections, and this is a regular|\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\bc_\bo_\bn_\bn_\be_\bc_\bt_\bi_\bo_\bn_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|duplicate_peer_id |79 |The client is already connected to|\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\bt_\bh_\bi_\bs_\b _\bp_\be_\be_\br_\b-_\bI_\bD_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|_\bt_\bo_\br_\br_\be_\bn_\bt_\b__\br_\be_\bm_\bo_\bv_\be_\bd_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b8_\b0_\b _\b _\b _\b|_\bT_\bo_\br_\br_\be_\bn_\bt_\b _\bw_\ba_\bs_\b _\br_\be_\bm_\bo_\bv_\be_\bd_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|packet_too_large |81 |The packet size exceeded the upper|\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\bs_\ba_\bn_\bi_\bt_\by_\b _\bc_\bh_\be_\bc_\bk_\b-_\bl_\bi_\bm_\bi_\bt_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|_\br_\be_\bs_\be_\br_\bv_\be_\bd_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b8_\b2_\b _\b _\b _\b|_\b\u00a0_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|http_error |83 |The web server responded with an |\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\be_\br_\br_\bo_\br_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|missing_location |84 |The web server response is missing|\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\ba_\b _\bl_\bo_\bc_\ba_\bt_\bi_\bo_\bn_\b _\bh_\be_\ba_\bd_\be_\br_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-| | |The web seed redirected to a path |\n-|invalid_redirection |85 |that no longer matches the |\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\b._\bt_\bo_\br_\br_\be_\bn_\bt_\b _\bd_\bi_\br_\be_\bc_\bt_\bo_\br_\by_\b _\bs_\bt_\br_\bu_\bc_\bt_\bu_\br_\be_\b _\b _\b _\b _\b _\b |\n-|redirecting |86 |The connection was closed because |\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\bi_\bt_\b _\br_\be_\bd_\bi_\br_\be_\bc_\bt_\be_\bd_\b _\bt_\bo_\b _\ba_\b _\bd_\bi_\bf_\bf_\be_\br_\be_\bn_\bt_\b _\bU_\bR_\bL_\b _\b |\n-|_\bi_\bn_\bv_\ba_\bl_\bi_\bd_\b__\br_\ba_\bn_\bg_\be_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b8_\b7_\b _\b _\b _\b|_\bT_\bh_\be_\b _\bH_\bT_\bT_\bP_\b _\br_\ba_\bn_\bg_\be_\b _\bh_\be_\ba_\bd_\be_\br_\b _\bi_\bs_\b _\bi_\bn_\bv_\ba_\bl_\bi_\bd_\b _\b |\n-|no_content_length |88 |The HTTP response did not have a |\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\bc_\bo_\bn_\bt_\be_\bn_\bt_\b _\bl_\be_\bn_\bg_\bt_\bh_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|_\bb_\ba_\bn_\bn_\be_\bd_\b__\bb_\by_\b__\bi_\bp_\b__\bf_\bi_\bl_\bt_\be_\br_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b8_\b9_\b _\b _\b _\b|_\bT_\bh_\be_\b _\bI_\bP_\b _\bi_\bs_\b _\bb_\bl_\bo_\bc_\bk_\be_\bd_\b _\bb_\by_\b _\bt_\bh_\be_\b _\bI_\bP_\b _\bf_\bi_\bl_\bt_\be_\br|\n-|_\bt_\bo_\bo_\b__\bm_\ba_\bn_\by_\b__\bc_\bo_\bn_\bn_\be_\bc_\bt_\bi_\bo_\bn_\bs_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b9_\b0_\b _\b _\b _\b|_\bA_\bt_\b _\bt_\bh_\be_\b _\bc_\bo_\bn_\bn_\be_\bc_\bt_\bi_\bo_\bn_\b _\bl_\bi_\bm_\bi_\bt_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|_\bp_\be_\be_\br_\b__\bb_\ba_\bn_\bn_\be_\bd_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b9_\b1_\b _\b _\b _\b|_\bT_\bh_\be_\b _\bp_\be_\be_\br_\b _\bi_\bs_\b _\bm_\ba_\br_\bk_\be_\bd_\b _\ba_\bs_\b _\bb_\ba_\bn_\bn_\be_\bd_\b _\b _\b _\b _\b _\b |\n-|stopping_torrent |92 |The torrent is stopping, causing |\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\bt_\bh_\be_\b _\bo_\bp_\be_\br_\ba_\bt_\bi_\bo_\bn_\b _\bt_\bo_\b _\bf_\ba_\bi_\bl_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|too_many_corrupt_pieces |93 |The peer has sent too many corrupt|\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\bp_\bi_\be_\bc_\be_\bs_\b _\ba_\bn_\bd_\b _\bi_\bs_\b _\bb_\ba_\bn_\bn_\be_\bd_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|torrent_not_ready |94 |The torrent is not ready to |\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\br_\be_\bc_\be_\bi_\bv_\be_\b _\bp_\be_\be_\br_\bs_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|peer_not_constructed |95 |The peer is not completely |\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\bc_\bo_\bn_\bs_\bt_\br_\bu_\bc_\bt_\be_\bd_\b _\by_\be_\bt_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|session_closing |96 |The _\bs_\be_\bs_\bs_\bi_\bo_\bn is closing, causing |\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\bt_\bh_\be_\b _\bo_\bp_\be_\br_\ba_\bt_\bi_\bo_\bn_\b _\bt_\bo_\b _\bf_\ba_\bi_\bl_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-| | |The peer was disconnected in order|\n-|optimistic_disconnect |97 |to leave room for a potentially |\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\bb_\be_\bt_\bt_\be_\br_\b _\bp_\be_\be_\br_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|_\bt_\bo_\br_\br_\be_\bn_\bt_\b__\bf_\bi_\bn_\bi_\bs_\bh_\be_\bd_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b9_\b8_\b _\b _\b _\b|_\bT_\bh_\be_\b _\bt_\bo_\br_\br_\be_\bn_\bt_\b _\bi_\bs_\b _\bf_\bi_\bn_\bi_\bs_\bh_\be_\bd_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|_\bn_\bo_\b__\br_\bo_\bu_\bt_\be_\br_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b9_\b9_\b _\b _\b _\b|_\bN_\bo_\b _\bU_\bP_\bn_\bP_\b _\br_\bo_\bu_\bt_\be_\br_\b _\bf_\bo_\bu_\bn_\bd_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|metadata_too_large |100 |The metadata message says the |\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\bm_\be_\bt_\ba_\bd_\ba_\bt_\ba_\b _\be_\bx_\bc_\be_\be_\bd_\bs_\b _\bt_\bh_\be_\b _\bl_\bi_\bm_\bi_\bt_\b _\b _\b _\b _\b _\b _\b _\b |\n-|invalid_metadata_request |101 |The peer sent an invalid metadata |\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\br_\be_\bq_\bu_\be_\bs_\bt_\b _\bm_\be_\bs_\bs_\ba_\bg_\be_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|invalid_metadata_size |102 |The peer advertised an invalid |\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\bm_\be_\bt_\ba_\bd_\ba_\bt_\ba_\b _\bs_\bi_\bz_\be_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|invalid_metadata_offset |103 |The peer sent a message with an |\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\bi_\bn_\bv_\ba_\bl_\bi_\bd_\b _\bm_\be_\bt_\ba_\bd_\ba_\bt_\ba_\b _\bo_\bf_\bf_\bs_\be_\bt_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|invalid_metadata_message |104 |The peer sent an invalid metadata |\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\bm_\be_\bs_\bs_\ba_\bg_\be_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|pex_message_too_large |105 |The peer sent a peer exchange |\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\bm_\be_\bs_\bs_\ba_\bg_\be_\b _\bt_\bh_\ba_\bt_\b _\bw_\ba_\bs_\b _\bt_\bo_\bo_\b _\bl_\ba_\br_\bg_\be_\b _\b _\b _\b _\b _\b _\b _\b |\n-|invalid_pex_message |106 |The peer sent an invalid peer |\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\be_\bx_\bc_\bh_\ba_\bn_\bg_\be_\b _\bm_\be_\bs_\bs_\ba_\bg_\be_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|invalid_lt_tracker_message |107 |The peer sent an invalid tracker |\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\be_\bx_\bc_\bh_\ba_\bn_\bg_\be_\b _\bm_\be_\bs_\bs_\ba_\bg_\be_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-| | |The peer sent an pex messages too |\n-|too_frequent_pex |108 |often. This is a possible attempt |\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\bo_\bf_\b _\ba_\bn_\bd_\b _\ba_\bt_\bt_\ba_\bc_\bk_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-| | |The operation failed because it |\n-| | |requires the torrent to have the |\n-| | |metadata (.torrent file) and it |\n-|no_metadata |109 |doesn't have it yet. This happens |\n-| | |for magnet links before they have |\n-| | |downloaded the metadata, and also |\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\bt_\bo_\br_\br_\be_\bn_\bt_\bs_\b _\ba_\bd_\bd_\be_\bd_\b _\bb_\by_\b _\bU_\bR_\bL_\b._\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-| | |The peer sent an invalid dont_have|\n-| | |message. The don't have message is|\n-|invalid_dont_have |110 |an extension to allow peers to |\n-| | |advertise that the no longer has a|\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\bp_\bi_\be_\bc_\be_\b _\bt_\bh_\be_\by_\b _\bp_\br_\be_\bv_\bi_\bo_\bu_\bs_\bl_\by_\b _\bh_\ba_\bd_\b._\b _\b _\b _\b _\b _\b _\b _\b |\n-| | |The peer tried to connect to an |\n-|requires_ssl_connection |111 |SSL torrent without connecting |\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\bo_\bv_\be_\br_\b _\bS_\bS_\bL_\b._\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-| | |The peer tried to connect to a |\n-|invalid_ssl_cert |112 |torrent with a certificate for a |\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\bd_\bi_\bf_\bf_\be_\br_\be_\bn_\bt_\b _\bt_\bo_\br_\br_\be_\bn_\bt_\b._\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-| | |the torrent is not an SSL torrent,|\n-|not_an_ssl_torrent |113 |and the operation requires an SSL |\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\bt_\bo_\br_\br_\be_\bn_\bt_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-| | |peer was banned because its listen|\n-|banned_by_port_filter |114 |port is within a banned port |\n-| | |range, as specified by the |\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\bp_\bo_\br_\bt_\b__\bf_\bi_\bl_\bt_\be_\br_\b._\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|invalid_session_handle |115 |The _\bs_\be_\bs_\bs_\bi_\bo_\bn_\b__\bh_\ba_\bn_\bd_\bl_\be is not |\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\br_\be_\bf_\be_\br_\br_\bi_\bn_\bg_\b _\bt_\bo_\b _\ba_\b _\bv_\ba_\bl_\bi_\bd_\b _\bs_\be_\bs_\bs_\bi_\bo_\bn_\b__\bi_\bm_\bp_\bl_\b |\n-|invalid_listen_socket |116 |the listen socket associated with |\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\bt_\bh_\bi_\bs_\b _\br_\be_\bq_\bu_\be_\bs_\bt_\b _\bw_\ba_\bs_\b _\bc_\bl_\bo_\bs_\be_\bd_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|_\bi_\bn_\bv_\ba_\bl_\bi_\bd_\b__\bh_\ba_\bs_\bh_\b__\br_\be_\bq_\bu_\be_\bs_\bt_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b1_\b1_\b7_\b _\b _\b|_\b\u00a0_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|_\bi_\bn_\bv_\ba_\bl_\bi_\bd_\b__\bh_\ba_\bs_\bh_\be_\bs_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b1_\b1_\b8_\b _\b _\b|_\b\u00a0_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|_\bi_\bn_\bv_\ba_\bl_\bi_\bd_\b__\bh_\ba_\bs_\bh_\b__\br_\be_\bj_\be_\bc_\bt_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b1_\b1_\b9_\b _\b _\b|_\b\u00a0_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|_\bd_\be_\bp_\br_\be_\bc_\ba_\bt_\be_\bd_\b__\b1_\b2_\b0_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b1_\b2_\b0_\b _\b _\b|_\b\u00a0_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|_\bd_\be_\bp_\br_\be_\bc_\ba_\bt_\be_\bd_\b__\b1_\b2_\b1_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b1_\b2_\b1_\b _\b _\b|_\b\u00a0_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|_\bd_\be_\bp_\br_\be_\bc_\ba_\bt_\be_\bd_\b__\b1_\b2_\b2_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b1_\b2_\b2_\b _\b _\b|_\b\u00a0_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|_\bd_\be_\bp_\br_\be_\bc_\ba_\bt_\be_\bd_\b__\b1_\b2_\b3_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b1_\b2_\b3_\b _\b _\b|_\b\u00a0_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|_\bd_\be_\bp_\br_\be_\bc_\ba_\bt_\be_\bd_\b__\b1_\b2_\b4_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b1_\b2_\b4_\b _\b _\b|_\b\u00a0_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|missing_file_sizes |130 |The resume data file is missing |\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\bt_\bh_\be_\b _\bf_\bi_\bl_\be_\b _\bs_\bi_\bz_\be_\bs_\b _\be_\bn_\bt_\br_\by_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|no_files_in_resume_data |131 |The resume data file file sizes |\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\be_\bn_\bt_\br_\by_\b _\bi_\bs_\b _\be_\bm_\bp_\bt_\by_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|missing_pieces |132 |The resume data file is missing |\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\bt_\bh_\be_\b _\bp_\bi_\be_\bc_\be_\bs_\b _\ba_\bn_\bd_\b _\bs_\bl_\bo_\bt_\bs_\b _\be_\bn_\bt_\br_\by_\b _\b _\b _\b _\b _\b _\b _\b |\n-| | |The number of files in the resume |\n-|mismatching_number_of_files |133 |data does not match the number of |\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\bf_\bi_\bl_\be_\bs_\b _\bi_\bn_\b _\bt_\bh_\be_\b _\bt_\bo_\br_\br_\be_\bn_\bt_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-| | |One of the files on disk has a |\n-|mismatching_file_size |134 |different size than in the fast |\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\br_\be_\bs_\bu_\bm_\be_\b _\bf_\bi_\bl_\be_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-| | |One of the files on disk has a |\n-|mismatching_file_timestamp |135 |different timestamp than in the |\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\bf_\ba_\bs_\bt_\b _\br_\be_\bs_\bu_\bm_\be_\b _\bf_\bi_\bl_\be_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|not_a_dictionary |136 |The resume data file is not a |\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\bd_\bi_\bc_\bt_\bi_\bo_\bn_\ba_\br_\by_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|invalid_blocks_per_piece |137 |The blocks per piece _\be_\bn_\bt_\br_\by is |\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\bi_\bn_\bv_\ba_\bl_\bi_\bd_\b _\bi_\bn_\b _\bt_\bh_\be_\b _\br_\be_\bs_\bu_\bm_\be_\b _\bd_\ba_\bt_\ba_\b _\bf_\bi_\bl_\be_\b _\b _\b |\n-| | |The resume file is missing the |\n-|missing_slots |138 |slots _\be_\bn_\bt_\br_\by, which is required for|\n-| | |torrents with compact allocation. |\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\bD\bD_\bE\bE_\bP\bP_\bR\bR_\bE\bE_\bC\bC_\bA\bA_\bT\bT_\bE\bE_\bD\bD_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|too_many_slots |139 |The resume file contains more |\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\bs_\bl_\bo_\bt_\bs_\b _\bt_\bh_\ba_\bn_\b _\bt_\bh_\be_\b _\bt_\bo_\br_\br_\be_\bn_\bt_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|invalid_slot_list |140 |The slot _\be_\bn_\bt_\br_\by is invalid in the |\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\br_\be_\bs_\bu_\bm_\be_\b _\bd_\ba_\bt_\ba_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|invalid_piece_index |141 |One index in the slot list is |\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\bi_\bn_\bv_\ba_\bl_\bi_\bd_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-| | |The pieces on disk needs to be re-|\n-| | |ordered for the specified |\n-| | |allocation mode. This happens if |\n-|pieces_need_reorder |142 |you specify sparse allocation and |\n-| | |the files on disk are using |\n-| | |compact storage. The pieces needs |\n-| | |to be moved to their right |\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\bp_\bo_\bs_\bi_\bt_\bi_\bo_\bn_\b._\b _\bD\bD_\bE\bE_\bP\bP_\bR\bR_\bE\bE_\bC\bC_\bA\bA_\bT\bT_\bE\bE_\bD\bD_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-| | |this error is returned when asking|\n-| | |to save resume data and specifying|\n-|resume_data_not_modified |143 |the flag to only save when there's|\n-| | |anything new to save |\n-| | |(_\bt_\bo_\br_\br_\be_\bn_\bt_\b__\bh_\ba_\bn_\bd_\bl_\be_\b:_\b:_\bo_\bn_\bl_\by_\b__\bi_\bf_\b__\bm_\bo_\bd_\bi_\bf_\bi_\be_\bd)|\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\ba_\bn_\bd_\b _\bt_\bh_\be_\br_\be_\b _\bw_\ba_\bs_\bn_\b'_\bt_\b _\ba_\bn_\by_\bt_\bh_\bi_\bn_\bg_\b _\bc_\bh_\ba_\bn_\bg_\be_\bd_\b.|\n-|http_parse_error |150 |The HTTP header was not correctly |\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\bf_\bo_\br_\bm_\ba_\bt_\bt_\be_\bd_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-| | |The HTTP response was in the 300- |\n-|http_missing_location |151 |399 range but lacked a location |\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\bh_\be_\ba_\bd_\be_\br_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-| | |The HTTP response was encoded with|\n-|http_failed_decompress |152 |gzip or deflate but decompressing |\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\bi_\bt_\b _\bf_\ba_\bi_\bl_\be_\bd_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|no_i2p_router |160 |The URL specified an i2p address, |\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\bb_\bu_\bt_\b _\bn_\bo_\b _\bi_\b2_\bp_\b _\br_\bo_\bu_\bt_\be_\br_\b _\bi_\bs_\b _\bc_\bo_\bn_\bf_\bi_\bg_\bu_\br_\be_\bd_\b _\b _\b |\n-|no_i2p_endpoint |161 |i2p acceptor is not available yet,|\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\bc_\ba_\bn_\b'_\bt_\b _\ba_\bn_\bn_\bo_\bu_\bn_\bc_\be_\b _\bw_\bi_\bt_\bh_\bo_\bu_\bt_\b _\be_\bn_\bd_\bp_\bo_\bi_\bn_\bt_\b _\b _\b |\n-| | |The tracker URL doesn't support |\n-|scrape_not_available |170 |transforming it into a scrape URL.|\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\bi_\b._\be_\b._\b _\bi_\bt_\b _\bd_\bo_\be_\bs_\bn_\b'_\bt_\b _\bc_\bo_\bn_\bt_\ba_\bi_\bn_\b _\b\"_\ba_\bn_\bn_\bo_\bu_\bn_\bc_\be_\b.|\n-|_\bi_\bn_\bv_\ba_\bl_\bi_\bd_\b__\bt_\br_\ba_\bc_\bk_\be_\br_\b__\br_\be_\bs_\bp_\bo_\bn_\bs_\be_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b1_\b7_\b1_\b _\b _\b|_\bi_\bn_\bv_\ba_\bl_\bi_\bd_\b _\bt_\br_\ba_\bc_\bk_\be_\br_\b _\br_\be_\bs_\bp_\bo_\bn_\bs_\be_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|invalid_peer_dict |172 |invalid peer dictionary _\be_\bn_\bt_\br_\by. Not|\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\ba_\b _\bd_\bi_\bc_\bt_\bi_\bo_\bn_\ba_\br_\by_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|_\bt_\br_\ba_\bc_\bk_\be_\br_\b__\bf_\ba_\bi_\bl_\bu_\br_\be_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b1_\b7_\b3_\b _\b _\b|_\bt_\br_\ba_\bc_\bk_\be_\br_\b _\bs_\be_\bn_\bt_\b _\ba_\b _\bf_\ba_\bi_\bl_\bu_\br_\be_\b _\bm_\be_\bs_\bs_\ba_\bg_\be_\b _\b _\b _\b |\n-|_\bi_\bn_\bv_\ba_\bl_\bi_\bd_\b__\bf_\bi_\bl_\be_\bs_\b__\be_\bn_\bt_\br_\by_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b1_\b7_\b4_\b _\b _\b|_\bm_\bi_\bs_\bs_\bi_\bn_\bg_\b _\bo_\br_\b _\bi_\bn_\bv_\ba_\bl_\bi_\bd_\b _\bf_\bi_\bl_\be_\bs_\b _\be_\bn_\bt_\br_\by_\b _\b _\b _\b |\n-|_\bi_\bn_\bv_\ba_\bl_\bi_\bd_\b__\bh_\ba_\bs_\bh_\b__\be_\bn_\bt_\br_\by_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b1_\b7_\b5_\b _\b _\b|_\bm_\bi_\bs_\bs_\bi_\bn_\bg_\b _\bo_\br_\b _\bi_\bn_\bv_\ba_\bl_\bi_\bd_\b _\bh_\ba_\bs_\bh_\b _\be_\bn_\bt_\br_\by_\b _\b _\b _\b _\b |\n-|invalid_peers_entry |176 |missing or invalid peers and |\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\bp_\be_\be_\br_\bs_\b6_\b _\be_\bn_\bt_\br_\by_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|invalid_tracker_response_length |177 |UDP tracker response packet has |\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\bi_\bn_\bv_\ba_\bl_\bi_\bd_\b _\bs_\bi_\bz_\be_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|invalid_tracker_transaction_id |178 |invalid transaction id in UDP |\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\bt_\br_\ba_\bc_\bk_\be_\br_\b _\br_\be_\bs_\bp_\bo_\bn_\bs_\be_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|invalid_tracker_action |179 |invalid action field in UDP |\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\bt_\br_\ba_\bc_\bk_\be_\br_\b _\br_\be_\bs_\bp_\bo_\bn_\bs_\be_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-| | |skipped announce (because it's |\n-|announce_skipped |180 |assumed to be unreachable over the|\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\bg_\bi_\bv_\be_\bn_\b _\bs_\bo_\bu_\br_\bc_\be_\b _\bn_\be_\bt_\bw_\bo_\br_\bk_\b _\bi_\bn_\bt_\be_\br_\bf_\ba_\bc_\be_\b)_\b _\b _\b |\n-|_\bn_\bo_\b__\be_\bn_\bt_\br_\bo_\bp_\by_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b2_\b0_\b0_\b _\b _\b|_\br_\ba_\bn_\bd_\bo_\bm_\b _\bn_\bu_\bm_\bb_\be_\br_\b _\bg_\be_\bn_\be_\br_\ba_\bt_\bi_\bo_\bn_\b _\bf_\ba_\bi_\bl_\be_\bd_\b _\b _\b |\n-|_\bs_\bs_\br_\bf_\b__\bm_\bi_\bt_\bi_\bg_\ba_\bt_\bi_\bo_\bn_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b2_\b0_\b1_\b _\b _\b|_\bb_\bl_\bo_\bc_\bk_\be_\bd_\b _\bb_\by_\b _\bS_\bS_\bR_\bF_\b _\bm_\bi_\bt_\bi_\bg_\ba_\bt_\bi_\bo_\bn_\b _\b _\b _\b _\b _\b _\b _\b |\n-|blocked_by_idna |202 |blocked because IDNA host names |\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\ba_\br_\be_\b _\bb_\ba_\bn_\bn_\be_\bd_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|torrent_unknown_version |210 |the torrent file has an unknown |\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\bm_\be_\bt_\ba_\b _\bv_\be_\br_\bs_\bi_\bo_\bn_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|torrent_missing_file_tree |211 |the v2 torrent file has no file |\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\bt_\br_\be_\be_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|torrent_missing_meta_version |212 |the torrent contains v2 keys but |\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\bd_\bo_\be_\bs_\b _\bn_\bo_\bt_\b _\bs_\bp_\be_\bc_\bi_\bf_\by_\b _\bm_\be_\bt_\ba_\b _\bv_\be_\br_\bs_\bi_\bo_\bn_\b _\b2_\b _\b _\b |\n-|torrent_inconsistent_files |213 |the v1 and v2 file metadata does |\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\bn_\bo_\bt_\b _\bm_\ba_\bt_\bc_\bh_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|torrent_missing_piece_layer |214 |one or more files are missing |\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\bp_\bi_\be_\bc_\be_\b _\bl_\ba_\by_\be_\br_\b _\bh_\ba_\bs_\bh_\be_\bs_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|torrent_invalid_piece_layer |215 |a piece layer has the wrong size |\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\bo_\br_\b _\bf_\ba_\bi_\bl_\be_\bd_\b _\bh_\ba_\bs_\bh_\b _\bc_\bh_\be_\bc_\bk_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|_\bt_\bo_\br_\br_\be_\bn_\bt_\b__\bm_\bi_\bs_\bs_\bi_\bn_\bg_\b__\bp_\bi_\be_\bc_\be_\bs_\b__\br_\bo_\bo_\bt_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b2_\b1_\b6_\b _\b _\b|_\ba_\b _\bv_\b2_\b _\bf_\bi_\bl_\be_\b _\be_\bn_\bt_\br_\by_\b _\bh_\ba_\bs_\b _\bn_\bo_\b _\br_\bo_\bo_\bt_\b _\bh_\ba_\bs_\bh_\b _\b |\n-|torrent_inconsistent_hashes |217 |the v1 and v2 hashes do not |\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\bd_\be_\bs_\bc_\br_\bi_\bb_\be_\b _\bt_\bh_\be_\b _\bs_\ba_\bm_\be_\b _\bd_\ba_\bt_\ba_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|torrent_invalid_pad_file |218 |a file in the v2 metadata has the |\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\bp_\ba_\bd_\b _\ba_\bt_\bt_\br_\bi_\bb_\bu_\bt_\be_\b _\bs_\be_\bt_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|_\be_\br_\br_\bo_\br_\b__\bc_\bo_\bd_\be_\b__\bm_\ba_\bx_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b2_\b1_\b9_\b _\b _\b|_\bt_\bh_\be_\b _\bn_\bu_\bm_\bb_\be_\br_\b _\bo_\bf_\b _\be_\br_\br_\bo_\br_\b _\bc_\bo_\bd_\be_\bs_\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b**\b* e\ben\bnu\bum\bm h\bht\btt\btp\bp_\b_e\ber\brr\bro\bor\brs\bs *\b**\b**\b**\b**\b**\b*\n-Declared in \"_\bl_\bi_\bb_\bt_\bo_\br_\br_\be_\bn_\bt_\b/_\be_\br_\br_\bo_\br_\b__\bc_\bo_\bd_\be_\b._\bh_\bp_\bp\"\n- _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b \n-|_\bn\bn_\ba\ba_\bm\bm_\be\be_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\bv\bv_\ba\ba_\bl\bl_\bu\bu_\be\be_\b|_\bd\bd_\be\be_\bs\bs_\bc\bc_\br\br_\bi\bi_\bp\bp_\bt\bt_\bi\bi_\bo\bo_\bn\bn|\n-|_\bc_\bo_\bn_\bt_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b1_\b0_\b0_\b _\b _\b|_\b\u00a0_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|_\bo_\bk_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b2_\b0_\b0_\b _\b _\b|_\b\u00a0_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|_\bc_\br_\be_\ba_\bt_\be_\bd_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b2_\b0_\b1_\b _\b _\b|_\b\u00a0_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|_\ba_\bc_\bc_\be_\bp_\bt_\be_\bd_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b2_\b0_\b2_\b _\b _\b|_\b\u00a0_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|_\bn_\bo_\b__\bc_\bo_\bn_\bt_\be_\bn_\bt_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b2_\b0_\b4_\b _\b _\b|_\b\u00a0_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|_\bm_\bu_\bl_\bt_\bi_\bp_\bl_\be_\b__\bc_\bh_\bo_\bi_\bc_\be_\bs_\b _\b _\b _\b _\b _\b|_\b3_\b0_\b0_\b _\b _\b|_\b\u00a0_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|_\bm_\bo_\bv_\be_\bd_\b__\bp_\be_\br_\bm_\ba_\bn_\be_\bn_\bt_\bl_\by_\b _\b _\b _\b _\b|_\b3_\b0_\b1_\b _\b _\b|_\b\u00a0_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|_\bm_\bo_\bv_\be_\bd_\b__\bt_\be_\bm_\bp_\bo_\br_\ba_\br_\bi_\bl_\by_\b _\b _\b _\b _\b|_\b3_\b0_\b2_\b _\b _\b|_\b\u00a0_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|_\bn_\bo_\bt_\b__\bm_\bo_\bd_\bi_\bf_\bi_\be_\bd_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b3_\b0_\b4_\b _\b _\b|_\b\u00a0_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|_\bb_\ba_\bd_\b__\br_\be_\bq_\bu_\be_\bs_\bt_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b4_\b0_\b0_\b _\b _\b|_\b\u00a0_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|_\bu_\bn_\ba_\bu_\bt_\bh_\bo_\br_\bi_\bz_\be_\bd_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b4_\b0_\b1_\b _\b _\b|_\b\u00a0_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|_\bf_\bo_\br_\bb_\bi_\bd_\bd_\be_\bn_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b4_\b0_\b3_\b _\b _\b|_\b\u00a0_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|_\bn_\bo_\bt_\b__\bf_\bo_\bu_\bn_\bd_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b4_\b0_\b4_\b _\b _\b|_\b\u00a0_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|_\bi_\bn_\bt_\be_\br_\bn_\ba_\bl_\b__\bs_\be_\br_\bv_\be_\br_\b__\be_\br_\br_\bo_\br_\b|_\b5_\b0_\b0_\b _\b _\b|_\b\u00a0_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|_\bn_\bo_\bt_\b__\bi_\bm_\bp_\bl_\be_\bm_\be_\bn_\bt_\be_\bd_\b _\b _\b _\b _\b _\b _\b|_\b5_\b0_\b1_\b _\b _\b|_\b\u00a0_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|_\bb_\ba_\bd_\b__\bg_\ba_\bt_\be_\bw_\ba_\by_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b5_\b0_\b2_\b _\b _\b|_\b\u00a0_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|_\bs_\be_\br_\bv_\bi_\bc_\be_\b__\bu_\bn_\ba_\bv_\ba_\bi_\bl_\ba_\bb_\bl_\be_\b _\b _\b|_\b5_\b0_\b3_\b _\b _\b|_\b\u00a0_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b**\b* e\ben\bnu\bum\bm p\bpc\bcp\bp_\b_e\ber\brr\bro\bor\brs\bs *\b**\b**\b**\b**\b**\b*\n-Declared in \"_\bl_\bi_\bb_\bt_\bo_\br_\br_\be_\bn_\bt_\b/_\bn_\ba_\bt_\bp_\bm_\bp_\b._\bh_\bp_\bp\"\n- _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b \n-|_\bn\bn_\ba\ba_\bm\bm_\be\be_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\bv\bv_\ba\ba_\bl\bl_\bu\bu_\be\be_\b|_\bd\bd_\be\be_\bs\bs_\bc\bc_\br\br_\bi\bi_\bp\bp_\bt\bt_\bi\bi_\bo\bo_\bn\bn|\n-|_\bp_\bc_\bp_\b__\bs_\bu_\bc_\bc_\be_\bs_\bs_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b0_\b _\b _\b _\b _\b|_\b\u00a0_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|_\bp_\bc_\bp_\b__\bu_\bn_\bs_\bu_\bp_\bp_\b__\bv_\be_\br_\bs_\bi_\bo_\bn_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b1_\b _\b _\b _\b _\b|_\b\u00a0_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|_\bp_\bc_\bp_\b__\bn_\bo_\bt_\b__\ba_\bu_\bt_\bh_\bo_\br_\bi_\bz_\be_\bd_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b2_\b _\b _\b _\b _\b|_\b\u00a0_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|_\bp_\bc_\bp_\b__\bm_\ba_\bl_\bf_\bo_\br_\bm_\be_\bd_\b__\br_\be_\bq_\bu_\be_\bs_\bt_\b _\b _\b _\b _\b _\b _\b|_\b3_\b _\b _\b _\b _\b|_\b\u00a0_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|_\bp_\bc_\bp_\b__\bu_\bn_\bs_\bu_\bp_\bp_\b__\bo_\bp_\bc_\bo_\bd_\be_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b4_\b _\b _\b _\b _\b|_\b\u00a0_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|_\bp_\bc_\bp_\b__\bu_\bn_\bs_\bu_\bp_\bp_\b__\bo_\bp_\bt_\bi_\bo_\bn_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b5_\b _\b _\b _\b _\b|_\b\u00a0_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|_\bp_\bc_\bp_\b__\bm_\ba_\bl_\bf_\bo_\br_\bm_\be_\bd_\b__\bo_\bp_\bt_\bi_\bo_\bn_\b _\b _\b _\b _\b _\b _\b _\b|_\b6_\b _\b _\b _\b _\b|_\b\u00a0_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|_\bp_\bc_\bp_\b__\bn_\be_\bt_\bw_\bo_\br_\bk_\b__\bf_\ba_\bi_\bl_\bu_\br_\be_\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b7_\b _\b _\b _\b _\b|_\b\u00a0_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|_\bp_\bc_\bp_\b__\bn_\bo_\b__\br_\be_\bs_\bo_\bu_\br_\bc_\be_\bs_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b8_\b _\b _\b _\b _\b|_\b\u00a0_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|_\bp_\bc_\bp_\b__\bu_\bn_\bs_\bu_\bp_\bp_\b__\bp_\br_\bo_\bt_\bo_\bc_\bo_\bl_\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b9_\b _\b _\b _\b _\b|_\b\u00a0_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|_\bp_\bc_\bp_\b__\bu_\bs_\be_\br_\b__\be_\bx_\b__\bq_\bu_\bo_\bt_\ba_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b1_\b0_\b _\b _\b _\b|_\b\u00a0_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|_\bp_\bc_\bp_\b__\bc_\ba_\bn_\bn_\bo_\bt_\b__\bp_\br_\bo_\bv_\bi_\bd_\be_\b__\be_\bx_\bt_\be_\br_\bn_\ba_\bl_\b|_\b1_\b1_\b _\b _\b _\b|_\b\u00a0_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|_\bp_\bc_\bp_\b__\ba_\bd_\bd_\br_\be_\bs_\bs_\b__\bm_\bi_\bs_\bm_\ba_\bt_\bc_\bh_\b _\b _\b _\b _\b _\b _\b _\b|_\b1_\b2_\b _\b _\b _\b|_\b\u00a0_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|_\bp_\bc_\bp_\b__\be_\bx_\bc_\be_\bs_\bs_\bi_\bv_\be_\b__\br_\be_\bm_\bo_\bt_\be_\b__\bp_\be_\be_\br_\bs_\b _\b|_\b1_\b3_\b _\b _\b _\b|_\b\u00a0_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b**\b* e\ben\bnu\bum\bm s\bso\boc\bck\bks\bs_\b_e\ber\brr\bro\bor\br_\b_c\bco\bod\bde\be *\b**\b**\b**\b**\b**\b*\n-Declared in \"_\bl_\bi_\bb_\bt_\bo_\br_\br_\be_\bn_\bt_\b/_\bs_\bo_\bc_\bk_\bs_\b5_\b__\bs_\bt_\br_\be_\ba_\bm_\b._\bh_\bp_\bp\"\n- _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b \n-|_\bn\bn_\ba\ba_\bm\bm_\be\be_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\bv\bv_\ba\ba_\bl\bl_\bu\bu_\be\be_\b|_\bd\bd_\be\be_\bs\bs_\bc\bc_\br\br_\bi\bi_\bp\bp_\bt\bt_\bi\bi_\bo\bo_\bn\bn|\n-|_\bn_\bo_\b__\be_\br_\br_\bo_\br_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b0_\b _\b _\b _\b _\b|_\b\u00a0_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|_\bu_\bn_\bs_\bu_\bp_\bp_\bo_\br_\bt_\be_\bd_\b__\bv_\be_\br_\bs_\bi_\bo_\bn_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b1_\b _\b _\b _\b _\b|_\b\u00a0_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|_\bu_\bn_\bs_\bu_\bp_\bp_\bo_\br_\bt_\be_\bd_\b__\ba_\bu_\bt_\bh_\be_\bn_\bt_\bi_\bc_\ba_\bt_\bi_\bo_\bn_\b__\bm_\be_\bt_\bh_\bo_\bd_\b _\b|_\b2_\b _\b _\b _\b _\b|_\b\u00a0_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|_\bu_\bn_\bs_\bu_\bp_\bp_\bo_\br_\bt_\be_\bd_\b__\ba_\bu_\bt_\bh_\be_\bn_\bt_\bi_\bc_\ba_\bt_\bi_\bo_\bn_\b__\bv_\be_\br_\bs_\bi_\bo_\bn_\b|_\b3_\b _\b _\b _\b _\b|_\b\u00a0_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|_\ba_\bu_\bt_\bh_\be_\bn_\bt_\bi_\bc_\ba_\bt_\bi_\bo_\bn_\b__\be_\br_\br_\bo_\br_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b4_\b _\b _\b _\b _\b|_\b\u00a0_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|_\bu_\bs_\be_\br_\bn_\ba_\bm_\be_\b__\br_\be_\bq_\bu_\bi_\br_\be_\bd_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b5_\b _\b _\b _\b _\b|_\b\u00a0_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|_\bg_\be_\bn_\be_\br_\ba_\bl_\b__\bf_\ba_\bi_\bl_\bu_\br_\be_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b6_\b _\b _\b _\b _\b|_\b\u00a0_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|_\bc_\bo_\bm_\bm_\ba_\bn_\bd_\b__\bn_\bo_\bt_\b__\bs_\bu_\bp_\bp_\bo_\br_\bt_\be_\bd_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b7_\b _\b _\b _\b _\b|_\b\u00a0_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|_\bn_\bo_\b__\bi_\bd_\be_\bn_\bt_\bd_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b8_\b _\b _\b _\b _\b|_\b\u00a0_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|_\bi_\bd_\be_\bn_\bt_\bd_\b__\be_\br_\br_\bo_\br_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b9_\b _\b _\b _\b _\b|_\b\u00a0_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|_\bn_\bu_\bm_\b__\be_\br_\br_\bo_\br_\bs_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b1_\b0_\b _\b _\b _\b|_\b\u00a0_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b**\b* e\ben\bnu\bum\bm e\ber\brr\bro\bor\br_\b_c\bco\bod\bde\be_\b_e\ben\bnu\bum\bm *\b**\b**\b**\b**\b**\b*\n-Declared in \"_\bl_\bi_\bb_\bt_\bo_\br_\br_\be_\bn_\bt_\b/_\bg_\bz_\bi_\bp_\b._\bh_\bp_\bp\"\n- _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b \n-|_\bn\bn_\ba\ba_\bm\bm_\be\be_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\bv\bv_\ba\ba_\bl\bl_\bu\bu_\be\be_\b|_\bd\bd_\be\be_\bs\bs_\bc\bc_\br\br_\bi\bi_\bp\bp_\bt\bt_\bi\bi_\bo\bo_\bn\bn_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|_\bn_\bo_\b__\be_\br_\br_\bo_\br_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b0_\b _\b _\b _\b _\b|_\bN_\bo_\bt_\b _\ba_\bn_\b _\be_\br_\br_\bo_\br_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|invalid_gzip_header |1 |the supplied gzip buffer has |\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\bi_\bn_\bv_\ba_\bl_\bi_\bd_\b _\bh_\be_\ba_\bd_\be_\br_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-| | |the gzip buffer would inflate to |\n-|inflated_data_too_large |2 |more bytes than the specified |\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\bm_\ba_\bx_\bi_\bm_\bu_\bm_\b _\bs_\bi_\bz_\be_\b,_\b _\ba_\bn_\bd_\b _\bw_\ba_\bs_\b _\br_\be_\bj_\be_\bc_\bt_\be_\bd_\b._\b _\b _\b _\b |\n-|data_did_not_terminate |3 |available inflate data did not |\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\bt_\be_\br_\bm_\bi_\bn_\ba_\bt_\be_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|space_exhausted |4 |output space exhausted before |\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\bc_\bo_\bm_\bp_\bl_\be_\bt_\bi_\bn_\bg_\b _\bi_\bn_\bf_\bl_\ba_\bt_\be_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|_\bi_\bn_\bv_\ba_\bl_\bi_\bd_\b__\bb_\bl_\bo_\bc_\bk_\b__\bt_\by_\bp_\be_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b5_\b _\b _\b _\b _\b|_\bi_\bn_\bv_\ba_\bl_\bi_\bd_\b _\bb_\bl_\bo_\bc_\bk_\b _\bt_\by_\bp_\be_\b _\b(_\bt_\by_\bp_\be_\b _\b=_\b=_\b _\b3_\b)_\b _\b _\b _\b _\b |\n-|invalid_stored_block_length |6 |stored block length did not match |\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\bo_\bn_\be_\b'_\bs_\b _\bc_\bo_\bm_\bp_\bl_\be_\bm_\be_\bn_\bt_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|too_many_length_or_distance_codes |7 |dynamic block code description: too|\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\bm_\ba_\bn_\by_\b _\bl_\be_\bn_\bg_\bt_\bh_\b _\bo_\br_\b _\bd_\bi_\bs_\bt_\ba_\bn_\bc_\be_\b _\bc_\bo_\bd_\be_\bs_\b _\b _\b _\b _\b _\b |\n-|code_lengths_codes_incomplete |8 |dynamic block code description: |\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\bc_\bo_\bd_\be_\b _\bl_\be_\bn_\bg_\bt_\bh_\bs_\b _\bc_\bo_\bd_\be_\bs_\b _\bi_\bn_\bc_\bo_\bm_\bp_\bl_\be_\bt_\be_\b _\b _\b _\b _\b _\b |\n-|repeat_lengths_with_no_first_length|9 |dynamic block code description: |\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\br_\be_\bp_\be_\ba_\bt_\b _\bl_\be_\bn_\bg_\bt_\bh_\bs_\b _\bw_\bi_\bt_\bh_\b _\bn_\bo_\b _\bf_\bi_\br_\bs_\bt_\b _\bl_\be_\bn_\bg_\bt_\bh|\n-|repeat_more_than_specified_lengths |10 |dynamic block code description: |\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\br_\be_\bp_\be_\ba_\bt_\b _\bm_\bo_\br_\be_\b _\bt_\bh_\ba_\bn_\b _\bs_\bp_\be_\bc_\bi_\bf_\bi_\be_\bd_\b _\bl_\be_\bn_\bg_\bt_\bh_\bs_\b |\n-|invalid_literal_length_code_lengths|11 |dynamic block code description: |\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\bi_\bn_\bv_\ba_\bl_\bi_\bd_\b _\bl_\bi_\bt_\be_\br_\ba_\bl_\b/_\bl_\be_\bn_\bg_\bt_\bh_\b _\bc_\bo_\bd_\be_\b _\bl_\be_\bn_\bg_\bt_\bh_\bs|\n-|invalid_distance_code_lengths |12 |dynamic block code description: |\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\bi_\bn_\bv_\ba_\bl_\bi_\bd_\b _\bd_\bi_\bs_\bt_\ba_\bn_\bc_\be_\b _\bc_\bo_\bd_\be_\b _\bl_\be_\bn_\bg_\bt_\bh_\bs_\b _\b _\b _\b _\b _\b |\n-|invalid_literal_code_in_block |13 |invalid literal/length or distance |\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\bc_\bo_\bd_\be_\b _\bi_\bn_\b _\bf_\bi_\bx_\be_\bd_\b _\bo_\br_\b _\bd_\by_\bn_\ba_\bm_\bi_\bc_\b _\bb_\bl_\bo_\bc_\bk_\b _\b _\b _\b _\b |\n-|distance_too_far_back_in_block |14 |distance is too far back in fixed |\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\bo_\br_\b _\bd_\by_\bn_\ba_\bm_\bi_\bc_\b _\bb_\bl_\bo_\bc_\bk_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|unknown_gzip_error |15 |an unknown error occurred during |\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\bg_\bz_\bi_\bp_\b _\bi_\bn_\bf_\bl_\ba_\bt_\bi_\bo_\bn_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|_\be_\br_\br_\bo_\br_\b__\bc_\bo_\bd_\be_\b__\bm_\ba_\bx_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b1_\b6_\b _\b _\b _\b|_\bt_\bh_\be_\b _\bn_\bu_\bm_\bb_\be_\br_\b _\bo_\bf_\b _\be_\br_\br_\bo_\br_\b _\bc_\bo_\bd_\be_\bs_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b**\b* e\ben\bnu\bum\bm e\ber\brr\bro\bor\br_\b_c\bco\bod\bde\be_\b_e\ben\bnu\bum\bm *\b**\b**\b**\b**\b**\b*\n-Declared in \"_\bl_\bi_\bb_\bt_\bo_\br_\br_\be_\bn_\bt_\b/_\bu_\bp_\bn_\bp_\b._\bh_\bp_\bp\"\n- _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b \n-|_\bn\bn_\ba\ba_\bm\bm_\be\be_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\bv\bv_\ba\ba_\bl\bl_\bu\bu_\be\be_\b|_\bd\bd_\be\be_\bs\bs_\bc\bc_\br\br_\bi\bi_\bp\bp_\bt\bt_\bi\bi_\bo\bo_\bn\bn_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|_\bn_\bo_\b__\be_\br_\br_\bo_\br_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b0_\b _\b _\b _\b _\b|_\bN_\bo_\b _\be_\br_\br_\bo_\br_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|invalid_argument |402 |One of the arguments in the request |\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\bi_\bs_\b _\bi_\bn_\bv_\ba_\bl_\bi_\bd_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|_\ba_\bc_\bt_\bi_\bo_\bn_\b__\bf_\ba_\bi_\bl_\be_\bd_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b5_\b0_\b1_\b _\b _\b|_\bT_\bh_\be_\b _\br_\be_\bq_\bu_\be_\bs_\bt_\b _\bf_\ba_\bi_\bl_\be_\bd_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|value_not_in_array |714 |The specified value does not exist |\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\bi_\bn_\b _\bt_\bh_\be_\b _\ba_\br_\br_\ba_\by_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-| | |The source IP address cannot be |\n-|source_ip_cannot_be_wildcarded |715 |wild-carded, but must be fully |\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\bs_\bp_\be_\bc_\bi_\bf_\bi_\be_\bd_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|external_port_cannot_be_wildcarded|716 |The external port cannot be a |\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\bw_\bi_\bl_\bd_\bc_\ba_\br_\bd_\b,_\b _\bb_\bu_\bt_\b _\bm_\bu_\bs_\bt_\b _\bb_\be_\b _\bs_\bp_\be_\bc_\bi_\bf_\bi_\be_\bd_\b _\b _\b _\b _\b |\n-| | |The port mapping _\be_\bn_\bt_\br_\by specified |\n-|port_mapping_conflict |718 |conflicts with a mapping assigned |\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\bp_\br_\be_\bv_\bi_\bo_\bu_\bs_\bl_\by_\b _\bt_\bo_\b _\ba_\bn_\bo_\bt_\bh_\be_\br_\b _\bc_\bl_\bi_\be_\bn_\bt_\b _\b _\b _\b _\b _\b _\b _\b |\n-|internal_port_must_match_external |724 |Internal and external port value |\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\bm_\bu_\bs_\bt_\b _\bb_\be_\b _\bt_\bh_\be_\b _\bs_\ba_\bm_\be_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-| | |The NAT implementation only supports|\n-|only_permanent_leases_supported |725 |permanent lease times on port |\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\bm_\ba_\bp_\bp_\bi_\bn_\bg_\bs_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-| | |RemoteHost must be a wildcard and |\n-|remote_host_must_be_wildcard |726 |cannot be a specific IP address or |\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\bD_\bN_\bS_\b _\bn_\ba_\bm_\be_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|external_port_must_be_wildcard |727 |ExternalPort must be a wildcard and |\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\bc_\ba_\bn_\bn_\bo_\bt_\b _\bb_\be_\b _\ba_\b _\bs_\bp_\be_\bc_\bi_\bf_\bi_\bc_\b _\bp_\bo_\br_\bt_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b**\b* e\ben\bnu\bum\bm e\ber\brr\bro\bor\br_\b_c\bco\bod\bde\be_\b_e\ben\bnu\bum\bm *\b**\b**\b**\b**\b**\b*\n-Declared in \"_\bl_\bi_\bb_\bt_\bo_\br_\br_\be_\bn_\bt_\b/_\bb_\bd_\be_\bc_\bo_\bd_\be_\b._\bh_\bp_\bp\"\n- _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b \n-|_\bn\bn_\ba\ba_\bm\bm_\be\be_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\bv\bv_\ba\ba_\bl\bl_\bu\bu_\be\be_\b|_\bd\bd_\be\be_\bs\bs_\bc\bc_\br\br_\bi\bi_\bp\bp_\bt\bt_\bi\bi_\bo\bo_\bn\bn_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|_\bn_\bo_\b__\be_\br_\br_\bo_\br_\b _\b _\b _\b _\b _\b _\b|_\b0_\b _\b _\b _\b _\b|_\bN_\bo_\bt_\b _\ba_\bn_\b _\be_\br_\br_\bo_\br_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|_\be_\bx_\bp_\be_\bc_\bt_\be_\bd_\b__\bd_\bi_\bg_\bi_\bt_\b|_\b1_\b _\b _\b _\b _\b|_\be_\bx_\bp_\be_\bc_\bt_\be_\bd_\b _\bd_\bi_\bg_\bi_\bt_\b _\bi_\bn_\b _\bb_\be_\bn_\bc_\bo_\bd_\be_\bd_\b _\bs_\bt_\br_\bi_\bn_\bg_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|_\be_\bx_\bp_\be_\bc_\bt_\be_\bd_\b__\bc_\bo_\bl_\bo_\bn_\b|_\b2_\b _\b _\b _\b _\b|_\be_\bx_\bp_\be_\bc_\bt_\be_\bd_\b _\bc_\bo_\bl_\bo_\bn_\b _\bi_\bn_\b _\bb_\be_\bn_\bc_\bo_\bd_\be_\bd_\b _\bs_\bt_\br_\bi_\bn_\bg_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|_\bu_\bn_\be_\bx_\bp_\be_\bc_\bt_\be_\bd_\b__\be_\bo_\bf_\b|_\b3_\b _\b _\b _\b _\b|_\bu_\bn_\be_\bx_\bp_\be_\bc_\bt_\be_\bd_\b _\be_\bn_\bd_\b _\bo_\bf_\b _\bf_\bi_\bl_\be_\b _\bi_\bn_\b _\bb_\be_\bn_\bc_\bo_\bd_\be_\bd_\b _\bs_\bt_\br_\bi_\bn_\bg_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|expected_value|4 |expected value (list, dict, _\bi_\bn_\bt or string) in bencoded|\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\bs_\bt_\br_\bi_\bn_\bg_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|_\bd_\be_\bp_\bt_\bh_\b__\be_\bx_\bc_\be_\be_\bd_\be_\bd_\b|_\b5_\b _\b _\b _\b _\b|_\bb_\be_\bn_\bc_\bo_\bd_\be_\bd_\b _\br_\be_\bc_\bu_\br_\bs_\bi_\bo_\bn_\b _\bd_\be_\bp_\bt_\bh_\b _\bl_\bi_\bm_\bi_\bt_\b _\be_\bx_\bc_\be_\be_\bd_\be_\bd_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|_\bl_\bi_\bm_\bi_\bt_\b__\be_\bx_\bc_\be_\be_\bd_\be_\bd_\b|_\b6_\b _\b _\b _\b _\b|_\bb_\be_\bn_\bc_\bo_\bd_\be_\bd_\b _\bi_\bt_\be_\bm_\b _\bc_\bo_\bu_\bn_\bt_\b _\bl_\bi_\bm_\bi_\bt_\b _\be_\bx_\bc_\be_\be_\bd_\be_\bd_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|_\bo_\bv_\be_\br_\bf_\bl_\bo_\bw_\b _\b _\b _\b _\b _\b _\b|_\b7_\b _\b _\b _\b _\b|_\bi_\bn_\bt_\be_\bg_\be_\br_\b _\bo_\bv_\be_\br_\bf_\bl_\bo_\bw_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|_\be_\br_\br_\bo_\br_\b__\bc_\bo_\bd_\be_\b__\bm_\ba_\bx_\b|_\b8_\b _\b _\b _\b _\b|_\bt_\bh_\be_\b _\bn_\bu_\bm_\bb_\be_\br_\b _\bo_\bf_\b _\be_\br_\br_\bo_\br_\b _\bc_\bo_\bd_\be_\bs_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b**\b* e\ben\bnu\bum\bm i\bi2\b2p\bp_\b_e\ber\brr\bro\bor\br_\b_c\bco\bod\bde\be *\b**\b**\b**\b**\b**\b*\n-Declared in \"_\bl_\bi_\bb_\bt_\bo_\br_\br_\be_\bn_\bt_\b/_\bi_\b2_\bp_\b__\bs_\bt_\br_\be_\ba_\bm_\b._\bh_\bp_\bp\"\n- _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b \n-|_\bn\bn_\ba\ba_\bm\bm_\be\be_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\bv\bv_\ba\ba_\bl\bl_\bu\bu_\be\be_\b|_\bd\bd_\be\be_\bs\bs_\bc\bc_\br\br_\bi\bi_\bp\bp_\bt\bt_\bi\bi_\bo\bo_\bn\bn|\n-|_\bn_\bo_\b__\be_\br_\br_\bo_\br_\b _\b _\b _\b _\b _\b _\b _\b|_\b0_\b _\b _\b _\b _\b|_\b\u00a0_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|_\bp_\ba_\br_\bs_\be_\b__\bf_\ba_\bi_\bl_\be_\bd_\b _\b _\b _\b|_\b1_\b _\b _\b _\b _\b|_\b\u00a0_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|_\bc_\ba_\bn_\bt_\b__\br_\be_\ba_\bc_\bh_\b__\bp_\be_\be_\br_\b|_\b2_\b _\b _\b _\b _\b|_\b\u00a0_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|_\bi_\b2_\bp_\b__\be_\br_\br_\bo_\br_\b _\b _\b _\b _\b _\b _\b|_\b3_\b _\b _\b _\b _\b|_\b\u00a0_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|_\bi_\bn_\bv_\ba_\bl_\bi_\bd_\b__\bk_\be_\by_\b _\b _\b _\b _\b|_\b4_\b _\b _\b _\b _\b|_\b\u00a0_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|_\bi_\bn_\bv_\ba_\bl_\bi_\bd_\b__\bi_\bd_\b _\b _\b _\b _\b _\b|_\b5_\b _\b _\b _\b _\b|_\b\u00a0_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|_\bt_\bi_\bm_\be_\bo_\bu_\bt_\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b6_\b _\b _\b _\b _\b|_\b\u00a0_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|_\bk_\be_\by_\b__\bn_\bo_\bt_\b__\bf_\bo_\bu_\bn_\bd_\b _\b _\b|_\b7_\b _\b _\b _\b _\b|_\b\u00a0_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|_\bd_\bu_\bp_\bl_\bi_\bc_\ba_\bt_\be_\bd_\b__\bi_\bd_\b _\b _\b|_\b8_\b _\b _\b _\b _\b|_\b\u00a0_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|_\bn_\bu_\bm_\b__\be_\br_\br_\bo_\br_\bs_\b _\b _\b _\b _\b _\b|_\b9_\b _\b _\b _\b _\b|_\b\u00a0_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b**\b* h\bha\bas\bsh\bhe\ber\br *\b**\b**\b**\b**\b**\b*\n-Declared in \"_\bl_\bi_\bb_\bt_\bo_\br_\br_\be_\bn_\bt_\b/_\bh_\ba_\bs_\bh_\be_\br_\b._\bh_\bp_\bp\"\n-this is a SHA-1 hash class.\n-You use it by first instantiating it, then call update() to feed it with data.\n-i.e. you don't have to keep the entire buffer of which you want to create the\n-hash in memory. You can feed the _\bh_\ba_\bs_\bh_\be_\br parts of it at a time. When You have\n-fed the _\bh_\ba_\bs_\bh_\be_\br with all the data, you call final() and it will return the sha1-\n-hash of the data.\n-The constructor that takes a char const* and an integer will construct the sha1\n-context and feed it the data passed in.\n-If you want to reuse the _\bh_\ba_\bs_\bh_\be_\br object once you have created a hash, you have\n-to call reset() to reinitialize it.\n-The built-in software version of sha1-algorithm was implemented by Steve Reid\n-and released as public domain. For more info, see src/sha1.cpp.\n-class hasher\n-{\n- h\bha\bas\bsh\bhe\ber\br ();\n- h\bha\bas\bsh\bhe\ber\br (hasher const&);\n- explicit h\bha\bas\bsh\bhe\ber\br (span
data);\n- h\bha\bas\bsh\bhe\ber\br (char const* data, int len);\n- hasher& o\bop\bpe\ber\bra\bat\bto\bor\br=\b= (hasher const&) &;\n- hasher& u\bup\bpd\bda\bat\bte\be (char const* data, int len);\n- hasher& u\bup\bpd\bda\bat\bte\be (span data);\n- sha1_hash f\bfi\bin\bna\bal\bl ();\n- void r\bre\bes\bse\bet\bt ();\n-};\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b* o\bop\bpe\ber\bra\bat\bto\bor\br=\b=(\b()\b) h\bha\bas\bsh\bhe\ber\br(\b()\b) *\b**\b**\b**\b**\b*\n-h\bha\bas\bsh\bhe\ber\br (hasher const&);\n-explicit h\bha\bas\bsh\bhe\ber\br (span data);\n-h\bha\bas\bsh\bhe\ber\br (char const* data, int len);\n-hasher& o\bop\bpe\ber\bra\bat\bto\bor\br=\b= (hasher const&) &;\n-this is the same as default constructing followed by a call to update(data,\n-len).\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b* u\bup\bpd\bda\bat\bte\be(\b()\b) *\b**\b**\b**\b**\b*\n-hasher& u\bup\bpd\bda\bat\bte\be (char const* data, int len);\n-hasher& u\bup\bpd\bda\bat\bte\be (span data);\n-append the following bytes to what is being hashed\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b* f\bfi\bin\bna\bal\bl(\b()\b) *\b**\b**\b**\b**\b*\n-sha1_hash f\bfi\bin\bna\bal\bl ();\n-returns the SHA-1 digest of the buffers previously passed to _\bu_\bp_\bd_\ba_\bt_\be_\b(_\b) and the\n-_\bh_\ba_\bs_\bh_\be_\br constructor.\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b* r\bre\bes\bse\bet\bt(\b()\b) *\b**\b**\b**\b**\b*\n-void r\bre\bes\bse\bet\bt ();\n-restore the _\bh_\ba_\bs_\bh_\be_\br state to be as if the _\bh_\ba_\bs_\bh_\be_\br has just been default\n-constructed.\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b**\b* h\bha\bas\bsh\bhe\ber\br2\b25\b56\b6 *\b**\b**\b**\b**\b**\b*\n-Declared in \"_\bl_\bi_\bb_\bt_\bo_\br_\br_\be_\bn_\bt_\b/_\bh_\ba_\bs_\bh_\be_\br_\b._\bh_\bp_\bp\"\n-class hasher256\n-{\n- h\bha\bas\bsh\bhe\ber\br2\b25\b56\b6 ();\n- h\bha\bas\bsh\bhe\ber\br2\b25\b56\b6 (char const* data, int len);\n- explicit h\bha\bas\bsh\bhe\ber\br2\b25\b56\b6 (span data);\n- h\bha\bas\bsh\bhe\ber\br2\b25\b56\b6 (hasher256 const&);\n- hasher256& o\bop\bpe\ber\bra\bat\bto\bor\br=\b= (hasher256 const&) &;\n- hasher256& u\bup\bpd\bda\bat\bte\be (char const* data, int len);\n- hasher256& u\bup\bpd\bda\bat\bte\be (span data);\n- sha256_hash f\bfi\bin\bna\bal\bl ();\n- void r\bre\bes\bse\bet\bt ();\n- ~\b~h\bha\bas\bsh\bhe\ber\br2\b25\b56\b6 ();\n-};\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b* o\bop\bpe\ber\bra\bat\bto\bor\br=\b=(\b()\b) h\bha\bas\bsh\bhe\ber\br2\b25\b56\b6(\b()\b) *\b**\b**\b**\b**\b*\n-h\bha\bas\bsh\bhe\ber\br2\b25\b56\b6 (char const* data, int len);\n-explicit h\bha\bas\bsh\bhe\ber\br2\b25\b56\b6 (span data);\n-h\bha\bas\bsh\bhe\ber\br2\b25\b56\b6 (hasher256 const&);\n-hasher256& o\bop\bpe\ber\bra\bat\bto\bor\br=\b= (hasher256 const&) &;\n-this is the same as default constructing followed by a call to update(data,\n-len).\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b* u\bup\bpd\bda\bat\bte\be(\b()\b) *\b**\b**\b**\b**\b*\n-hasher256& u\bup\bpd\bda\bat\bte\be (char const* data, int len);\n-hasher256& u\bup\bpd\bda\bat\bte\be (span data);\n-append the following bytes to what is being hashed\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b* f\bfi\bin\bna\bal\bl(\b()\b) *\b**\b**\b**\b**\b*\n-sha256_hash f\bfi\bin\bna\bal\bl ();\n-returns the SHA-1 digest of the buffers previously passed to _\bu_\bp_\bd_\ba_\bt_\be_\b(_\b) and the\n-_\bh_\ba_\bs_\bh_\be_\br constructor.\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b* r\bre\bes\bse\bet\bt(\b()\b) *\b**\b**\b**\b**\b*\n-void r\bre\bes\bse\bet\bt ();\n-restore the _\bh_\ba_\bs_\bh_\be_\br state to be as if the _\bh_\ba_\bs_\bh_\be_\br has just been default\n-constructed.\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b**\b* b\bbi\bit\btf\bfi\bie\bel\bld\bd *\b**\b**\b**\b**\b**\b*\n-Declared in \"_\bl_\bi_\bb_\bt_\bo_\br_\br_\be_\bn_\bt_\b/_\bb_\bi_\bt_\bf_\bi_\be_\bl_\bd_\b._\bh_\bp_\bp\"\n-The _\bb_\bi_\bt_\bf_\bi_\be_\bl_\bd type stores any number of bits as a _\bb_\bi_\bt_\bf_\bi_\be_\bl_\bd in a heap allocated\n-array.\n-struct bitfield\n-{\n- b\bbi\bit\btf\bfi\bie\bel\bld\bd (bitfield const& rhs);\n- b\bbi\bit\btf\bfi\bie\bel\bld\bd (bitfield&& rhs) noexcept = default;\n- b\bbi\bit\btf\bfi\bie\bel\bld\bd () noexcept = default;\n- b\bbi\bit\btf\bfi\bie\bel\bld\bd (int bits, bool val);\n- b\bbi\bit\btf\bfi\bie\bel\bld\bd (char const* b, int bits);\n- explicit b\bbi\bit\btf\bfi\bie\bel\bld\bd (int bits);\n- void a\bas\bss\bsi\big\bgn\bn (char const* b, int const bits);\n- bool g\bge\bet\bt_\b_b\bbi\bit\bt (int index) const noexcept;\n- bool o\bop\bpe\ber\bra\bat\bto\bor\br[\b[]\b] (int index) const noexcept;\n- void c\bcl\ble\bea\bar\br_\b_b\bbi\bit\bt (int index) noexcept;\n- void s\bse\bet\bt_\b_b\bbi\bit\bt (int index) noexcept;\n- bool a\bal\bll\bl_\b_s\bse\bet\bt () const noexcept;\n- bool n\bno\bon\bne\be_\b_s\bse\bet\bt () const noexcept;\n- int s\bsi\biz\bze\be () const noexcept;\n- int n\bnu\bum\bm_\b_w\bwo\bor\brd\bds\bs () const noexcept;\n- int n\bnu\bum\bm_\b_b\bby\byt\bte\bes\bs () const noexcept;\n- bool e\bem\bmp\bpt\bty\by () const noexcept;\n- char const* d\bda\bat\bta\ba () const noexcept;\n- char* d\bda\bat\bta\ba () noexcept;\n- void s\bsw\bwa\bap\bp (bitfield& rhs) noexcept;\n- int c\bco\bou\bun\bnt\bt () const noexcept;\n- int f\bfi\bin\bnd\bd_\b_f\bfi\bir\brs\bst\bt_\b_s\bse\bet\bt () const noexcept;\n- int f\bfi\bin\bnd\bd_\b_l\bla\bas\bst\bt_\b_c\bcl\ble\bea\bar\br () const noexcept;\n- bool o\bop\bpe\ber\bra\bat\bto\bor\br=\b==\b= (lt::bitfield const& rhs) const;\n-};\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b* b\bbi\bit\btf\bfi\bie\bel\bld\bd(\b()\b) *\b**\b**\b**\b**\b*\n-b\bbi\bit\btf\bfi\bie\bel\bld\bd (bitfield const& rhs);\n-b\bbi\bit\btf\bfi\bie\bel\bld\bd (bitfield&& rhs) noexcept = default;\n-b\bbi\bit\btf\bfi\bie\bel\bld\bd () noexcept = default;\n-b\bbi\bit\btf\bfi\bie\bel\bld\bd (int bits, bool val);\n-b\bbi\bit\btf\bfi\bie\bel\bld\bd (char const* b, int bits);\n-explicit b\bbi\bit\btf\bfi\bie\bel\bld\bd (int bits);\n-constructs a new _\bb_\bi_\bt_\bf_\bi_\be_\bl_\bd. The default constructor creates an empty _\bb_\bi_\bt_\bf_\bi_\be_\bl_\bd.\n-bits is the size of the _\bb_\bi_\bt_\bf_\bi_\be_\bl_\bd (specified in bits). val is the value to\n-initialize the bits to. If not specified all bits are initialized to 0.\n-The constructor taking a pointer b and bits copies a _\bb_\bi_\bt_\bf_\bi_\be_\bl_\bd from the\n-specified buffer, and bits number of bits (rounded up to the nearest byte\n-boundary).\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b* a\bas\bss\bsi\big\bgn\bn(\b()\b) *\b**\b**\b**\b**\b*\n-void a\bas\bss\bsi\big\bgn\bn (char const* b, int const bits);\n-copy _\bb_\bi_\bt_\bf_\bi_\be_\bl_\bd from buffer b of bits number of bits, rounded up to the nearest\n-byte boundary.\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b* g\bge\bet\bt_\b_b\bbi\bit\bt(\b()\b) o\bop\bpe\ber\bra\bat\bto\bor\br[\b[]\b](\b()\b) *\b**\b**\b**\b**\b*\n-bool g\bge\bet\bt_\b_b\bbi\bit\bt (int index) const noexcept;\n-bool o\bop\bpe\ber\bra\bat\bto\bor\br[\b[]\b] (int index) const noexcept;\n-query bit at index. Returns true if bit is 1, otherwise false.\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b* c\bcl\ble\bea\bar\br_\b_b\bbi\bit\bt(\b()\b) s\bse\bet\bt_\b_b\bbi\bit\bt(\b()\b) *\b**\b**\b**\b**\b*\n-void c\bcl\ble\bea\bar\br_\b_b\bbi\bit\bt (int index) noexcept;\n-void s\bse\bet\bt_\b_b\bbi\bit\bt (int index) noexcept;\n-set bit at index to 0 (clear_bit) or 1 (set_bit).\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b* a\bal\bll\bl_\b_s\bse\bet\bt(\b()\b) *\b**\b**\b**\b**\b*\n-bool a\bal\bll\bl_\b_s\bse\bet\bt () const noexcept;\n-returns true if all bits in the _\bb_\bi_\bt_\bf_\bi_\be_\bl_\bd are set\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b* n\bno\bon\bne\be_\b_s\bse\bet\bt(\b()\b) *\b**\b**\b**\b**\b*\n-bool n\bno\bon\bne\be_\b_s\bse\bet\bt () const noexcept;\n-returns true if no bit in the _\bb_\bi_\bt_\bf_\bi_\be_\bl_\bd is set\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b* s\bsi\biz\bze\be(\b()\b) *\b**\b**\b**\b**\b*\n-int s\bsi\biz\bze\be () const noexcept;\n-returns the size of the _\bb_\bi_\bt_\bf_\bi_\be_\bl_\bd in bits.\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b* n\bnu\bum\bm_\b_w\bwo\bor\brd\bds\bs(\b()\b) *\b**\b**\b**\b**\b*\n-int n\bnu\bum\bm_\b_w\bwo\bor\brd\bds\bs () const noexcept;\n-returns the number of 32 bit words are needed to represent all bits in this\n-_\bb_\bi_\bt_\bf_\bi_\be_\bl_\bd.\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b* n\bnu\bum\bm_\b_b\bby\byt\bte\bes\bs(\b()\b) *\b**\b**\b**\b**\b*\n-int n\bnu\bum\bm_\b_b\bby\byt\bte\bes\bs () const noexcept;\n-returns the number of bytes needed to represent all bits in this _\bb_\bi_\bt_\bf_\bi_\be_\bl_\bd\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b* e\bem\bmp\bpt\bty\by(\b()\b) *\b**\b**\b**\b**\b*\n-bool e\bem\bmp\bpt\bty\by () const noexcept;\n-returns true if the _\bb_\bi_\bt_\bf_\bi_\be_\bl_\bd has zero size.\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b* d\bda\bat\bta\ba(\b()\b) *\b**\b**\b**\b**\b*\n-char const* d\bda\bat\bta\ba () const noexcept;\n-char* d\bda\bat\bta\ba () noexcept;\n-returns a pointer to the internal buffer of the _\bb_\bi_\bt_\bf_\bi_\be_\bl_\bd, or nullptr if it's\n-empty.\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b* s\bsw\bwa\bap\bp(\b()\b) *\b**\b**\b**\b**\b*\n-void s\bsw\bwa\bap\bp (bitfield& rhs) noexcept;\n-swaps the bit-fields two variables refer to\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b* c\bco\bou\bun\bnt\bt(\b()\b) *\b**\b**\b**\b**\b*\n-int c\bco\bou\bun\bnt\bt () const noexcept;\n-count the number of bits in the _\bb_\bi_\bt_\bf_\bi_\be_\bl_\bd that are set to 1.\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b* f\bfi\bin\bnd\bd_\b_f\bfi\bir\brs\bst\bt_\b_s\bse\bet\bt(\b()\b) *\b**\b**\b**\b**\b*\n-int f\bfi\bin\bnd\bd_\b_f\bfi\bir\brs\bst\bt_\b_s\bse\bet\bt () const noexcept;\n-returns the index of the first set bit in the _\bb_\bi_\bt_\bf_\bi_\be_\bl_\bd, i.e. 1 bit.\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b* f\bfi\bin\bnd\bd_\b_l\bla\bas\bst\bt_\b_c\bcl\ble\bea\bar\br(\b()\b) *\b**\b**\b**\b**\b*\n-int f\bfi\bin\bnd\bd_\b_l\bla\bas\bst\bt_\b_c\bcl\ble\bea\bar\br () const noexcept;\n-returns the index to the last cleared bit in the _\bb_\bi_\bt_\bf_\bi_\be_\bl_\bd, i.e. 0 bit.\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n *\b**\b**\b**\b**\b**\b* c\bco\bou\bun\bnt\bte\ber\brs\bs *\b**\b**\b**\b**\b**\b*\n Declared in \"_\bl_\bi_\bb_\bt_\bo_\br_\br_\be_\bn_\bt_\b/_\bp_\be_\br_\bf_\bo_\br_\bm_\ba_\bn_\bc_\be_\b__\bc_\bo_\bu_\bn_\bt_\be_\br_\bs_\b._\bh_\bp_\bp\"\n struct counters\n {\n c\bco\bou\bun\bnt\bte\ber\brs\bs () ;\n counters& o\bop\bpe\ber\bra\bat\bto\bor\br=\b= (counters const&) & ;\n c\bco\bou\bun\bnt\bte\ber\brs\bs (counters const&) ;\n std::int64_t i\bin\bnc\bc_\b_s\bst\bta\bat\bts\bs_\b_c\bco\bou\bun\bnt\bte\ber\br (int c, std::int64_t value = 1) ;\n std::int64_t o\bop\bpe\ber\bra\bat\bto\bor\br[\b[]\b] (int i) const ;\n- void s\bse\bet\bt_\b_v\bva\bal\blu\bue\be (int c, std::int64_t value) ;\n void b\bbl\ble\ben\bnd\bd_\b_s\bst\bta\bat\bts\bs_\b_c\bco\bou\bun\bnt\bte\ber\br (int c, std::int64_t value, int ratio) ;\n+ void s\bse\bet\bt_\b_v\bva\bal\blu\bue\be (int c, std::int64_t value) ;\n };\n [_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b* o\bop\bpe\ber\bra\bat\bto\bor\br[\b[]\b](\b()\b) i\bin\bnc\bc_\b_s\bst\bta\bat\bts\bs_\b_c\bco\bou\bun\bnt\bte\ber\br(\b()\b) *\b**\b**\b**\b**\b*\n+*\b**\b**\b**\b**\b* i\bin\bnc\bc_\b_s\bst\bta\bat\bts\bs_\b_c\bco\bou\bun\bnt\bte\ber\br(\b()\b) o\bop\bpe\ber\bra\bat\bto\bor\br[\b[]\b](\b()\b) *\b**\b**\b**\b**\b*\n std::int64_t i\bin\bnc\bc_\b_s\bst\bta\bat\bts\bs_\b_c\bco\bou\bun\bnt\bte\ber\br (int c, std::int64_t value = 1) ;\n std::int64_t o\bop\bpe\ber\bra\bat\bto\bor\br[\b[]\b] (int i) const ;\n returns the new value\n [_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n *\b**\b**\b**\b**\b**\b* s\bst\bta\bat\bts\bs_\b_m\bme\bet\btr\bri\bic\bc *\b**\b**\b**\b**\b**\b*\n Declared in \"_\bl_\bi_\bb_\bt_\bo_\br_\br_\be_\bn_\bt_\b/_\bs_\be_\bs_\bs_\bi_\bo_\bn_\b__\bs_\bt_\ba_\bt_\bs_\b._\bh_\bp_\bp\"\n describes one statistics metric from the _\bs_\be_\bs_\bs_\bi_\bo_\bn. For more information, see the\n@@ -1486,4121 +687,2706 @@\n [_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n *\b**\b**\b**\b**\b**\b* e\ben\bnu\bum\bm m\bme\bet\btr\bri\bic\bc_\b_t\bty\byp\bpe\be_\b_t\bt *\b**\b**\b**\b**\b**\b*\n Declared in \"_\bl_\bi_\bb_\bt_\bo_\br_\br_\be_\bn_\bt_\b/_\bs_\be_\bs_\bs_\bi_\bo_\bn_\b__\bs_\bt_\ba_\bt_\bs_\b._\bh_\bp_\bp\"\n _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b \n |_\bn\bn_\ba\ba_\bm\bm_\be\be_\b _\b _\b _\b|_\bv\bv_\ba\ba_\bl\bl_\bu\bu_\be\be_\b|_\bd\bd_\be\be_\bs\bs_\bc\bc_\br\br_\bi\bi_\bp\bp_\bt\bt_\bi\bi_\bo\bo_\bn\bn|\n |_\bc_\bo_\bu_\bn_\bt_\be_\br_\b|_\b0_\b _\b _\b _\b _\b|_\b\u00a0_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n |_\bg_\ba_\bu_\bg_\be_\b _\b _\b|_\b1_\b _\b _\b _\b _\b|_\b\u00a0_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-This section describes the functions and classes that are used to create\n-torrent files. It is a layered API with low level classes and higher level\n-convenience functions. A torrent is created in 4 steps:\n- 1. first the files that will be part of the torrent are determined.\n- 2. the torrent properties are set, such as tracker url, web seeds, DHT nodes\n- etc.\n- 3. Read through all the files in the torrent, SHA-1 all the data and set the\n- piece hashes.\n- 4. The torrent is bencoded into a file or buffer.\n-If there are a lot of files and or deep directory hierarchies to traverse, step\n-one can be time consuming.\n-Typically step 3 is by far the most time consuming step, since it requires to\n-read all the bytes from all the files in the torrent.\n-All of these classes and functions are declared by including libtorrent/\n-create_torrent.hpp.\n-example:\n-file_storage fs;\n-\n-// recursively adds files in directories\n-add_files(fs, \"./my_torrent\");\n-\n-create_torrent t(fs);\n-t.add_tracker(\"http://my.tracker.com/announce\");\n-t.set_creator(\"libtorrent example\");\n-\n-// reads the files and calculates the hashes\n-set_piece_hashes(t, \".\");\n-\n-ofstream out(\"my_torrent.torrent\", std::ios_base::binary);\n-std::vector buf = t.generate_buf();\n-out.write(buf.data(), buf.size());\n-\n-// alternatively, generate an entry and encode it directly to an ostream\n-// iterator\n-bencode(std::ostream_iterator(out), t.generate());\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b**\b* c\bcr\bre\bea\bat\bte\be_\b_t\bto\bor\brr\bre\ben\bnt\bt *\b**\b**\b**\b**\b**\b*\n-Declared in \"_\bl_\bi_\bb_\bt_\bo_\br_\br_\be_\bn_\bt_\b/_\bc_\br_\be_\ba_\bt_\be_\b__\bt_\bo_\br_\br_\be_\bn_\bt_\b._\bh_\bp_\bp\"\n-This class holds state for creating a torrent. After having added all\n-information to it, call _\bc_\br_\be_\ba_\bt_\be_\b__\bt_\bo_\br_\br_\be_\bn_\bt_\b:_\b:_\bg_\be_\bn_\be_\br_\ba_\bt_\be_\b(_\b) to generate the torrent. The\n-_\be_\bn_\bt_\br_\by that's returned can then be bencoded into a .torrent file using _\bb_\be_\bn_\bc_\bo_\bd_\be\n-_\b(_\b).\n-struct create_torrent\n-{\n- explicit c\bcr\bre\bea\bat\bte\be_\b_t\bto\bor\brr\bre\ben\bnt\bt (torrent_info const& ti);\n- explicit c\bcr\bre\bea\bat\bte\be_\b_t\bto\bor\brr\bre\ben\bnt\bt (file_storage& fs, int piece_size = 0\n- , create_flags_t flags = {});\n- entry g\bge\ben\bne\ber\bra\bat\bte\be () const;\n- std::vector g\bge\ben\bne\ber\bra\bat\bte\be_\b_b\bbu\buf\bf () const;\n- file_storage const& f\bfi\bil\ble\bes\bs () const;\n- void s\bse\bet\bt_\b_c\bco\bom\bmm\bme\ben\bnt\bt (char const* str);\n- void s\bse\bet\bt_\b_c\bcr\bre\bea\bat\bto\bor\br (char const* str);\n- void s\bse\bet\bt_\b_c\bcr\bre\bea\bat\bti\bio\bon\bn_\b_d\bda\bat\bte\be (std::time_t timestamp);\n- void s\bse\bet\bt_\b_h\bha\bas\bsh\bh (piece_index_t index, sha1_hash const& h);\n- void s\bse\bet\bt_\b_h\bha\bas\bsh\bh2\b2 (file_index_t file, piece_index_t::diff_type piece,\n-sha256_hash const& h);\n- void a\bad\bdd\bd_\b_u\bur\brl\bl_\b_s\bse\bee\bed\bd (string_view url);\n- void a\bad\bdd\bd_\b_h\bht\btt\btp\bp_\b_s\bse\bee\bed\bd (string_view url);\n- void a\bad\bdd\bd_\b_n\bno\bod\bde\be (std::pair node);\n- void a\bad\bdd\bd_\b_t\btr\bra\bac\bck\bke\ber\br (string_view url, int tier = 0);\n- void s\bse\bet\bt_\b_r\bro\boo\bot\bt_\b_c\bce\ber\brt\bt (string_view cert);\n- void s\bse\bet\bt_\b_p\bpr\bri\biv\bv (bool p);\n- bool p\bpr\bri\biv\bv () const;\n- bool i\bis\bs_\b_v\bv2\b2_\b_o\bon\bnl\bly\by () const;\n- bool i\bis\bs_\b_v\bv1\b1_\b_o\bon\bnl\bly\by () const;\n- int n\bnu\bum\bm_\b_p\bpi\bie\bec\bce\bes\bs () const;\n- piece_index_t e\ben\bnd\bd_\b_p\bpi\bie\bec\bce\be () const;\n- index_range p\bpi\bie\bec\bce\be_\b_r\bra\ban\bng\bge\be () const noexcept;\n- file_index_t e\ben\bnd\bd_\b_f\bfi\bil\ble\be () const;\n- index_range f\bfi\bil\ble\be_\b_r\bra\ban\bng\bge\be () const noexcept;\n- index_range f\bfi\bil\ble\be_\b_p\bpi\bie\bec\bce\be_\b_r\bra\ban\bng\bge\be (file_index_t f);\n- std::int64_t t\bto\bot\bta\bal\bl_\b_s\bsi\biz\bze\be () const;\n- int p\bpi\bie\bec\bce\be_\b_s\bsi\biz\bze\be (piece_index_t i) const;\n- int p\bpi\bie\bec\bce\be_\b_l\ble\ben\bng\bgt\bth\bh () const;\n- void a\bad\bdd\bd_\b_c\bco\bol\bll\ble\bec\bct\bti\bio\bon\bn (string_view c);\n- void a\bad\bdd\bd_\b_s\bsi\bim\bmi\bil\bla\bar\br_\b_t\bto\bor\brr\bre\ben\bnt\bt (sha1_hash ih);\n-\n- static constexpr create_flags_t m\bmo\bod\bdi\bif\bfi\bic\bca\bat\bti\bio\bon\bn_\b_t\bti\bim\bme\be = 2_bit;\n- static constexpr create_flags_t s\bsy\bym\bml\bli\bin\bnk\bks\bs = 3_bit;\n- static constexpr create_flags_t v\bv2\b2_\b_o\bon\bnl\bly\by = 5_bit;\n- static constexpr create_flags_t v\bv1\b1_\b_o\bon\bnl\bly\by = 6_bit;\n- static constexpr create_flags_t c\bca\ban\bno\bon\bni\bic\bca\bal\bl_\b_f\bfi\bil\ble\bes\bs = 7_bit;\n- static constexpr create_flags_t n\bno\bo_\b_a\bat\btt\btr\bri\bib\bbu\but\bte\bes\bs = 8_bit;\n- static constexpr create_flags_t c\bca\ban\bno\bon\bni\bic\bca\bal\bl_\b_f\bfi\bil\ble\bes\bs_\b_n\bno\bo_\b_t\bta\bai\bil\bl_\b_p\bpa\bad\bdd\bdi\bin\bng\bg = 9_bit;\n-};\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b* c\bcr\bre\bea\bat\bte\be_\b_t\bto\bor\brr\bre\ben\bnt\bt(\b()\b) *\b**\b**\b**\b**\b*\n-explicit c\bcr\bre\bea\bat\bte\be_\b_t\bto\bor\brr\bre\ben\bnt\bt (torrent_info const& ti);\n-explicit c\bcr\bre\bea\bat\bte\be_\b_t\bto\bor\brr\bre\ben\bnt\bt (file_storage& fs, int piece_size = 0\n- , create_flags_t flags = {});\n-The piece_size is the size of each piece in bytes. It must be a power of 2 and\n-a minimum of 16 kiB. If a piece size of 0 is specified, a piece_size will be\n-set automatically.\n-The flags arguments specifies options for the torrent creation. It can be any\n-combination of the flags defined by create_flags_t.\n-The _\bf_\bi_\bl_\be_\b__\bs_\bt_\bo_\br_\ba_\bg_\be (fs) parameter defines the files, sizes and their properties\n-for the torrent to be created. Set this up first, before passing it to the\n-_\bc_\br_\be_\ba_\bt_\be_\b__\bt_\bo_\br_\br_\be_\bn_\bt constructor.\n-The overload that takes a torrent_info object will make a verbatim copy of its\n-info dictionary (to preserve the info-hash). The copy of the info dictionary\n-will be used by _\bc_\br_\be_\ba_\bt_\be_\b__\bt_\bo_\br_\br_\be_\bn_\bt_\b:_\b:_\bg_\be_\bn_\be_\br_\ba_\bt_\be_\b(_\b). This means that none of the member\n-functions of _\bc_\br_\be_\ba_\bt_\be_\b__\bt_\bo_\br_\br_\be_\bn_\bt that affects the content of the info dictionary\n-(such as _\bs_\be_\bt_\b__\bh_\ba_\bs_\bh_\b(_\b)), will have any affect. Instead of using this overload,\n-consider using _\bw_\br_\bi_\bt_\be_\b__\bt_\bo_\br_\br_\be_\bn_\bt_\b__\bf_\bi_\bl_\be_\b(_\b) instead.\n-Warning\n-The _\bf_\bi_\bl_\be_\b__\bs_\bt_\bo_\br_\ba_\bg_\be and _\bt_\bo_\br_\br_\be_\bn_\bt_\b__\bi_\bn_\bf_\bo objects must stay alive for the entire\n-duration of the _\bc_\br_\be_\ba_\bt_\be_\b__\bt_\bo_\br_\br_\be_\bn_\bt object.\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b* g\bge\ben\bne\ber\bra\bat\bte\be(\b()\b) g\bge\ben\bne\ber\bra\bat\bte\be_\b_b\bbu\buf\bf(\b()\b) *\b**\b**\b**\b**\b*\n-entry g\bge\ben\bne\ber\bra\bat\bte\be () const;\n-std::vector g\bge\ben\bne\ber\bra\bat\bte\be_\b_b\bbu\buf\bf () const;\n-This function will generate the .torrent file as a bencode tree, or a bencoded\n-into a buffer. In order to encode the _\be_\bn_\bt_\br_\by into a flat file, use the _\bb_\be_\bn_\bc_\bo_\bd_\be_\b(_\b)\n-function.\n-The function returning an _\be_\bn_\bt_\br_\by may be useful to add custom entries to the\n-torrent file before bencoding it and saving it to disk.\n-Whether the resulting torrent object is v1, v2 or hybrid depends on whether any\n-of the v1_only or v2_only flags were set on the constructor. If neither were\n-set, the resulting torrent depends on which hashes were set. If both v1 and v2\n-hashes were set, a hybrid torrent is created.\n-Any failure will cause this function to throw system_error, with an appropriate\n-error message. These are the reasons this call may throw:\n- * the file storage has 0 files\n- * the total size of the file storage is 0 bytes (i.e. it only has empty\n- files)\n- * not all v1 hashes (_\bs_\be_\bt_\b__\bh_\ba_\bs_\bh_\b(_\b)) and not all v2 hashes (_\bs_\be_\bt_\b__\bh_\ba_\bs_\bh_\b2_\b(_\b)) were\n- set\n- * for v2 torrents, you may not have a directory with the same name as a\n- file. If that's encountered in the file storage, _\bg_\be_\bn_\be_\br_\ba_\bt_\be_\b(_\b) fails.\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b* f\bfi\bil\ble\bes\bs(\b()\b) *\b**\b**\b**\b**\b*\n-file_storage const& f\bfi\bil\ble\bes\bs () const;\n-returns an immutable reference to the _\bf_\bi_\bl_\be_\b__\bs_\bt_\bo_\br_\ba_\bg_\be used to create the torrent\n-from.\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b* s\bse\bet\bt_\b_c\bco\bom\bmm\bme\ben\bnt\bt(\b()\b) *\b**\b**\b**\b**\b*\n-void s\bse\bet\bt_\b_c\bco\bom\bmm\bme\ben\bnt\bt (char const* str);\n-Sets the comment for the torrent. The string str should be utf-8 encoded. The\n-comment in a torrent file is optional.\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b* s\bse\bet\bt_\b_c\bcr\bre\bea\bat\bto\bor\br(\b()\b) *\b**\b**\b**\b**\b*\n-void s\bse\bet\bt_\b_c\bcr\bre\bea\bat\bto\bor\br (char const* str);\n-Sets the creator of the torrent. The string str should be utf-8 encoded. This\n-is optional.\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b* s\bse\bet\bt_\b_c\bcr\bre\bea\bat\bti\bio\bon\bn_\b_d\bda\bat\bte\be(\b()\b) *\b**\b**\b**\b**\b*\n-void s\bse\bet\bt_\b_c\bcr\bre\bea\bat\bti\bio\bon\bn_\b_d\bda\bat\bte\be (std::time_t timestamp);\n-sets the \"creation time\" field. Defaults to the system clock at the time of\n-construction of the _\bc_\br_\be_\ba_\bt_\be_\b__\bt_\bo_\br_\br_\be_\bn_\bt object. The timestamp is specified in\n-seconds, posix time. If the creation date is set to 0, the \"creation date\"\n-field will be omitted from the generated torrent.\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b* s\bse\bet\bt_\b_h\bha\bas\bsh\bh(\b()\b) *\b**\b**\b**\b**\b*\n-void s\bse\bet\bt_\b_h\bha\bas\bsh\bh (piece_index_t index, sha1_hash const& h);\n-This sets the SHA-1 hash for the specified piece (index). You are required to\n-set the hash for every piece in the torrent before generating it. If you have\n-the files on disk, you can use the high level convenience function to do this.\n-See _\bs_\be_\bt_\b__\bp_\bi_\be_\bc_\be_\b__\bh_\ba_\bs_\bh_\be_\bs_\b(_\b). A SHA-1 hash of all zeros is internally used to\n-indicate a hash that has not been set. Setting such hash will not be considered\n-set when calling _\bg_\be_\bn_\be_\br_\ba_\bt_\be_\b(_\b). This function will throw std::system_error if it\n-is called on an object constructed with the v2_only flag.\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b* s\bse\bet\bt_\b_h\bha\bas\bsh\bh2\b2(\b()\b) *\b**\b**\b**\b**\b*\n-void s\bse\bet\bt_\b_h\bha\bas\bsh\bh2\b2 (file_index_t file, piece_index_t::diff_type piece, sha256_hash\n-const& h);\n-sets the bittorrent v2 hash for filefileof the piecepiece.pieceis relative to\n-the first piece of the file, starting at 0. The first piece in the file can be\n-computed with _\bf_\bi_\bl_\be_\b__\bs_\bt_\bo_\br_\ba_\bg_\be_\b:_\b:_\bf_\bi_\bl_\be_\b__\bi_\bn_\bd_\be_\bx_\b__\ba_\bt_\b__\bp_\bi_\be_\bc_\be_\b(_\b). The hash,h, is the root of\n-the merkle tree formed by the piece's 16 kiB blocks. Note that piece sizes must\n-be powers-of-2, so all per-piece merkle trees are complete. A SHA-256 hash of\n-all zeros is internally used to indicate a hash that has not been set. Setting\n-such hash will not be considered set when calling _\bg_\be_\bn_\be_\br_\ba_\bt_\be_\b(_\b). This function\n-will throw std::system_error if it is called on an object constructed with the\n-v1_only flag.\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b* a\bad\bdd\bd_\b_h\bht\btt\btp\bp_\b_s\bse\bee\bed\bd(\b()\b) a\bad\bdd\bd_\b_u\bur\brl\bl_\b_s\bse\bee\bed\bd(\b()\b) *\b**\b**\b**\b**\b*\n-void a\bad\bdd\bd_\b_u\bur\brl\bl_\b_s\bse\bee\bed\bd (string_view url);\n-void a\bad\bdd\bd_\b_h\bht\btt\btp\bp_\b_s\bse\bee\bed\bd (string_view url);\n-This adds a url seed to the torrent. You can have any number of url seeds. For\n-a single file torrent, this should be an HTTP url, pointing to a file with\n-identical content as the file of the torrent. For a multi-file torrent, it\n-should point to a directory containing a directory with the same name as this\n-torrent, and all the files of the torrent in it.\n-The second function, add_http_seed() adds an HTTP seed instead.\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b* a\bad\bdd\bd_\b_n\bno\bod\bde\be(\b()\b) *\b**\b**\b**\b**\b*\n-void a\bad\bdd\bd_\b_n\bno\bod\bde\be (std::pair node);\n-This adds a DHT node to the torrent. This especially useful if you're creating\n-a tracker less torrent. It can be used by clients to bootstrap their DHT node\n-from. The node is a hostname and a port number where there is a DHT node\n-running. You can have any number of DHT nodes in a torrent.\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b* a\bad\bdd\bd_\b_t\btr\bra\bac\bck\bke\ber\br(\b()\b) *\b**\b**\b**\b**\b*\n-void a\bad\bdd\bd_\b_t\btr\bra\bac\bck\bke\ber\br (string_view url, int tier = 0);\n-Adds a tracker to the torrent. This is not strictly required, but most torrents\n-use a tracker as their main source of peers. The url should be an _\bh_\bt_\bt_\bp_\b:_\b/_\b/ or\n-udp:// url to a machine running a bittorrent tracker that accepts announces for\n-this torrent's info-hash. The tier is the fallback priority of the tracker. All\n-trackers with tier 0 are tried first (in any order). If all fail, trackers with\n-tier 1 are tried. If all of those fail, trackers with tier 2 are tried, and so\n-on.\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b* s\bse\bet\bt_\b_r\bro\boo\bot\bt_\b_c\bce\ber\brt\bt(\b()\b) *\b**\b**\b**\b**\b*\n-void s\bse\bet\bt_\b_r\bro\boo\bot\bt_\b_c\bce\ber\brt\bt (string_view cert);\n-This function sets an X.509 certificate in PEM format to the torrent. This\n-makes the torrent an S\bSS\bSL\bL t\bto\bor\brr\bre\ben\bnt\bt. An SSL torrent requires that each peer has a\n-valid certificate signed by this root certificate. For SSL torrents, all peers\n-are connecting over SSL connections. For more information, see the section on\n-_\bs_\bs_\bl_\b _\bt_\bo_\br_\br_\be_\bn_\bt_\bs.\n-The string is not the path to the cert, it's the actual content of the\n-certificate.\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b* s\bse\bet\bt_\b_p\bpr\bri\biv\bv(\b()\b) p\bpr\bri\biv\bv(\b()\b) *\b**\b**\b**\b**\b*\n-void s\bse\bet\bt_\b_p\bpr\bri\biv\bv (bool p);\n-bool p\bpr\bri\biv\bv () const;\n-Sets and queries the private flag of the torrent. Torrents with the private\n-flag set ask the client to not use any other sources than the tracker for\n-peers, and to not use DHT to advertise itself publicly, only the tracker.\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b* n\bnu\bum\bm_\b_p\bpi\bie\bec\bce\bes\bs(\b()\b) *\b**\b**\b**\b**\b*\n-int n\bnu\bum\bm_\b_p\bpi\bie\bec\bce\bes\bs () const;\n-returns the number of pieces in the associated _\bf_\bi_\bl_\be_\b__\bs_\bt_\bo_\br_\ba_\bg_\be object.\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b* p\bpi\bie\bec\bce\be_\b_r\bra\ban\bng\bge\be(\b()\b) *\b**\b**\b**\b**\b*\n-index_range p\bpi\bie\bec\bce\be_\b_r\bra\ban\bng\bge\be () const noexcept;\n-all piece indices in the torrent to be created\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b* f\bfi\bil\ble\be_\b_r\bra\ban\bng\bge\be(\b()\b) *\b**\b**\b**\b**\b*\n-index_range f\bfi\bil\ble\be_\b_r\bra\ban\bng\bge\be () const noexcept;\n-all file indices in the torrent to be created\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b* f\bfi\bil\ble\be_\b_p\bpi\bie\bec\bce\be_\b_r\bra\ban\bng\bge\be(\b()\b) *\b**\b**\b**\b**\b*\n-index_range f\bfi\bil\ble\be_\b_p\bpi\bie\bec\bce\be_\b_r\bra\ban\bng\bge\be (file_index_t f);\n-for v2 and hybrid torrents only, the pieces in the specified file, specified as\n-delta from the first piece in the file. i.e. the first index is 0.\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b* t\bto\bot\bta\bal\bl_\b_s\bsi\biz\bze\be(\b()\b) *\b**\b**\b**\b**\b*\n-std::int64_t t\bto\bot\bta\bal\bl_\b_s\bsi\biz\bze\be () const;\n-the total number of bytes of all files and pad files\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b* p\bpi\bie\bec\bce\be_\b_s\bsi\biz\bze\be(\b()\b) p\bpi\bie\bec\bce\be_\b_l\ble\ben\bng\bgt\bth\bh(\b()\b) *\b**\b**\b**\b**\b*\n-int p\bpi\bie\bec\bce\be_\b_s\bsi\biz\bze\be (piece_index_t i) const;\n-int p\bpi\bie\bec\bce\be_\b_l\ble\ben\bng\bgt\bth\bh () const;\n-piece_length() returns the piece size of all pieces but the last one.\n-piece_size() returns the size of the specified piece. these functions are just\n-forwarding to the associated _\bf_\bi_\bl_\be_\b__\bs_\bt_\bo_\br_\ba_\bg_\be.\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b* a\bad\bdd\bd_\b_s\bsi\bim\bmi\bil\bla\bar\br_\b_t\bto\bor\brr\bre\ben\bnt\bt(\b()\b) a\bad\bdd\bd_\b_c\bco\bol\bll\ble\bec\bct\bti\bio\bon\bn(\b()\b) *\b**\b**\b**\b**\b*\n-void a\bad\bdd\bd_\b_c\bco\bol\bll\ble\bec\bct\bti\bio\bon\bn (string_view c);\n-void a\bad\bdd\bd_\b_s\bsi\bim\bmi\bil\bla\bar\br_\b_t\bto\bor\brr\bre\ben\bnt\bt (sha1_hash ih);\n-Add similar torrents (by info-hash) or collections of similar torrents. Similar\n-torrents are expected to share some files with this torrent. Torrents sharing a\n-collection name with this torrent are also expected to share files with this\n-torrent. A torrent may have more than one collection and more than one similar\n-torrents. For more information, see _\bB_\bE_\bP_\b _\b3_\b8.\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n- modification_time\n- This will include the file modification time as part of the torrent. This\n- is not enabled by default, as it might cause problems when you create a\n- torrent from separate files with the same content, hoping to yield the\n- same info-hash. If the files have different modification times, with this\n- option enabled, you would get different info-hashes for the files.\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n- symlinks\n- If this flag is set, files that are symlinks get a symlink attribute set\n- on them and their data will not be included in the torrent. This is\n- useful if you need to reconstruct a file hierarchy which contains\n- symlinks.\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n- v2_only\n- Do not generate v1 metadata. The resulting torrent will only be usable by\n- clients which support v2. This requires setting all v2 hashes, with\n- _\bs_\be_\bt_\b__\bh_\ba_\bs_\bh_\b2_\b(_\b) before calling _\bg_\be_\bn_\be_\br_\ba_\bt_\be_\b(_\b). Setting v1 hashes (with _\bs_\be_\bt_\b__\bh_\ba_\bs_\bh\n- _\b(_\b)) is an error with this flag set.\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n- v1_only\n- do not generate v2 metadata or enforce v2 alignment and padding rules\n- this is mainly for tests, not recommended for production use. This\n- requires setting all v1 hashes, with _\bs_\be_\bt_\b__\bh_\ba_\bs_\bh_\b(_\b), before calling _\bg_\be_\bn_\be_\br_\ba_\bt_\be\n- _\b(_\b). Setting v2 hashes (with _\bs_\be_\bt_\b__\bh_\ba_\bs_\bh_\b2_\b(_\b)) is an error with this flag set.\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n- canonical_files\n- This flag only affects v1-only torrents, and is only relevant together\n- with the v1_only_flag. This flag will force the same file order and\n- padding as a v2 (or hybrid) torrent would have. It has the effect of\n- ordering files and inserting pad files to align them with piece\n- boundaries.\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n- no_attributes\n- passing this flag to _\ba_\bd_\bd_\b__\bf_\bi_\bl_\be_\bs_\b(_\b) will ignore file attributes (such as\n- executable or hidden) when adding the files to the file storage. Since\n- not all filesystems and operating systems support all file attributes the\n- resulting torrent may differ depending on where it's created. If it's\n- important for torrents to be created consistently across systems, this\n- flag should be set.\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n- canonical_files_no_tail_padding\n- this flag enforces the file layout to be canonical according to the\n- bittorrent v2 specification (just like the canonical_files flag) with the\n- one exception that tail padding is not added to the last file. This\n- behavior deviates from the specification but was the way libtorrent\n- created torrents in version up to and including 2.0.7. This flag is here\n- for backwards compatibility.\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b**\b* a\bad\bdd\bd_\b_f\bfi\bil\ble\bes\bs(\b()\b) *\b**\b**\b**\b**\b**\b*\n-Declared in \"_\bl_\bi_\bb_\bt_\bo_\br_\br_\be_\bn_\bt_\b/_\bc_\br_\be_\ba_\bt_\be_\b__\bt_\bo_\br_\br_\be_\bn_\bt_\b._\bh_\bp_\bp\"\n-void a\bad\bdd\bd_\b_f\bfi\bil\ble\bes\bs (file_storage& fs, std::string const& file\n- , std::function p, create_flags_t flags = {});\n-void a\bad\bdd\bd_\b_f\bfi\bil\ble\bes\bs (file_storage& fs, std::string const& file\n- , create_flags_t flags = {});\n-Adds the file specified by path to the _\bf_\bi_\bl_\be_\b__\bs_\bt_\bo_\br_\ba_\bg_\be object. In case path refers\n-to a directory, files will be added recursively from the directory.\n-If specified, the predicate p is called once for every file and directory that\n-is encountered. Files for which p returns true are added, and directories for\n-which p returns true are traversed. p must have the following signature:\n-bool Pred(std::string const& p);\n-The path that is passed in to the predicate is the full path of the file or\n-directory. If no predicate is specified, all files are added, and all\n-directories are traversed.\n-The \"..\" directory is never traversed.\n-The flags argument should be the same as the flags passed to the _\bc_\br_\be_\ba_\bt_\be_\b__\bt_\bo_\br_\br_\be_\bn_\bt\n-constructor.\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b**\b* s\bse\bet\bt_\b_p\bpi\bie\bec\bce\be_\b_h\bha\bas\bsh\bhe\bes\bs(\b()\b) *\b**\b**\b**\b**\b**\b*\n-Declared in \"_\bl_\bi_\bb_\bt_\bo_\br_\br_\be_\bn_\bt_\b/_\bc_\br_\be_\ba_\bt_\be_\b__\bt_\bo_\br_\br_\be_\bn_\bt_\b._\bh_\bp_\bp\"\n-void s\bse\bet\bt_\b_p\bpi\bie\bec\bce\be_\b_h\bha\bas\bsh\bhe\bes\bs (create_torrent& t, std::string const& p\n- , settings_interface const& settings, disk_io_constructor_type disk_io\n- , std::function const& f, error_code& ec);\n-void s\bse\bet\bt_\b_p\bpi\bie\bec\bce\be_\b_h\bha\bas\bsh\bhe\bes\bs (create_torrent& t, std::string const& p\n- , settings_interface const& settings\n- , std::function const& f, error_code& ec);\n-inline void s\bse\bet\bt_\b_p\bpi\bie\bec\bce\be_\b_h\bha\bas\bsh\bhe\bes\bs (create_torrent& t, std::string const& p,\n-error_code& ec);\n-inline void s\bse\bet\bt_\b_p\bpi\bie\bec\bce\be_\b_h\bha\bas\bsh\bhe\bes\bs (create_torrent& t, std::string const& p);\n-inline void s\bse\bet\bt_\b_p\bpi\bie\bec\bce\be_\b_h\bha\bas\bsh\bhe\bes\bs (create_torrent& t, std::string const& p\n- , std::function const& f);\n-void s\bse\bet\bt_\b_p\bpi\bie\bec\bce\be_\b_h\bha\bas\bsh\bhe\bes\bs (create_torrent& t, std::string const& p\n- , std::function const& f, error_code& ec);\n-inline void s\bse\bet\bt_\b_p\bpi\bie\bec\bce\be_\b_h\bha\bas\bsh\bhe\bes\bs (create_torrent& t, std::string const& p\n- , settings_interface const& settings\n- , std::function const& f);\n-This function will assume that the files added to the torrent file exists at\n-path p, read those files and hash the content and set the hashes in the\n-create_torrent object. The optional function f is called in between every hash\n-that is set. f must have the following signature:\n-void Fun(piece_index_t);\n-The overloads taking a _\bs_\be_\bt_\bt_\bi_\bn_\bg_\bs_\b__\bp_\ba_\bc_\bk may be used to configure the underlying\n-disk access. Such as settings_pack::aio_threads.\n-The overloads that don't take an error_code& may throw an exception in case of\n-a file error, the other overloads sets the error code to reflect the error, if\n-any.\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b**\b* w\bwe\beb\bb_\b_s\bse\bee\bed\bd_\b_e\ben\bnt\btr\bry\by *\b**\b**\b**\b**\b**\b*\n-Declared in \"_\bl_\bi_\bb_\bt_\bo_\br_\br_\be_\bn_\bt_\b/_\bt_\bo_\br_\br_\be_\bn_\bt_\b__\bi_\bn_\bf_\bo_\b._\bh_\bp_\bp\"\n-the _\bw_\be_\bb_\b__\bs_\be_\be_\bd_\b__\be_\bn_\bt_\br_\by holds information about a web seed (also known as URL seed\n-or HTTP seed). It is essentially a URL with some state associated with it. For\n-more information, see _\bB_\bE_\bP_\b _\b1_\b7 and _\bB_\bE_\bP_\b _\b1_\b9.\n-struct web_seed_entry\n-{\n- bool o\bop\bpe\ber\bra\bat\bto\bor\br=\b==\b= (web_seed_entry const& e) const;\n- bool o\bop\bpe\ber\bra\bat\bto\bor\br<\b< (web_seed_entry const& e) const;\n-\n- enum type_t\n- {\n- url_seed,\n- http_seed,\n- };\n-\n- std::string url;\n- std::string auth;\n- headers_t extra_headers;\n- std::uint8_t type;\n-};\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b* o\bop\bpe\ber\bra\bat\bto\bor\br=\b==\b=(\b()\b) *\b**\b**\b**\b**\b*\n-bool o\bop\bpe\ber\bra\bat\bto\bor\br=\b==\b= (web_seed_entry const& e) const;\n-URL and type comparison\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b* o\bop\bpe\ber\bra\bat\bto\bor\br<\b<(\b()\b) *\b**\b**\b**\b**\b*\n-bool o\bop\bpe\ber\bra\bat\bto\bor\br<\b< (web_seed_entry const& e) const;\n-URL and type less-than comparison\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b* e\ben\bnu\bum\bm t\bty\byp\bpe\be_\b_t\bt *\b**\b**\b**\b**\b*\n-Declared in \"_\bl_\bi_\bb_\bt_\bo_\br_\br_\be_\bn_\bt_\b/_\bt_\bo_\br_\br_\be_\bn_\bt_\b__\bi_\bn_\bf_\bo_\b._\bh_\bp_\bp\"\n- _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b \n-|_\bn\bn_\ba\ba_\bm\bm_\be\be_\b _\b _\b _\b _\b _\b|_\bv\bv_\ba\ba_\bl\bl_\bu\bu_\be\be_\b|_\bd\bd_\be\be_\bs\bs_\bc\bc_\br\br_\bi\bi_\bp\bp_\bt\bt_\bi\bi_\bo\bo_\bn\bn|\n-|_\bu_\br_\bl_\b__\bs_\be_\be_\bd_\b _\b|_\b0_\b _\b _\b _\b _\b|_\b\u00a0_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|_\bh_\bt_\bt_\bp_\b__\bs_\be_\be_\bd_\b|_\b1_\b _\b _\b _\b _\b|_\b\u00a0_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n- url\n- The URL of the web seed\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n- auth\n- Optional authentication. If this is set, it's passed in as HTTP basic\n- auth to the web seed. The format is: username:password.\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n- extra_headers\n- Any extra HTTP headers that need to be passed to the web seed\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n- type\n- The type of web seed (see _\bt_\by_\bp_\be_\b__\bt)\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b**\b* l\blo\boa\bad\bd_\b_t\bto\bor\brr\bre\ben\bnt\bt_\b_l\bli\bim\bmi\bit\bts\bs *\b**\b**\b**\b**\b**\b*\n-Declared in \"_\bl_\bi_\bb_\bt_\bo_\br_\br_\be_\bn_\bt_\b/_\bt_\bo_\br_\br_\be_\bn_\bt_\b__\bi_\bn_\bf_\bo_\b._\bh_\bp_\bp\"\n-this object holds configuration options for limits to use when loading\n-torrents. They are meant to prevent loading potentially malicious torrents that\n-cause excessive memory allocations.\n-struct load_torrent_limits\n-{\n- int m\bma\bax\bx_\b_b\bbu\buf\bff\bfe\ber\br_\b_s\bsi\biz\bze\be = 10000000;\n- int m\bma\bax\bx_\b_p\bpi\bie\bec\bce\bes\bs = 0x200000;\n- int m\bma\bax\bx_\b_d\bde\bec\bco\bod\bde\be_\b_d\bde\bep\bpt\bth\bh = 100;\n- int m\bma\bax\bx_\b_d\bde\bec\bco\bod\bde\be_\b_t\bto\bok\bke\ben\bns\bs = 3000000;\n-};\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n- max_buffer_size\n- the max size of a .torrent file to load into RAM\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n- max_pieces\n- the max number of pieces allowed in the torrent\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n- max_decode_depth\n- the max recursion depth in the bdecoded structure\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n- max_decode_tokens\n- the max number of bdecode tokens\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b**\b* t\bto\bor\brr\bre\ben\bnt\bt_\b_i\bin\bnf\bfo\bo *\b**\b**\b**\b**\b**\b*\n-Declared in \"_\bl_\bi_\bb_\bt_\bo_\br_\br_\be_\bn_\bt_\b/_\bt_\bo_\br_\br_\be_\bn_\bt_\b__\bi_\bn_\bf_\bo_\b._\bh_\bp_\bp\"\n-the _\bt_\bo_\br_\br_\be_\bn_\bt_\b__\bi_\bn_\bf_\bo class holds the information found in a .torrent file.\n-class torrent_info\n-{\n- explicit t\bto\bor\brr\bre\ben\bnt\bt_\b_i\bin\bnf\bfo\bo (span buffer, from_span_t);\n- t\bto\bor\brr\bre\ben\bnt\bt_\b_i\bin\bnf\bfo\bo (std::string const& filename, load_torrent_limits const& cfg);\n- t\bto\bor\brr\bre\ben\bnt\bt_\b_i\bin\bnf\bfo\bo (char const* buffer, int size, error_code& ec);\n- explicit t\bto\bor\brr\bre\ben\bnt\bt_\b_i\bin\bnf\bfo\bo (bdecode_node const& torrent_file);\n- t\bto\bor\brr\bre\ben\bnt\bt_\b_i\bin\bnf\bfo\bo (span buffer, error_code& ec, from_span_t);\n- t\bto\bor\brr\bre\ben\bnt\bt_\b_i\bin\bnf\bfo\bo (std::string const& filename, error_code& ec);\n- t\bto\bor\brr\bre\ben\bnt\bt_\b_i\bin\bnf\bfo\bo (char const* buffer, int size);\n- t\bto\bor\brr\bre\ben\bnt\bt_\b_i\bin\bnf\bfo\bo (bdecode_node const& torrent_file, load_torrent_limits const&\n-cfg);\n- explicit t\bto\bor\brr\bre\ben\bnt\bt_\b_i\bin\bnf\bfo\bo (info_hash_t const& info_hash);\n- explicit t\bto\bor\brr\bre\ben\bnt\bt_\b_i\bin\bnf\bfo\bo (std::string const& filename);\n- t\bto\bor\brr\bre\ben\bnt\bt_\b_i\bin\bnf\bfo\bo (torrent_info const& t);\n- t\bto\bor\brr\bre\ben\bnt\bt_\b_i\bin\bnf\bfo\bo (bdecode_node const& torrent_file, error_code& ec);\n- t\bto\bor\brr\bre\ben\bnt\bt_\b_i\bin\bnf\bfo\bo (span buffer, load_torrent_limits const& cfg,\n-from_span_t);\n- ~\b~t\bto\bor\brr\bre\ben\bnt\bt_\b_i\bin\bnf\bfo\bo ();\n- file_storage const& f\bfi\bil\ble\bes\bs () const;\n- file_storage const& o\bor\bri\big\bg_\b_f\bfi\bil\ble\bes\bs () const;\n- void r\bre\ben\bna\bam\bme\be_\b_f\bfi\bil\ble\be (file_index_t index, std::string const& new_filename);\n- void r\bre\bem\bma\bap\bp_\b_f\bfi\bil\ble\bes\bs (file_storage const& f);\n- void c\bcl\ble\bea\bar\br_\b_t\btr\bra\bac\bck\bke\ber\brs\bs ();\n- void a\bad\bdd\bd_\b_t\btr\bra\bac\bck\bke\ber\br (std::string const& url, int tier\n- , announce_entry::tracker_source source);\n- std::vector const& t\btr\bra\bac\bck\bke\ber\brs\bs () const;\n- void a\bad\bdd\bd_\b_t\btr\bra\bac\bck\bke\ber\br (std::string const& url, int tier = 0);\n- std::vector s\bsi\bim\bmi\bil\bla\bar\br_\b_t\bto\bor\brr\bre\ben\bnt\bts\bs () const;\n- std::vector c\bco\bol\bll\ble\bec\bct\bti\bio\bon\bns\bs () const;\n- void a\bad\bdd\bd_\b_h\bht\btt\btp\bp_\b_s\bse\bee\bed\bd (std::string const& url\n- , std::string const& extern_auth = std::string()\n- , web_seed_entry::headers_t const& extra_headers = web_seed_entry::\n-headers_t());\n- void s\bse\bet\bt_\b_w\bwe\beb\bb_\b_s\bse\bee\bed\bds\bs (std::vector seeds);\n- void a\bad\bdd\bd_\b_u\bur\brl\bl_\b_s\bse\bee\bed\bd (std::string const& url\n- , std::string const& ext_auth = std::string()\n- , web_seed_entry::headers_t const& ext_headers = web_seed_entry::\n-headers_t());\n- std::vector const& w\bwe\beb\bb_\b_s\bse\bee\bed\bds\bs () const;\n- std::int64_t t\bto\bot\bta\bal\bl_\b_s\bsi\biz\bze\be () const;\n- int n\bnu\bum\bm_\b_p\bpi\bie\bec\bce\bes\bs () const;\n- int p\bpi\bie\bec\bce\be_\b_l\ble\ben\bng\bgt\bth\bh () const;\n- int b\bbl\blo\boc\bck\bks\bs_\b_p\bpe\ber\br_\b_p\bpi\bie\bec\bce\be () const;\n- piece_index_t e\ben\bnd\bd_\b_p\bpi\bie\bec\bce\be () const;\n- index_range p\bpi\bie\bec\bce\be_\b_r\bra\ban\bng\bge\be () const;\n- piece_index_t l\bla\bas\bst\bt_\b_p\bpi\bie\bec\bce\be () const;\n- sha1_hash i\bin\bnf\bfo\bo_\b_h\bha\bas\bsh\bh () const noexcept;\n- info_hash_t const& i\bin\bnf\bfo\bo_\b_h\bha\bas\bsh\bhe\bes\bs () const;\n- bool v\bv2\b2 () const;\n- bool v\bv1\b1 () const;\n- int n\bnu\bum\bm_\b_f\bfi\bil\ble\bes\bs () const;\n- std::vector m\bma\bap\bp_\b_b\bbl\blo\boc\bck\bk (piece_index_t const piece\n- , std::int64_t offset, int size) const;\n- peer_request m\bma\bap\bp_\b_f\bfi\bil\ble\be (file_index_t const file, std::int64_t offset, int\n-size) const;\n- string_view s\bss\bsl\bl_\b_c\bce\ber\brt\bt () const;\n- bool i\bis\bs_\b_v\bva\bal\bli\bid\bd () const;\n- bool p\bpr\bri\biv\bv () const;\n- bool i\bis\bs_\b_i\bi2\b2p\bp () const;\n- int p\bpi\bie\bec\bce\be_\b_s\bsi\biz\bze\be (piece_index_t index) const;\n- char const* h\bha\bas\bsh\bh_\b_f\bfo\bor\br_\b_p\bpi\bie\bec\bce\be_\b_p\bpt\btr\br (piece_index_t const index) const;\n- sha1_hash h\bha\bas\bsh\bh_\b_f\bfo\bor\br_\b_p\bpi\bie\bec\bce\be (piece_index_t index) const;\n- bool i\bis\bs_\b_l\blo\boa\bad\bde\bed\bd () const;\n- const std::string& n\bna\bam\bme\be () const;\n- std::time_t c\bcr\bre\bea\bat\bti\bio\bon\bn_\b_d\bda\bat\bte\be () const;\n- const std::string& c\bcr\bre\bea\bat\bto\bor\br () const;\n- const std::string& c\bco\bom\bmm\bme\ben\bnt\bt () const;\n- std::vector> const& n\bno\bod\bde\bes\bs () const;\n- void a\bad\bdd\bd_\b_n\bno\bod\bde\be (std::pair const& node);\n- bool p\bpa\bar\brs\bse\be_\b_i\bin\bnf\bfo\bo_\b_s\bse\bec\bct\bti\bio\bon\bn (bdecode_node const& info, error_code& ec, int\n-max_pieces);\n- bdecode_node i\bin\bnf\bfo\bo (char const* key) const;\n- span i\bin\bnf\bfo\bo_\b_s\bse\bec\bct\bti\bio\bon\bn () const;\n- span p\bpi\bie\bec\bce\be_\b_l\bla\bay\bye\ber\br (file_index_t) const;\n- void f\bfr\bre\bee\be_\b_p\bpi\bie\bec\bce\be_\b_l\bla\bay\bye\ber\brs\bs ();\n-};\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b* t\bto\bor\brr\bre\ben\bnt\bt_\b_i\bin\bnf\bfo\bo(\b()\b) *\b**\b**\b**\b**\b*\n-explicit t\bto\bor\brr\bre\ben\bnt\bt_\b_i\bin\bnf\bfo\bo (span buffer, from_span_t);\n-t\bto\bor\brr\bre\ben\bnt\bt_\b_i\bin\bnf\bfo\bo (std::string const& filename, load_torrent_limits const& cfg);\n-t\bto\bor\brr\bre\ben\bnt\bt_\b_i\bin\bnf\bfo\bo (char const* buffer, int size, error_code& ec);\n-explicit t\bto\bor\brr\bre\ben\bnt\bt_\b_i\bin\bnf\bfo\bo (bdecode_node const& torrent_file);\n-t\bto\bor\brr\bre\ben\bnt\bt_\b_i\bin\bnf\bfo\bo (span buffer, error_code& ec, from_span_t);\n-t\bto\bor\brr\bre\ben\bnt\bt_\b_i\bin\bnf\bfo\bo (std::string const& filename, error_code& ec);\n-t\bto\bor\brr\bre\ben\bnt\bt_\b_i\bin\bnf\bfo\bo (char const* buffer, int size);\n-t\bto\bor\brr\bre\ben\bnt\bt_\b_i\bin\bnf\bfo\bo (bdecode_node const& torrent_file, load_torrent_limits const&\n-cfg);\n-explicit t\bto\bor\brr\bre\ben\bnt\bt_\b_i\bin\bnf\bfo\bo (info_hash_t const& info_hash);\n-explicit t\bto\bor\brr\bre\ben\bnt\bt_\b_i\bin\bnf\bfo\bo (std::string const& filename);\n-t\bto\bor\brr\bre\ben\bnt\bt_\b_i\bin\bnf\bfo\bo (torrent_info const& t);\n-t\bto\bor\brr\bre\ben\bnt\bt_\b_i\bin\bnf\bfo\bo (bdecode_node const& torrent_file, error_code& ec);\n-t\bto\bor\brr\bre\ben\bnt\bt_\b_i\bin\bnf\bfo\bo (span buffer, load_torrent_limits const& cfg,\n-from_span_t);\n-The constructor that takes an info-hash will initialize the info-hash to the\n-given value, but leave all other fields empty. This is used internally when\n-downloading torrents without the metadata. The metadata will be created by\n-libtorrent as soon as it has been downloaded from the swarm.\n-The constructor that takes a _\bb_\bd_\be_\bc_\bo_\bd_\be_\b__\bn_\bo_\bd_\be will create a _\bt_\bo_\br_\br_\be_\bn_\bt_\b__\bi_\bn_\bf_\bo object\n-from the information found in the given torrent_file. The _\bb_\bd_\be_\bc_\bo_\bd_\be_\b__\bn_\bo_\bd_\be\n-represents a tree node in an bencoded file. To load an ordinary .torrent file\n-into a _\bb_\bd_\be_\bc_\bo_\bd_\be_\b__\bn_\bo_\bd_\be, use _\bb_\bd_\be_\bc_\bo_\bd_\be_\b(_\b).\n-The version that takes a buffer pointer and a size will decode it as a .torrent\n-file and initialize the _\bt_\bo_\br_\br_\be_\bn_\bt_\b__\bi_\bn_\bf_\bo object for you.\n-The version that takes a filename will simply load the torrent file and decode\n-it inside the constructor, for convenience. This might not be the most suitable\n-for applications that want to be able to report detailed errors on what might\n-go wrong.\n-There is an upper limit on the size of the torrent file that will be loaded by\n-the overload taking a filename. If it's important that even very large torrent\n-files are loaded, use one of the other overloads.\n-The overloads that takes an error_code const& never throws if an error occur,\n-they will simply set the error code to describe what went wrong and not fully\n-initialize the _\bt_\bo_\br_\br_\be_\bn_\bt_\b__\bi_\bn_\bf_\bo object. The overloads that do not take the extra\n-error_code parameter will always throw if an error occurs. These overloads are\n-not available when building without exception support.\n-The overload that takes a span also needs an extra parameter of type\n-from_span_t to disambiguate the std::string overload for string literals. There\n-is an object in the libtorrent namespace of this type called from_span.\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b* ~\b~t\bto\bor\brr\bre\ben\bnt\bt_\b_i\bin\bnf\bfo\bo(\b()\b) *\b**\b**\b**\b**\b*\n-~\b~t\bto\bor\brr\bre\ben\bnt\bt_\b_i\bin\bnf\bfo\bo ();\n-frees all storage associated with this _\bt_\bo_\br_\br_\be_\bn_\bt_\b__\bi_\bn_\bf_\bo object\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b* o\bor\bri\big\bg_\b_f\bfi\bil\ble\bes\bs(\b()\b) f\bfi\bil\ble\bes\bs(\b()\b) *\b**\b**\b**\b**\b*\n-file_storage const& f\bfi\bil\ble\bes\bs () const;\n-file_storage const& o\bor\bri\big\bg_\b_f\bfi\bil\ble\bes\bs () const;\n-The _\bf_\bi_\bl_\be_\b__\bs_\bt_\bo_\br_\ba_\bg_\be object contains the information on how to map the pieces to\n-files. It is separated from the _\bt_\bo_\br_\br_\be_\bn_\bt_\b__\bi_\bn_\bf_\bo object because when creating\n-torrents a storage object needs to be created without having a torrent file.\n-When renaming files in a storage, the storage needs to make its own copy of the\n-_\bf_\bi_\bl_\be_\b__\bs_\bt_\bo_\br_\ba_\bg_\be in order to make its mapping differ from the one in the torrent\n-file.\n-orig_files() returns the original (unmodified) file storage for this torrent.\n-This is used by the web server connection, which needs to request files with\n-the original names. Filename may be changed using torrent_info::rename_file().\n-For more information on the _\bf_\bi_\bl_\be_\b__\bs_\bt_\bo_\br_\ba_\bg_\be object, see the separate document on\n-how to create torrents.\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b* r\bre\ben\bna\bam\bme\be_\b_f\bfi\bil\ble\be(\b()\b) *\b**\b**\b**\b**\b*\n-void r\bre\ben\bna\bam\bme\be_\b_f\bfi\bil\ble\be (file_index_t index, std::string const& new_filename);\n-Renames the file with the specified index to the new name. The new filename is\n-reflected by the file_storage returned by files() but not by the one returned\n-by orig_files().\n-If you want to rename the base name of the torrent (for a multi file torrent),\n-you can copy the file_storage (see _\bf_\bi_\bl_\be_\bs_\b(_\b) and _\bo_\br_\bi_\bg_\b__\bf_\bi_\bl_\be_\bs_\b(_\b) ), change the name,\n-and then use _\br_\be_\bm_\ba_\bp_\b__\bf_\bi_\bl_\be_\bs_\b(_\b).\n-The new_filename can both be a relative path, in which case the file name is\n-relative to the save_path of the torrent. If the new_filename is an absolute\n-path (i.e. is_complete(new_filename) == true), then the file is detached from\n-the save_path of the torrent. In this case the file is not moved when\n-_\bm_\bo_\bv_\be_\b__\bs_\bt_\bo_\br_\ba_\bg_\be_\b(_\b) is invoked.\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b* r\bre\bem\bma\bap\bp_\b_f\bfi\bil\ble\bes\bs(\b()\b) *\b**\b**\b**\b**\b*\n-void r\bre\bem\bma\bap\bp_\b_f\bfi\bil\ble\bes\bs (file_storage const& f);\n-Warning\n-Usingremap_files()is discouraged as it's incompatible with v2 torrents. This is\n-because the piece boundaries and piece hashes in v2 torrents are intimately\n-tied to the file boundaries. Instead, just rename individual files, or\n-implement a custom _\bd_\bi_\bs_\bk_\b__\bi_\bn_\bt_\be_\br_\bf_\ba_\bc_\be to customize how to store files.\n-Remaps the file storage to a new file layout. This can be used to, for\n-instance, download all data in a torrent to a single file, or to a number of\n-fixed size sector aligned files, regardless of the number and sizes of the\n-files in the torrent.\n-The new specified file_storage must have the exact same size as the current\n-one.\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b* a\bad\bdd\bd_\b_t\btr\bra\bac\bck\bke\ber\br(\b()\b) t\btr\bra\bac\bck\bke\ber\brs\bs(\b()\b) c\bcl\ble\bea\bar\br_\b_t\btr\bra\bac\bck\bke\ber\brs\bs(\b()\b) *\b**\b**\b**\b**\b*\n-void c\bcl\ble\bea\bar\br_\b_t\btr\bra\bac\bck\bke\ber\brs\bs ();\n-void a\bad\bdd\bd_\b_t\btr\bra\bac\bck\bke\ber\br (std::string const& url, int tier\n- , announce_entry::tracker_source source);\n-std::vector const& t\btr\bra\bac\bck\bke\ber\brs\bs () const;\n-void a\bad\bdd\bd_\b_t\btr\bra\bac\bck\bke\ber\br (std::string const& url, int tier = 0);\n-add_tracker() adds a tracker to the announce-list. The tier determines the\n-order in which the trackers are to be tried. The trackers() function will\n-return a sorted vector of _\ba_\bn_\bn_\bo_\bu_\bn_\bc_\be_\b__\be_\bn_\bt_\br_\by. Each announce _\be_\bn_\bt_\br_\by contains a\n-string, which is the tracker url, and a tier index. The tier index is the high-\n-level priority. No matter which trackers that works or not, the ones with lower\n-tier will always be tried before the one with higher tier number. For more\n-information, see _\ba_\bn_\bn_\bo_\bu_\bn_\bc_\be_\b__\be_\bn_\bt_\br_\by.\n-trackers() returns all entries from announce-list.\n-clear_trackers() removes all trackers from announce-list.\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b* c\bco\bol\bll\ble\bec\bct\bti\bio\bon\bns\bs(\b()\b) s\bsi\bim\bmi\bil\bla\bar\br_\b_t\bto\bor\brr\bre\ben\bnt\bts\bs(\b()\b) *\b**\b**\b**\b**\b*\n-std::vector s\bsi\bim\bmi\bil\bla\bar\br_\b_t\bto\bor\brr\bre\ben\bnt\bts\bs () const;\n-std::vector c\bco\bol\bll\ble\bec\bct\bti\bio\bon\bns\bs () const;\n-These two functions are related to _\bB_\bE_\bP_\b _\b3_\b8 (mutable torrents). The vectors\n-returned from these correspond to the \"similar\" and \"collections\" keys in the\n-.torrent file. Both info-hashes and collections from within the info-dict and\n-from outside of it are included.\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b* s\bse\bet\bt_\b_w\bwe\beb\bb_\b_s\bse\bee\bed\bds\bs(\b()\b) w\bwe\beb\bb_\b_s\bse\bee\bed\bds\bs(\b()\b) a\bad\bdd\bd_\b_h\bht\btt\btp\bp_\b_s\bse\bee\bed\bd(\b()\b) a\bad\bdd\bd_\b_u\bur\brl\bl_\b_s\bse\bee\bed\bd(\b()\b) *\b**\b**\b**\b**\b*\n-void a\bad\bdd\bd_\b_h\bht\btt\btp\bp_\b_s\bse\bee\bed\bd (std::string const& url\n- , std::string const& extern_auth = std::string()\n- , web_seed_entry::headers_t const& extra_headers = web_seed_entry::\n-headers_t());\n-void s\bse\bet\bt_\b_w\bwe\beb\bb_\b_s\bse\bee\bed\bds\bs (std::vector seeds);\n-void a\bad\bdd\bd_\b_u\bur\brl\bl_\b_s\bse\bee\bed\bd (std::string const& url\n- , std::string const& ext_auth = std::string()\n- , web_seed_entry::headers_t const& ext_headers = web_seed_entry::\n-headers_t());\n-std::vector const& w\bwe\beb\bb_\b_s\bse\bee\bed\bds\bs () const;\n-web_seeds() returns all url seeds and http seeds in the torrent. Each _\be_\bn_\bt_\br_\by is\n-a web_seed_entry and may refer to either a url seed or http seed.\n-add_url_seed() and add_http_seed() adds one url to the list of url/http seeds.\n-set_web_seeds() replaces all web seeds with the ones specified in the seeds\n-vector.\n-The extern_auth argument can be used for other authorization schemes than basic\n-HTTP authorization. If set, it will override any username and password found in\n-the URL itself. The string will be sent as the HTTP authorization header's\n-value (without specifying \"Basic\").\n-The extra_headers argument defaults to an empty list, but can be used to insert\n-custom HTTP headers in the requests to a specific web seed.\n-See _\bh_\bt_\bt_\bp_\b _\bs_\be_\be_\bd_\bi_\bn_\bg for more information.\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b* t\bto\bot\bta\bal\bl_\b_s\bsi\biz\bze\be(\b()\b) *\b**\b**\b**\b**\b*\n-std::int64_t t\bto\bot\bta\bal\bl_\b_s\bsi\biz\bze\be () const;\n-total_size() returns the total number of bytes the torrent-file represents.\n-Note that this is the number of pieces times the piece size (modulo the last\n-piece possibly being smaller). With pad files, the total size will be larger\n-than the sum of all (regular) file sizes.\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b* p\bpi\bie\bec\bce\be_\b_l\ble\ben\bng\bgt\bth\bh(\b()\b) n\bnu\bum\bm_\b_p\bpi\bie\bec\bce\bes\bs(\b()\b) *\b**\b**\b**\b**\b*\n-int n\bnu\bum\bm_\b_p\bpi\bie\bec\bce\bes\bs () const;\n-int p\bpi\bie\bec\bce\be_\b_l\ble\ben\bng\bgt\bth\bh () const;\n-piece_length() and num_pieces() returns the number of byte for each piece and\n-the total number of pieces, respectively. The difference between piece_size()\n-and piece_length() is that piece_size() takes the piece index as argument and\n-gives you the exact size of that piece. It will always be the same as\n-piece_length() except in the case of the last piece, which may be smaller.\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b* b\bbl\blo\boc\bck\bks\bs_\b_p\bpe\ber\br_\b_p\bpi\bie\bec\bce\be(\b()\b) *\b**\b**\b**\b**\b*\n-int b\bbl\blo\boc\bck\bks\bs_\b_p\bpe\ber\br_\b_p\bpi\bie\bec\bce\be () const;\n-returns the number of blocks there are in the typical piece. There may be fewer\n-in the last piece)\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b* l\bla\bas\bst\bt_\b_p\bpi\bie\bec\bce\be(\b()\b) e\ben\bnd\bd_\b_p\bpi\bie\bec\bce\be(\b()\b) p\bpi\bie\bec\bce\be_\b_r\bra\ban\bng\bge\be(\b()\b) *\b**\b**\b**\b**\b*\n-piece_index_t e\ben\bnd\bd_\b_p\bpi\bie\bec\bce\be () const;\n-index_range p\bpi\bie\bec\bce\be_\b_r\bra\ban\bng\bge\be () const;\n-piece_index_t l\bla\bas\bst\bt_\b_p\bpi\bie\bec\bce\be () const;\n-last_piece() returns the index to the last piece in the torrent and end_piece()\n-returns the index to the one-past-end piece in the torrent piece_range()\n-returns an implementation-defined type that can be used as the container in a\n-range-for loop. Where the values are the indices of all pieces in the\n-_\bf_\bi_\bl_\be_\b__\bs_\bt_\bo_\br_\ba_\bg_\be.\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b* i\bin\bnf\bfo\bo_\b_h\bha\bas\bsh\bh(\b()\b) i\bin\bnf\bfo\bo_\b_h\bha\bas\bsh\bhe\bes\bs(\b()\b) *\b**\b**\b**\b**\b*\n-sha1_hash i\bin\bnf\bfo\bo_\b_h\bha\bas\bsh\bh () const noexcept;\n-info_hash_t const& i\bin\bnf\bfo\bo_\b_h\bha\bas\bsh\bhe\bes\bs () const;\n-returns the info-hash of the torrent. For BitTorrent v2 support, use\n-info_hashes() to get an object that may hold both a v1 and v2 info-hash\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b* v\bv1\b1(\b()\b) v\bv2\b2(\b()\b) *\b**\b**\b**\b**\b*\n-bool v\bv2\b2 () const;\n-bool v\bv1\b1 () const;\n-returns whether this torrent has v1 and/or v2 metadata, respectively. Hybrid\n-torrents have both. These are shortcuts for info_hashes().has_v1() and\n-info_hashes().has_v2() calls.\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b* n\bnu\bum\bm_\b_f\bfi\bil\ble\bes\bs(\b()\b) *\b**\b**\b**\b**\b*\n-int n\bnu\bum\bm_\b_f\bfi\bil\ble\bes\bs () const;\n-If you need index-access to files you can use the num_files() along with the\n-file_path(), file_size()-family of functions to access files using indices.\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b* m\bma\bap\bp_\b_b\bbl\blo\boc\bck\bk(\b()\b) *\b**\b**\b**\b**\b*\n-std::vector m\bma\bap\bp_\b_b\bbl\blo\boc\bck\bk (piece_index_t const piece\n- , std::int64_t offset, int size) const;\n-This function will map a piece index, a byte offset within that piece and a\n-size (in bytes) into the corresponding files with offsets where that data for\n-that piece is supposed to be stored. See _\bf_\bi_\bl_\be_\b__\bs_\bl_\bi_\bc_\be.\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b* m\bma\bap\bp_\b_f\bfi\bil\ble\be(\b()\b) *\b**\b**\b**\b**\b*\n-peer_request m\bma\bap\bp_\b_f\bfi\bil\ble\be (file_index_t const file, std::int64_t offset, int size)\n-const;\n-This function will map a range in a specific file into a range in the torrent.\n-The file_offset parameter is the offset in the file, given in bytes, where 0 is\n-the start of the file. See _\bp_\be_\be_\br_\b__\br_\be_\bq_\bu_\be_\bs_\bt.\n-The input range is assumed to be valid within the torrent. file_offset + size\n-is not allowed to be greater than the file size. file_index must refer to a\n-valid file, i.e. it cannot be >= num_files().\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b* s\bss\bsl\bl_\b_c\bce\ber\brt\bt(\b()\b) *\b**\b**\b**\b**\b*\n-string_view s\bss\bsl\bl_\b_c\bce\ber\brt\bt () const;\n-Returns the SSL root certificate for the torrent, if it is an SSL torrent.\n-Otherwise returns an empty string. The certificate is the public certificate in\n-x509 format.\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b* i\bis\bs_\b_v\bva\bal\bli\bid\bd(\b()\b) *\b**\b**\b**\b**\b*\n-bool i\bis\bs_\b_v\bva\bal\bli\bid\bd () const;\n-returns true if this _\bt_\bo_\br_\br_\be_\bn_\bt_\b__\bi_\bn_\bf_\bo object has a torrent loaded. This is\n-primarily used to determine if a magnet link has had its metadata resolved yet\n-or not.\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b* p\bpr\bri\biv\bv(\b()\b) *\b**\b**\b**\b**\b*\n-bool p\bpr\bri\biv\bv () const;\n-returns true if this torrent is private. i.e., the client should not advertise\n-itself on the trackerless network (the Kademlia DHT) for this torrent.\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b* i\bis\bs_\b_i\bi2\b2p\bp(\b()\b) *\b**\b**\b**\b**\b*\n-bool i\bis\bs_\b_i\bi2\b2p\bp () const;\n-returns true if this is an i2p torrent. This is determined by whether or not it\n-has a tracker whose URL domain name ends with \".i2p\". i2p torrents disable the\n-DHT and local peer discovery as well as talking to peers over anything other\n-than the i2p network.\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b* p\bpi\bie\bec\bce\be_\b_s\bsi\biz\bze\be(\b()\b) *\b**\b**\b**\b**\b*\n-int p\bpi\bie\bec\bce\be_\b_s\bsi\biz\bze\be (piece_index_t index) const;\n-returns the piece size of file with index. This will be the same as\n-_\bp_\bi_\be_\bc_\be_\b__\bl_\be_\bn_\bg_\bt_\bh_\b(_\b), except for the last piece, which may be shorter.\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b* h\bha\bas\bsh\bh_\b_f\bfo\bor\br_\b_p\bpi\bie\bec\bce\be(\b()\b) h\bha\bas\bsh\bh_\b_f\bfo\bor\br_\b_p\bpi\bie\bec\bce\be_\b_p\bpt\btr\br(\b()\b) *\b**\b**\b**\b**\b*\n-char const* h\bha\bas\bsh\bh_\b_f\bfo\bor\br_\b_p\bpi\bie\bec\bce\be_\b_p\bpt\btr\br (piece_index_t const index) const;\n-sha1_hash h\bha\bas\bsh\bh_\b_f\bfo\bor\br_\b_p\bpi\bie\bec\bce\be (piece_index_t index) const;\n-hash_for_piece() takes a piece-index and returns the 20-bytes sha1-hash for\n-that piece and info_hash() returns the 20-bytes sha1-hash for the info-section\n-of the torrent file. hash_for_piece_ptr() returns a pointer to the 20 byte sha1\n-digest for the piece. Note that the string is not 0-terminated.\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b* n\bna\bam\bme\be(\b()\b) *\b**\b**\b**\b**\b*\n-const std::string& n\bna\bam\bme\be () const;\n-name() returns the name of the torrent. name contains UTF-8 encoded string.\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b* c\bcr\bre\bea\bat\bti\bio\bon\bn_\b_d\bda\bat\bte\be(\b()\b) *\b**\b**\b**\b**\b*\n-std::time_t c\bcr\bre\bea\bat\bti\bio\bon\bn_\b_d\bda\bat\bte\be () const;\n-creation_date() returns the creation date of the torrent as time_t (_\bp_\bo_\bs_\bi_\bx\n-_\bt_\bi_\bm_\be). If there's no time stamp in the torrent file, 0 is returned. .. posix\n-time: _\bh_\bt_\bt_\bp_\b:_\b/_\b/_\bw_\bw_\bw_\b._\bo_\bp_\be_\bn_\bg_\br_\bo_\bu_\bp_\b._\bo_\br_\bg_\b/_\bo_\bn_\bl_\bi_\bn_\be_\bp_\bu_\bb_\bs_\b/_\b0_\b0_\b9_\b6_\b9_\b5_\b3_\b9_\b9_\b/_\bf_\bu_\bn_\bc_\bt_\bi_\bo_\bn_\bs_\b/_\bt_\bi_\bm_\be_\b._\bh_\bt_\bm_\bl\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b* c\bcr\bre\bea\bat\bto\bor\br(\b()\b) *\b**\b**\b**\b**\b*\n-const std::string& c\bcr\bre\bea\bat\bto\bor\br () const;\n-creator() returns the creator string in the torrent. If there is no creator\n-string it will return an empty string.\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b* c\bco\bom\bmm\bme\ben\bnt\bt(\b()\b) *\b**\b**\b**\b**\b*\n-const std::string& c\bco\bom\bmm\bme\ben\bnt\bt () const;\n-comment() returns the comment associated with the torrent. If there's no\n-comment, it will return an empty string. comment contains UTF-8 encoded string.\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b* n\bno\bod\bde\bes\bs(\b()\b) *\b**\b**\b**\b**\b*\n-std::vector> const& n\bno\bod\bde\bes\bs () const;\n-If this torrent contains any DHT nodes, they are put in this vector in their\n-original form (host name and port number).\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b* a\bad\bdd\bd_\b_n\bno\bod\bde\be(\b()\b) *\b**\b**\b**\b**\b*\n-void a\bad\bdd\bd_\b_n\bno\bod\bde\be (std::pair const& node);\n-This is used when creating torrent. Use this to add a known DHT node. It may be\n-used, by the client, to bootstrap into the DHT network.\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b* p\bpa\bar\brs\bse\be_\b_i\bin\bnf\bfo\bo_\b_s\bse\bec\bct\bti\bio\bon\bn(\b()\b) *\b**\b**\b**\b**\b*\n-bool p\bpa\bar\brs\bse\be_\b_i\bin\bnf\bfo\bo_\b_s\bse\bec\bct\bti\bio\bon\bn (bdecode_node const& info, error_code& ec, int\n-max_pieces);\n-populates the _\bt_\bo_\br_\br_\be_\bn_\bt_\b__\bi_\bn_\bf_\bo by providing just the info-dict buffer. This is used\n-when loading a torrent from a magnet link for instance, where we only have the\n-info-dict. The _\bb_\bd_\be_\bc_\bo_\bd_\be_\b__\bn_\bo_\bd_\be e points to a parsed info-dictionary. ec returns an\n-error code if something fails (typically if the info dictionary is malformed).\n-Themax_piecesparameter allows limiting the amount of memory dedicated to\n-loading the torrent, and fails for torrents that exceed the limit. To load\n-large torrents, this limit may also need to be raised in _\bs_\be_\bt_\bt_\bi_\bn_\bg_\bs_\b__\bp_\ba_\bc_\bk_\b:_\b:\n-_\bm_\ba_\bx_\b__\bp_\bi_\be_\bc_\be_\b__\bc_\bo_\bu_\bn_\bt and in calls to _\br_\be_\ba_\bd_\b__\br_\be_\bs_\bu_\bm_\be_\b__\bd_\ba_\bt_\ba_\b(_\b).\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b* i\bin\bnf\bfo\bo(\b()\b) *\b**\b**\b**\b**\b*\n-bdecode_node i\bin\bnf\bfo\bo (char const* key) const;\n-This function looks up keys from the info-dictionary of the loaded torrent\n-file. It can be used to access extension values put in the .torrent file. If\n-the specified key cannot be found, it returns nullptr.\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b* i\bin\bnf\bfo\bo_\b_s\bse\bec\bct\bti\bio\bon\bn(\b()\b) *\b**\b**\b**\b**\b*\n-span i\bin\bnf\bfo\bo_\b_s\bse\bec\bct\bti\bio\bon\bn () const;\n-returns a the raw info section of the torrent file. The underlying buffer is\n-still owned by the _\bt_\bo_\br_\br_\be_\bn_\bt_\b__\bi_\bn_\bf_\bo object\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b* p\bpi\bie\bec\bce\be_\b_l\bla\bay\bye\ber\br(\b()\b) *\b**\b**\b**\b**\b*\n-span p\bpi\bie\bec\bce\be_\b_l\bla\bay\bye\ber\br (file_index_t) const;\n-return the bytes of the piece layer hashes for the specified file. If the file\n-doesn't have a piece layer, an empty span is returned. The span size is\n-divisible by 32, the size of a SHA-256 hash. If the size of the file is smaller\n-than or equal to the piece size, the files \"root hash\" is the hash of the file\n-and is not saved separately in the \"piece layers\" field, but this function\n-still returns the root hash of the file in that case.\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b* f\bfr\bre\bee\be_\b_p\bpi\bie\bec\bce\be_\b_l\bla\bay\bye\ber\brs\bs(\b()\b) *\b**\b**\b**\b**\b*\n-void f\bfr\bre\bee\be_\b_p\bpi\bie\bec\bce\be_\b_l\bla\bay\bye\ber\brs\bs ();\n-clears the piece layers from the _\bt_\bo_\br_\br_\be_\bn_\bt_\b__\bi_\bn_\bf_\bo. This is done by the _\bs_\be_\bs_\bs_\bi_\bo_\bn when\n-a torrent is added, to avoid storing it twice. The piece layer (or other hashes\n-part of the merkle tree) are stored in the internal torrent object.\n-Bencoding is a common representation in bittorrent used for dictionary, list,\n-_\bi_\bn_\bt and string hierarchies. It's used to encode .torrent files and some\n-messages in the network protocol. libtorrent also uses it to store settings,\n-resume data and other _\bs_\be_\bs_\bs_\bi_\bo_\bn state.\n-Strings in bencoded structures do not necessarily represent text. Strings are\n-raw byte buffers of a certain length. If a string is meant to be interpreted as\n-text, it is required to be UTF-8 encoded. See _\bB_\bE_\bP_\b _\b3.\n-The function for decoding bencoded data _\bb_\bd_\be_\bc_\bo_\bd_\be_\b(_\b), returning a _\bb_\bd_\be_\bc_\bo_\bd_\be_\b__\bn_\bo_\bd_\be.\n-This function builds a tree that points back into the original buffer. The\n-returned _\bb_\bd_\be_\bc_\bo_\bd_\be_\b__\bn_\bo_\bd_\be will not be valid once the buffer it was parsed out of is\n-discarded.\n-It's possible to construct an _\be_\bn_\bt_\br_\by from a _\bb_\bd_\be_\bc_\bo_\bd_\be_\b__\bn_\bo_\bd_\be, if a structure needs\n-to be altered and re-encoded.\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b**\b* e\ben\bnt\btr\bry\by *\b**\b**\b**\b**\b**\b*\n-Declared in \"_\bl_\bi_\bb_\bt_\bo_\br_\br_\be_\bn_\bt_\b/_\be_\bn_\bt_\br_\by_\b._\bh_\bp_\bp\"\n-The entry class represents one node in a bencoded hierarchy. It works as a\n-variant type, it can be either a list, a dictionary (std::map), an integer or a\n-string.\n-class entry\n-{\n- data_type t\bty\byp\bpe\be () const;\n- e\ben\bnt\btr\bry\by (dictionary_type);\n- e\ben\bnt\btr\bry\by (span);\n- e\ben\bnt\btr\bry\by (list_type);\n- e\ben\bnt\btr\bry\by (preformatted_type);\n- e\ben\bnt\btr\bry\by (integer_type);\n- e\ben\bnt\btr\bry\by (U v);\n- e\ben\bnt\btr\bry\by (data_type t);\n- e\ben\bnt\btr\bry\by (bdecode_node const& n);\n- entry& o\bop\bpe\ber\bra\bat\bto\bor\br=\b= (entry&&) & noexcept;\n- entry& o\bop\bpe\ber\bra\bat\bto\bor\br=\b= (bdecode_node const&) &;\n- entry& o\bop\bpe\ber\bra\bat\bto\bor\br=\b= (list_type) &;\n- entry& o\bop\bpe\ber\bra\bat\bto\bor\br=\b= (dictionary_type) &;\n- entry& o\bop\bpe\ber\bra\bat\bto\bor\br=\b= (integer_type) &;\n- entry& o\bop\bpe\ber\bra\bat\bto\bor\br=\b= (entry const&) &;\n- entry& o\bop\bpe\ber\bra\bat\bto\bor\br=\b= (preformatted_type) &;\n- entry& o\bop\bpe\ber\bra\bat\bto\bor\br=\b= (span) &;\n- entry& o\bop\bpe\ber\bra\bat\bto\bor\br=\b= (U v) &;\n- dictionary_type const& d\bdi\bic\bct\bt () const;\n- list_type const& l\bli\bis\bst\bt () const;\n- preformatted_type const& p\bpr\bre\bef\bfo\bor\brm\bma\bat\btt\bte\bed\bd () const;\n- string_type& s\bst\btr\bri\bin\bng\bg ();\n- integer_type& i\bin\bnt\bte\beg\bge\ber\br ();\n- string_type const& s\bst\btr\bri\bin\bng\bg () const;\n- dictionary_type& d\bdi\bic\bct\bt ();\n- integer_type const& i\bin\bnt\bte\beg\bge\ber\br () const;\n- list_type& l\bli\bis\bst\bt ();\n- preformatted_type& p\bpr\bre\bef\bfo\bor\brm\bma\bat\btt\bte\bed\bd ();\n- void s\bsw\bwa\bap\bp (entry& e);\n- entry& o\bop\bpe\ber\bra\bat\bto\bor\br[\b[]\b] (string_view key);\n- entry const& o\bop\bpe\ber\bra\bat\bto\bor\br[\b[]\b] (string_view key) const;\n- entry* f\bfi\bin\bnd\bd_\b_k\bke\bey\by (string_view key);\n- entry const* f\bfi\bin\bnd\bd_\b_k\bke\bey\by (string_view key) const;\n- std::string t\bto\bo_\b_s\bst\btr\bri\bin\bng\bg (bool single_line = false) const;\n-\n- enum data_type\n- {\n- int_t,\n- string_t,\n- list_t,\n- dictionary_t,\n- undefined_t,\n- preformatted_t,\n- };\n-};\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b* t\bty\byp\bpe\be(\b()\b) *\b**\b**\b**\b**\b*\n-data_type t\bty\byp\bpe\be () const;\n-returns the concrete type of the _\be_\bn_\bt_\br_\by\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b* e\ben\bnt\btr\bry\by(\b()\b) *\b**\b**\b**\b**\b*\n-e\ben\bnt\btr\bry\by (dictionary_type);\n-e\ben\bnt\btr\bry\by (span);\n-e\ben\bnt\btr\bry\by (list_type);\n-e\ben\bnt\btr\bry\by (preformatted_type);\n-e\ben\bnt\btr\bry\by (integer_type);\n-constructors directly from a specific type. The content of the argument is\n-copied into the newly constructed _\be_\bn_\bt_\br_\by\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b* e\ben\bnt\btr\bry\by(\b()\b) *\b**\b**\b**\b**\b*\n-e\ben\bnt\btr\bry\by (data_type t);\n-construct an empty _\be_\bn_\bt_\br_\by of the specified type. see _\bd_\ba_\bt_\ba_\b__\bt_\by_\bp_\be enum.\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b* e\ben\bnt\btr\bry\by(\b()\b) *\b**\b**\b**\b**\b*\n-e\ben\bnt\btr\bry\by (bdecode_node const& n);\n-construct from _\bb_\bd_\be_\bc_\bo_\bd_\be_\b__\bn_\bo_\bd_\be parsed form (see _\bb_\bd_\be_\bc_\bo_\bd_\be_\b(_\b))\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b* o\bop\bpe\ber\bra\bat\bto\bor\br=\b=(\b()\b) *\b**\b**\b**\b**\b*\n-entry& o\bop\bpe\ber\bra\bat\bto\bor\br=\b= (entry&&) & noexcept;\n-entry& o\bop\bpe\ber\bra\bat\bto\bor\br=\b= (bdecode_node const&) &;\n-entry& o\bop\bpe\ber\bra\bat\bto\bor\br=\b= (list_type) &;\n-entry& o\bop\bpe\ber\bra\bat\bto\bor\br=\b= (dictionary_type) &;\n-entry& o\bop\bpe\ber\bra\bat\bto\bor\br=\b= (integer_type) &;\n-entry& o\bop\bpe\ber\bra\bat\bto\bor\br=\b= (entry const&) &;\n-entry& o\bop\bpe\ber\bra\bat\bto\bor\br=\b= (preformatted_type) &;\n-entry& o\bop\bpe\ber\bra\bat\bto\bor\br=\b= (span) &;\n-copies the structure of the right hand side into this _\be_\bn_\bt_\br_\by.\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b* s\bst\btr\bri\bin\bng\bg(\b()\b) i\bin\bnt\bte\beg\bge\ber\br(\b()\b) l\bli\bis\bst\bt(\b()\b) p\bpr\bre\bef\bfo\bor\brm\bma\bat\btt\bte\bed\bd(\b()\b) d\bdi\bic\bct\bt(\b()\b) *\b**\b**\b**\b**\b*\n-dictionary_type const& d\bdi\bic\bct\bt () const;\n-list_type const& l\bli\bis\bst\bt () const;\n-preformatted_type const& p\bpr\bre\bef\bfo\bor\brm\bma\bat\btt\bte\bed\bd () const;\n-string_type& s\bst\btr\bri\bin\bng\bg ();\n-integer_type& i\bin\bnt\bte\beg\bge\ber\br ();\n-string_type const& s\bst\btr\bri\bin\bng\bg () const;\n-dictionary_type& d\bdi\bic\bct\bt ();\n-integer_type const& i\bin\bnt\bte\beg\bge\ber\br () const;\n-list_type& l\bli\bis\bst\bt ();\n-preformatted_type& p\bpr\bre\bef\bfo\bor\brm\bma\bat\btt\bte\bed\bd ();\n-The integer(), string(), list() and dict() functions are accessors that return\n-the respective type. If the entry object isn't of the type you request, the\n-accessor will throw system_error. You can ask an entry for its type through the\n-type() function.\n-If you want to create an entry you give it the type you want it to have in its\n-constructor, and then use one of the non-const accessors to get a reference\n-which you then can assign the value you want it to have.\n-The typical code to get info from a torrent file will then look like this:\n-entry torrent_file;\n-// ...\n-\n-// throws if this is not a dictionary\n-entry::dictionary_type const& dict = torrent_file.dict();\n-entry::dictionary_type::const_iterator i;\n-i = dict.find(\"announce\");\n-if (i != dict.end())\n-{\n- std::string tracker_url = i->second.string();\n- std::cout << tracker_url << \"\\n\";\n-}\n-The following code is equivalent, but a little bit shorter:\n-entry torrent_file;\n-// ...\n-\n-// throws if this is not a dictionary\n-if (entry* i = torrent_file.find_key(\"announce\"))\n-{\n- std::string tracker_url = i->string();\n- std::cout << tracker_url << \"\\n\";\n-}\n-To make it easier to extract information from a torrent file, the class\n-_\bt_\bo_\br_\br_\be_\bn_\bt_\b__\bi_\bn_\bf_\bo exists.\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b* s\bsw\bwa\bap\bp(\b()\b) *\b**\b**\b**\b**\b*\n-void s\bsw\bwa\bap\bp (entry& e);\n-swaps the content of t\bth\bhi\bis\bs with e.\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b* o\bop\bpe\ber\bra\bat\bto\bor\br[\b[]\b](\b()\b) *\b**\b**\b**\b**\b*\n-entry& o\bop\bpe\ber\bra\bat\bto\bor\br[\b[]\b] (string_view key);\n-entry const& o\bop\bpe\ber\bra\bat\bto\bor\br[\b[]\b] (string_view key) const;\n-All of these functions requires the _\be_\bn_\bt_\br_\by to be a dictionary, if it isn't they\n-will throw system_error.\n-The non-const versions of the operator[] will return a reference to either the\n-existing element at the given key or, if there is no element with the given\n-key, a reference to a newly inserted element at that key.\n-The const version of operator[] will only return a reference to an existing\n-element at the given key. If the key is not found, it will throw system_error.\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b* f\bfi\bin\bnd\bd_\b_k\bke\bey\by(\b()\b) *\b**\b**\b**\b**\b*\n-entry* f\bfi\bin\bnd\bd_\b_k\bke\bey\by (string_view key);\n-entry const* f\bfi\bin\bnd\bd_\b_k\bke\bey\by (string_view key) const;\n-These functions requires the _\be_\bn_\bt_\br_\by to be a dictionary, if it isn't they will\n-throw system_error.\n-They will look for an element at the given key in the dictionary, if the\n-element cannot be found, they will return nullptr. If an element with the given\n-key is found, the return a pointer to it.\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b* t\bto\bo_\b_s\bst\btr\bri\bin\bng\bg(\b()\b) *\b**\b**\b**\b**\b*\n-std::string t\bto\bo_\b_s\bst\btr\bri\bin\bng\bg (bool single_line = false) const;\n-returns a pretty-printed string representation of the bencoded structure, with\n-JSON-style syntax\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b* e\ben\bnu\bum\bm d\bda\bat\bta\ba_\b_t\bty\byp\bpe\be *\b**\b**\b**\b**\b*\n-Declared in \"_\bl_\bi_\bb_\bt_\bo_\br_\br_\be_\bn_\bt_\b/_\be_\bn_\bt_\br_\by_\b._\bh_\bp_\bp\"\n- _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b \n-|_\bn\bn_\ba\ba_\bm\bm_\be\be_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\bv\bv_\ba\ba_\bl\bl_\bu\bu_\be\be_\b|_\bd\bd_\be\be_\bs\bs_\bc\bc_\br\br_\bi\bi_\bp\bp_\bt\bt_\bi\bi_\bo\bo_\bn\bn|\n-|_\bi_\bn_\bt_\b__\bt_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b0_\b _\b _\b _\b _\b|_\b\u00a0_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|_\bs_\bt_\br_\bi_\bn_\bg_\b__\bt_\b _\b _\b _\b _\b _\b _\b|_\b1_\b _\b _\b _\b _\b|_\b\u00a0_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|_\bl_\bi_\bs_\bt_\b__\bt_\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b2_\b _\b _\b _\b _\b|_\b\u00a0_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|_\bd_\bi_\bc_\bt_\bi_\bo_\bn_\ba_\br_\by_\b__\bt_\b _\b _\b|_\b3_\b _\b _\b _\b _\b|_\b\u00a0_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|_\bu_\bn_\bd_\be_\bf_\bi_\bn_\be_\bd_\b__\bt_\b _\b _\b _\b|_\b4_\b _\b _\b _\b _\b|_\b\u00a0_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|_\bp_\br_\be_\bf_\bo_\br_\bm_\ba_\bt_\bt_\be_\bd_\b__\bt_\b|_\b5_\b _\b _\b _\b _\b|_\b\u00a0_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b**\b* b\bbe\ben\bnc\bco\bod\bde\be(\b()\b) *\b**\b**\b**\b**\b**\b*\n-Declared in \"_\bl_\bi_\bb_\bt_\bo_\br_\br_\be_\bn_\bt_\b/_\bb_\be_\bn_\bc_\bo_\bd_\be_\b._\bh_\bp_\bp\"\n-template int b\bbe\ben\bnc\bco\bod\bde\be (OutIt out, const entry& e);\n-This function will encode data to bencoded form.\n-The _\be_\bn_\bt_\br_\by class is the internal representation of the bencoded data and it can\n-be used to retrieve information, an _\be_\bn_\bt_\br_\by can also be build by the program and\n-given to bencode() to encode it into the OutIt iterator.\n-OutIt is an _\bO_\bu_\bt_\bp_\bu_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br. It's a template and usually instantiated as\n-_\bo_\bs_\bt_\br_\be_\ba_\bm_\b__\bi_\bt_\be_\br_\ba_\bt_\bo_\br or _\bb_\ba_\bc_\bk_\b__\bi_\bn_\bs_\be_\br_\bt_\b__\bi_\bt_\be_\br_\ba_\bt_\bo_\br. This function assumes the value_type\n-of the iterator is a char. In order to encode _\be_\bn_\bt_\br_\by e into a buffer, do:\n-std::vector buf;\n-bencode(std::back_inserter(buf), e);\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b**\b* o\bop\bpe\ber\bra\bat\bto\bor\br<\b<<\b<(\b()\b) *\b**\b**\b**\b**\b**\b*\n-Declared in \"_\bl_\bi_\bb_\bt_\bo_\br_\br_\be_\bn_\bt_\b/_\be_\bn_\bt_\br_\by_\b._\bh_\bp_\bp\"\n-inline std::ostream& o\bop\bpe\ber\bra\bat\bto\bor\br<\b<<\b< (std::ostream& os, const entry& e);\n-prints the bencoded structure to the ostream as a JSON-style structure.\n-The _\bp_\bo_\bp_\b__\ba_\bl_\be_\br_\bt_\bs_\b(_\b) function on _\bs_\be_\bs_\bs_\bi_\bo_\bn is the main interface for retrieving\n-alerts (warnings, messages and errors from libtorrent). If no alerts have been\n-posted by libtorrent _\bp_\bo_\bp_\b__\ba_\bl_\be_\br_\bt_\bs_\b(_\b) will return an empty list.\n-By default, only errors are reported. _\bs_\be_\bt_\bt_\bi_\bn_\bg_\bs_\b__\bp_\ba_\bc_\bk_\b:_\b:_\ba_\bl_\be_\br_\bt_\b__\bm_\ba_\bs_\bk can be used to\n-specify which kinds of events should be reported. The _\ba_\bl_\be_\br_\bt mask is a\n-combination of the _\ba_\bl_\be_\br_\bt_\b__\bc_\ba_\bt_\be_\bg_\bo_\br_\by_\b__\bt flags in the _\ba_\bl_\be_\br_\bt class.\n-Every _\ba_\bl_\be_\br_\bt belongs to one or more category. There is a cost associated with\n-posting alerts. Only alerts that belong to an enabled category are posted.\n-Setting the _\ba_\bl_\be_\br_\bt bitmask to 0 will disable all alerts (except those that are\n-non-discardable). Alerts that are responses to API calls such as\n-_\bs_\ba_\bv_\be_\b__\br_\be_\bs_\bu_\bm_\be_\b__\bd_\ba_\bt_\ba_\b(_\b) and _\bp_\bo_\bs_\bt_\b__\bs_\be_\bs_\bs_\bi_\bo_\bn_\b__\bs_\bt_\ba_\bt_\bs_\b(_\b) are non-discardable and will be\n-posted even if their category is disabled.\n-There are other _\ba_\bl_\be_\br_\bt base classes that some alerts derive from, all the alerts\n-that are generated for a specific torrent are derived from _\bt_\bo_\br_\br_\be_\bn_\bt_\b__\ba_\bl_\be_\br_\bt, and\n-tracker events derive from _\bt_\br_\ba_\bc_\bk_\be_\br_\b__\ba_\bl_\be_\br_\bt.\n-Alerts returned by _\bp_\bo_\bp_\b__\ba_\bl_\be_\br_\bt_\bs_\b(_\b) are only valid until the next call to\n-_\bp_\bo_\bp_\b__\ba_\bl_\be_\br_\bt_\bs_\b(_\b). You may not copy an _\ba_\bl_\be_\br_\bt object to access it after the next call\n-to _\bp_\bo_\bp_\b__\ba_\bl_\be_\br_\bt_\bs_\b(_\b). Internal members of alerts also become invalid once _\bp_\bo_\bp_\b__\ba_\bl_\be_\br_\bt_\bs\n-_\b(_\b) is called again.\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b**\b* d\bdh\bht\bt_\b_r\bro\bou\but\bti\bin\bng\bg_\b_b\bbu\buc\bck\bke\bet\bt *\b**\b**\b**\b**\b**\b*\n-Declared in \"_\bl_\bi_\bb_\bt_\bo_\br_\br_\be_\bn_\bt_\b/_\ba_\bl_\be_\br_\bt_\b__\bt_\by_\bp_\be_\bs_\b._\bh_\bp_\bp\"\n-struct to hold information about a single DHT routing table bucket\n-struct dht_routing_bucket\n-{\n- int num_nodes;\n- int num_replacements;\n- int last_active;\n-};\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n- num_nodes num_replacements\n- the total number of nodes and replacement nodes in the routing table\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n- last_active\n- number of seconds since last activity\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b**\b* t\bto\bor\brr\bre\ben\bnt\bt_\b_a\bal\ble\ber\brt\bt *\b**\b**\b**\b**\b**\b*\n-Declared in \"_\bl_\bi_\bb_\bt_\bo_\br_\br_\be_\bn_\bt_\b/_\ba_\bl_\be_\br_\bt_\b__\bt_\by_\bp_\be_\bs_\b._\bh_\bp_\bp\"\n-This is a base class for alerts that are associated with a specific torrent. It\n-contains a handle to the torrent.\n-Note that by the time the client receives a _\bt_\bo_\br_\br_\be_\bn_\bt_\b__\ba_\bl_\be_\br_\bt, its handle member\n-may be invalid.\n-struct torrent_alert : alert\n-{\n- std::string m\bme\bes\bss\bsa\bag\bge\be () const override;\n- char const* t\bto\bor\brr\bre\ben\bnt\bt_\b_n\bna\bam\bme\be () const;\n-\n- torrent_handle handle;\n-};\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b* m\bme\bes\bss\bsa\bag\bge\be(\b()\b) *\b**\b**\b**\b**\b*\n-std::string m\bme\bes\bss\bsa\bag\bge\be () const override;\n-returns the message associated with this _\ba_\bl_\be_\br_\bt\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n- handle\n- The _\bt_\bo_\br_\br_\be_\bn_\bt_\b__\bh_\ba_\bn_\bd_\bl_\be pointing to the torrent this _\ba_\bl_\be_\br_\bt is associated with.\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b**\b* p\bpe\bee\ber\br_\b_a\bal\ble\ber\brt\bt *\b**\b**\b**\b**\b**\b*\n-Declared in \"_\bl_\bi_\bb_\bt_\bo_\br_\br_\be_\bn_\bt_\b/_\ba_\bl_\be_\br_\bt_\b__\bt_\by_\bp_\be_\bs_\b._\bh_\bp_\bp\"\n-The peer _\ba_\bl_\be_\br_\bt is a base class for alerts that refer to a specific peer. It\n-includes all the information to identify the peer. i.e. ip and peer-id.\n-struct peer_alert : torrent_alert\n-{\n- std::string m\bme\bes\bss\bsa\bag\bge\be () const override;\n-\n- aux::noexcept_movable<_\bt_\bc_\bp_\b:_\b:_\be_\bn_\bd_\bp_\bo_\bi_\bn_\bt> endpoint;\n- peer_id pid;\n-};\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n- endpoint\n- The peer's IP address and port.\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n- pid\n- the peer ID, if known.\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b**\b* t\btr\bra\bac\bck\bke\ber\br_\b_a\bal\ble\ber\brt\bt *\b**\b**\b**\b**\b**\b*\n-Declared in \"_\bl_\bi_\bb_\bt_\bo_\br_\br_\be_\bn_\bt_\b/_\ba_\bl_\be_\br_\bt_\b__\bt_\by_\bp_\be_\bs_\b._\bh_\bp_\bp\"\n-This is a base class used for alerts that are associated with a specific\n-tracker. It derives from _\bt_\bo_\br_\br_\be_\bn_\bt_\b__\ba_\bl_\be_\br_\bt since a tracker is also associated with\n-a specific torrent.\n-struct tracker_alert : torrent_alert\n-{\n- std::string m\bme\bes\bss\bsa\bag\bge\be () const override;\n- char const* t\btr\bra\bac\bck\bke\ber\br_\b_u\bur\brl\bl () const;\n-\n- aux::noexcept_movable<_\bt_\bc_\bp_\b:_\b:_\be_\bn_\bd_\bp_\bo_\bi_\bn_\bt> local_endpoint;\n-};\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b* t\btr\bra\bac\bck\bke\ber\br_\b_u\bur\brl\bl(\b()\b) *\b**\b**\b**\b**\b*\n-char const* t\btr\bra\bac\bck\bke\ber\br_\b_u\bur\brl\bl () const;\n-returns a 0-terminated string of the tracker's URL\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n- local_endpoint\n- endpoint of the listen interface being announced\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b**\b* t\bto\bor\brr\bre\ben\bnt\bt_\b_r\bre\bem\bmo\bov\bve\bed\bd_\b_a\bal\ble\ber\brt\bt *\b**\b**\b**\b**\b**\b*\n-Declared in \"_\bl_\bi_\bb_\bt_\bo_\br_\br_\be_\bn_\bt_\b/_\ba_\bl_\be_\br_\bt_\b__\bt_\by_\bp_\be_\bs_\b._\bh_\bp_\bp\"\n-The torrent_removed_alert is posted whenever a torrent is removed. Since the\n-torrent handle in its base class will usually be invalid (since the torrent is\n-already removed) it has the info hash as a member, to identify it. It's posted\n-when the alert_category::status bit is set in the alert_mask.\n-Note that the handle remains valid for some time after _\bt_\bo_\br_\br_\be_\bn_\bt_\b__\br_\be_\bm_\bo_\bv_\be_\bd_\b__\ba_\bl_\be_\br_\bt is\n-posted, as long as some internal libtorrent task (such as an I/O task) refers\n-to it. Additionally, other alerts like _\bs_\ba_\bv_\be_\b__\br_\be_\bs_\bu_\bm_\be_\b__\bd_\ba_\bt_\ba_\b__\ba_\bl_\be_\br_\bt may be posted\n-after _\bt_\bo_\br_\br_\be_\bn_\bt_\b__\br_\be_\bm_\bo_\bv_\be_\bd_\b__\ba_\bl_\be_\br_\bt. To synchronize on whether the torrent has been\n-removed or not, call _\bt_\bo_\br_\br_\be_\bn_\bt_\b__\bh_\ba_\bn_\bd_\bl_\be_\b:_\b:_\bi_\bn_\b__\bs_\be_\bs_\bs_\bi_\bo_\bn_\b(_\b). This will return true before\n-_\bt_\bo_\br_\br_\be_\bn_\bt_\b__\br_\be_\bm_\bo_\bv_\be_\bd_\b__\ba_\bl_\be_\br_\bt is posted, and false afterward.\n-Even though the handle member doesn't point to an existing torrent anymore, it\n-is still useful for comparing to other handles, which may also no longer point\n-to existing torrents, but to the same non-existing torrents.\n-The torrent_handle acts as a weak_ptr, even though its object no longer exists,\n-it can still compare equal to another weak pointer which points to the same\n-non-existent object.\n-struct torrent_removed_alert final : torrent_alert\n-{\n- std::string m\bme\bes\bss\bsa\bag\bge\be () const override;\n-\n- static constexpr alert_category_t s\bst\bta\bat\bti\bic\bc_\b_c\bca\bat\bte\beg\bgo\bor\bry\by = alert_category::status;\n- info_hash_t info_hashes;\n- client_data_t userdata;\n-};\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n- userdata\n- 'userdata`as set in _\ba_\bd_\bd_\b__\bt_\bo_\br_\br_\be_\bn_\bt_\b__\bp_\ba_\br_\ba_\bm_\bs at torrent creation. This can be\n- used to associate this torrent with related data in the client\n- application more efficiently than info_hashes.\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b**\b* r\bre\bea\bad\bd_\b_p\bpi\bie\bec\bce\be_\b_a\bal\ble\ber\brt\bt *\b**\b**\b**\b**\b**\b*\n-Declared in \"_\bl_\bi_\bb_\bt_\bo_\br_\br_\be_\bn_\bt_\b/_\ba_\bl_\be_\br_\bt_\b__\bt_\by_\bp_\be_\bs_\b._\bh_\bp_\bp\"\n-This _\ba_\bl_\be_\br_\bt is posted when the asynchronous read operation initiated by a call\n-to _\bt_\bo_\br_\br_\be_\bn_\bt_\b__\bh_\ba_\bn_\bd_\bl_\be_\b:_\b:_\br_\be_\ba_\bd_\b__\bp_\bi_\be_\bc_\be_\b(_\b) is completed. If the read failed, the torrent\n-is paused and an error state is set and the buffer member of the _\ba_\bl_\be_\br_\bt is 0. If\n-successful, buffer points to a buffer containing all the data of the piece.\n-piece is the piece index that was read. size is the number of bytes that was\n-read.\n-If the operation fails, error will indicate what went wrong.\n-struct read_piece_alert final : torrent_alert\n-{\n- std::string m\bme\bes\bss\bsa\bag\bge\be () const override;\n-\n- static constexpr alert_category_t s\bst\bta\bat\bti\bic\bc_\b_c\bca\bat\bte\beg\bgo\bor\bry\by = alert_category::\n-storage;\n- error_code const error;\n- boost::shared_array const buffer;\n- piece_index_t const piece;\n- int const size;\n-};\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b**\b* f\bfi\bil\ble\be_\b_c\bco\bom\bmp\bpl\ble\bet\bte\bed\bd_\b_a\bal\ble\ber\brt\bt *\b**\b**\b**\b**\b**\b*\n-Declared in \"_\bl_\bi_\bb_\bt_\bo_\br_\br_\be_\bn_\bt_\b/_\ba_\bl_\be_\br_\bt_\b__\bt_\by_\bp_\be_\bs_\b._\bh_\bp_\bp\"\n-This is posted whenever an individual file completes its download. i.e. All\n-pieces overlapping this file have passed their hash check.\n-struct file_completed_alert final : torrent_alert\n-{\n- std::string m\bme\bes\bss\bsa\bag\bge\be () const override;\n-\n- file_index_t const index;\n-};\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n- index\n- refers to the index of the file that completed.\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b**\b* f\bfi\bil\ble\be_\b_r\bre\ben\bna\bam\bme\bed\bd_\b_a\bal\ble\ber\brt\bt *\b**\b**\b**\b**\b**\b*\n-Declared in \"_\bl_\bi_\bb_\bt_\bo_\br_\br_\be_\bn_\bt_\b/_\ba_\bl_\be_\br_\bt_\b__\bt_\by_\bp_\be_\bs_\b._\bh_\bp_\bp\"\n-This is posted as a response to a _\bt_\bo_\br_\br_\be_\bn_\bt_\b__\bh_\ba_\bn_\bd_\bl_\be_\b:_\b:_\br_\be_\bn_\ba_\bm_\be_\b__\bf_\bi_\bl_\be_\b(_\b) call, if the\n-rename operation succeeds.\n-struct file_renamed_alert final : torrent_alert\n-{\n- std::string m\bme\bes\bss\bsa\bag\bge\be () const override;\n- char const* n\bne\bew\bw_\b_n\bna\bam\bme\be () const;\n- char const* o\bol\bld\bd_\b_n\bna\bam\bme\be () const;\n-\n- static constexpr alert_category_t s\bst\bta\bat\bti\bic\bc_\b_c\bca\bat\bte\beg\bgo\bor\bry\by = alert_category::\n-storage;\n- file_index_t const index;\n-};\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b* n\bne\bew\bw_\b_n\bna\bam\bme\be(\b()\b) o\bol\bld\bd_\b_n\bna\bam\bme\be(\b()\b) *\b**\b**\b**\b**\b*\n-char const* n\bne\bew\bw_\b_n\bna\bam\bme\be () const;\n-char const* o\bol\bld\bd_\b_n\bna\bam\bme\be () const;\n-returns the new and previous file name, respectively.\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n- index\n- refers to the index of the file that was renamed,\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b**\b* f\bfi\bil\ble\be_\b_r\bre\ben\bna\bam\bme\be_\b_f\bfa\bai\bil\ble\bed\bd_\b_a\bal\ble\ber\brt\bt *\b**\b**\b**\b**\b**\b*\n-Declared in \"_\bl_\bi_\bb_\bt_\bo_\br_\br_\be_\bn_\bt_\b/_\ba_\bl_\be_\br_\bt_\b__\bt_\by_\bp_\be_\bs_\b._\bh_\bp_\bp\"\n-This is posted as a response to a _\bt_\bo_\br_\br_\be_\bn_\bt_\b__\bh_\ba_\bn_\bd_\bl_\be_\b:_\b:_\br_\be_\bn_\ba_\bm_\be_\b__\bf_\bi_\bl_\be_\b(_\b) call, if the\n-rename operation failed.\n-struct file_rename_failed_alert final : torrent_alert\n-{\n- std::string m\bme\bes\bss\bsa\bag\bge\be () const override;\n-\n- static constexpr alert_category_t s\bst\bta\bat\bti\bic\bc_\b_c\bca\bat\bte\beg\bgo\bor\bry\by = alert_category::\n-storage;\n- file_index_t const index;\n- error_code const error;\n-};\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n- index error\n- refers to the index of the file that was supposed to be renamed, error is\n- the error code returned from the filesystem.\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b**\b* p\bpe\ber\brf\bfo\bor\brm\bma\ban\bnc\bce\be_\b_a\bal\ble\ber\brt\bt *\b**\b**\b**\b**\b**\b*\n-Declared in \"_\bl_\bi_\bb_\bt_\bo_\br_\br_\be_\bn_\bt_\b/_\ba_\bl_\be_\br_\bt_\b__\bt_\by_\bp_\be_\bs_\b._\bh_\bp_\bp\"\n-This _\ba_\bl_\be_\br_\bt is generated when a limit is reached that might have a negative\n-impact on upload or download rate performance.\n-struct performance_alert final : torrent_alert\n+The disk I/O can be customized in libtorrent. In previous versions, the\n+customization was at the level of each torrent. Now, the customization point is\n+at the _\bs_\be_\bs_\bs_\bi_\bo_\bn level. All torrents added to a _\bs_\be_\bs_\bs_\bi_\bo_\bn will use the same disk I/\n+O subsystem, as determined by the disk_io_constructor (in _\bs_\be_\bs_\bs_\bi_\bo_\bn_\b__\bp_\ba_\br_\ba_\bm_\bs).\n+This allows the disk subsystem to also customize threading and disk job\n+management.\n+To customize the disk subsystem, implement _\bd_\bi_\bs_\bk_\b__\bi_\bn_\bt_\be_\br_\bf_\ba_\bc_\be and provide a factory\n+function to the _\bs_\be_\bs_\bs_\bi_\bo_\bn constructor (via _\bs_\be_\bs_\bs_\bi_\bo_\bn_\b__\bp_\ba_\br_\ba_\bm_\bs).\n+Example use:\n+struct temp_storage\n {\n- std::string m\bme\bes\bss\bsa\bag\bge\be () const override;\n-\n- enum performance_warning_t\n- {\n- outstanding_disk_buffer_limit_reached,\n- outstanding_request_limit_reached,\n- upload_limit_too_low,\n- download_limit_too_low,\n- send_buffer_watermark_too_low,\n- too_many_optimistic_unchoke_slots,\n- too_high_disk_queue_limit,\n- aio_limit_reached,\n- deprecated_bittyrant_with_no_uplimit,\n- too_few_outgoing_ports,\n- too_few_file_descriptors,\n- num_warnings,\n- };\n+ explicit temp_storage(lt::file_storage const& fs) : m_files(fs) {}\n \n- static constexpr alert_category_t s\bst\bta\bat\bti\bic\bc_\b_c\bca\bat\bte\beg\bgo\bor\bry\by = alert_category::\n-performance_warning;\n- performance_warning_t const warning_code;\n-};\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b* e\ben\bnu\bum\bm p\bpe\ber\brf\bfo\bor\brm\bma\ban\bnc\bce\be_\b_w\bwa\bar\brn\bni\bin\bng\bg_\b_t\bt *\b**\b**\b**\b**\b*\n-Declared in \"_\bl_\bi_\bb_\bt_\bo_\br_\br_\be_\bn_\bt_\b/_\ba_\bl_\be_\br_\bt_\b__\bt_\by_\bp_\be_\bs_\b._\bh_\bp_\bp\"\n- _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b \n-|_\bn\bn_\ba\ba_\bm\bm_\be\be_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\bv\bv_\ba\ba_\bl\bl_\bu\bu_\be\be_\b|_\bd\bd_\be\be_\bs\bs_\bc\bc_\br\br_\bi\bi_\bp\bp_\bt\bt_\bi\bi_\bo\bo_\bn\bn_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-| | |This warning means that the |\n-| | |number of bytes queued to be |\n-| | |written to disk exceeds the max |\n-| | |disk byte queue setting |\n-| | |(settings_pack:: |\n-| | |max_queued_disk_bytes). This |\n-| | |might restrict the download rate,|\n-| | |by not queuing up enough write |\n-|outstanding_disk_buffer_limit_reached|0 |jobs to the disk I/O thread. When|\n-| | |this _\ba_\bl_\be_\br_\bt is posted, peer |\n-| | |connections are temporarily |\n-| | |stopped from downloading, until |\n-| | |the queued disk bytes have fallen|\n-| | |below the limit again. Unless |\n-| | |your max_queued_disk_bytes |\n-| | |setting is already high, you |\n-| | |might want to increase it to get |\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\bb_\be_\bt_\bt_\be_\br_\b _\bp_\be_\br_\bf_\bo_\br_\bm_\ba_\bn_\bc_\be_\b._\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-| | |This is posted when libtorrent |\n-| | |would like to send more requests |\n-| | |to a peer, but it's limited by |\n-| | |settings_pack:: |\n-| | |max_out_request_queue. The queue |\n-| | |length libtorrent is trying to |\n-| | |achieve is determined by the |\n-| | |download rate and the assumed |\n-| | |round-trip-time (settings_pack:: |\n-| | |request_queue_time). The assumed |\n-| | |round-trip-time is not limited to|\n-| | |just the network RTT, but also |\n-|outstanding_request_limit_reached |1 |the remote disk access time and |\n-| | |message handling time. It |\n-| | |defaults to 3 seconds. The target|\n-| | |number of outstanding requests is|\n-| | |set to fill the bandwidth-delay |\n-| | |product (assumed RTT times |\n-| | |download rate divided by number |\n-| | |of bytes per request). When this |\n-| | |_\ba_\bl_\be_\br_\bt is posted, there is a risk |\n-| | |that the number of outstanding |\n-| | |requests is too low and limits |\n-| | |the download rate. You might want|\n-| | |to increase the |\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\bm_\ba_\bx_\b__\bo_\bu_\bt_\b__\br_\be_\bq_\bu_\be_\bs_\bt_\b__\bq_\bu_\be_\bu_\be_\b _\bs_\be_\bt_\bt_\bi_\bn_\bg_\b._\b _\b _\b |\n-| | |This warning is posted when the |\n-| | |amount of TCP/IP overhead is |\n-| | |greater than the upload rate |\n-| | |limit. When this happens, the |\n-| | |TCP/IP overhead is caused by a |\n-| | |much faster download rate, |\n-| | |triggering TCP ACK packets. These|\n-| | |packets eat into the rate limit |\n-| | |specified to libtorrent. When the|\n-| | |overhead traffic is greater than |\n-| | |the rate limit, libtorrent will |\n-|upload_limit_too_low |2 |not be able to send any actual |\n-| | |payload, such as piece requests. |\n-| | |This means the download rate will|\n-| | |suffer, and new requests can be |\n-| | |sent again. There will be an |\n-| | |equilibrium where the download |\n-| | |rate, on average, is about 20 |\n-| | |times the upload rate limit. If |\n-| | |you want to maximize the download|\n-| | |rate, increase the upload rate |\n-| | |limit above 5% of your download |\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\bc_\ba_\bp_\ba_\bc_\bi_\bt_\by_\b._\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-| | |This is the same warning as |\n-| | |upload_limit_too_low but |\n-| | |referring to the download limit |\n-| | |instead of upload. This suggests |\n-| | |that your download rate limit is |\n-|download_limit_too_low |3 |much lower than your upload |\n-| | |capacity. Your upload rate will |\n-| | |suffer. To maximize upload rate, |\n-| | |make sure your download rate |\n-| | |limit is above 5% of your upload |\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\bc_\ba_\bp_\ba_\bc_\bi_\bt_\by_\b._\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-| | |We're stalled on the disk. We |\n-| | |want to write to the socket, and |\n-| | |we can write but our send buffer |\n-| | |is empty, waiting to be refilled |\n-| | |from the disk. This either means |\n-| | |the disk is slower than the |\n-| | |network connection or that our |\n-| | |send buffer watermark is too |\n-| | |small, because we can send it all|\n-|send_buffer_watermark_too_low |4 |before the disk gets back to us. |\n-| | |The number of bytes that we keep |\n-| | |outstanding, requested from the |\n-| | |disk, is calculated as follows: |\n-| | |min(512, max(upload_rate * |\n-| | |send_buffer_watermark_factor / |\n-| | |100, send_buffer_watermark)) |\n-| | |If you receive this _\ba_\bl_\be_\br_\bt, you |\n-| | |might want to either increase |\n-| | |your send_buffer_watermark or |\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\bs_\be_\bn_\bd_\b__\bb_\bu_\bf_\bf_\be_\br_\b__\bw_\ba_\bt_\be_\br_\bm_\ba_\br_\bk_\b__\bf_\ba_\bc_\bt_\bo_\br_\b._\b _\b _\b _\b |\n-| | |If the half (or more) of all |\n-| | |upload slots are set as |\n-|too_many_optimistic_unchoke_slots |5 |optimistic unchoke slots, this |\n-| | |warning is issued. You probably |\n-| | |want more regular (rate based) |\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\bu_\bn_\bc_\bh_\bo_\bk_\be_\b _\bs_\bl_\bo_\bt_\bs_\b._\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-| | |If the disk write queue ever |\n-| | |grows larger than half of the |\n-| | |cache size, this warning is |\n-| | |posted. The disk write queue eats|\n-| | |into the total disk cache and |\n-| | |leaves very little left for the |\n-|too_high_disk_queue_limit |6 |actual cache. This causes the |\n-| | |disk cache to oscillate in |\n-| | |evicting large portions of the |\n-| | |cache before allowing peers to |\n-| | |download any more, onto the disk |\n-| | |write queue. Either lower |\n-| | |max_queued_disk_bytes or increase|\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\bc_\ba_\bc_\bh_\be_\b__\bs_\bi_\bz_\be_\b._\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|_\ba_\bi_\bo_\b__\bl_\bi_\bm_\bi_\bt_\b__\br_\be_\ba_\bc_\bh_\be_\bd_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b7_\b _\b _\b _\b _\b|_\b\u00a0_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|_\bd_\be_\bp_\br_\be_\bc_\ba_\bt_\be_\bd_\b__\bb_\bi_\bt_\bt_\by_\br_\ba_\bn_\bt_\b__\bw_\bi_\bt_\bh_\b__\bn_\bo_\b__\bu_\bp_\bl_\bi_\bm_\bi_\bt_\b _\b|_\b8_\b _\b _\b _\b _\b|_\b\u00a0_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-| | |This is generated if outgoing |\n-| | |peer connections are failing |\n-| | |because of a\bad\bdd\bdr\bre\bes\bss\bs i\bin\bn u\bus\bse\be errors,|\n-| | |indicating that settings_pack:: |\n-|too_few_outgoing_ports |9 |outgoing_ports is set and is too |\n-| | |small of a range. Consider not |\n-| | |using the outgoing_ports setting |\n-| | |at all, or widen the range to |\n-|_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b _\b _\b _\b _\b _\b|_\bi_\bn_\bc_\bl_\bu_\bd_\be_\b _\bm_\bo_\br_\be_\b _\bp_\bo_\br_\bt_\bs_\b._\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|_\bt_\bo_\bo_\b__\bf_\be_\bw_\b__\bf_\bi_\bl_\be_\b__\bd_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\bs_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b1_\b0_\b _\b _\b _\b|_\b\u00a0_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|_\bn_\bu_\bm_\b__\bw_\ba_\br_\bn_\bi_\bn_\bg_\bs_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b1_\b1_\b _\b _\b _\b|_\b\u00a0_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b**\b* s\bst\bta\bat\bte\be_\b_c\bch\bha\ban\bng\bge\bed\bd_\b_a\bal\ble\ber\brt\bt *\b**\b**\b**\b**\b**\b*\n-Declared in \"_\bl_\bi_\bb_\bt_\bo_\br_\br_\be_\bn_\bt_\b/_\ba_\bl_\be_\br_\bt_\b__\bt_\by_\bp_\be_\bs_\b._\bh_\bp_\bp\"\n-Generated whenever a torrent changes its state.\n-struct state_changed_alert final : torrent_alert\n-{\n- std::string m\bme\bes\bss\bsa\bag\bge\be () const override;\n+ lt::span readv(lt::peer_request const r, lt::storage_error& ec)\n+const\n+ {\n+ auto const i = m_file_data.find(r.piece);\n+ if (i == m_file_data.end())\n+ {\n+ ec.operation = lt::operation_t::file_read;\n+ ec.ec = boost::asio::error::eof;\n+ return {};\n+ }\n+ if (int(i->second.size()) <= r.start)\n+ {\n+ ec.operation = lt::operation_t::file_read;\n+ ec.ec = boost::asio::error::eof;\n+ return {};\n+ }\n+ return { i->second.data() + r.start, std::min(r.length, int(i->second.size\n+()) - r.start) };\n+ }\n+ void writev(lt::span const b, lt::piece_index_t const piece, int\n+const offset)\n+ {\n+ auto& data = m_file_data[piece];\n+ if (data.empty())\n+ {\n+ // allocate the whole piece, otherwise we'll invalidate the pointers\n+ // we have returned back to libtorrent\n+ int const size = piece_size(piece);\n+ data.resize(std::size_t(size));\n+ }\n+ TORRENT_ASSERT(offset + b.size() <= int(data.size()));\n+ std::memcpy(data.data() + offset, b.data(), std::size_t(b.size()));\n+ }\n+ lt::sha1_hash hash(lt::piece_index_t const piece\n+ , lt::span const block_hashes, lt::storage_error& ec)\n+const\n+ {\n+ auto const i = m_file_data.find(piece);\n+ if (i == m_file_data.end())\n+ {\n+ ec.operation = lt::operation_t::file_read;\n+ ec.ec = boost::asio::error::eof;\n+ return {};\n+ }\n+ if (!block_hashes.empty())\n+ {\n+ int const piece_size2 = m_files.piece_size2(piece);\n+ int const blocks_in_piece2 = m_files.blocks_in_piece2(piece);\n+ char const* buf = i->second.data();\n+ std::int64_t offset = 0;\n+ for (int k = 0; k < blocks_in_piece2; ++k)\n+ {\n+ lt::hasher256 h2;\n+ std::ptrdiff_t const len2 = std::min(lt::default_block_size, int\n+(piece_size2 - offset));\n+ h2.update({ buf, len2 });\n+ buf += len2;\n+ offset += len2;\n+ block_hashes[k] = h2.final();\n+ }\n+ }\n+ return lt::hasher(i->second).final();\n+ }\n+ lt::sha256_hash hash2(lt::piece_index_t const piece, int const offset, lt::\n+storage_error& ec)\n+ {\n+ auto const i = m_file_data.find(piece);\n+ if (i == m_file_data.end())\n+ {\n+ ec.operation = lt::operation_t::file_read;\n+ ec.ec = boost::asio::error::eof;\n+ return {};\n+ }\n \n- static constexpr alert_category_t s\bst\bta\bat\bti\bic\bc_\b_c\bca\bat\bte\beg\bgo\bor\bry\by = alert_category::status;\n- torrent_status::state_t const state;\n- torrent_status::state_t const prev_state;\n-};\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n- state\n- the new state of the torrent.\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n- prev_state\n- the previous state.\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b**\b* t\btr\bra\bac\bck\bke\ber\br_\b_e\ber\brr\bro\bor\br_\b_a\bal\ble\ber\brt\bt *\b**\b**\b**\b**\b**\b*\n-Declared in \"_\bl_\bi_\bb_\bt_\bo_\br_\br_\be_\bn_\bt_\b/_\ba_\bl_\be_\br_\bt_\b__\bt_\by_\bp_\be_\bs_\b._\bh_\bp_\bp\"\n-This _\ba_\bl_\be_\br_\bt is generated on tracker time outs, premature disconnects, invalid\n-response or a HTTP response other than \"200 OK\". From the _\ba_\bl_\be_\br_\bt you can get the\n-handle to the torrent the tracker belongs to.\n-struct tracker_error_alert final : tracker_alert\n-{\n- std::string m\bme\bes\bss\bsa\bag\bge\be () const override;\n- char const* f\bfa\bai\bil\blu\bur\bre\be_\b_r\bre\bea\bas\bso\bon\bn () const;\n+ int const piece_size = m_files.piece_size2(piece);\n \n- static constexpr alert_category_t s\bst\bta\bat\bti\bic\bc_\b_c\bca\bat\bte\beg\bgo\bor\bry\by = alert_category::tracker\n-| alert_category::error;\n- int const times_in_row;\n- error_code const error;\n- operation_t op;\n- protocol_version version;\n-};\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b* f\bfa\bai\bil\blu\bur\bre\be_\b_r\bre\bea\bas\bso\bon\bn(\b()\b) *\b**\b**\b**\b**\b*\n-char const* f\bfa\bai\bil\blu\bur\bre\be_\b_r\bre\bea\bas\bso\bon\bn () const;\n-if the tracker sent a \"failure reason\" string, it will be returned here.\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n- times_in_row\n- This member says how many times in a row this tracker has failed.\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n- error\n- the error code indicating why the tracker announce failed. If it is is\n- lt::errors::tracker_failure the _\bf_\ba_\bi_\bl_\bu_\br_\be_\b__\br_\be_\ba_\bs_\bo_\bn_\b(_\b) might contain a more\n- detailed description of why the tracker rejected the request. HTTP status\n- codes indicating errors are also set in this field.\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n- version\n- the bittorrent protocol version that was announced\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b**\b* t\btr\bra\bac\bck\bke\ber\br_\b_w\bwa\bar\brn\bni\bin\bng\bg_\b_a\bal\ble\ber\brt\bt *\b**\b**\b**\b**\b**\b*\n-Declared in \"_\bl_\bi_\bb_\bt_\bo_\br_\br_\be_\bn_\bt_\b/_\ba_\bl_\be_\br_\bt_\b__\bt_\by_\bp_\be_\bs_\b._\bh_\bp_\bp\"\n-This _\ba_\bl_\be_\br_\bt is triggered if the tracker reply contains a warning field. Usually\n-this means that the tracker announce was successful, but the tracker has a\n-message to the client.\n-struct tracker_warning_alert final : tracker_alert\n-{\n- std::string m\bme\bes\bss\bsa\bag\bge\be () const override;\n- char const* w\bwa\bar\brn\bni\bin\bng\bg_\b_m\bme\bes\bss\bsa\bag\bge\be () const;\n+ std::ptrdiff_t const len = std::min(lt::default_block_size, piece_size -\n+offset);\n \n- static constexpr alert_category_t s\bst\bta\bat\bti\bic\bc_\b_c\bca\bat\bte\beg\bgo\bor\bry\by = alert_category::tracker\n-| alert_category::error;\n- protocol_version version;\n-};\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b* w\bwa\bar\brn\bni\bin\bng\bg_\b_m\bme\bes\bss\bsa\bag\bge\be(\b()\b) *\b**\b**\b**\b**\b*\n-char const* w\bwa\bar\brn\bni\bin\bng\bg_\b_m\bme\bes\bss\bsa\bag\bge\be () const;\n-the message associated with this warning\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n- version\n- the bittorrent protocol version that was announced\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b**\b* s\bsc\bcr\bra\bap\bpe\be_\b_r\bre\bep\bpl\bly\by_\b_a\bal\ble\ber\brt\bt *\b**\b**\b**\b**\b**\b*\n-Declared in \"_\bl_\bi_\bb_\bt_\bo_\br_\br_\be_\bn_\bt_\b/_\ba_\bl_\be_\br_\bt_\b__\bt_\by_\bp_\be_\bs_\b._\bh_\bp_\bp\"\n-This _\ba_\bl_\be_\br_\bt is generated when a scrape request succeeds.\n-struct scrape_reply_alert final : tracker_alert\n-{\n- std::string m\bme\bes\bss\bsa\bag\bge\be () const override;\n+ lt::span b = {i->second.data() + offset, len};\n+ return lt::hasher256(b).final();\n+ }\n \n- static constexpr alert_category_t s\bst\bta\bat\bti\bic\bc_\b_c\bca\bat\bte\beg\bgo\bor\bry\by = alert_category::\n-tracker;\n- int const incomplete;\n- int const complete;\n- protocol_version version;\n-};\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n- incomplete complete\n- the data returned in the scrape response. These numbers may be -1 if the\n- response was malformed.\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n- version\n- the bittorrent protocol version that was scraped\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b**\b* s\bsc\bcr\bra\bap\bpe\be_\b_f\bfa\bai\bil\ble\bed\bd_\b_a\bal\ble\ber\brt\bt *\b**\b**\b**\b**\b**\b*\n-Declared in \"_\bl_\bi_\bb_\bt_\bo_\br_\br_\be_\bn_\bt_\b/_\ba_\bl_\be_\br_\bt_\b__\bt_\by_\bp_\be_\bs_\b._\bh_\bp_\bp\"\n-If a scrape request fails, this _\ba_\bl_\be_\br_\bt is generated. This might be due to the\n-tracker timing out, refusing connection or returning an http response code\n-indicating an error.\n-struct scrape_failed_alert final : tracker_alert\n-{\n- std::string m\bme\bes\bss\bsa\bag\bge\be () const override;\n- char const* e\ber\brr\bro\bor\br_\b_m\bme\bes\bss\bsa\bag\bge\be () const;\n+private:\n+ int piece_size(lt::piece_index_t piece) const\n+ {\n+ int const num_pieces = static_cast((m_files.total_size() +\n+m_files.piece_length() - 1) / m_files.piece_length());\n+ return static_cast(piece) < num_pieces - 1\n+ ? m_files.piece_length() : static_cast(m_files.total_size() - std::\n+int64_t(num_pieces - 1) * m_files.piece_length());\n+ }\n \n- static constexpr alert_category_t s\bst\bta\bat\bti\bic\bc_\b_c\bca\bat\bte\beg\bgo\bor\bry\by = alert_category::tracker\n-| alert_category::error;\n- error_code const error;\n- protocol_version version;\n+ lt::file_storage const& m_files;\n+ std::map> m_file_data;\n };\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b* e\ber\brr\bro\bor\br_\b_m\bme\bes\bss\bsa\bag\bge\be(\b()\b) *\b**\b**\b**\b**\b*\n-char const* e\ber\brr\bro\bor\br_\b_m\bme\bes\bss\bsa\bag\bge\be () const;\n-if the error indicates there is an associated message, this returns that\n-message. Otherwise and empty string.\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n- error\n- the error itself. This may indicate that the tracker sent an error\n- message (error::tracker_failure), in which case it can be retrieved by\n- calling error_message().\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n- version\n- the bittorrent protocol version that was scraped\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b**\b* t\btr\bra\bac\bck\bke\ber\br_\b_r\bre\bep\bpl\bly\by_\b_a\bal\ble\ber\brt\bt *\b**\b**\b**\b**\b**\b*\n-Declared in \"_\bl_\bi_\bb_\bt_\bo_\br_\br_\be_\bn_\bt_\b/_\ba_\bl_\be_\br_\bt_\b__\bt_\by_\bp_\be_\bs_\b._\bh_\bp_\bp\"\n-This _\ba_\bl_\be_\br_\bt is only for informational purpose. It is generated when a tracker\n-announce succeeds. It is generated regardless what kind of tracker was used, be\n-it UDP, HTTP or the DHT.\n-struct tracker_reply_alert final : tracker_alert\n-{\n- std::string m\bme\bes\bss\bsa\bag\bge\be () const override;\n \n- static constexpr alert_category_t s\bst\bta\bat\bti\bic\bc_\b_c\bca\bat\bte\beg\bgo\bor\bry\by = alert_category::\n-tracker;\n- int const num_peers;\n- protocol_version version;\n-};\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n- num_peers\n- tells how many peers the tracker returned in this response. This is not\n- expected to be greater than the num_want settings. These are not\n- necessarily all new peers, some of them may already be connected.\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n- version\n- the bittorrent protocol version that was announced\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b**\b* d\bdh\bht\bt_\b_r\bre\bep\bpl\bly\by_\b_a\bal\ble\ber\brt\bt *\b**\b**\b**\b**\b**\b*\n-Declared in \"_\bl_\bi_\bb_\bt_\bo_\br_\br_\be_\bn_\bt_\b/_\ba_\bl_\be_\br_\bt_\b__\bt_\by_\bp_\be_\bs_\b._\bh_\bp_\bp\"\n-This _\ba_\bl_\be_\br_\bt is generated each time the DHT receives peers from a node. num_peers\n-is the number of peers we received in this packet. Typically these packets are\n-received from multiple DHT nodes, and so the alerts are typically generated a\n-few at a time.\n-struct dht_reply_alert final : tracker_alert\n+lt::storage_index_t pop(std::vector& q)\n {\n- std::string m\bme\bes\bss\bsa\bag\bge\be () const override;\n+ TORRENT_ASSERT(!q.empty());\n+ lt::storage_index_t const ret = q.back();\n+ q.pop_back();\n+ return ret;\n+}\n \n- static constexpr alert_category_t s\bst\bta\bat\bti\bic\bc_\b_c\bca\bat\bte\beg\bgo\bor\bry\by = alert_category::dht |\n-alert_category::tracker;\n- int const num_peers;\n-};\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b**\b* t\btr\bra\bac\bck\bke\ber\br_\b_a\ban\bnn\bno\bou\bun\bnc\bce\be_\b_a\bal\ble\ber\brt\bt *\b**\b**\b**\b**\b**\b*\n-Declared in \"_\bl_\bi_\bb_\bt_\bo_\br_\br_\be_\bn_\bt_\b/_\ba_\bl_\be_\br_\bt_\b__\bt_\by_\bp_\be_\bs_\b._\bh_\bp_\bp\"\n-This _\ba_\bl_\be_\br_\bt is generated each time a tracker announce is sent (or attempted to\n-be sent). There are no extra data members in this _\ba_\bl_\be_\br_\bt. The url can be found\n-in the base class however.\n-struct tracker_announce_alert final : tracker_alert\n+struct temp_disk_io final : lt::disk_interface\n+ , lt::buffer_allocator_interface\n {\n- std::string m\bme\bes\bss\bsa\bag\bge\be () const override;\n+ explicit temp_disk_io(lt::io_context& ioc): m_ioc(ioc) {}\n \n- static constexpr alert_category_t s\bst\bta\bat\bti\bic\bc_\b_c\bca\bat\bte\beg\bgo\bor\bry\by = alert_category::\n-tracker;\n- event_t const event;\n- protocol_version version;\n-};\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n- event\n- specifies what event was sent to the tracker. See _\be_\bv_\be_\bn_\bt_\b__\bt.\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n- version\n- the bittorrent protocol version that is announced\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b**\b* h\bha\bas\bsh\bh_\b_f\bfa\bai\bil\ble\bed\bd_\b_a\bal\ble\ber\brt\bt *\b**\b**\b**\b**\b**\b*\n-Declared in \"_\bl_\bi_\bb_\bt_\bo_\br_\br_\be_\bn_\bt_\b/_\ba_\bl_\be_\br_\bt_\b__\bt_\by_\bp_\be_\bs_\b._\bh_\bp_\bp\"\n-This _\ba_\bl_\be_\br_\bt is generated when a finished piece fails its hash check. You can get\n-the handle to the torrent which got the failed piece and the index of the piece\n-itself from the _\ba_\bl_\be_\br_\bt.\n-struct hash_failed_alert final : torrent_alert\n-{\n- std::string m\bme\bes\bss\bsa\bag\bge\be () const override;\n+ void settings_updated() override {}\n \n- static constexpr alert_category_t s\bst\bta\bat\bti\bic\bc_\b_c\bca\bat\bte\beg\bgo\bor\bry\by = alert_category::status;\n- piece_index_t const piece_index;\n-};\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b**\b* p\bpe\bee\ber\br_\b_b\bba\ban\bn_\b_a\bal\ble\ber\brt\bt *\b**\b**\b**\b**\b**\b*\n-Declared in \"_\bl_\bi_\bb_\bt_\bo_\br_\br_\be_\bn_\bt_\b/_\ba_\bl_\be_\br_\bt_\b__\bt_\by_\bp_\be_\bs_\b._\bh_\bp_\bp\"\n-This _\ba_\bl_\be_\br_\bt is generated when a peer is banned because it has sent too many\n-corrupt pieces to us. ip is the endpoint to the peer that was banned.\n-struct peer_ban_alert final : peer_alert\n-{\n- std::string m\bme\bes\bss\bsa\bag\bge\be () const override;\n+ lt::storage_holder new_torrent(lt::storage_params const& params\n+ , std::shared_ptr const&) override\n+ {\n+ lt::storage_index_t const idx = m_free_slots.empty()\n+ ? m_torrents.end_index()\n+ : pop(m_free_slots);\n+ auto storage = std::make_unique(params.files);\n+ if (idx == m_torrents.end_index()) m_torrents.emplace_back(std::move\n+(storage));\n+ else m_torrents[idx] = std::move(storage);\n+ return lt::storage_holder(idx, *this);\n+ }\n \n- static constexpr alert_category_t s\bst\bta\bat\bti\bic\bc_\b_c\bca\bat\bte\beg\bgo\bor\bry\by = alert_category::peer;\n-};\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b**\b* p\bpe\bee\ber\br_\b_u\bun\bns\bsn\bnu\bub\bbb\bbe\bed\bd_\b_a\bal\ble\ber\brt\bt *\b**\b**\b**\b**\b**\b*\n-Declared in \"_\bl_\bi_\bb_\bt_\bo_\br_\br_\be_\bn_\bt_\b/_\ba_\bl_\be_\br_\bt_\b__\bt_\by_\bp_\be_\bs_\b._\bh_\bp_\bp\"\n-This _\ba_\bl_\be_\br_\bt is generated when a peer is un-snubbed. Essentially when it was\n-snubbed for stalling sending data, and now it started sending data again.\n-struct peer_unsnubbed_alert final : peer_alert\n-{\n- std::string m\bme\bes\bss\bsa\bag\bge\be () const override;\n+ void remove_torrent(lt::storage_index_t const idx) override\n+ {\n+ m_torrents[idx].reset();\n+ m_free_slots.push_back(idx);\n+ }\n \n- static constexpr alert_category_t s\bst\bta\bat\bti\bic\bc_\b_c\bca\bat\bte\beg\bgo\bor\bry\by = alert_category::peer;\n-};\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b**\b* p\bpe\bee\ber\br_\b_s\bsn\bnu\bub\bbb\bbe\bed\bd_\b_a\bal\ble\ber\brt\bt *\b**\b**\b**\b**\b**\b*\n-Declared in \"_\bl_\bi_\bb_\bt_\bo_\br_\br_\be_\bn_\bt_\b/_\ba_\bl_\be_\br_\bt_\b__\bt_\by_\bp_\be_\bs_\b._\bh_\bp_\bp\"\n-This _\ba_\bl_\be_\br_\bt is generated when a peer is snubbed, when it stops sending data when\n-we request it.\n-struct peer_snubbed_alert final : peer_alert\n-{\n- std::string m\bme\bes\bss\bsa\bag\bge\be () const override;\n+ void abort(bool) override {}\n \n- static constexpr alert_category_t s\bst\bta\bat\bti\bic\bc_\b_c\bca\bat\bte\beg\bgo\bor\bry\by = alert_category::peer;\n-};\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b**\b* p\bpe\bee\ber\br_\b_e\ber\brr\bro\bor\br_\b_a\bal\ble\ber\brt\bt *\b**\b**\b**\b**\b**\b*\n-Declared in \"_\bl_\bi_\bb_\bt_\bo_\br_\br_\be_\bn_\bt_\b/_\ba_\bl_\be_\br_\bt_\b__\bt_\by_\bp_\be_\bs_\b._\bh_\bp_\bp\"\n-This _\ba_\bl_\be_\br_\bt is generated when a peer sends invalid data over the peer-peer\n-protocol. The peer will be disconnected, but you get its ip address from the\n-_\ba_\bl_\be_\br_\bt, to identify it.\n-struct peer_error_alert final : peer_alert\n-{\n- std::string m\bme\bes\bss\bsa\bag\bge\be () const override;\n+ void async_read(lt::storage_index_t storage, lt::peer_request const& r\n+ , std::function handler\n+ , lt::disk_job_flags_t) override\n+ {\n+ // this buffer is owned by the storage. It will remain valid for as\n+ // long as the torrent remains in the session. We don't need any lifetime\n+ // management of it.\n+ lt::storage_error error;\n+ lt::span b = m_torrents[storage]->readv(r, error);\n \n- static constexpr alert_category_t s\bst\bta\bat\bti\bic\bc_\b_c\bca\bat\bte\beg\bgo\bor\bry\by = alert_category::peer;\n- operation_t op;\n- error_code const error;\n-};\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n- op\n- a 0-terminated string of the low-level operation that failed, or nullptr\n- if there was no low level disk operation.\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n- error\n- tells you what error caused this _\ba_\bl_\be_\br_\bt.\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b**\b* p\bpe\bee\ber\br_\b_c\bco\bon\bnn\bne\bec\bct\bt_\b_a\bal\ble\ber\brt\bt *\b**\b**\b**\b**\b**\b*\n-Declared in \"_\bl_\bi_\bb_\bt_\bo_\br_\br_\be_\bn_\bt_\b/_\ba_\bl_\be_\br_\bt_\b__\bt_\by_\bp_\be_\bs_\b._\bh_\bp_\bp\"\n-This _\ba_\bl_\be_\br_\bt is posted every time an incoming peer connection both successfully\n-passes the protocol handshake and is associated with a torrent, or an outgoing\n-peer connection attempt succeeds. For arbitrary incoming connections, see\n-_\bi_\bn_\bc_\bo_\bm_\bi_\bn_\bg_\b__\bc_\bo_\bn_\bn_\be_\bc_\bt_\bi_\bo_\bn_\b__\ba_\bl_\be_\br_\bt.\n-struct peer_connect_alert final : peer_alert\n-{\n- std::string m\bme\bes\bss\bsa\bag\bge\be () const override;\n+ post(m_ioc, [handler, error, b, this]\n+ { handler(lt::disk_buffer_holder(*this, const_cast(b.data()), int\n+(b.size())), error); });\n+ }\n \n- enum direction_t\n- {\n- in,\n- out,\n- };\n+ bool async_write(lt::storage_index_t storage, lt::peer_request const& r\n+ , char const* buf, std::shared_ptr\n+ , std::function handler\n+ , lt::disk_job_flags_t) override\n+ {\n+ lt::span const b = { buf, r.length };\n \n- static constexpr alert_category_t s\bst\bta\bat\bti\bic\bc_\b_c\bca\bat\bte\beg\bgo\bor\bry\by = alert_category::\n-connect;\n- direction_t direction;\n- socket_type_t socket_type;\n-};\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b* e\ben\bnu\bum\bm d\bdi\bir\bre\bec\bct\bti\bio\bon\bn_\b_t\bt *\b**\b**\b**\b**\b*\n-Declared in \"_\bl_\bi_\bb_\bt_\bo_\br_\br_\be_\bn_\bt_\b/_\ba_\bl_\be_\br_\bt_\b__\bt_\by_\bp_\be_\bs_\b._\bh_\bp_\bp\"\n- _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b \n-|_\bn\bn_\ba\ba_\bm\bm_\be\be_\b|_\bv\bv_\ba\ba_\bl\bl_\bu\bu_\be\be_\b|_\bd\bd_\be\be_\bs\bs_\bc\bc_\br\br_\bi\bi_\bp\bp_\bt\bt_\bi\bi_\bo\bo_\bn\bn|\n-|_\bi_\bn_\b _\b _\b|_\b0_\b _\b _\b _\b _\b|_\b\u00a0_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|_\bo_\bu_\bt_\b _\b|_\b1_\b _\b _\b _\b _\b|_\b\u00a0_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n- direction\n- Tells you if the peer was incoming or outgoing\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b**\b* p\bpe\bee\ber\br_\b_d\bdi\bis\bsc\bco\bon\bnn\bne\bec\bct\bte\bed\bd_\b_a\bal\ble\ber\brt\bt *\b**\b**\b**\b**\b**\b*\n-Declared in \"_\bl_\bi_\bb_\bt_\bo_\br_\br_\be_\bn_\bt_\b/_\ba_\bl_\be_\br_\bt_\b__\bt_\by_\bp_\be_\bs_\b._\bh_\bp_\bp\"\n-This _\ba_\bl_\be_\br_\bt is generated when a peer is disconnected for any reason (other than\n-the ones covered by _\bp_\be_\be_\br_\b__\be_\br_\br_\bo_\br_\b__\ba_\bl_\be_\br_\bt ).\n-struct peer_disconnected_alert final : peer_alert\n-{\n- std::string m\bme\bes\bss\bsa\bag\bge\be () const override;\n+ m_torrents[storage]->writev(b, r.piece, r.start);\n \n- static constexpr alert_category_t s\bst\bta\bat\bti\bic\bc_\b_c\bca\bat\bte\beg\bgo\bor\bry\by = alert_category::\n-connect;\n- socket_type_t const socket_type;\n- operation_t const op;\n- error_code const error;\n- close_reason_t const reason;\n-};\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n- socket_type\n- the kind of socket this peer was connected over\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n- op\n- the operation or level where the error occurred. Specified as an value\n- from the _\bo_\bp_\be_\br_\ba_\bt_\bi_\bo_\bn_\b__\bt enum. Defined in operations.hpp.\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n- error\n- tells you what error caused peer to disconnect.\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n- reason\n- the reason the peer disconnected (if specified)\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b**\b* i\bin\bnv\bva\bal\bli\bid\bd_\b_r\bre\beq\bqu\bue\bes\bst\bt_\b_a\bal\ble\ber\brt\bt *\b**\b**\b**\b**\b**\b*\n-Declared in \"_\bl_\bi_\bb_\bt_\bo_\br_\br_\be_\bn_\bt_\b/_\ba_\bl_\be_\br_\bt_\b__\bt_\by_\bp_\be_\bs_\b._\bh_\bp_\bp\"\n-This is a debug _\ba_\bl_\be_\br_\bt that is generated by an incoming invalid piece request.\n-ip is the address of the peer and the request is the actual incoming request\n-from the peer. See _\bp_\be_\be_\br_\b__\br_\be_\bq_\bu_\be_\bs_\bt for more info.\n-struct invalid_request_alert final : peer_alert\n-{\n- std::string m\bme\bes\bss\bsa\bag\bge\be () const override;\n+ post(m_ioc, [=]{ handler(lt::storage_error()); });\n+ return false;\n+ }\n \n- static constexpr alert_category_t s\bst\bta\bat\bti\bic\bc_\b_c\bca\bat\bte\beg\bgo\bor\bry\by = alert_category::peer;\n- peer_request const request;\n- bool const we_have;\n- bool const peer_interested;\n- bool const withheld;\n-};\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n- request\n- the request we received from the peer\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n- we_have\n- true if we have this piece\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n- peer_interested\n- true if the peer indicated that it was interested to download before\n- sending the request\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n- withheld\n- if this is true, the peer is not allowed to download this piece because\n- of super-seeding rules.\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b**\b* t\bto\bor\brr\bre\ben\bnt\bt_\b_f\bfi\bin\bni\bis\bsh\bhe\bed\bd_\b_a\bal\ble\ber\brt\bt *\b**\b**\b**\b**\b**\b*\n-Declared in \"_\bl_\bi_\bb_\bt_\bo_\br_\br_\be_\bn_\bt_\b/_\ba_\bl_\be_\br_\bt_\b__\bt_\by_\bp_\be_\bs_\b._\bh_\bp_\bp\"\n-This _\ba_\bl_\be_\br_\bt is generated when a torrent switches from being a downloader to a\n-seed. It will only be generated once per torrent. It contains a _\bt_\bo_\br_\br_\be_\bn_\bt_\b__\bh_\ba_\bn_\bd_\bl_\be\n-to the torrent in question.\n-struct torrent_finished_alert final : torrent_alert\n-{\n- std::string m\bme\bes\bss\bsa\bag\bge\be () const override;\n+ void async_hash(lt::storage_index_t storage, lt::piece_index_t const piece\n+ , lt::span block_hashes, lt::disk_job_flags_t\n+ , std::function handler) override\n+ {\n+ lt::storage_error error;\n+ lt::sha1_hash const hash = m_torrents[storage]->hash(piece, block_hashes,\n+error);\n+ post(m_ioc, [=]{ handler(piece, hash, error); });\n+ }\n \n- static constexpr alert_category_t s\bst\bta\bat\bti\bic\bc_\b_c\bca\bat\bte\beg\bgo\bor\bry\by = alert_category::status;\n-};\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b**\b* p\bpi\bie\bec\bce\be_\b_f\bfi\bin\bni\bis\bsh\bhe\bed\bd_\b_a\bal\ble\ber\brt\bt *\b**\b**\b**\b**\b**\b*\n-Declared in \"_\bl_\bi_\bb_\bt_\bo_\br_\br_\be_\bn_\bt_\b/_\ba_\bl_\be_\br_\bt_\b__\bt_\by_\bp_\be_\bs_\b._\bh_\bp_\bp\"\n-this _\ba_\bl_\be_\br_\bt is posted every time a piece completes downloading and passes the\n-hash check. This _\ba_\bl_\be_\br_\bt derives from _\bt_\bo_\br_\br_\be_\bn_\bt_\b__\ba_\bl_\be_\br_\bt which contains the\n-_\bt_\bo_\br_\br_\be_\bn_\bt_\b__\bh_\ba_\bn_\bd_\bl_\be to the torrent the piece belongs to. Note that being downloaded\n-and passing the hash check may happen before the piece is also fully flushed to\n-disk. So _\bt_\bo_\br_\br_\be_\bn_\bt_\b__\bh_\ba_\bn_\bd_\bl_\be_\b:_\b:_\bh_\ba_\bv_\be_\b__\bp_\bi_\be_\bc_\be_\b(_\b) may still return false\n-struct piece_finished_alert final : torrent_alert\n-{\n- std::string m\bme\bes\bss\bsa\bag\bge\be () const override;\n+ void async_hash2(lt::storage_index_t storage, lt::piece_index_t const piece\n+ , int const offset, lt::disk_job_flags_t\n+ , std::function handler) override\n+ {\n+ lt::storage_error error;\n+ lt::sha256_hash const hash = m_torrents[storage]->hash2(piece, offset,\n+error);\n+ post(m_ioc, [=]{ handler(piece, hash, error); });\n+ }\n \n- piece_index_t const piece_index;\n-};\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n- piece_index\n- the index of the piece that finished\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b**\b* r\bre\beq\bqu\bue\bes\bst\bt_\b_d\bdr\bro\bop\bpp\bpe\bed\bd_\b_a\bal\ble\ber\brt\bt *\b**\b**\b**\b**\b**\b*\n-Declared in \"_\bl_\bi_\bb_\bt_\bo_\br_\br_\be_\bn_\bt_\b/_\ba_\bl_\be_\br_\bt_\b__\bt_\by_\bp_\be_\bs_\b._\bh_\bp_\bp\"\n-This _\ba_\bl_\be_\br_\bt is generated when a peer rejects or ignores a piece request.\n-struct request_dropped_alert final : peer_alert\n-{\n- std::string m\bme\bes\bss\bsa\bag\bge\be () const override;\n+ void async_move_storage(lt::storage_index_t, std::string p, lt::move_flags_t\n+ , std::function handler) override\n+ {\n+ post(m_ioc, [=]{\n+ handler(lt::status_t::fatal_disk_error, p\n+ , lt::storage_error(lt::error_code(boost::system::errc::\n+operation_not_supported, lt::system_category())));\n+ });\n+ }\n \n- int const block_index;\n- piece_index_t const piece_index;\n-};\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b**\b* b\bbl\blo\boc\bck\bk_\b_t\bti\bim\bme\beo\bou\but\bt_\b_a\bal\ble\ber\brt\bt *\b**\b**\b**\b**\b**\b*\n-Declared in \"_\bl_\bi_\bb_\bt_\bo_\br_\br_\be_\bn_\bt_\b/_\ba_\bl_\be_\br_\bt_\b__\bt_\by_\bp_\be_\bs_\b._\bh_\bp_\bp\"\n-This _\ba_\bl_\be_\br_\bt is generated when a block request times out.\n-struct block_timeout_alert final : peer_alert\n-{\n- std::string m\bme\bes\bss\bsa\bag\bge\be () const override;\n+ void async_release_files(lt::storage_index_t, std::function) override\n+{}\n \n- int const block_index;\n- piece_index_t const piece_index;\n-};\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b**\b* b\bbl\blo\boc\bck\bk_\b_f\bfi\bin\bni\bis\bsh\bhe\bed\bd_\b_a\bal\ble\ber\brt\bt *\b**\b**\b**\b**\b**\b*\n-Declared in \"_\bl_\bi_\bb_\bt_\bo_\br_\br_\be_\bn_\bt_\b/_\ba_\bl_\be_\br_\bt_\b__\bt_\by_\bp_\be_\bs_\b._\bh_\bp_\bp\"\n-This _\ba_\bl_\be_\br_\bt is generated when a block request receives a response.\n-struct block_finished_alert final : peer_alert\n-{\n- std::string m\bme\bes\bss\bsa\bag\bge\be () const override;\n+ void async_delete_files(lt::storage_index_t, lt::remove_flags_t\n+ , std::function handler) override\n+ {\n+ post(m_ioc, [=]{ handler(lt::storage_error()); });\n+ }\n \n- int const block_index;\n- piece_index_t const piece_index;\n-};\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b**\b* b\bbl\blo\boc\bck\bk_\b_d\bdo\bow\bwn\bnl\blo\boa\bad\bdi\bin\bng\bg_\b_a\bal\ble\ber\brt\bt *\b**\b**\b**\b**\b**\b*\n-Declared in \"_\bl_\bi_\bb_\bt_\bo_\br_\br_\be_\bn_\bt_\b/_\ba_\bl_\be_\br_\bt_\b__\bt_\by_\bp_\be_\bs_\b._\bh_\bp_\bp\"\n-This _\ba_\bl_\be_\br_\bt is generated when a block request is sent to a peer.\n-struct block_downloading_alert final : peer_alert\n-{\n- std::string m\bme\bes\bss\bsa\bag\bge\be () const override;\n+ void async_check_files(lt::storage_index_t\n+ , lt::add_torrent_params const*\n+ , lt::aux::vector\n+ , std::function handler)\n+override\n+ {\n+ post(m_ioc, [=]{ handler(lt::status_t::no_error, lt::storage_error()); });\n+ }\n \n- int const block_index;\n- piece_index_t const piece_index;\n-};\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b**\b* u\bun\bnw\bwa\ban\bnt\bte\bed\bd_\b_b\bbl\blo\boc\bck\bk_\b_a\bal\ble\ber\brt\bt *\b**\b**\b**\b**\b**\b*\n-Declared in \"_\bl_\bi_\bb_\bt_\bo_\br_\br_\be_\bn_\bt_\b/_\ba_\bl_\be_\br_\bt_\b__\bt_\by_\bp_\be_\bs_\b._\bh_\bp_\bp\"\n-This _\ba_\bl_\be_\br_\bt is generated when a block is received that was not requested or\n-whose request timed out.\n-struct unwanted_block_alert final : peer_alert\n-{\n- std::string m\bme\bes\bss\bsa\bag\bge\be () const override;\n+ void async_rename_file(lt::storage_index_t\n+ , lt::file_index_t const idx\n+ , std::string const name\n+ , std::function handler) override\n+ {\n+ post(m_ioc, [=]{ handler(name, idx, lt::storage_error()); });\n+ }\n \n- static constexpr alert_category_t s\bst\bta\bat\bti\bic\bc_\b_c\bca\bat\bte\beg\bgo\bor\bry\by = alert_category::peer;\n- int const block_index;\n- piece_index_t const piece_index;\n-};\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b**\b* s\bst\bto\bor\bra\bag\bge\be_\b_m\bmo\bov\bve\bed\bd_\b_a\bal\ble\ber\brt\bt *\b**\b**\b**\b**\b**\b*\n-Declared in \"_\bl_\bi_\bb_\bt_\bo_\br_\br_\be_\bn_\bt_\b/_\ba_\bl_\be_\br_\bt_\b__\bt_\by_\bp_\be_\bs_\b._\bh_\bp_\bp\"\n-The storage_moved_alert is generated when all the disk IO has completed and the\n-files have been moved, as an effect of a call to torrent_handle::move_storage.\n-This is useful to synchronize with the actual disk. The storage_path() member\n-return the new path of the storage.\n-struct storage_moved_alert final : torrent_alert\n-{\n- std::string m\bme\bes\bss\bsa\bag\bge\be () const override;\n- char const* o\bol\bld\bd_\b_p\bpa\bat\bth\bh () const;\n- char const* s\bst\bto\bor\bra\bag\bge\be_\b_p\bpa\bat\bth\bh () const;\n+ void async_stop_torrent(lt::storage_index_t, std::function handler)\n+override\n+ {\n+ post(m_ioc, handler);\n+ }\n \n- static constexpr alert_category_t s\bst\bta\bat\bti\bic\bc_\b_c\bca\bat\bte\beg\bgo\bor\bry\by = alert_category::\n-storage;\n-};\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b* s\bst\bto\bor\bra\bag\bge\be_\b_p\bpa\bat\bth\bh(\b()\b) o\bol\bld\bd_\b_p\bpa\bat\bth\bh(\b()\b) *\b**\b**\b**\b**\b*\n-char const* o\bol\bld\bd_\b_p\bpa\bat\bth\bh () const;\n-char const* s\bst\bto\bor\bra\bag\bge\be_\b_p\bpa\bat\bth\bh () const;\n-the path the torrent was moved to and from, respectively.\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b**\b* s\bst\bto\bor\bra\bag\bge\be_\b_m\bmo\bov\bve\bed\bd_\b_f\bfa\bai\bil\ble\bed\bd_\b_a\bal\ble\ber\brt\bt *\b**\b**\b**\b**\b**\b*\n-Declared in \"_\bl_\bi_\bb_\bt_\bo_\br_\br_\be_\bn_\bt_\b/_\ba_\bl_\be_\br_\bt_\b__\bt_\by_\bp_\be_\bs_\b._\bh_\bp_\bp\"\n-The storage_moved_failed_alert is generated when an attempt to move the\n-storage, via _\bt_\bo_\br_\br_\be_\bn_\bt_\b__\bh_\ba_\bn_\bd_\bl_\be_\b:_\b:_\bm_\bo_\bv_\be_\b__\bs_\bt_\bo_\br_\ba_\bg_\be_\b(_\b), fails.\n-struct storage_moved_failed_alert final : torrent_alert\n-{\n- std::string m\bme\bes\bss\bsa\bag\bge\be () const override;\n- char const* f\bfi\bil\ble\be_\b_p\bpa\bat\bth\bh () const;\n+ void async_set_file_priority(lt::storage_index_t\n+ , lt::aux::vector prio\n+ , std::function)> handler)\n+override\n+ {\n+ post(m_ioc, [=]{\n+ handler(lt::storage_error(lt::error_code(\n+ boost::system::errc::operation_not_supported, lt::system_category())),\n+std::move(prio));\n+ });\n+ }\n \n- static constexpr alert_category_t s\bst\bta\bat\bti\bic\bc_\b_c\bca\bat\bte\beg\bgo\bor\bry\by = alert_category::\n-storage;\n- error_code const error;\n- operation_t op;\n-};\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b* f\bfi\bil\ble\be_\b_p\bpa\bat\bth\bh(\b()\b) *\b**\b**\b**\b**\b*\n-char const* f\bfi\bil\ble\be_\b_p\bpa\bat\bth\bh () const;\n-If the error happened for a specific file, this returns its path.\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n- op\n- this indicates what underlying operation caused the error\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b**\b* t\bto\bor\brr\bre\ben\bnt\bt_\b_d\bde\bel\ble\bet\bte\bed\bd_\b_a\bal\ble\ber\brt\bt *\b**\b**\b**\b**\b**\b*\n-Declared in \"_\bl_\bi_\bb_\bt_\bo_\br_\br_\be_\bn_\bt_\b/_\ba_\bl_\be_\br_\bt_\b__\bt_\by_\bp_\be_\bs_\b._\bh_\bp_\bp\"\n-This _\ba_\bl_\be_\br_\bt is generated when a request to delete the files of a torrent\n-complete.\n-This _\ba_\bl_\be_\br_\bt is posted in the alert_category::storage category, and that bit\n-needs to be set in the alert_mask.\n-struct torrent_deleted_alert final : torrent_alert\n-{\n- std::string m\bme\bes\bss\bsa\bag\bge\be () const override;\n+ void async_clear_piece(lt::storage_index_t, lt::piece_index_t index\n+ , std::function handler) override\n+ {\n+ post(m_ioc, [=]{ handler(index); });\n+ }\n \n- static constexpr alert_category_t s\bst\bta\bat\bti\bic\bc_\b_c\bca\bat\bte\beg\bgo\bor\bry\by = alert_category::\n-storage;\n- info_hash_t info_hashes;\n-};\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n- info_hashes\n- The info-hash of the torrent that was just deleted. Most of the time the\n- _\bt_\bo_\br_\br_\be_\bn_\bt_\b__\bh_\ba_\bn_\bd_\bl_\be in the torrent_alert will be invalid by the time this\n- _\ba_\bl_\be_\br_\bt arrives, since the torrent is being deleted. The info_hashes member\n- is hence the main way of identifying which torrent just completed the\n- delete.\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b**\b* t\bto\bor\brr\bre\ben\bnt\bt_\b_d\bde\bel\ble\bet\bte\be_\b_f\bfa\bai\bil\ble\bed\bd_\b_a\bal\ble\ber\brt\bt *\b**\b**\b**\b**\b**\b*\n-Declared in \"_\bl_\bi_\bb_\bt_\bo_\br_\br_\be_\bn_\bt_\b/_\ba_\bl_\be_\br_\bt_\b__\bt_\by_\bp_\be_\bs_\b._\bh_\bp_\bp\"\n-This _\ba_\bl_\be_\br_\bt is generated when a request to delete the files of a torrent fails.\n-Just removing a torrent from the _\bs_\be_\bs_\bs_\bi_\bo_\bn cannot fail\n-struct torrent_delete_failed_alert final : torrent_alert\n-{\n- std::string m\bme\bes\bss\bsa\bag\bge\be () const override;\n+ // implements buffer_allocator_interface\n+ void free_disk_buffer(char*) override\n+ {\n+ // never free any buffer. We only return buffers owned by the storage\n+ // object\n+ }\n \n- static constexpr alert_category_t s\bst\bta\bat\bti\bic\bc_\b_c\bca\bat\bte\beg\bgo\bor\bry\by = alert_category::storage\n- | alert_category::error;\n- error_code const error;\n- info_hash_t info_hashes;\n-};\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n- error\n- tells you why it failed.\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n- info_hashes\n- the info hash of the torrent whose files failed to be deleted\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b**\b* s\bsa\bav\bve\be_\b_r\bre\bes\bsu\bum\bme\be_\b_d\bda\bat\bta\ba_\b_a\bal\ble\ber\brt\bt *\b**\b**\b**\b**\b**\b*\n-Declared in \"_\bl_\bi_\bb_\bt_\bo_\br_\br_\be_\bn_\bt_\b/_\ba_\bl_\be_\br_\bt_\b__\bt_\by_\bp_\be_\bs_\b._\bh_\bp_\bp\"\n-This _\ba_\bl_\be_\br_\bt is generated as a response to a torrent_handle::save_resume_data\n-request. It is generated once the disk IO thread is done writing the state for\n-this torrent.\n-struct save_resume_data_alert final : torrent_alert\n-{\n- std::string m\bme\bes\bss\bsa\bag\bge\be () const override;\n+ void update_stats_counters(lt::counters&) const override {}\n \n- static constexpr alert_category_t s\bst\bta\bat\bti\bic\bc_\b_c\bca\bat\bte\beg\bgo\bor\bry\by = alert_category::\n-storage;\n- add_torrent_params params;\n-};\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n- params\n- the params object is populated with the torrent file whose resume data\n- was saved. It is suitable to be:\n- * added to a _\bs_\be_\bs_\bs_\bi_\bo_\bn with _\ba_\bd_\bd_\b__\bt_\bo_\br_\br_\be_\bn_\bt_\b(_\b) or _\ba_\bs_\by_\bn_\bc_\b__\ba_\bd_\bd_\b__\bt_\bo_\br_\br_\be_\bn_\bt_\b(_\b)\n- * saved to disk with _\bw_\br_\bi_\bt_\be_\b__\br_\be_\bs_\bu_\bm_\be_\b__\bd_\ba_\bt_\ba_\b(_\b)\n- * turned into a magnet link with _\bm_\ba_\bk_\be_\b__\bm_\ba_\bg_\bn_\be_\bt_\b__\bu_\br_\bi_\b(_\b)\n- * saved as a .torrent file with _\bw_\br_\bi_\bt_\be_\b__\bt_\bo_\br_\br_\be_\bn_\bt_\b__\bf_\bi_\bl_\be_\b(_\b)\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b**\b* s\bsa\bav\bve\be_\b_r\bre\bes\bsu\bum\bme\be_\b_d\bda\bat\bta\ba_\b_f\bfa\bai\bil\ble\bed\bd_\b_a\bal\ble\ber\brt\bt *\b**\b**\b**\b**\b**\b*\n-Declared in \"_\bl_\bi_\bb_\bt_\bo_\br_\br_\be_\bn_\bt_\b/_\ba_\bl_\be_\br_\bt_\b__\bt_\by_\bp_\be_\bs_\b._\bh_\bp_\bp\"\n-This _\ba_\bl_\be_\br_\bt is generated instead of save_resume_data_alert if there was an error\n-generating the resume data. error describes what went wrong.\n-struct save_resume_data_failed_alert final : torrent_alert\n-{\n- std::string m\bme\bes\bss\bsa\bag\bge\be () const override;\n+ std::vector get_status(lt::storage_index_t) const\n+override\n+ { return {}; }\n \n- static constexpr alert_category_t s\bst\bta\bat\bti\bic\bc_\b_c\bca\bat\bte\beg\bgo\bor\bry\by = alert_category::storage\n- | alert_category::error;\n- error_code const error;\n-};\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n- error\n- the error code from the resume_data failure\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b**\b* t\bto\bor\brr\bre\ben\bnt\bt_\b_p\bpa\bau\bus\bse\bed\bd_\b_a\bal\ble\ber\brt\bt *\b**\b**\b**\b**\b**\b*\n-Declared in \"_\bl_\bi_\bb_\bt_\bo_\br_\br_\be_\bn_\bt_\b/_\ba_\bl_\be_\br_\bt_\b__\bt_\by_\bp_\be_\bs_\b._\bh_\bp_\bp\"\n-This _\ba_\bl_\be_\br_\bt is generated as a response to a torrent_handle::pause request. It is\n-generated once all disk IO is complete and the files in the torrent have been\n-closed. This is useful for synchronizing with the disk.\n-struct torrent_paused_alert final : torrent_alert\n-{\n- std::string m\bme\bes\bss\bsa\bag\bge\be () const override;\n+ void submit_jobs() override {}\n \n- static constexpr alert_category_t s\bst\bta\bat\bti\bic\bc_\b_c\bca\bat\bte\beg\bgo\bor\bry\by = alert_category::status;\n-};\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b**\b* t\bto\bor\brr\bre\ben\bnt\bt_\b_r\bre\bes\bsu\bum\bme\bed\bd_\b_a\bal\ble\ber\brt\bt *\b**\b**\b**\b**\b**\b*\n-Declared in \"_\bl_\bi_\bb_\bt_\bo_\br_\br_\be_\bn_\bt_\b/_\ba_\bl_\be_\br_\bt_\b__\bt_\by_\bp_\be_\bs_\b._\bh_\bp_\bp\"\n-This _\ba_\bl_\be_\br_\bt is generated as a response to a _\bt_\bo_\br_\br_\be_\bn_\bt_\b__\bh_\ba_\bn_\bd_\bl_\be_\b:_\b:_\br_\be_\bs_\bu_\bm_\be_\b(_\b) request. It\n-is generated when a torrent goes from a paused state to an active state.\n-struct torrent_resumed_alert final : torrent_alert\n-{\n- std::string m\bme\bes\bss\bsa\bag\bge\be () const override;\n+private:\n \n- static constexpr alert_category_t s\bst\bta\bat\bti\bic\bc_\b_c\bca\bat\bte\beg\bgo\bor\bry\by = alert_category::status;\n-};\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b**\b* t\bto\bor\brr\bre\ben\bnt\bt_\b_c\bch\bhe\bec\bck\bke\bed\bd_\b_a\bal\ble\ber\brt\bt *\b**\b**\b**\b**\b**\b*\n-Declared in \"_\bl_\bi_\bb_\bt_\bo_\br_\br_\be_\bn_\bt_\b/_\ba_\bl_\be_\br_\bt_\b__\bt_\by_\bp_\be_\bs_\b._\bh_\bp_\bp\"\n-This _\ba_\bl_\be_\br_\bt is posted when a torrent completes checking. i.e. when it\n-transitions out of the checking files state into a state where it is ready to\n-start downloading\n-struct torrent_checked_alert final : torrent_alert\n-{\n- std::string m\bme\bes\bss\bsa\bag\bge\be () const override;\n+ lt::aux::vector, lt::storage_index_t>\n+m_torrents;\n \n- static constexpr alert_category_t s\bst\bta\bat\bti\bic\bc_\b_c\bca\bat\bte\beg\bgo\bor\bry\by = alert_category::status;\n-};\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b**\b* u\bur\brl\bl_\b_s\bse\bee\bed\bd_\b_a\bal\ble\ber\brt\bt *\b**\b**\b**\b**\b**\b*\n-Declared in \"_\bl_\bi_\bb_\bt_\bo_\br_\br_\be_\bn_\bt_\b/_\ba_\bl_\be_\br_\bt_\b__\bt_\by_\bp_\be_\bs_\b._\bh_\bp_\bp\"\n-This _\ba_\bl_\be_\br_\bt is generated when a HTTP seed name lookup fails.\n-struct url_seed_alert final : torrent_alert\n-{\n- std::string m\bme\bes\bss\bsa\bag\bge\be () const override;\n- char const* s\bse\ber\brv\bve\ber\br_\b_u\bur\brl\bl () const;\n- char const* e\ber\brr\bro\bor\br_\b_m\bme\bes\bss\bsa\bag\bge\be () const;\n+ // slots that are unused in the m_torrents vector\n+ std::vector m_free_slots;\n \n- static constexpr alert_category_t s\bst\bta\bat\bti\bic\bc_\b_c\bca\bat\bte\beg\bgo\bor\bry\by = alert_category::peer |\n-alert_category::error;\n- error_code const error;\n+ // callbacks are posted on this\n+ lt::io_context& m_ioc;\n };\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b* s\bse\ber\brv\bve\ber\br_\b_u\bur\brl\bl(\b()\b) *\b**\b**\b**\b**\b*\n-char const* s\bse\ber\brv\bve\ber\br_\b_u\bur\brl\bl () const;\n-the URL the error is associated with\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b* e\ber\brr\bro\bor\br_\b_m\bme\bes\bss\bsa\bag\bge\be(\b()\b) *\b**\b**\b**\b**\b*\n-char const* e\ber\brr\bro\bor\br_\b_m\bme\bes\bss\bsa\bag\bge\be () const;\n-in case the web server sent an error message, this function returns it.\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n- error\n- the error the web seed encountered. If this is not set, the server sent\n- an error message, call error_message().\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b**\b* f\bfi\bil\ble\be_\b_e\ber\brr\bro\bor\br_\b_a\bal\ble\ber\brt\bt *\b**\b**\b**\b**\b**\b*\n-Declared in \"_\bl_\bi_\bb_\bt_\bo_\br_\br_\be_\bn_\bt_\b/_\ba_\bl_\be_\br_\bt_\b__\bt_\by_\bp_\be_\bs_\b._\bh_\bp_\bp\"\n-If the storage fails to read or write files that it needs access to, this _\ba_\bl_\be_\br_\bt\n-is generated and the torrent is paused.\n-struct file_error_alert final : torrent_alert\n-{\n- std::string m\bme\bes\bss\bsa\bag\bge\be () const override;\n- char const* f\bfi\bil\ble\ben\bna\bam\bme\be () const;\n \n- static constexpr alert_category_t s\bst\bta\bat\bti\bic\bc_\b_c\bca\bat\bte\beg\bgo\bor\bry\by = alert_category::status\n- | alert_category::storage;\n- error_code const error;\n- operation_t op;\n-};\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b* f\bfi\bil\ble\ben\bna\bam\bme\be(\b()\b) *\b**\b**\b**\b**\b*\n-char const* f\bfi\bil\ble\ben\bna\bam\bme\be () const;\n-the file that experienced the error\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n- error\n- the error code describing the error.\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n- op\n- indicates which underlying operation caused the error\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b**\b* m\bme\bet\bta\bad\bda\bat\bta\ba_\b_f\bfa\bai\bil\ble\bed\bd_\b_a\bal\ble\ber\brt\bt *\b**\b**\b**\b**\b**\b*\n-Declared in \"_\bl_\bi_\bb_\bt_\bo_\br_\br_\be_\bn_\bt_\b/_\ba_\bl_\be_\br_\bt_\b__\bt_\by_\bp_\be_\bs_\b._\bh_\bp_\bp\"\n-This _\ba_\bl_\be_\br_\bt is generated when the metadata has been completely received and the\n-info-hash failed to match it. i.e. the metadata that was received was corrupt.\n-libtorrent will automatically retry to fetch it in this case. This is only\n-relevant when running a torrent-less download, with the metadata extension\n-provided by libtorrent.\n-struct metadata_failed_alert final : torrent_alert\n+std::unique_ptr temp_disk_constructor(\n+ lt::io_context& ioc, lt::settings_interface const&, lt::counters&)\n {\n- std::string m\bme\bes\bss\bsa\bag\bge\be () const override;\n-\n- static constexpr alert_category_t s\bst\bta\bat\bti\bic\bc_\b_c\bca\bat\bte\beg\bgo\bor\bry\by = alert_category::error;\n- error_code const error;\n-};\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n- error\n- indicates what failed when parsing the metadata. This error is what's\n- returned from lazy_bdecode().\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b**\b* m\bme\bet\bta\bad\bda\bat\bta\ba_\b_r\bre\bec\bce\bei\biv\bve\bed\bd_\b_a\bal\ble\ber\brt\bt *\b**\b**\b**\b**\b**\b*\n-Declared in \"_\bl_\bi_\bb_\bt_\bo_\br_\br_\be_\bn_\bt_\b/_\ba_\bl_\be_\br_\bt_\b__\bt_\by_\bp_\be_\bs_\b._\bh_\bp_\bp\"\n-This _\ba_\bl_\be_\br_\bt is generated when the metadata has been completely received and the\n-torrent can start downloading. It is not generated on torrents that are started\n-with metadata, but only those that needs to download it from peers (when\n-utilizing the libtorrent extension).\n-There are no additional data members in this _\ba_\bl_\be_\br_\bt.\n-Typically, when receiving this _\ba_\bl_\be_\br_\bt, you would want to save the torrent file\n-in order to load it back up again when the _\bs_\be_\bs_\bs_\bi_\bo_\bn is restarted. Here's an\n-example snippet of code to do that:\n-torrent_handle h = alert->handle();\n-std::shared_ptr ti = h.torrent_file();\n-create_torrent ct(*ti);\n-entry te = ct.generate();\n-std::vector buffer;\n-bencode(std::back_inserter(buffer), te);\n-FILE* f = fopen((to_hex(ti->info_hashes().get_best().to_string()) +\n-\".torrent\").c_str(), \"wb+\");\n-if (f) {\n- fwrite(&buffer[0], 1, buffer.size(), f);\n- fclose(f);\n+ return std::make_unique(ioc);\n }\n-struct metadata_received_alert final : torrent_alert\n-{\n- std::string m\bme\bes\bss\bsa\bag\bge\be () const override;\n-\n- static constexpr alert_category_t s\bst\bta\bat\bti\bic\bc_\b_c\bca\bat\bte\beg\bgo\bor\bry\by = alert_category::status;\n-};\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b**\b* u\bud\bdp\bp_\b_e\ber\brr\bro\bor\br_\b_a\bal\ble\ber\brt\bt *\b**\b**\b**\b**\b**\b*\n-Declared in \"_\bl_\bi_\bb_\bt_\bo_\br_\br_\be_\bn_\bt_\b/_\ba_\bl_\be_\br_\bt_\b__\bt_\by_\bp_\be_\bs_\b._\bh_\bp_\bp\"\n-This _\ba_\bl_\be_\br_\bt is posted when there is an error on a UDP socket. The UDP sockets\n-are used for all uTP, DHT and UDP tracker traffic. They are global to the\n-_\bs_\be_\bs_\bs_\bi_\bo_\bn.\n-struct udp_error_alert final : alert\n-{\n- std::string m\bme\bes\bss\bsa\bag\bge\be () const override;\n-\n- static constexpr alert_category_t s\bst\bta\bat\bti\bic\bc_\b_c\bca\bat\bte\beg\bgo\bor\bry\by = alert_category::error;\n- aux::noexcept_movable endpoint;\n- operation_t operation;\n- error_code const error;\n-};\n [_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n- endpoint\n- the source address associated with the error (if any)\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n- operation\n- the operation that failed\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n- error\n- the error code describing the error\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b**\b* e\bex\bxt\bte\ber\brn\bna\bal\bl_\b_i\bip\bp_\b_a\bal\ble\ber\brt\bt *\b**\b**\b**\b**\b**\b*\n-Declared in \"_\bl_\bi_\bb_\bt_\bo_\br_\br_\be_\bn_\bt_\b/_\ba_\bl_\be_\br_\bt_\b__\bt_\by_\bp_\be_\bs_\b._\bh_\bp_\bp\"\n-Whenever libtorrent learns about the machines external IP, this _\ba_\bl_\be_\br_\bt is\n-generated. The external IP address can be acquired from the tracker (if it\n-supports that) or from peers that supports the extension protocol. The address\n-can be accessed through the external_address member.\n-struct external_ip_alert final : alert\n-{\n- std::string m\bme\bes\bss\bsa\bag\bge\be () const override;\n-\n- static constexpr alert_category_t s\bst\bta\bat\bti\bic\bc_\b_c\bca\bat\bte\beg\bgo\bor\bry\by = alert_category::status;\n- aux::noexcept_movable external_address;\n-};\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n- external_address\n- the IP address that is believed to be our external IP\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b**\b* l\bli\bis\bst\bte\ben\bn_\b_f\bfa\bai\bil\ble\bed\bd_\b_a\bal\ble\ber\brt\bt *\b**\b**\b**\b**\b**\b*\n-Declared in \"_\bl_\bi_\bb_\bt_\bo_\br_\br_\be_\bn_\bt_\b/_\ba_\bl_\be_\br_\bt_\b__\bt_\by_\bp_\be_\bs_\b._\bh_\bp_\bp\"\n-This _\ba_\bl_\be_\br_\bt is generated when none of the ports, given in the port range, to\n-_\bs_\be_\bs_\bs_\bi_\bo_\bn can be opened for listening. The listen_interface member is the\n-interface that failed, error is the error code describing the failure.\n-In the case an endpoint was created before generating the _\ba_\bl_\be_\br_\bt, it is\n-represented by address and port. The combinations of socket type and operation\n-in which such address and port are not valid are: accept - i2p accept - socks5\n-enum_if - tcp\n-libtorrent may sometimes try to listen on port 0, if all other ports failed.\n-Port 0 asks the operating system to pick a port that's free). If that fails you\n-may see a _\bl_\bi_\bs_\bt_\be_\bn_\b__\bf_\ba_\bi_\bl_\be_\bd_\b__\ba_\bl_\be_\br_\bt with port 0 even if you didn't ask to listen on\n-it.\n-struct listen_failed_alert final : alert\n-{\n- std::string m\bme\bes\bss\bsa\bag\bge\be () const override;\n- char const* l\bli\bis\bst\bte\ben\bn_\b_i\bin\bnt\bte\ber\brf\bfa\bac\bce\be () const;\n-\n- static constexpr alert_category_t s\bst\bta\bat\bti\bic\bc_\b_c\bca\bat\bte\beg\bgo\bor\bry\by = alert_category::status\n-| alert_category::error;\n- error_code const error;\n- operation_t op;\n- lt::socket_type_t const socket_type;\n- aux::noexcept_movable address;\n- int const port;\n-};\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b* l\bli\bis\bst\bte\ben\bn_\b_i\bin\bnt\bte\ber\brf\bfa\bac\bce\be(\b()\b) *\b**\b**\b**\b**\b*\n-char const* l\bli\bis\bst\bte\ben\bn_\b_i\bin\bnt\bte\ber\brf\bfa\bac\bce\be () const;\n-the network device libtorrent attempted to listen on, or the IP address\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n- error\n- the error the system returned\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n- op\n- the underlying operation that failed\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n- socket_type\n- the type of listen socket this _\ba_\bl_\be_\br_\bt refers to.\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n- address\n- the address libtorrent attempted to listen on see _\ba_\bl_\be_\br_\bt documentation for\n- validity of this value\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n- port\n- the port libtorrent attempted to listen on see _\ba_\bl_\be_\br_\bt documentation for\n- validity of this value\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b**\b* l\bli\bis\bst\bte\ben\bn_\b_s\bsu\buc\bcc\bce\bee\bed\bde\bed\bd_\b_a\bal\ble\ber\brt\bt *\b**\b**\b**\b**\b**\b*\n-Declared in \"_\bl_\bi_\bb_\bt_\bo_\br_\br_\be_\bn_\bt_\b/_\ba_\bl_\be_\br_\bt_\b__\bt_\by_\bp_\be_\bs_\b._\bh_\bp_\bp\"\n-This _\ba_\bl_\be_\br_\bt is posted when the listen port succeeds to be opened on a particular\n-interface. address and port is the endpoint that successfully was opened for\n-listening.\n-struct listen_succeeded_alert final : alert\n-{\n- std::string m\bme\bes\bss\bsa\bag\bge\be () const override;\n-\n- static constexpr alert_category_t s\bst\bta\bat\bti\bic\bc_\b_c\bca\bat\bte\beg\bgo\bor\bry\by = alert_category::status;\n- aux::noexcept_movable address;\n- int const port;\n- lt::socket_type_t const socket_type;\n-};\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n- address\n- the address libtorrent ended up listening on. This address refers to the\n- local interface.\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n- port\n- the port libtorrent ended up listening on.\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n- socket_type\n- the type of listen socket this _\ba_\bl_\be_\br_\bt refers to.\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b**\b* p\bpo\bor\brt\btm\bma\bap\bp_\b_e\ber\brr\bro\bor\br_\b_a\bal\ble\ber\brt\bt *\b**\b**\b**\b**\b**\b*\n-Declared in \"_\bl_\bi_\bb_\bt_\bo_\br_\br_\be_\bn_\bt_\b/_\ba_\bl_\be_\br_\bt_\b__\bt_\by_\bp_\be_\bs_\b._\bh_\bp_\bp\"\n-This _\ba_\bl_\be_\br_\bt is generated when a NAT router was successfully found but some part\n-of the port mapping request failed. It contains a text message that may help\n-the user figure out what is wrong. This _\ba_\bl_\be_\br_\bt is not generated in case it\n-appears the client is not running on a NAT:ed network or if it appears there is\n-no NAT router that can be remote controlled to add port mappings.\n-struct portmap_error_alert final : alert\n-{\n- std::string m\bme\bes\bss\bsa\bag\bge\be () const override;\n-\n- static constexpr alert_category_t s\bst\bta\bat\bti\bic\bc_\b_c\bca\bat\bte\beg\bgo\bor\bry\by = alert_category::\n-port_mapping\n- | alert_category::error;\n- port_mapping_t const mapping;\n- portmap_transport map_transport;\n- aux::noexcept_movable local_address;\n- error_code const error;\n-};\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n- mapping\n- refers to the mapping index of the port map that failed, i.e. the index\n- returned from add_mapping().\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n- map_transport\n- UPnP or NAT-PMP\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n- local_address\n- the local network the port mapper is running on\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n- error\n- tells you what failed.\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b**\b* p\bpo\bor\brt\btm\bma\bap\bp_\b_a\bal\ble\ber\brt\bt *\b**\b**\b**\b**\b**\b*\n-Declared in \"_\bl_\bi_\bb_\bt_\bo_\br_\br_\be_\bn_\bt_\b/_\ba_\bl_\be_\br_\bt_\b__\bt_\by_\bp_\be_\bs_\b._\bh_\bp_\bp\"\n-This _\ba_\bl_\be_\br_\bt is generated when a NAT router was successfully found and a port was\n-successfully mapped on it. On a NAT:ed network with a NAT-PMP capable router,\n-this is typically generated once when mapping the TCP port and, if DHT is\n-enabled, when the UDP port is mapped.\n-struct portmap_alert final : alert\n-{\n- std::string m\bme\bes\bss\bsa\bag\bge\be () const override;\n-\n- static constexpr alert_category_t s\bst\bta\bat\bti\bic\bc_\b_c\bca\bat\bte\beg\bgo\bor\bry\by = alert_category::\n-port_mapping;\n- port_mapping_t const mapping;\n- int const external_port;\n- portmap_protocol const map_protocol;\n- portmap_transport const map_transport;\n- aux::noexcept_movable local_address;\n-};\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n- mapping\n- refers to the mapping index of the port map that failed, i.e. the index\n- returned from add_mapping().\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n- external_port\n- the external port allocated for the mapping.\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n- local_address\n- the local network the port mapper is running on\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b**\b* p\bpo\bor\brt\btm\bma\bap\bp_\b_l\blo\bog\bg_\b_a\bal\ble\ber\brt\bt *\b**\b**\b**\b**\b**\b*\n-Declared in \"_\bl_\bi_\bb_\bt_\bo_\br_\br_\be_\bn_\bt_\b/_\ba_\bl_\be_\br_\bt_\b__\bt_\by_\bp_\be_\bs_\b._\bh_\bp_\bp\"\n-This _\ba_\bl_\be_\br_\bt is generated to log informational events related to either UPnP or\n-NAT-PMP. They contain a log line and the type (0 = NAT-PMP and 1 = UPnP).\n-Displaying these messages to an end user is only useful for debugging the UPnP\n-or NAT-PMP implementation. This _\ba_\bl_\be_\br_\bt is only posted if the alert_category::\n-port_mapping_log flag is enabled in the _\ba_\bl_\be_\br_\bt mask.\n-struct portmap_log_alert final : alert\n-{\n- std::string m\bme\bes\bss\bsa\bag\bge\be () const override;\n- char const* l\blo\bog\bg_\b_m\bme\bes\bss\bsa\bag\bge\be () const;\n-\n- static constexpr alert_category_t s\bst\bta\bat\bti\bic\bc_\b_c\bca\bat\bte\beg\bgo\bor\bry\by = alert_category::\n-port_mapping_log;\n- portmap_transport const map_transport;\n- aux::noexcept_movable local_address;\n-};\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b* l\blo\bog\bg_\b_m\bme\bes\bss\bsa\bag\bge\be(\b()\b) *\b**\b**\b**\b**\b*\n-char const* l\blo\bog\bg_\b_m\bme\bes\bss\bsa\bag\bge\be () const;\n-the message associated with this log line\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n- local_address\n- the local network the port mapper is running on\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b**\b* f\bfa\bas\bst\btr\bre\bes\bsu\bum\bme\be_\b_r\bre\bej\bje\bec\bct\bte\bed\bd_\b_a\bal\ble\ber\brt\bt *\b**\b**\b**\b**\b**\b*\n-Declared in \"_\bl_\bi_\bb_\bt_\bo_\br_\br_\be_\bn_\bt_\b/_\ba_\bl_\be_\br_\bt_\b__\bt_\by_\bp_\be_\bs_\b._\bh_\bp_\bp\"\n-This _\ba_\bl_\be_\br_\bt is generated when a fast resume file has been passed to _\ba_\bd_\bd_\b__\bt_\bo_\br_\br_\be_\bn_\bt\n-_\b(_\b) but the files on disk did not match the fast resume file. The error_code\n-explains the reason why the resume file was rejected.\n-struct fastresume_rejected_alert final : torrent_alert\n-{\n- std::string m\bme\bes\bss\bsa\bag\bge\be () const override;\n- char const* f\bfi\bil\ble\be_\b_p\bpa\bat\bth\bh () const;\n-\n- static constexpr alert_category_t s\bst\bta\bat\bti\bic\bc_\b_c\bca\bat\bte\beg\bgo\bor\bry\by = alert_category::status\n- | alert_category::error;\n- error_code error;\n- operation_t op;\n-};\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b* f\bfi\bil\ble\be_\b_p\bpa\bat\bth\bh(\b()\b) *\b**\b**\b**\b**\b*\n-char const* f\bfi\bil\ble\be_\b_p\bpa\bat\bth\bh () const;\n-If the error happened to a specific file, this returns the path to it.\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n- op\n- the underlying operation that failed\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b**\b* p\bpe\bee\ber\br_\b_b\bbl\blo\boc\bck\bke\bed\bd_\b_a\bal\ble\ber\brt\bt *\b**\b**\b**\b**\b**\b*\n-Declared in \"_\bl_\bi_\bb_\bt_\bo_\br_\br_\be_\bn_\bt_\b/_\ba_\bl_\be_\br_\bt_\b__\bt_\by_\bp_\be_\bs_\b._\bh_\bp_\bp\"\n-This _\ba_\bl_\be_\br_\bt is posted when an incoming peer connection, or a peer that's about\n-to be added to our peer list, is blocked for some reason. This could be any of:\n- * the IP filter\n- * i2p mixed mode restrictions (a normal peer is not allowed on an i2p\n- swarm)\n- * the port filter\n- * the peer has a low port and no_connect_privileged_ports is enabled\n- * the protocol of the peer is blocked (uTP/TCP blocking)\n-struct peer_blocked_alert final : peer_alert\n-{\n- std::string m\bme\bes\bss\bsa\bag\bge\be () const override;\n-\n- enum reason_t\n- {\n- ip_filter,\n- port_filter,\n- i2p_mixed,\n- privileged_ports,\n- utp_disabled,\n- tcp_disabled,\n- invalid_local_interface,\n- ssrf_mitigation,\n- };\n-\n- static constexpr alert_category_t s\bst\bta\bat\bti\bic\bc_\b_c\bca\bat\bte\beg\bgo\bor\bry\by = alert_category::\n-ip_block;\n- int const reason;\n-};\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b* e\ben\bnu\bum\bm r\bre\bea\bas\bso\bon\bn_\b_t\bt *\b**\b**\b**\b**\b*\n-Declared in \"_\bl_\bi_\bb_\bt_\bo_\br_\br_\be_\bn_\bt_\b/_\ba_\bl_\be_\br_\bt_\b__\bt_\by_\bp_\be_\bs_\b._\bh_\bp_\bp\"\n- _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b \n-|_\bn\bn_\ba\ba_\bm\bm_\be\be_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\bv\bv_\ba\ba_\bl\bl_\bu\bu_\be\be_\b|_\bd\bd_\be\be_\bs\bs_\bc\bc_\br\br_\bi\bi_\bp\bp_\bt\bt_\bi\bi_\bo\bo_\bn\bn|\n-|_\bi_\bp_\b__\bf_\bi_\bl_\bt_\be_\br_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b0_\b _\b _\b _\b _\b|_\b\u00a0_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|_\bp_\bo_\br_\bt_\b__\bf_\bi_\bl_\bt_\be_\br_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b1_\b _\b _\b _\b _\b|_\b\u00a0_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|_\bi_\b2_\bp_\b__\bm_\bi_\bx_\be_\bd_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b2_\b _\b _\b _\b _\b|_\b\u00a0_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|_\bp_\br_\bi_\bv_\bi_\bl_\be_\bg_\be_\bd_\b__\bp_\bo_\br_\bt_\bs_\b _\b _\b _\b _\b _\b _\b _\b|_\b3_\b _\b _\b _\b _\b|_\b\u00a0_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|_\bu_\bt_\bp_\b__\bd_\bi_\bs_\ba_\bb_\bl_\be_\bd_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b4_\b _\b _\b _\b _\b|_\b\u00a0_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|_\bt_\bc_\bp_\b__\bd_\bi_\bs_\ba_\bb_\bl_\be_\bd_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b5_\b _\b _\b _\b _\b|_\b\u00a0_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|_\bi_\bn_\bv_\ba_\bl_\bi_\bd_\b__\bl_\bo_\bc_\ba_\bl_\b__\bi_\bn_\bt_\be_\br_\bf_\ba_\bc_\be_\b|_\b6_\b _\b _\b _\b _\b|_\b\u00a0_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-|_\bs_\bs_\br_\bf_\b__\bm_\bi_\bt_\bi_\bg_\ba_\bt_\bi_\bo_\bn_\b _\b _\b _\b _\b _\b _\b _\b _\b|_\b7_\b _\b _\b _\b _\b|_\b\u00a0_\b _\b _\b _\b _\b _\b _\b _\b _\b _\b |\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n- reason\n- the reason for the peer being blocked. Is one of the values from the\n- _\br_\be_\ba_\bs_\bo_\bn_\b__\bt enum.\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b**\b* d\bdh\bht\bt_\b_a\ban\bnn\bno\bou\bun\bnc\bce\be_\b_a\bal\ble\ber\brt\bt *\b**\b**\b**\b**\b**\b*\n-Declared in \"_\bl_\bi_\bb_\bt_\bo_\br_\br_\be_\bn_\bt_\b/_\ba_\bl_\be_\br_\bt_\b__\bt_\by_\bp_\be_\bs_\b._\bh_\bp_\bp\"\n-This _\ba_\bl_\be_\br_\bt is generated when a DHT node announces to an info-hash on our DHT\n-node. It belongs to the alert_category::dht category.\n-struct dht_announce_alert final : alert\n-{\n- std::string m\bme\bes\bss\bsa\bag\bge\be () const override;\n-\n- static constexpr alert_category_t s\bst\bta\bat\bti\bic\bc_\b_c\bca\bat\bte\beg\bgo\bor\bry\by = alert_category::dht;\n- aux::noexcept_movable ip;\n- int port;\n- sha1_hash info_hash;\n-};\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b**\b* d\bdh\bht\bt_\b_g\bge\bet\bt_\b_p\bpe\bee\ber\brs\bs_\b_a\bal\ble\ber\brt\bt *\b**\b**\b**\b**\b**\b*\n-Declared in \"_\bl_\bi_\bb_\bt_\bo_\br_\br_\be_\bn_\bt_\b/_\ba_\bl_\be_\br_\bt_\b__\bt_\by_\bp_\be_\bs_\b._\bh_\bp_\bp\"\n-This _\ba_\bl_\be_\br_\bt is generated when a DHT node sends a get_peers message to our DHT\n-node. It belongs to the alert_category::dht category.\n-struct dht_get_peers_alert final : alert\n-{\n- std::string m\bme\bes\bss\bsa\bag\bge\be () const override;\n-\n- static constexpr alert_category_t s\bst\bta\bat\bti\bic\bc_\b_c\bca\bat\bte\beg\bgo\bor\bry\by = alert_category::dht;\n- sha1_hash info_hash;\n-};\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b**\b* c\bca\bac\bch\bhe\be_\b_f\bfl\blu\bus\bsh\bhe\bed\bd_\b_a\bal\ble\ber\brt\bt *\b**\b**\b**\b**\b**\b*\n-Declared in \"_\bl_\bi_\bb_\bt_\bo_\br_\br_\be_\bn_\bt_\b/_\ba_\bl_\be_\br_\bt_\b__\bt_\by_\bp_\be_\bs_\b._\bh_\bp_\bp\"\n-This _\ba_\bl_\be_\br_\bt is posted when the disk cache has been flushed for a specific\n-torrent as a result of a call to _\bt_\bo_\br_\br_\be_\bn_\bt_\b__\bh_\ba_\bn_\bd_\bl_\be_\b:_\b:_\bf_\bl_\bu_\bs_\bh_\b__\bc_\ba_\bc_\bh_\be_\b(_\b). This _\ba_\bl_\be_\br_\bt\n-belongs to the alert_category::storage category, which must be enabled to let\n-this _\ba_\bl_\be_\br_\bt through. The _\ba_\bl_\be_\br_\bt is also posted when removing a torrent from the\n-_\bs_\be_\bs_\bs_\bi_\bo_\bn, once the outstanding cache flush is complete and the torrent does no\n-longer have any files open.\n-struct cache_flushed_alert final : torrent_alert\n+*\b**\b**\b**\b**\b**\b* s\bse\bet\btt\bti\bin\bng\bgs\bs_\b_i\bin\bnt\bte\ber\brf\bfa\bac\bce\be *\b**\b**\b**\b**\b**\b*\n+Declared in \"_\bl_\bi_\bb_\bt_\bo_\br_\br_\be_\bn_\bt_\b/_\bs_\be_\bt_\bt_\bi_\bn_\bg_\bs_\b__\bp_\ba_\bc_\bk_\b._\bh_\bp_\bp\"\n+the common interface to _\bs_\be_\bt_\bt_\bi_\bn_\bg_\bs_\b__\bp_\ba_\bc_\bk and the internal representation of\n+settings.\n+struct settings_interface\n {\n- static constexpr alert_category_t s\bst\bta\bat\bti\bic\bc_\b_c\bca\bat\bte\beg\bgo\bor\bry\by = alert_category::\n-storage;\n+ virtual void s\bse\bet\bt_\b_b\bbo\boo\bol\bl (int name, bool val) = 0;\n+ virtual bool h\bha\bas\bs_\b_v\bva\bal\bl (int name) const = 0;\n+ virtual void s\bse\bet\bt_\b_i\bin\bnt\bt (int name, int val) = 0;\n+ virtual void s\bse\bet\bt_\b_s\bst\btr\br (int name, std::string val) = 0;\n+ virtual bool g\bge\bet\bt_\b_b\bbo\boo\bol\bl (int name) const = 0;\n+ virtual int g\bge\bet\bt_\b_i\bin\bnt\bt (int name) const = 0;\n+ virtual std::string const& g\bge\bet\bt_\b_s\bst\btr\br (int name) const = 0;\n };\n [_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b**\b* l\bls\bsd\bd_\b_p\bpe\bee\ber\br_\b_a\bal\ble\ber\brt\bt *\b**\b**\b**\b**\b**\b*\n-Declared in \"_\bl_\bi_\bb_\bt_\bo_\br_\br_\be_\bn_\bt_\b/_\ba_\bl_\be_\br_\bt_\b__\bt_\by_\bp_\be_\bs_\b._\bh_\bp_\bp\"\n-This _\ba_\bl_\be_\br_\bt is generated when we receive a local service discovery message from\n-a peer for a torrent we're currently participating in.\n-struct lsd_peer_alert final : peer_alert\n+*\b**\b**\b**\b**\b**\b* b\bbu\buf\bff\bfe\ber\br_\b_a\bal\bll\blo\boc\bca\bat\bto\bor\br_\b_i\bin\bnt\bte\ber\brf\bfa\bac\bce\be *\b**\b**\b**\b**\b**\b*\n+Declared in \"_\bl_\bi_\bb_\bt_\bo_\br_\br_\be_\bn_\bt_\b/_\bd_\bi_\bs_\bk_\b__\bb_\bu_\bf_\bf_\be_\br_\b__\bh_\bo_\bl_\bd_\be_\br_\b._\bh_\bp_\bp\"\n+the interface for freeing disk buffers, used by the _\bd_\bi_\bs_\bk_\b__\bb_\bu_\bf_\bf_\be_\br_\b__\bh_\bo_\bl_\bd_\be_\br. when\n+implementing _\bd_\bi_\bs_\bk_\b__\bi_\bn_\bt_\be_\br_\bf_\ba_\bc_\be, this must also be implemented in order to return\n+disk buffers back to libtorrent\n+struct buffer_allocator_interface\n {\n- std::string m\bme\bes\bss\bsa\bag\bge\be () const override;\n-\n- static constexpr alert_category_t s\bst\bta\bat\bti\bic\bc_\b_c\bca\bat\bte\beg\bgo\bor\bry\by = alert_category::peer;\n+ virtual void f\bfr\bre\bee\be_\b_d\bdi\bis\bsk\bk_\b_b\bbu\buf\bff\bfe\ber\br (char* b) = 0;\n };\n [_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b**\b* t\btr\bra\bac\bck\bke\ber\bri\bid\bd_\b_a\bal\ble\ber\brt\bt *\b**\b**\b**\b**\b**\b*\n-Declared in \"_\bl_\bi_\bb_\bt_\bo_\br_\br_\be_\bn_\bt_\b/_\ba_\bl_\be_\br_\bt_\b__\bt_\by_\bp_\be_\bs_\b._\bh_\bp_\bp\"\n-This _\ba_\bl_\be_\br_\bt is posted whenever a tracker responds with a trackerid. The tracker\n-ID is like a cookie. libtorrent will store the tracker ID for this tracker and\n-repeat it in subsequent announces.\n-struct trackerid_alert final : tracker_alert\n+*\b**\b**\b**\b**\b**\b* d\bdi\bis\bsk\bk_\b_b\bbu\buf\bff\bfe\ber\br_\b_h\bho\bol\bld\bde\ber\br *\b**\b**\b**\b**\b**\b*\n+Declared in \"_\bl_\bi_\bb_\bt_\bo_\br_\br_\be_\bn_\bt_\b/_\bd_\bi_\bs_\bk_\b__\bb_\bu_\bf_\bf_\be_\br_\b__\bh_\bo_\bl_\bd_\be_\br_\b._\bh_\bp_\bp\"\n+The disk buffer holder acts like a unique_ptr that frees a disk buffer when\n+it's destructed\n+If this buffer holder is moved-from, default constructed or reset, data() will\n+return nullptr.\n+struct disk_buffer_holder\n {\n- std::string m\bme\bes\bss\bsa\bag\bge\be () const override;\n- char const* t\btr\bra\bac\bck\bke\ber\br_\b_i\bid\bd () const;\n-\n- static constexpr alert_category_t s\bst\bta\bat\bti\bic\bc_\b_c\bca\bat\bte\beg\bgo\bor\bry\by = alert_category::status;\n+ disk_buffer_holder& o\bop\bpe\ber\bra\bat\bto\bor\br=\b= (disk_buffer_holder&&) & noexcept;\n+ d\bdi\bis\bsk\bk_\b_b\bbu\buf\bff\bfe\ber\br_\b_h\bho\bol\bld\bde\ber\br (disk_buffer_holder&&) noexcept;\n+ disk_buffer_holder& o\bop\bpe\ber\bra\bat\bto\bor\br=\b= (disk_buffer_holder const&) = delete;\n+ d\bdi\bis\bsk\bk_\b_b\bbu\buf\bff\bfe\ber\br_\b_h\bho\bol\bld\bde\ber\br (disk_buffer_holder const&) = delete;\n+ d\bdi\bis\bsk\bk_\b_b\bbu\buf\bff\bfe\ber\br_\b_h\bho\bol\bld\bde\ber\br (buffer_allocator_interface& alloc\n+ , char* buf, int sz) noexcept;\n+ d\bdi\bis\bsk\bk_\b_b\bbu\buf\bff\bfe\ber\br_\b_h\bho\bol\bld\bde\ber\br () noexcept = default;\n+ ~\b~d\bdi\bis\bsk\bk_\b_b\bbu\buf\bff\bfe\ber\br_\b_h\bho\bol\bld\bde\ber\br ();\n+ char* d\bda\bat\bta\ba () const noexcept;\n+ void r\bre\bes\bse\bet\bt ();\n+ void s\bsw\bwa\bap\bp (disk_buffer_holder& h) noexcept;\n+ bool i\bis\bs_\b_m\bmu\but\bta\bab\bbl\ble\be () const noexcept;\n+ explicit operator b\bbo\boo\bol\bl () const noexcept;\n+ std::ptrdiff_t s\bsi\biz\bze\be () const;\n };\n [_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b* t\btr\bra\bac\bck\bke\ber\br_\b_i\bid\bd(\b()\b) *\b**\b**\b**\b**\b*\n-char const* t\btr\bra\bac\bck\bke\ber\br_\b_i\bid\bd () const;\n-The tracker ID returned by the tracker\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b**\b* d\bdh\bht\bt_\b_b\bbo\boo\bot\bts\bst\btr\bra\bap\bp_\b_a\bal\ble\ber\brt\bt *\b**\b**\b**\b**\b**\b*\n-Declared in \"_\bl_\bi_\bb_\bt_\bo_\br_\br_\be_\bn_\bt_\b/_\ba_\bl_\be_\br_\bt_\b__\bt_\by_\bp_\be_\bs_\b._\bh_\bp_\bp\"\n-This _\ba_\bl_\be_\br_\bt is posted when the initial DHT bootstrap is done.\n-struct dht_bootstrap_alert final : alert\n-{\n- std::string m\bme\bes\bss\bsa\bag\bge\be () const override;\n-\n- static constexpr alert_category_t s\bst\bta\bat\bti\bic\bc_\b_c\bca\bat\bte\beg\bgo\bor\bry\by = alert_category::dht;\n-};\n+*\b**\b**\b**\b**\b* d\bdi\bis\bsk\bk_\b_b\bbu\buf\bff\bfe\ber\br_\b_h\bho\bol\bld\bde\ber\br(\b()\b) *\b**\b**\b**\b**\b*\n+d\bdi\bis\bsk\bk_\b_b\bbu\buf\bff\bfe\ber\br_\b_h\bho\bol\bld\bde\ber\br (buffer_allocator_interface& alloc\n+ , char* buf, int sz) noexcept;\n+construct a buffer holder that will free the held buffer using a disk buffer\n+pool directly (there's only one disk_buffer_pool per _\bs_\be_\bs_\bs_\bi_\bo_\bn)\n [_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b**\b* t\bto\bor\brr\bre\ben\bnt\bt_\b_e\ber\brr\bro\bor\br_\b_a\bal\ble\ber\brt\bt *\b**\b**\b**\b**\b**\b*\n-Declared in \"_\bl_\bi_\bb_\bt_\bo_\br_\br_\be_\bn_\bt_\b/_\ba_\bl_\be_\br_\bt_\b__\bt_\by_\bp_\be_\bs_\b._\bh_\bp_\bp\"\n-This is posted whenever a torrent is transitioned into the error state. If the\n-error code is duplicate_torrent (_\be_\br_\br_\bo_\br_\b__\bc_\bo_\bd_\be_\b__\be_\bn_\bu_\bm) error, it suggests two magnet\n-links ended up resolving to the same hybrid torrent. For more details, see\n-_\bB_\bi_\bt_\bT_\bo_\br_\br_\be_\bn_\bt_\b _\bv_\b2_\b _\bt_\bo_\br_\br_\be_\bn_\bt_\bs.\n-struct torrent_error_alert final : torrent_alert\n-{\n- std::string m\bme\bes\bss\bsa\bag\bge\be () const override;\n- char const* f\bfi\bil\ble\ben\bna\bam\bme\be () const;\n-\n- static constexpr alert_category_t s\bst\bta\bat\bti\bic\bc_\b_c\bca\bat\bte\beg\bgo\bor\bry\by = alert_category::error |\n-alert_category::status;\n- error_code const error;\n-};\n+*\b**\b**\b**\b**\b* d\bdi\bis\bsk\bk_\b_b\bbu\buf\bff\bfe\ber\br_\b_h\bho\bol\bld\bde\ber\br(\b()\b) *\b**\b**\b**\b**\b*\n+d\bdi\bis\bsk\bk_\b_b\bbu\buf\bff\bfe\ber\br_\b_h\bho\bol\bld\bde\ber\br () noexcept = default;\n+default construct a holder that does not own any buffer\n [_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b* f\bfi\bil\ble\ben\bna\bam\bme\be(\b()\b) *\b**\b**\b**\b**\b*\n-char const* f\bfi\bil\ble\ben\bna\bam\bme\be () const;\n-the filename (or object) the error occurred on.\n+*\b**\b**\b**\b**\b* ~\b~d\bdi\bis\bsk\bk_\b_b\bbu\buf\bff\bfe\ber\br_\b_h\bho\bol\bld\bde\ber\br(\b()\b) *\b**\b**\b**\b**\b*\n+~\b~d\bdi\bis\bsk\bk_\b_b\bbu\buf\bff\bfe\ber\br_\b_h\bho\bol\bld\bde\ber\br ();\n+frees disk buffer held by this object\n [_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n- error\n- specifies which error the torrent encountered.\n+*\b**\b**\b**\b**\b* d\bda\bat\bta\ba(\b()\b) *\b**\b**\b**\b**\b*\n+char* d\bda\bat\bta\ba () const noexcept;\n+return a pointer to the held buffer, if any. Otherwise returns nullptr.\n [_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b**\b* t\bto\bor\brr\bre\ben\bnt\bt_\b_n\bne\bee\bed\bd_\b_c\bce\ber\brt\bt_\b_a\bal\ble\ber\brt\bt *\b**\b**\b**\b**\b**\b*\n-Declared in \"_\bl_\bi_\bb_\bt_\bo_\br_\br_\be_\bn_\bt_\b/_\ba_\bl_\be_\br_\bt_\b__\bt_\by_\bp_\be_\bs_\b._\bh_\bp_\bp\"\n-This is always posted for SSL torrents. This is a reminder to the client that\n-the torrent won't work unless _\bt_\bo_\br_\br_\be_\bn_\bt_\b__\bh_\ba_\bn_\bd_\bl_\be_\b:_\b:_\bs_\be_\bt_\b__\bs_\bs_\bl_\b__\bc_\be_\br_\bt_\bi_\bf_\bi_\bc_\ba_\bt_\be_\b(_\b) is called\n-with a valid certificate. Valid certificates MUST be signed by the SSL\n-certificate in the .torrent file.\n-struct torrent_need_cert_alert final : torrent_alert\n-{\n- std::string m\bme\bes\bss\bsa\bag\bge\be () const override;\n-\n- static constexpr alert_category_t s\bst\bta\bat\bti\bic\bc_\b_c\bca\bat\bte\beg\bgo\bor\bry\by = alert_category::status;\n-};\n+*\b**\b**\b**\b**\b* r\bre\bes\bse\bet\bt(\b()\b) *\b**\b**\b**\b**\b*\n+void r\bre\bes\bse\bet\bt ();\n+free the held disk buffer, if any, and clear the holder. This sets the holder\n+object to a default-constructed state\n [_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b**\b* i\bin\bnc\bco\bom\bmi\bin\bng\bg_\b_c\bco\bon\bnn\bne\bec\bct\bti\bio\bon\bn_\b_a\bal\ble\ber\brt\bt *\b**\b**\b**\b**\b**\b*\n-Declared in \"_\bl_\bi_\bb_\bt_\bo_\br_\br_\be_\bn_\bt_\b/_\ba_\bl_\be_\br_\bt_\b__\bt_\by_\bp_\be_\bs_\b._\bh_\bp_\bp\"\n-The incoming connection _\ba_\bl_\be_\br_\bt is posted every time we successfully accept an\n-incoming connection, through any mean. The most straight-forward ways of\n-accepting incoming connections are through the TCP listen socket and the UDP\n-listen socket for uTP sockets. However, connections may also be accepted\n-through a Socks5 or i2p listen socket, or via an SSL listen socket.\n-struct incoming_connection_alert final : alert\n-{\n- std::string m\bme\bes\bss\bsa\bag\bge\be () const override;\n-\n- static constexpr alert_category_t s\bst\bta\bat\bti\bic\bc_\b_c\bca\bat\bte\beg\bgo\bor\bry\by = alert_category::peer;\n- socket_type_t socket_type;\n- aux::noexcept_movable<_\bt_\bc_\bp_\b:_\b:_\be_\bn_\bd_\bp_\bo_\bi_\bn_\bt> endpoint;\n-};\n+*\b**\b**\b**\b**\b* s\bsw\bwa\bap\bp(\b()\b) *\b**\b**\b**\b**\b*\n+void s\bsw\bwa\bap\bp (disk_buffer_holder& h) noexcept;\n+swap pointers of two disk buffer holders.\n [_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n- socket_type\n- tells you what kind of socket the connection was accepted\n+*\b**\b**\b**\b**\b* i\bis\bs_\b_m\bmu\but\bta\bab\bbl\ble\be(\b()\b) *\b**\b**\b**\b**\b*\n+bool i\bis\bs_\b_m\bmu\but\bta\bab\bbl\ble\be () const noexcept;\n+if this returns true, the buffer may not be modified in place\n [_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n- endpoint\n- is the IP address and port the connection came from.\n+*\b**\b**\b**\b**\b* b\bbo\boo\bol\bl(\b()\b) *\b**\b**\b**\b**\b*\n+explicit operator b\bbo\boo\bol\bl () const noexcept;\n+implicitly convertible to true if the object is currently holding a buffer\n [_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b**\b* a\bad\bdd\bd_\b_t\bto\bor\brr\bre\ben\bnt\bt_\b_a\bal\ble\ber\brt\bt *\b**\b**\b**\b**\b**\b*\n-Declared in \"_\bl_\bi_\bb_\bt_\bo_\br_\br_\be_\bn_\bt_\b/_\ba_\bl_\be_\br_\bt_\b__\bt_\by_\bp_\be_\bs_\b._\bh_\bp_\bp\"\n-This _\ba_\bl_\be_\br_\bt is always posted when a torrent was attempted to be added and\n-contains the return status of the add operation. The torrent handle of the new\n-torrent can be found as the handle member in the base class. If adding the\n-torrent failed, error contains the error code.\n-struct add_torrent_alert final : torrent_alert\n+*\b**\b**\b**\b**\b**\b* d\bdi\bis\bsk\bk_\b_o\bob\bbs\bse\ber\brv\bve\ber\br *\b**\b**\b**\b**\b**\b*\n+Declared in \"_\bl_\bi_\bb_\bt_\bo_\br_\br_\be_\bn_\bt_\b/_\bd_\bi_\bs_\bk_\b__\bo_\bb_\bs_\be_\br_\bv_\be_\br_\b._\bh_\bp_\bp\"\n+struct disk_observer\n {\n- std::string m\bme\bes\bss\bsa\bag\bge\be () const override;\n-\n- static constexpr alert_category_t s\bst\bta\bat\bti\bic\bc_\b_c\bca\bat\bte\beg\bgo\bor\bry\by = alert_category::status;\n- add_torrent_params params;\n- error_code error;\n+ virtual void o\bon\bn_\b_d\bdi\bis\bsk\bk () = 0;\n };\n [_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n- params\n- This contains copies of the most important fields from the original\n- _\ba_\bd_\bd_\b__\bt_\bo_\br_\br_\be_\bn_\bt_\b__\bp_\ba_\br_\ba_\bm_\bs object, passed to _\ba_\bd_\bd_\b__\bt_\bo_\br_\br_\be_\bn_\bt_\b(_\b) or _\ba_\bs_\by_\bn_\bc_\b__\ba_\bd_\bd_\b__\bt_\bo_\br_\br_\be_\bn_\bt\n- _\b(_\b). Specifically, these fields are copied:\n- * version\n- * ti\n- * name\n- * save_path\n- * userdata\n- * tracker_id\n- * flags\n- * info_hash\n- the info_hash field will be updated with the info-hash of the torrent\n- specified by ti.\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n- error\n- set to the error, if one occurred while adding the torrent.\n+*\b**\b**\b**\b**\b* o\bon\bn_\b_d\bdi\bis\bsk\bk(\b()\b) *\b**\b**\b**\b**\b*\n+virtual void o\bon\bn_\b_d\bdi\bis\bsk\bk () = 0;\n+called when the disk cache size has dropped below the low watermark again and\n+we can resume downloading from peers\n [_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b**\b* s\bst\bta\bat\bte\be_\b_u\bup\bpd\bda\bat\bte\be_\b_a\bal\ble\ber\brt\bt *\b**\b**\b**\b**\b**\b*\n-Declared in \"_\bl_\bi_\bb_\bt_\bo_\br_\br_\be_\bn_\bt_\b/_\ba_\bl_\be_\br_\bt_\b__\bt_\by_\bp_\be_\bs_\b._\bh_\bp_\bp\"\n-This _\ba_\bl_\be_\br_\bt is only posted when requested by the user, by calling session::\n-post_torrent_updates() on the _\bs_\be_\bs_\bs_\bi_\bo_\bn. It contains the torrent status of all\n-torrents that changed since last time this message was posted. Its category is\n-alert_category::status, but it's not subject to filtering, since it's only\n-manually posted anyway.\n-struct state_update_alert final : alert\n+*\b**\b**\b**\b**\b**\b* o\bop\bpe\ben\bn_\b_f\bfi\bil\ble\be_\b_s\bst\bta\bat\bte\be *\b**\b**\b**\b**\b**\b*\n+Declared in \"_\bl_\bi_\bb_\bt_\bo_\br_\br_\be_\bn_\bt_\b/_\bd_\bi_\bs_\bk_\b__\bi_\bn_\bt_\be_\br_\bf_\ba_\bc_\be_\b._\bh_\bp_\bp\"\n+this contains information about a file that's currently open by the libtorrent\n+disk I/O subsystem. It's associated with a single torrent.\n+struct open_file_state\n {\n- std::string m\bme\bes\bss\bsa\bag\bge\be () const override;\n-\n- static constexpr alert_category_t s\bst\bta\bat\bti\bic\bc_\b_c\bca\bat\bte\beg\bgo\bor\bry\by = alert_category::status;\n- std::vector status;\n+ file_index_t file_index;\n+ file_open_mode_t open_mode;\n+ time_point last_use;\n };\n [_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n- status\n- contains the torrent status of all torrents that changed since last time\n- this message was posted. Note that you can map a torrent status to a\n- specific torrent via its handle member. The receiving end is suggested to\n- have all torrents sorted by the _\bt_\bo_\br_\br_\be_\bn_\bt_\b__\bh_\ba_\bn_\bd_\bl_\be or hashed by it, for\n- efficient updates.\n+ file_index\n+ the index of the file this _\be_\bn_\bt_\br_\by refers to into the file_storage file\n+ list of this torrent. This starts indexing at 0.\n [_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b**\b* s\bse\bes\bss\bsi\bio\bon\bn_\b_s\bst\bta\bat\bts\bs_\b_a\bal\ble\ber\brt\bt *\b**\b**\b**\b**\b**\b*\n-Declared in \"_\bl_\bi_\bb_\bt_\bo_\br_\br_\be_\bn_\bt_\b/_\ba_\bl_\be_\br_\bt_\b__\bt_\by_\bp_\be_\bs_\b._\bh_\bp_\bp\"\n-The _\bs_\be_\bs_\bs_\bi_\bo_\bn_\b__\bs_\bt_\ba_\bt_\bs_\b__\ba_\bl_\be_\br_\bt is posted when the user requests _\bs_\be_\bs_\bs_\bi_\bo_\bn statistics by\n-calling _\bp_\bo_\bs_\bt_\b__\bs_\be_\bs_\bs_\bi_\bo_\bn_\b__\bs_\bt_\ba_\bt_\bs_\b(_\b) on the _\bs_\be_\bs_\bs_\bi_\bo_\bn object. This _\ba_\bl_\be_\br_\bt does not have a\n-category, since it's only posted in response to an API call. It is not subject\n-to the alert_mask filter.\n-the message() member function returns a string representation of the values\n-that properly match the line returned in session_stats_header_alert::message().\n-this specific output is parsed by tools/parse_session_stats.py if this is\n-changed, that parser should also be changed\n-struct session_stats_alert final : alert\n-{\n- std::string m\bme\bes\bss\bsa\bag\bge\be () const override;\n- span c\bco\bou\bun\bnt\bte\ber\brs\bs () const;\n-\n- static constexpr alert_category_t s\bst\bta\bat\bti\bic\bc_\b_c\bca\bat\bte\beg\bgo\bor\bry\by = {};\n-};\n+ open_mode\n+ open_mode is a bitmask of the file flags this file is currently opened\n+ with. For possible flags, see _\bf_\bi_\bl_\be_\b__\bo_\bp_\be_\bn_\b__\bm_\bo_\bd_\be_\b__\bt.\n+ Note that the read/write mode is not a bitmask. The two least significant\n+ bits are used to represent the read/write mode. Those bits can be masked\n+ out using the rw_mask constant.\n [_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b* c\bco\bou\bun\bnt\bte\ber\brs\bs(\b()\b) *\b**\b**\b**\b**\b*\n-span c\bco\bou\bun\bnt\bte\ber\brs\bs () const;\n-An array are a mix of c\bco\bou\bun\bnt\bte\ber\brs\bs and g\bga\bau\bug\bge\bes\bs, which meanings can be queries via\n-the _\bs_\be_\bs_\bs_\bi_\bo_\bn_\b__\bs_\bt_\ba_\bt_\bs_\b__\bm_\be_\bt_\br_\bi_\bc_\bs_\b(_\b) function on the _\bs_\be_\bs_\bs_\bi_\bo_\bn. The mapping from a\n-specific metric to an index into this array is constant for a specific version\n-of libtorrent, but may differ for other versions. The intended usage is to\n-request the mapping, i.e. call _\bs_\be_\bs_\bs_\bi_\bo_\bn_\b__\bs_\bt_\ba_\bt_\bs_\b__\bm_\be_\bt_\br_\bi_\bc_\bs_\b(_\b), once on startup, and\n-then use that mapping to interpret these values throughout the process'\n-runtime.\n-For more information, see the _\bs_\be_\bs_\bs_\bi_\bo_\bn_\b _\bs_\bt_\ba_\bt_\bi_\bs_\bt_\bi_\bc_\bs section.\n+ last_use\n+ a (high precision) timestamp of when the file was last used.\n [_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n-*\b**\b**\b**\b**\b**\b* d\bdh\bht\bt_\b_e\ber\brr\bro\bor\br_\b_a\bal\ble\ber\brt\bt *\b**\b**\b**\b**\b**\b*\n-Declared in \"_\bl_\bi_\bb_\bt_\bo_\br_\br_\be_\bn_\bt_\b/_\ba_\bl_\be_\br_\bt_\b__\bt_\by_\bp_\be_\bs_\b._\bh_\bp_\bp\"\n-posted when something fails in the DHT. This is not necessarily a fatal error,\n-but it could prevent proper operation\n-struct dht_error_alert final : alert\n+*\b**\b**\b**\b**\b**\b* d\bdi\bis\bsk\bk_\b_i\bin\bnt\bte\ber\brf\bfa\bac\bce\be *\b**\b**\b**\b**\b**\b*\n+Declared in \"_\bl_\bi_\bb_\bt_\bo_\br_\br_\be_\bn_\bt_\b/_\bd_\bi_\bs_\bk_\b__\bi_\bn_\bt_\be_\br_\bf_\ba_\bc_\be_\b._\bh_\bp_\bp\"\n+The _\bd_\bi_\bs_\bk_\b__\bi_\bn_\bt_\be_\br_\bf_\ba_\bc_\be is the customization point for disk I/O in libtorrent.\n+implement this interface and provide a factory function to the _\bs_\be_\bs_\bs_\bi_\bo_\bn\n+constructor use custom disk I/O. All functions on the disk subsystem\n+(implementing _\bd_\bi_\bs_\bk_\b__\bi_\bn_\bt_\be_\br_\bf_\ba_\bc_\be) are called from within libtorrent's network\n+thread. For disk I/O to be performed in a separate thread, the disk subsystem\n+has to manage that itself.\n+Although the functions are called async_*, they do not technically h\bha\bav\bve\be to be\n+asynchronous, but they support being asynchronous, by expecting the result\n+passed back into a callback. The callbacks must be posted back onto the network\n+thread via the io_context object passed into the constructor. The callbacks\n+will be run in the network thread.\n+struct disk_interface\n {\n- std::string m\bme\bes\bss\bsa\bag\bge\be () const override;\n+ virtual storage_holder n\bne\bew\bw_\b_t\bto\bor\brr\bre\ben\bnt\bt (storage_params const& p\n+ , std::shared_ptr const& torrent) = 0;\n+ virtual void r\bre\bem\bmo\bov\bve\be_\b_t\bto\bor\brr\bre\ben\bnt\bt (storage_index_t) = 0;\n+ virtual void a\bas\bsy\byn\bnc\bc_\b_r\bre\bea\bad\bd (storage_index_t storage, peer_request const& r\n+ , std::function handler\n+ , disk_job_flags_t flags = {}) = 0;\n+ virtual bool a\bas\bsy\byn\bnc\bc_\b_w\bwr\bri\bit\bte\be (storage_index_t storage, peer_request const& r\n+ , char const* buf, std::shared_ptr o\n+ , std::function handler\n+ , disk_job_flags_t flags = {}) = 0;\n+ virtual void a\bas\bsy\byn\bnc\bc_\b_h\bha\bas\bsh\bh (storage_index_t storage, piece_index_t piece,\n+span v2\n+ , disk_job_flags_t flags\n+ , std::function handler) = 0;\n+ virtual void a\bas\bsy\byn\bnc\bc_\b_h\bha\bas\bsh\bh2\b2 (storage_index_t storage, piece_index_t piece, int\n+offset, disk_job_flags_t flags\n+ , std::function handler) = 0;\n+ virtual void a\bas\bsy\byn\bnc\bc_\b_m\bmo\bov\bve\be_\b_s\bst\bto\bor\bra\bag\bge\be (storage_index_t storage, std::string p,\n+move_flags_t flags\n+ , std::function\n+handler) = 0;\n+ virtual void a\bas\bsy\byn\bnc\bc_\b_r\bre\bel\ble\bea\bas\bse\be_\b_f\bfi\bil\ble\bes\bs (storage_index_t storage\n+ , std::function handler = std::function()) = 0;\n+ virtual void a\bas\bsy\byn\bnc\bc_\b_c\bch\bhe\bec\bck\bk_\b_f\bfi\bil\ble\bes\bs (storage_index_t storage\n+ , add_torrent_params const* resume_data\n+ , aux::vector links\n+ , std::function handler) = 0;\n+ virtual void a\bas\bsy\byn\bnc\bc_\b_s\bst\bto\bop\bp_\b_t\bto\bor\brr\bre\ben\bnt\bt (storage_index_t storage\n+ , std::function handler = std::function()) = 0;\n+ virtual void a\bas\bsy\byn\bnc\bc_\b_r\bre\ben\bna\bam\bme\be_\b_f\bfi\bil\ble\be (storage_index_t storage\n+ , file_index_t index, std::string name\n+ , std::function handler) = 0;\n+ virtual void a\bas\bsy\byn\bnc\bc_\b_d\bde\bel\ble\bet\bte\be_\b_f\bfi\bil\ble\bes\bs (storage_index_t storage, remove_flags_t\n+options\n+ , std::function handler) = 0;\n+ virtual void a\bas\bsy\byn\bnc\bc_\b_s\bse\bet\bt_\b_f\bfi\bil\ble\be_\b_p\bpr\bri\bio\bor\bri\bit\bty\by (storage_index_t storage\n+ , aux::vector prio\n+ , std::function)> handler) = 0;\n+ virtual void a\bas\bsy\byn\bnc\bc_\b_c\bcl\ble\bea\bar\br_\b_p\bpi\bie\bec\bce\be (storage_index_t storage, piece_index_t index\n+ , std::function handler) = 0;\n+ virtual void u\bup\bpd\bda\bat\bte\be_\b_s\bst\bta\bat\bts\bs_\b_c\bco\bou\bun\bnt\bte\ber\brs\bs (counters& c) const = 0;\n+ virtual std::vector g\bge\bet\bt_\b_s\bst\bta\bat\btu\bus\bs (storage_index_t) const = 0;\n+ virtual void a\bab\bbo\bor\brt\bt (bool wait) = 0;\n+ virtual void s\bsu\bub\bbm\bmi\bit\bt_\b_j\bjo\bob\bbs\bs () = 0;\n+ virtual void s\bse\bet\btt\bti\bin\bng\bgs\bs_\b_u\bup\bpd\bda\bat\bte\bed\bd () = 0;\n \n- static constexpr alert_category_t s\bst\bta\bat\bti\bic\bc_\b_c\bca\bat\bte\beg\bgo\bor\bry\by = alert_category::error |\n-alert_category::dht;\n- error_code error;\n- operation_t op;\n+ static constexpr disk_job_flags_t f\bfo\bor\brc\bce\be_\b_c\bco\bop\bpy\by = 0_bit;\n+ static constexpr disk_job_flags_t s\bse\beq\bqu\bue\ben\bnt\bti\bia\bal\bl_\b_a\bac\bcc\bce\bes\bss\bs = 3_bit;\n+ static constexpr disk_job_flags_t v\bvo\bol\bla\bat\bti\bil\ble\be_\b_r\bre\bea\bad\bd = 4_bit;\n+ static constexpr disk_job_flags_t v\bv1\b1_\b_h\bha\bas\bsh\bh = 5_bit;\n+ static constexpr disk_job_flags_t f\bfl\blu\bus\bsh\bh_\b_p\bpi\bie\bec\bce\be = 7_bit;\n };\n [_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n- error\n- the error code\n-[_\br_\be_\bp_\bo_\br_\bt_\b _\bi_\bs_\bs_\bu_\be]\n- op\n- the operation that failed\n+*\b**\b**\b**\b**\b* n\bne\bew\bw_\b_t\bto\bor\brr\bre\ben\bnt\bt(\b()\b) *\b**\b**\b**\b**\b*\n+virtual storage_holder n\bne\bew\bw_\b_t\bto\bor\brr\bre\ben\bnt\bt (storage_params const& p\n+ , std::shared_ptr