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/DHTAbstractNodeLookupTask.h | |
| 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/DHTAbstractNodeLookupTask.h')
| -rw-r--r-- | src/DHTAbstractNodeLookupTask.h | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/src/DHTAbstractNodeLookupTask.h b/src/DHTAbstractNodeLookupTask.h index 30fbf86c..824b7e0a 100644 --- a/src/DHTAbstractNodeLookupTask.h +++ b/src/DHTAbstractNodeLookupTask.h @@ -61,8 +61,8 @@ protected: void toEntries (Container& entries, const std::vector<SharedHandle<DHTNode> >& nodes) const { - for(std::vector<SharedHandle<DHTNode> >::const_iterator i = nodes.begin(); - i != nodes.end(); ++i) { + for(std::vector<SharedHandle<DHTNode> >::const_iterator i = nodes.begin(), + eoi = nodes.end(); i != eoi; ++i) { SharedHandle<DHTNodeLookupEntry> e(new DHTNodeLookupEntry(*i)); entries.push_back(e); } |