wornvirtue
/
premiere-libtorrent
forked from premiere/premiere-libtorrent
1
0
Fork 0
Code Pull Requests Activity

fix manual markup

This commit is contained in:
Arvid Norberg 2008-07-12 13:40:21 +00:00
parent 9bf25d1006
commit 3162a03d0c
2 changed files with 9 additions and 8 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

13
docs/manual.html
View File

@ -1600,7 +1600,7 @@ struct torrent_handle
torrent_handle(); torrent_handle();
torrent_status status(); torrent_status status();
void file_progress(std::vector<float>& fp); void file_progress(std::vector<size_type>& fp);
void get_download_queue(std::vector<partial_piece_info>& queue) const; void get_download_queue(std::vector<partial_piece_info>& queue) const;
void get_peer_info(std::vector<peer_info>& v) const; void get_peer_info(std::vector<peer_info>& v) const;
torrent_info const& get_torrent_info() const; torrent_info const& get_torrent_info() const;
@ -1738,13 +1738,14 @@ sets the priorities of all the pieces in the torrent based on the vector.</p>
<h2><a id="file-progress" name="file-progress">file_progress()</a></h2> <h2><a id="file-progress" name="file-progress">file_progress()</a></h2>
<blockquote> <blockquote>
<pre class="literal-block"> <pre class="literal-block">
void file_progress(std::vector&lt;float&gt;&amp; fp); void file_progress(std::vector&lt;size_type&gt;&amp; fp);
</pre> </pre>
</blockquote> </blockquote>
<p>This function fills in the supplied vector with the progress (a value in the <p>This function fills in the supplied vector with the the number of bytes downloaded
range [0, 1]) describing the download progress of each file in this torrent. of each file in this torrent. The progress values are ordered the same as the files
The progress values are ordered the same as the files in the <a class="reference" href="#torrent-info">torrent_info</a>. in the <a class="reference" href="#torrent-info">torrent_info</a>. This operation is not very cheap. Its complexity is <em>O(n + mj)</em>.
This operation is not very cheap.</p> Where <em>n</em> is the number of files, <em>m</em> is the number of downloading pieces and <em>j</em>
is the number of blocks in a piece.</p>
</div> </div>
<div class="section"> <div class="section">
<h2><a id="save-path" name="save-path">save_path()</a></h2> <h2><a id="save-path" name="save-path">save_path()</a></h2>

4
docs/manual.rst
View File

@ -1663,8 +1663,8 @@ file_progress()
This function fills in the supplied vector with the the number of bytes downloaded This function fills in the supplied vector with the the number of bytes downloaded
of each file in this torrent. The progress values are ordered the same as the files of each file in this torrent. The progress values are ordered the same as the files
in the `torrent_info`_. This operation is not very cheap. Its complexity is *O(n + m*j)*. in the `torrent_info`_. This operation is not very cheap. Its complexity is *O(n + mj)*.
Where *n * is the number of files, *m * is the number of downloading pieces and *j * Where *n* is the number of files, *m* is the number of downloading pieces and *j*
is the number of blocks in a piece. is the number of blocks in a piece.