diff options
| author | Tatsuhiro Tsujikawa <tatsuhiro.t@gmail.com> | 2010-02-28 16:04:52 +0000 |
|---|---|---|
| committer | Tatsuhiro Tsujikawa <tatsuhiro.t@gmail.com> | 2010-02-28 16:04:52 +0000 |
| commit | 72e475dfdeaa4a87dff0eef994e7814e94c40363 (patch) | |
| tree | 94a84e90c14876db223e4a733f651fe0b034f5e9 /src/PriorityPieceSelector.cc | |
| parent | c342bde9627b434effbc0cd10b817670d1da0923 (diff) | |
2010-03-01 Tatsuhiro Tsujikawa <t-tujikawa@users.sourceforge.net>
Avoid to calculate end() iterator in each loop. std::deque is
particularly slow. Make sure that recalculate end iterator if
element is erased during loop.
Diffstat (limited to 'src/PriorityPieceSelector.cc')
| -rw-r--r-- | src/PriorityPieceSelector.cc | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/src/PriorityPieceSelector.cc b/src/PriorityPieceSelector.cc index 808732b5..cb7ded3d 100644 --- a/src/PriorityPieceSelector.cc +++ b/src/PriorityPieceSelector.cc @@ -44,8 +44,8 @@ PriorityPieceSelector::PriorityPieceSelector bool PriorityPieceSelector::select (size_t& index, const unsigned char* bitfield, size_t nbits) const { - for(std::vector<size_t>::const_iterator i = _prioritizedPieces.begin(); - i != _prioritizedPieces.end(); ++i) { + for(std::vector<size_t>::const_iterator i = _prioritizedPieces.begin(), + eoi = _prioritizedPieces.end(); i != eoi; ++i) { if(bitfield::test(bitfield, nbits, *i)) { index = *i; return true; |