futures

diff --git a/src/consensus/consensus-simulation.py b/src/consensus/consensus-simulation.py
index 19b636cbd4e8262dadee7ec8dc7426019f8a3c22..542fe0dac05a99edaacc2503dc18bcf3aba38240 100644 (file)
--- a/src/consensus/consensus-simulation.py
+++ b/src/consensus/consensus-simulation.py
@@ -17,10 +17,13 @@
 # Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
 # Boston, MA 02110-1301, USA.
 
+from __future__ import absolute_import
+from __future__ import print_function
 import argparse
 import random
 from math import ceil,log,floor
 
+
 def bsc(n):
   """ count the bits set in n"""
   l = n.bit_length()
@@ -32,6 +35,7 @@ def bsc(n):
     x = x << 1
   return c
 
+
 def simulate(k, n, verbose):
   assert k < n
   largest_arc = int(2**ceil(log(n, 2))) / 2
@@ -87,6 +91,7 @@ def simulate(k, n, verbose):
     random.shuffle(peers)
   return rounds
 
+
 if __name__ == "__main__":
   parser = argparse.ArgumentParser()
   parser.add_argument("k", metavar="k", type=int, help="#(bad peers)")
@@ -98,6 +103,6 @@ if __name__ == "__main__":
   sum = 0.0;
   for n in xrange (0, args.r):
     sum += simulate(args.k, args.n, args.verbose)
-  print sum / args.r;
+  printsum / args.r;
 
 

diff --git a/src/dht/test_dht_tools.py.in b/src/dht/test_dht_tools.py.in
index f5dd14f67283a03cc6b5ce87710ee2cbbc7ede96..2d4ab9adc756327288cc862a8a22db74c296eb09 100644 (file)
--- a/src/dht/test_dht_tools.py.in
+++ b/src/dht/test_dht_tools.py.in
@@ -12,6 +12,7 @@
 # The code does NOT depend on DHT routing or any actual P2P functionality.
 #
 from __future__ import print_function
+from __future__ import absolute_import
 import os
 import sys
 import shutil