jinx/python-uncompyle6
1
Fork 0
mirror of https://github.com/rocky/python-uncompyle6.git synced 2025-08-03 00:45:53 +08:00
Code Issues Packages Projects Releases Wiki Activity

Remove long suffix "L" on ints in bytecode for > 3.0

Browse Source
This commit is contained in:
rocky
2020-01-08 11:54:45 -05:00
parent 13d9bcaaa9
commit a98bc444f7
3 changed files with 18 additions and 9 deletions
Download Patch File Download Diff File Expand all files Collapse all files

19
uncompyle6/util.py
View File

@@ -3,12 +3,13 @@
# More could be done here though.
from math import copysign
from uncompyle6 import PYTHON_VERSION
def is_negative_zero(n):
"""Returns true if n is -0.0"""
return n == 0.0 and copysign(1, n) == -1
def better_repr(v):
def better_repr(v, version):
"""Work around Python's unorthogonal and unhelpful repr() for primitive float
and complex."""
if isinstance(v, float):
@@ -23,20 +24,26 @@ def better_repr(v):
return "-0.0"
return repr(v)
elif isinstance(v, complex):
real = better_repr(v.real)
imag = better_repr(v.imag)
real = better_repr(v.real, version)
imag = better_repr(v.imag, version)
# FIXME: we could probably use repr() in most cases
# sort out when that's possible.
# The below is however round-tripable, and Python's repr() isn't.
return "complex(%s, %s)" % (real, imag)
elif isinstance(v, tuple):
if len(v) == 1:
return "(%s,)" % better_repr(v[0])
return "(%s)" % ", ".join(better_repr(i) for i in v)
return "(%s,)" % better_repr(v[0], version)
return "(%s)" % ", ".join(better_repr(i, version) for i in v)
elif PYTHON_VERSION < 3.0 and isinstance(v, long):
s = repr(v)
if version >= 3.0 and s[-1] == "L":
return s[:-1]
else:
return s
elif isinstance(v, list):
l = better_repr(v)
if len(v) == 1:
return "[%s,]" % better_repr(v[0])
return "[%s,]" % better_repr(v[0], version)
return "[%s]" % ", ".join(better_repr(i) for i in v)
# TODO: elif deal with sets and dicts
else: