Ilgrim/kademlia
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

fixed bug, updated readme

Browse Source
This commit is contained in:
Brian Muller 2014-03-25 08:37:25 -04:00
parent 2823b30672
commit 33d0fc898b
2 changed files with 2 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
README.markdown
View File

@ -1,7 +1,7 @@
# Python Distributed Hash Table # Python Distributed Hash Table
[![Build Status](https://secure.travis-ci.org/bmuller/kademlia.png?branch=master)](https://travis-ci.org/bmuller/kademlia) [![Build Status](https://secure.travis-ci.org/bmuller/kademlia.png?branch=master)](https://travis-ci.org/bmuller/kademlia)
This library is an asynchronous Python implementation of the [Kademlia distributed hash table](http://en.wikipedia.org/wiki/Kademlia). It uses [Twisted]() to provide asynchronous communication. The nodes communicate using [RPC over UDP](https://github.com/bmuller/rpcudp) to communiate, meaning that it is capable of working behind a [NAT](http://en.wikipedia.org/wiki/NAT). This library is an asynchronous Python implementation of the [Kademlia distributed hash table](http://en.wikipedia.org/wiki/Kademlia). It uses [Twisted](https://twistedmatrix.com) to provide asynchronous communication. The nodes communicate using [RPC over UDP](https://github.com/bmuller/rpcudp) to communiate, meaning that it is capable of working behind a [NAT](http://en.wikipedia.org/wiki/NAT).
This library aims to be as close to a reference implementation of the [Kademlia paper](http://pdos.csail.mit.edu/~petar/papers/maymounkov-kademlia-lncs.pdf) as possible. This library aims to be as close to a reference implementation of the [Kademlia paper](http://pdos.csail.mit.edu/~petar/papers/maymounkov-kademlia-lncs.pdf) as possible.

2
kademlia/crawling.py
View File

@ -85,7 +85,7 @@ class ValueSpiderCrawl(SpiderCrawl):
elif response.hasValue(): elif response.hasValue():
foundValues.append(response.getValue()) foundValues.append(response.getValue())
else: else:
peer = self.nearest.getById(peerid) peer = self.nearest.getNodeById(peerid)
self.nearestWithoutValue.push(peer) self.nearestWithoutValue.push(peer)
self.nearest.push(response.getNodeList()) self.nearest.push(response.getNodeList())
self.nearest.remove(toremove) self.nearest.remove(toremove)