From 33d0fc898b230429fc87fb7091dbda656b35d0e0 Mon Sep 17 00:00:00 2001 From: Brian Muller Date: Tue, 25 Mar 2014 08:37:25 -0400 Subject: [PATCH] fixed bug, updated readme --- README.markdown | 2 +- kademlia/crawling.py | 2 +- 2 files changed, 2 insertions(+), 2 deletions(-) diff --git a/README.markdown b/README.markdown index 625a467..e9c9bad 100644 --- a/README.markdown +++ b/README.markdown @@ -1,7 +1,7 @@ # Python Distributed Hash Table [![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. diff --git a/kademlia/crawling.py b/kademlia/crawling.py index ade427d..57bda72 100644 --- a/kademlia/crawling.py +++ b/kademlia/crawling.py @@ -85,7 +85,7 @@ class ValueSpiderCrawl(SpiderCrawl): elif response.hasValue(): foundValues.append(response.getValue()) else: - peer = self.nearest.getById(peerid) + peer = self.nearest.getNodeById(peerid) self.nearestWithoutValue.push(peer) self.nearest.push(response.getNodeList()) self.nearest.remove(toremove)