From 3162a03d0cdbe41538c6dbdade4294358629c620 Mon Sep 17 00:00:00 2001 From: Arvid Norberg Date: Sat, 12 Jul 2008 13:40:21 +0000 Subject: [PATCH] fix manual markup --- docs/manual.html | 13 +++++++------ docs/manual.rst | 4 ++-- 2 files changed, 9 insertions(+), 8 deletions(-) diff --git a/docs/manual.html b/docs/manual.html index 29668f8f2..502298be8 100644 --- a/docs/manual.html +++ b/docs/manual.html @@ -1600,7 +1600,7 @@ struct torrent_handle torrent_handle(); 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_peer_info(std::vector<peer_info>& v) 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.

file_progress()

-void file_progress(std::vector<float>& fp);
+void file_progress(std::vector<size_type>& fp);
 
-

This function fills in the supplied vector with the progress (a value in the -range [0, 1]) describing the download progress 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.

+

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 +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 +is the number of blocks in a piece.

save_path()

diff --git a/docs/manual.rst b/docs/manual.rst index aa4f04cac..1917380e3 100644 --- a/docs/manual.rst +++ b/docs/manual.rst @@ -1663,8 +1663,8 @@ file_progress() 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 -in the `torrent_info`_. This operation is not very cheap. Its complexity is *O(n + m*j)*. -Where *n * is the number of files, *m * is the number of downloading pieces and *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* is the number of blocks in a piece.