mirror of https://github.com/aria2/aria2
2008-05-12 Tatsuhiro Tsujikawa <tujikawa at rednoah dot com>
Changed method signature: DHTAbstractNodeLookupTask::toEntries * src/DHTAbstractNodeLookupTask.cc * src/DHTAbstractNodeLookupTask.hpull/1/head
parent
41b6003cbd
commit
c1ba19efe2
|
@ -1,3 +1,10 @@
|
||||||
|
2008-05-12 Tatsuhiro Tsujikawa <tujikawa at rednoah dot com>
|
||||||
|
|
||||||
|
Changed method signature:
|
||||||
|
DHTAbstractNodeLookupTask::toEntries
|
||||||
|
* src/DHTAbstractNodeLookupTask.cc
|
||||||
|
* src/DHTAbstractNodeLookupTask.h
|
||||||
|
|
||||||
2008-05-12 Tatsuhiro Tsujikawa <tujikawa at rednoah dot com>
|
2008-05-12 Tatsuhiro Tsujikawa <tujikawa at rednoah dot com>
|
||||||
|
|
||||||
Changed method signature:
|
Changed method signature:
|
||||||
|
|
|
@ -62,7 +62,8 @@ void DHTAbstractNodeLookupTask::onReceived(const SharedHandle<DHTMessage>& messa
|
||||||
onReceivedInternal(message);
|
onReceivedInternal(message);
|
||||||
std::deque<SharedHandle<DHTNode> > nodes;
|
std::deque<SharedHandle<DHTNode> > nodes;
|
||||||
getNodesFromMessage(nodes, message);
|
getNodesFromMessage(nodes, message);
|
||||||
std::deque<SharedHandle<DHTNodeLookupEntry> > newEntries = toEntries(nodes);
|
std::deque<SharedHandle<DHTNodeLookupEntry> > newEntries;
|
||||||
|
toEntries(newEntries, nodes);
|
||||||
|
|
||||||
size_t count = 0;
|
size_t count = 0;
|
||||||
for(std::deque<SharedHandle<DHTNodeLookupEntry> >::const_iterator i = newEntries.begin();
|
for(std::deque<SharedHandle<DHTNodeLookupEntry> >::const_iterator i = newEntries.begin();
|
||||||
|
@ -138,7 +139,8 @@ void DHTAbstractNodeLookupTask::startup()
|
||||||
{
|
{
|
||||||
std::deque<SharedHandle<DHTNode> > nodes;
|
std::deque<SharedHandle<DHTNode> > nodes;
|
||||||
_routingTable->getClosestKNodes(nodes, _targetID);
|
_routingTable->getClosestKNodes(nodes, _targetID);
|
||||||
_entries = toEntries(nodes);
|
_entries.clear();
|
||||||
|
toEntries(_entries, nodes);
|
||||||
if(_entries.empty()) {
|
if(_entries.empty()) {
|
||||||
_finished = true;
|
_finished = true;
|
||||||
} else {
|
} else {
|
||||||
|
@ -152,15 +154,14 @@ void DHTAbstractNodeLookupTask::startup()
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
std::deque<SharedHandle<DHTNodeLookupEntry> >
|
void DHTAbstractNodeLookupTask::toEntries
|
||||||
DHTAbstractNodeLookupTask::toEntries(const std::deque<SharedHandle<DHTNode> >& nodes) const
|
(std::deque<SharedHandle<DHTNodeLookupEntry> >& entries,
|
||||||
|
const std::deque<SharedHandle<DHTNode> >& nodes) const
|
||||||
{
|
{
|
||||||
std::deque<SharedHandle<DHTNodeLookupEntry> > entries;
|
|
||||||
for(std::deque<SharedHandle<DHTNode> >::const_iterator i = nodes.begin(); i != nodes.end(); ++i) {
|
for(std::deque<SharedHandle<DHTNode> >::const_iterator i = nodes.begin(); i != nodes.end(); ++i) {
|
||||||
SharedHandle<DHTNodeLookupEntry> e(new DHTNodeLookupEntry(*i));
|
SharedHandle<DHTNodeLookupEntry> e(new DHTNodeLookupEntry(*i));
|
||||||
entries.push_back(e);
|
entries.push_back(e);
|
||||||
}
|
}
|
||||||
return entries;
|
|
||||||
}
|
}
|
||||||
|
|
||||||
} // namespace aria2
|
} // namespace aria2
|
||||||
|
|
|
@ -53,9 +53,9 @@ protected:
|
||||||
std::deque<SharedHandle<DHTNodeLookupEntry> > _entries;
|
std::deque<SharedHandle<DHTNodeLookupEntry> > _entries;
|
||||||
|
|
||||||
size_t _inFlightMessage;
|
size_t _inFlightMessage;
|
||||||
|
|
||||||
std::deque<SharedHandle<DHTNodeLookupEntry> >
|
void toEntries(std::deque<SharedHandle<DHTNodeLookupEntry> >& entries,
|
||||||
toEntries(const std::deque<SharedHandle<DHTNode> >& nodes) const;
|
const std::deque<SharedHandle<DHTNode> >& nodes) const;
|
||||||
|
|
||||||
void sendMessage();
|
void sendMessage();
|
||||||
|
|
||||||
|
|
Loading…
Reference in New Issue