jiigen666/libtorrent
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

CPU optimization for end-game piece picker

Browse Source
This commit is contained in:
Arvid Norberg
2011-02-09 02:56:00 +00:00
parent cfd36ca53e
commit a42d42fd11
9 changed files with 82 additions and 100 deletions
Download Patch File Download Diff File Expand all files Collapse all files

7
test/test_piece_picker.cpp
View File

@@ -696,7 +696,8 @@ int test_main()
, piece_picker::fast, piece_picker::prioritize_partials, empty_vector);
TEST_CHECK(verify_pick(p, picked, true));
print_pick(picked);
TEST_CHECK(picked.size() == 7 * blocks_per_piece);
// don't pick both busy pieces, just one
TEST_EQUAL(picked.size(), 7 * blocks_per_piece - 1);
picked.clear();
p->pick_pieces(string2vec("*******"), picked, 7 * blocks_per_piece, 0, 0
@@ -704,14 +705,14 @@ int test_main()
| piece_picker::rarest_first, empty_vector);
TEST_CHECK(verify_pick(p, picked, true));
print_pick(picked);
TEST_CHECK(picked.size() == 7 * blocks_per_piece);
TEST_EQUAL(picked.size(), 7 * blocks_per_piece - 1);
picked.clear();
p->pick_pieces(string2vec("*******"), picked, 7 * blocks_per_piece, 0, 0
, piece_picker::fast, piece_picker::rarest_first, empty_vector);
TEST_CHECK(verify_pick(p, picked, true));
print_pick(picked);
TEST_CHECK(picked.size() == 7 * blocks_per_piece);
TEST_EQUAL(picked.size(), 7 * blocks_per_piece - 1);
// ========================================================