Merge pull request #1 from cpacia/nodeheapfix

Bug fix in NodeHeap - no duplicates

kademlia/node.py

@@ -94,6 +94,7 @@ class NodeHeap(object):
             nodes = [nodes]
 
         for node in nodes:
+	    if node not in self:
                 distance = self.node.distanceTo(node)
                 heapq.heappush(self.heap, (distance, node))
 
@@ -104,5 +105,11 @@ class NodeHeap(object):
         nodes = heapq.nsmallest(self.maxsize, self.heap)
         return iter(map(itemgetter(1), nodes))
 
+    def __contains__(self, node):
+        for distance, n in self.heap:
+            if node.id == n.id:
+                return True
+        return False	
+
     def getUncontacted(self):
         return [n for n in self if n.id not in self.contacted]