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/Piece.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/Piece.cc')
| -rw-r--r-- | src/Piece.cc | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/src/Piece.cc b/src/Piece.cc index 3c71bd8c..4b7620e8 100644 --- a/src/Piece.cc +++ b/src/Piece.cc @@ -176,8 +176,8 @@ size_t Piece::getMissingUnusedBlockIndex { size_t num = bitfield->getFirstNMissingUnusedIndex(indexes, n); if(num) { - for(std::vector<size_t>::const_iterator i = indexes.end()-num; - i != indexes.end(); ++i) { + for(std::vector<size_t>::const_iterator i = indexes.end()-num, + eoi = indexes.end(); i != eoi; ++i) { bitfield->setUseBit(*i); } } |
