Peter Otten wrote: > def itoa(n, base): > assert 2 <= base <= 16 > if n < 0: > digits = ["-"] > n = -n > else: > digits = [] > while n: > n, m = divmod(n, base) > digits.append(string.hexdigits[m]) > digits.reverse() > return "".join(digits)
This is junk, sorry. Doesn't handle n<=0 correctly (at least). Peter -- http://mail.python.org/mailman/listinfo/python-list
