home *** CD-ROM | disk | FTP | other *** search
- # Source Generated with Decompyle++
- # File: in.pyc (Python 2.4)
-
- from sha import sha
- from random import randint
-
- try:
- from entropy import entropy
- except ImportError:
-
- def entropy(n):
- s = ''
- for i in range(n):
- s += chr(randint(0, 255))
-
- return s
-
-
-
- def intify(hstr):
- '''20 bit hash, big-endian -> long python integer'''
- if not len(hstr) == 20:
- raise AssertionError
- return long(hstr.encode('hex'), 16)
-
-
- def stringify(num):
- '''long int -> 20-character string'''
- str = hex(num)[2:]
- if str[-1] == 'L':
- str = str[:-1]
-
- if len(str) % 2 != 0:
- str = '0' + str
-
- str = str.decode('hex')
- return (20 - len(str)) * '\x00' + str
-
-
- def distance(a, b):
- '''distance between two 160-bit hashes expressed as 20-character strings'''
- return intify(a) ^ intify(b)
-
-
- def newID():
- '''returns a new pseudorandom globally unique ID string'''
- h = sha()
- h.update(entropy(20))
- return h.digest()
-
-
- def newIDInRange(min, max):
- return stringify(randRange(min, max))
-
-
- def randRange(min, max):
- return min + intify(newID()) % (max - min)
-
-
- def newTID():
- return randRange(-2 ** 30, 2 ** 30)
-
- import unittest
-
- class NewID(unittest.TestCase):
-
- def testLength(self):
- self.assertEqual(len(newID()), 20)
-
-
- def testHundreds(self):
- for x in xrange(100):
- self.testLength
-
-
-
-
- class Intify(unittest.TestCase):
- known = [
- ('\x00' * 20, 0),
- ('\xff' * 20, 0x2L ** 160 - 1)]
-
- def testKnown(self):
- for str, value in self.known:
- self.assertEqual(intify(str), value)
-
-
-
- def testEndianessOnce(self):
- h = newID()
- while h[-1] == '\xff':
- h = newID()
- k = h[:-1] + chr(ord(h[-1]) + 1)
- self.assertEqual(intify(k) - intify(h), 1)
-
-
- def testEndianessLots(self):
- for x in xrange(100):
- self.testEndianessOnce()
-
-
-
-
- class Disantance(unittest.TestCase):
- known = [
- (('\x00' * 20, '\xff' * 20), 2 ** 0xA0L - 1),
- ((sha('foo').digest(), sha('foo').digest()), 0),
- ((sha('bar').digest(), sha('bar').digest()), 0)]
-
- def testKnown(self):
- for pair, dist in self.known:
- self.assertEqual(distance(pair[0], pair[1]), dist)
-
-
-
- def testCommutitive(self):
- for i in xrange(100):
- x = newID()
- y = newID()
- z = newID()
- self.assertEqual(distance(x, y) ^ distance(y, z), distance(x, z))
-
-
-
-
- class RandRange(unittest.TestCase):
-
- def testOnce(self):
- a = intify(newID())
- b = intify(newID())
- if a < b:
- c = randRange(a, b)
- None(self.assertEqual if c <= c else c < b, 1, 'output out of range %d %d %d' % (b, c, a))
- else:
- c = randRange(b, a)
- if c <= c:
- pass
- elif not c < a:
- raise AssertionError, 'output out of range %d %d %d' % (b, c, a)
-
-
- def testOneHundredTimes(self):
- for i in xrange(100):
- self.testOnce()
-
-
-
- if __name__ == '__main__':
- unittest.main()
-
-