Server: appserver-7f0f8755-nginx-15961cad18524ec5a9db05f2a6a7e440
Current directory: /usr/lib/python3.11
Software: nginx/1.27.5
Shell Command
Create a new file
Upload file
File: fractions.py
# Originally contributed by Sjoerd Mullender. # Significantly modified by Jeffrey Yasskin
. """Fraction, infinite-precision, rational numbers.""" from decimal import Decimal import math import numbers import operator import re import sys __all__ = ['Fraction'] # Constants related to the hash implementation; hash(x) is based # on the reduction of x modulo the prime _PyHASH_MODULUS. _PyHASH_MODULUS = sys.hash_info.modulus # Value to be used for rationals that reduce to infinity modulo # _PyHASH_MODULUS. _PyHASH_INF = sys.hash_info.inf _RATIONAL_FORMAT = re.compile(r""" \A\s* # optional whitespace at the start, (?P
[-+]?) # an optional sign, then (?=\d|\.\d) # lookahead for digit or .digit (?P
\d*|\d+(_\d+)*) # numerator (possibly empty) (?: # followed by (?:/(?P
\d+(_\d+)*))? # an optional denominator | # or (?:\.(?P
d*|\d+(_\d+)*))? # an optional fractional part (?:E(?P
[-+]?\d+(_\d+)*))? # and optional exponent ) \s*\Z # and optional whitespace to finish """, re.VERBOSE | re.IGNORECASE) class Fraction(numbers.Rational): """This class implements rational numbers. In the two-argument form of the constructor, Fraction(8, 6) will produce a rational number equivalent to 4/3. Both arguments must be Rational. The numerator defaults to 0 and the denominator defaults to 1 so that Fraction(3) == 3 and Fraction() == 0. Fractions can also be constructed from: - numeric strings similar to those accepted by the float constructor (for example, '-2.3' or '1e10') - strings of the form '123/456' - float and Decimal instances - other Rational instances (including integers) """ __slots__ = ('_numerator', '_denominator') # We're immutable, so use __new__ not __init__ def __new__(cls, numerator=0, denominator=None, *, _normalize=True): """Constructs a Rational. Takes a string like '3/2' or '1.5', another Rational instance, a numerator/denominator pair, or a float. Examples -------- >>> Fraction(10, -8) Fraction(-5, 4) >>> Fraction(Fraction(1, 7), 5) Fraction(1, 35) >>> Fraction(Fraction(1, 7), Fraction(2, 3)) Fraction(3, 14) >>> Fraction('314') Fraction(314, 1) >>> Fraction('-35/4') Fraction(-35, 4) >>> Fraction('3.1415') # conversion from numeric string Fraction(6283, 2000) >>> Fraction('-47e-2') # string may include a decimal exponent Fraction(-47, 100) >>> Fraction(1.47) # direct construction from float (exact conversion) Fraction(6620291452234629, 4503599627370496) >>> Fraction(2.25) Fraction(9, 4) >>> Fraction(Decimal('1.47')) Fraction(147, 100) """ self = super(Fraction, cls).__new__(cls) if denominator is None: if type(numerator) is int: self._numerator = numerator self._denominator = 1 return self elif isinstance(numerator, numbers.Rational): self._numerator = numerator.numerator self._denominator = numerator.denominator return self elif isinstance(numerator, (float, Decimal)): # Exact conversion self._numerator, self._denominator = numerator.as_integer_ratio() return self elif isinstance(numerator, str): # Handle construction from strings. m = _RATIONAL_FORMAT.match(numerator) if m is None: raise ValueError('Invalid literal for Fraction: %r' % numerator) numerator = int(m.group('num') or '0') denom = m.group('denom') if denom: denominator = int(denom) else: denominator = 1 decimal = m.group('decimal') if decimal: decimal = decimal.replace('_', '') scale = 10**len(decimal) numerator = numerator * scale + int(decimal) denominator *= scale exp = m.group('exp') if exp: exp = int(exp) if exp >= 0: numerator *= 10**exp else: denominator *= 10**-exp if m.group('sign') == '-': numerator = -numerator else: raise TypeError("argument should be a string " "or a Rational instance") elif type(numerator) is int is type(denominator): pass # *very* normal case elif (isinstance(numerator, numbers.Rational) and isinstance(denominator, numbers.Rational)): numerator, denominator = ( numerator.numerator * denominator.denominator, denominator.numerator * numerator.denominator ) else: raise TypeError("both arguments should be " "Rational instances") if denominator == 0: raise ZeroDivisionError('Fraction(%s, 0)' % numerator) if _normalize: g = math.gcd(numerator, denominator) if denominator < 0: g = -g numerator //= g denominator //= g self._numerator = numerator self._denominator = denominator return self @classmethod def from_float(cls, f): """Converts a finite float to a rational number, exactly. Beware that Fraction.from_float(0.3) != Fraction(3, 10). """ if isinstance(f, numbers.Integral): return cls(f) elif not isinstance(f, float): raise TypeError("%s.from_float() only takes floats, not %r (%s)" % (cls.__name__, f, type(f).__name__)) return cls(*f.as_integer_ratio()) @classmethod def from_decimal(cls, dec): """Converts a finite Decimal instance to a rational number, exactly.""" from decimal import Decimal if isinstance(dec, numbers.Integral): dec = Decimal(int(dec)) elif not isinstance(dec, Decimal): raise TypeError( "%s.from_decimal() only takes Decimals, not %r (%s)" % (cls.__name__, dec, type(dec).__name__)) return cls(*dec.as_integer_ratio()) def as_integer_ratio(self): """Return the integer ratio as a tuple. Return a tuple of two integers, whose ratio is equal to the Fraction and with a positive denominator. """ return (self._numerator, self._denominator) def limit_denominator(self, max_denominator=1000000): """Closest Fraction to self with denominator at most max_denominator. >>> Fraction('3.141592653589793').limit_denominator(10) Fraction(22, 7) >>> Fraction('3.141592653589793').limit_denominator(100) Fraction(311, 99) >>> Fraction(4321, 8765).limit_denominator(10000) Fraction(4321, 8765) """ # Algorithm notes: For any real number x, define a *best upper # approximation* to x to be a rational number p/q such that: # # (1) p/q >= x, and # (2) if p/q > r/s >= x then s > q, for any rational r/s. # # Define *best lower approximation* similarly. Then it can be # proved that a rational number is a best upper or lower # approximation to x if, and only if, it is a convergent or # semiconvergent of the (unique shortest) continued fraction # associated to x. # # To find a best rational approximation with denominator <= M, # we find the best upper and lower approximations with # denominator <= M and take whichever of these is closer to x. # In the event of a tie, the bound with smaller denominator is # chosen. If both denominators are equal (which can happen # only when max_denominator == 1 and self is midway between # two integers) the lower bound---i.e., the floor of self, is # taken. if max_denominator < 1: raise ValueError("max_denominator should be at least 1") if self._denominator <= max_denominator: return Fraction(self) p0, q0, p1, q1 = 0, 1, 1, 0 n, d = self._numerator, self._denominator while True: a = n//d q2 = q0+a*q1 if q2 > max_denominator: break p0, q0, p1, q1 = p1, q1, p0+a*p1, q2 n, d = d, n-a*d k = (max_denominator-q0)//q1 bound1 = Fraction(p0+k*p1, q0+k*q1) bound2 = Fraction(p1, q1) if abs(bound2 - self) <= abs(bound1-self): return bound2 else: return bound1 @property def numerator(a): return a._numerator @property def denominator(a): return a._denominator def __repr__(self): """repr(self)""" return '%s(%s, %s)' % (self.__class__.__name__, self._numerator, self._denominator) def __str__(self): """str(self)""" if self._denominator == 1: return str(self._numerator) else: return '%s/%s' % (self._numerator, self._denominator) def _operator_fallbacks(monomorphic_operator, fallback_operator): """Generates forward and reverse operators given a purely-rational operator and a function from the operator module. Use this like: __op__, __rop__ = _operator_fallbacks(just_rational_op, operator.op) In general, we want to implement the arithmetic operations so that mixed-mode operations either call an implementation whose author knew about the types of both arguments, or convert both to the nearest built in type and do the operation there. In Fraction, that means that we define __add__ and __radd__ as: def __add__(self, other): # Both types have numerators/denominator attributes, # so do the operation directly if isinstance(other, (int, Fraction)): return Fraction(self.numerator * other.denominator + other.numerator * self.denominator, self.denominator * other.denominator) # float and complex don't have those operations, but we # know about those types, so special case them. elif isinstance(other, float): return float(self) + other elif isinstance(other, complex): return complex(self) + other # Let the other type take over. return NotImplemented def __radd__(self, other): # radd handles more types than add because there's # nothing left to fall back to. if isinstance(other, numbers.Rational): return Fraction(self.numerator * other.denominator + other.numerator * self.denominator, self.denominator * other.denominator) elif isinstance(other, Real): return float(other) + float(self) elif isinstance(other, Complex): return complex(other) + complex(self) return NotImplemented There are 5 different cases for a mixed-type addition on Fraction. I'll refer to all of the above code that doesn't refer to Fraction, float, or complex as "boilerplate". 'r' will be an instance of Fraction, which is a subtype of Rational (r : Fraction <: Rational), and b : B <: Complex. The first three involve 'r + b': 1. If B <: Fraction, int, float, or complex, we handle that specially, and all is well. 2. If Fraction falls back to the boilerplate code, and it were to return a value from __add__, we'd miss the possibility that B defines a more intelligent __radd__, so the boilerplate should return NotImplemented from __add__. In particular, we don't handle Rational here, even though we could get an exact answer, in case the other type wants to do something special. 3. If B <: Fraction, Python tries B.__radd__ before Fraction.__add__. This is ok, because it was implemented with knowledge of Fraction, so it can handle those instances before delegating to Real or Complex. The next two situations describe 'b + r'. We assume that b didn't know about Fraction in its implementation, and that it uses similar boilerplate code: 4. If B <: Rational, then __radd_ converts both to the builtin rational type (hey look, that's us) and proceeds. 5. Otherwise, __radd__ tries to find the nearest common base ABC, and fall back to its builtin type. Since this class doesn't subclass a concrete type, there's no implementation to fall back to, so we need to try as hard as possible to return an actual value, or the user will get a TypeError. """ def forward(a, b): if isinstance(b, (int, Fraction)): return monomorphic_operator(a, b) elif isinstance(b, float): return fallback_operator(float(a), b) elif isinstance(b, complex): return fallback_operator(complex(a), b) else: return NotImplemented forward.__name__ = '__' + fallback_operator.__name__ + '__' forward.__doc__ = monomorphic_operator.__doc__ def reverse(b, a): if isinstance(a, numbers.Rational): # Includes ints. return monomorphic_operator(a, b) elif isinstance(a, numbers.Real): return fallback_operator(float(a), float(b)) elif isinstance(a, numbers.Complex): return fallback_operator(complex(a), complex(b)) else: return NotImplemented reverse.__name__ = '__r' + fallback_operator.__name__ + '__' reverse.__doc__ = monomorphic_operator.__doc__ return forward, reverse # Rational arithmetic algorithms: Knuth, TAOCP, Volume 2, 4.5.1. # # Assume input fractions a and b are normalized. # # 1) Consider addition/subtraction. # # Let g = gcd(da, db). Then # # na nb na*db ± nb*da # a ± b == -- ± -- == ------------- == # da db da*db # # na*(db//g) ± nb*(da//g) t # == ----------------------- == - # (da*db)//g d # # Now, if g > 1, we're working with smaller integers. # # Note, that t, (da//g) and (db//g) are pairwise coprime. # # Indeed, (da//g) and (db//g) share no common factors (they were # removed) and da is coprime with na (since input fractions are # normalized), hence (da//g) and na are coprime. By symmetry, # (db//g) and nb are coprime too. Then, # # gcd(t, da//g) == gcd(na*(db//g), da//g) == 1 # gcd(t, db//g) == gcd(nb*(da//g), db//g) == 1 # # Above allows us optimize reduction of the result to lowest # terms. Indeed, # # g2 = gcd(t, d) == gcd(t, (da//g)*(db//g)*g) == gcd(t, g) # # t//g2 t//g2 # a ± b == ----------------------- == ---------------- # (da//g)*(db//g)*(g//g2) (da//g)*(db//g2) # # is a normalized fraction. This is useful because the unnormalized # denominator d could be much larger than g. # # We should special-case g == 1 (and g2 == 1), since 60.8% of # randomly-chosen integers are coprime: # https://en.wikipedia.org/wiki/Coprime_integers#Probability_of_coprimality # Note, that g2 == 1 always for fractions, obtained from floats: here # g is a power of 2 and the unnormalized numerator t is an odd integer. # # 2) Consider multiplication # # Let g1 = gcd(na, db) and g2 = gcd(nb, da), then # # na*nb na*nb (na//g1)*(nb//g2) # a*b == ----- == ----- == ----------------- # da*db db*da (db//g1)*(da//g2) # # Note, that after divisions we're multiplying smaller integers. # # Also, the resulting fraction is normalized, because each of # two factors in the numerator is coprime to each of the two factors # in the denominator. # # Indeed, pick (na//g1). It's coprime with (da//g2), because input # fractions are normalized. It's also coprime with (db//g1), because # common factors are removed by g1 == gcd(na, db). # # As for addition/subtraction, we should special-case g1 == 1 # and g2 == 1 for same reason. That happens also for multiplying # rationals, obtained from floats. def _add(a, b): """a + b""" na, da = a.numerator, a.denominator nb, db = b.numerator, b.denominator g = math.gcd(da, db) if g == 1: return Fraction(na * db + da * nb, da * db, _normalize=False) s = da // g t = na * (db // g) + nb * s g2 = math.gcd(t, g) if g2 == 1: return Fraction(t, s * db, _normalize=False) return Fraction(t // g2, s * (db // g2), _normalize=False) __add__, __radd__ = _operator_fallbacks(_add, operator.add) def _sub(a, b): """a - b""" na, da = a.numerator, a.denominator nb, db = b.numerator, b.denominator g = math.gcd(da, db) if g == 1: return Fraction(na * db - da * nb, da * db, _normalize=False) s = da // g t = na * (db // g) - nb * s g2 = math.gcd(t, g) if g2 == 1: return Fraction(t, s * db, _normalize=False) return Fraction(t // g2, s * (db // g2), _normalize=False) __sub__, __rsub__ = _operator_fallbacks(_sub, operator.sub) def _mul(a, b): """a * b""" na, da = a.numerator, a.denominator nb, db = b.numerator, b.denominator g1 = math.gcd(na, db) if g1 > 1: na //= g1 db //= g1 g2 = math.gcd(nb, da) if g2 > 1: nb //= g2 da //= g2 return Fraction(na * nb, db * da, _normalize=False) __mul__, __rmul__ = _operator_fallbacks(_mul, operator.mul) def _div(a, b): """a / b""" # Same as _mul(), with inversed b. na, da = a.numerator, a.denominator nb, db = b.numerator, b.denominator g1 = math.gcd(na, nb) if g1 > 1: na //= g1 nb //= g1 g2 = math.gcd(db, da) if g2 > 1: da //= g2 db //= g2 n, d = na * db, nb * da if d < 0: n, d = -n, -d return Fraction(n, d, _normalize=False) __truediv__, __rtruediv__ = _operator_fallbacks(_div, operator.truediv) def _floordiv(a, b): """a // b""" return (a.numerator * b.denominator) // (a.denominator * b.numerator) __floordiv__, __rfloordiv__ = _operator_fallbacks(_floordiv, operator.floordiv) def _divmod(a, b): """(a // b, a % b)""" da, db = a.denominator, b.denominator div, n_mod = divmod(a.numerator * db, da * b.numerator) return div, Fraction(n_mod, da * db) __divmod__, __rdivmod__ = _operator_fallbacks(_divmod, divmod) def _mod(a, b): """a % b""" da, db = a.denominator, b.denominator return Fraction((a.numerator * db) % (b.numerator * da), da * db) __mod__, __rmod__ = _operator_fallbacks(_mod, operator.mod) def __pow__(a, b): """a ** b If b is not an integer, the result will be a float or complex since roots are generally irrational. If b is an integer, the result will be rational. """ if isinstance(b, numbers.Rational): if b.denominator == 1: power = b.numerator if power >= 0: return Fraction(a._numerator ** power, a._denominator ** power, _normalize=False) elif a._numerator >= 0: return Fraction(a._denominator ** -power, a._numerator ** -power, _normalize=False) else: return Fraction((-a._denominator) ** -power, (-a._numerator) ** -power, _normalize=False) else: # A fractional power will generally produce an # irrational number. return float(a) ** float(b) else: return float(a) ** b def __rpow__(b, a): """a ** b""" if b._denominator == 1 and b._numerator >= 0: # If a is an int, keep it that way if possible. return a ** b._numerator if isinstance(a, numbers.Rational): return Fraction(a.numerator, a.denominator) ** b if b._denominator == 1: return a ** b._numerator return a ** float(b) def __pos__(a): """+a: Coerces a subclass instance to Fraction""" return Fraction(a._numerator, a._denominator, _normalize=False) def __neg__(a): """-a""" return Fraction(-a._numerator, a._denominator, _normalize=False) def __abs__(a): """abs(a)""" return Fraction(abs(a._numerator), a._denominator, _normalize=False) def __int__(a, _index=operator.index): """int(a)""" if a._numerator < 0: return _index(-(-a._numerator // a._denominator)) else: return _index(a._numerator // a._denominator) def __trunc__(a): """math.trunc(a)""" if a._numerator < 0: return -(-a._numerator // a._denominator) else: return a._numerator // a._denominator def __floor__(a): """math.floor(a)""" return a.numerator // a.denominator def __ceil__(a): """math.ceil(a)""" # The negations cleverly convince floordiv to return the ceiling. return -(-a.numerator // a.denominator) def __round__(self, ndigits=None): """round(self, ndigits) Rounds half toward even. """ if ndigits is None: floor, remainder = divmod(self.numerator, self.denominator) if remainder * 2 < self.denominator: return floor elif remainder * 2 > self.denominator: return floor + 1 # Deal with the half case: elif floor % 2 == 0: return floor else: return floor + 1 shift = 10**abs(ndigits) # See _operator_fallbacks.forward to check that the results of # these operations will always be Fraction and therefore have # round(). if ndigits > 0: return Fraction(round(self * shift), shift) else: return Fraction(round(self / shift) * shift) def __hash__(self): """hash(self)""" # To make sure that the hash of a Fraction agrees with the hash # of a numerically equal integer, float or Decimal instance, we # follow the rules for numeric hashes outlined in the # documentation. (See library docs, 'Built-in Types'). try: dinv = pow(self._denominator, -1, _PyHASH_MODULUS) except ValueError: # ValueError means there is no modular inverse. hash_ = _PyHASH_INF else: # The general algorithm now specifies that the absolute value of # the hash is # (|N| * dinv) % P # where N is self._numerator and P is _PyHASH_MODULUS. That's # optimized here in two ways: first, for a non-negative int i, # hash(i) == i % P, but the int hash implementation doesn't need # to divide, and is faster than doing % P explicitly. So we do # hash(|N| * dinv) # instead. Second, N is unbounded, so its product with dinv may # be arbitrarily expensive to compute. The final answer is the # same if we use the bounded |N| % P instead, which can again # be done with an int hash() call. If 0 <= i < P, hash(i) == i, # so this nested hash() call wastes a bit of time making a # redundant copy when |N| < P, but can save an arbitrarily large # amount of computation for large |N|. hash_ = hash(hash(abs(self._numerator)) * dinv) result = hash_ if self._numerator >= 0 else -hash_ return -2 if result == -1 else result def __eq__(a, b): """a == b""" if type(b) is int: return a._numerator == b and a._denominator == 1 if isinstance(b, numbers.Rational): return (a._numerator == b.numerator and a._denominator == b.denominator) if isinstance(b, numbers.Complex) and b.imag == 0: b = b.real if isinstance(b, float): if math.isnan(b) or math.isinf(b): # comparisons with an infinity or nan should behave in # the same way for any finite a, so treat a as zero. return 0.0 == b else: return a == a.from_float(b) else: # Since a doesn't know how to compare with b, let's give b # a chance to compare itself with a. return NotImplemented def _richcmp(self, other, op): """Helper for comparison operators, for internal use only. Implement comparison between a Rational instance `self`, and either another Rational instance or a float `other`. If `other` is not a Rational instance or a float, return NotImplemented. `op` should be one of the six standard comparison operators. """ # convert other to a Rational instance where reasonable. if isinstance(other, numbers.Rational): return op(self._numerator * other.denominator, self._denominator * other.numerator) if isinstance(other, float): if math.isnan(other) or math.isinf(other): return op(0.0, other) else: return op(self, self.from_float(other)) else: return NotImplemented def __lt__(a, b): """a < b""" return a._richcmp(b, operator.lt) def __gt__(a, b): """a > b""" return a._richcmp(b, operator.gt) def __le__(a, b): """a <= b""" return a._richcmp(b, operator.le) def __ge__(a, b): """a >= b""" return a._richcmp(b, operator.ge) def __bool__(a): """a != 0""" # bpo-39274: Use bool() because (a._numerator != 0) can return an # object which is not a bool. return bool(a._numerator) # support for pickling, copy, and deepcopy def __reduce__(self): return (self.__class__, (self._numerator, self._denominator)) def __copy__(self): if type(self) == Fraction: return self # I'm immutable; therefore I am my own clone return self.__class__(self._numerator, self._denominator) def __deepcopy__(self, memo): if type(self) == Fraction: return self # My components are also immutable return self.__class__(self._numerator, self._denominator)
.
204 Items
Change directory
Remove directory
Rename directory
..
72 Items
Change directory
Remove directory
Rename directory
EXTERNALLY-MANAGED
0.63 KB
Edit
Delete
Copy
Move
Remame
LICENSE.txt
13.61 KB
Edit
Delete
Copy
Move
Remame
__future__.py
5.1 KB
Edit
Delete
Copy
Move
Remame
__hello__.py
0.22 KB
Edit
Delete
Copy
Move
Remame
__phello__
3 Items
Change directory
Remove directory
Rename directory
__pycache__
171 Items
Change directory
Remove directory
Rename directory
_aix_support.py
3.31 KB
Edit
Delete
Copy
Move
Remame
_bootsubprocess.py
2.61 KB
Edit
Delete
Copy
Move
Remame
_collections_abc.py
29.49 KB
Edit
Delete
Copy
Move
Remame
_compat_pickle.py
8.56 KB
Edit
Delete
Copy
Move
Remame
_compression.py
5.55 KB
Edit
Delete
Copy
Move
Remame
_distutils_system_mod.py
6.16 KB
Edit
Delete
Copy
Move
Remame
_markupbase.py
14.31 KB
Edit
Delete
Copy
Move
Remame
_osx_support.py
21.28 KB
Edit
Delete
Copy
Move
Remame
_py_abc.py
6.04 KB
Edit
Delete
Copy
Move
Remame
_pydecimal.py
223.83 KB
Edit
Delete
Copy
Move
Remame
_pyio.py
91.83 KB
Edit
Delete
Copy
Move
Remame
_sitebuiltins.py
3.05 KB
Edit
Delete
Copy
Move
Remame
_strptime.py
24.68 KB
Edit
Delete
Copy
Move
Remame
_sysconfigdata__linux_x86_64-linux-gnu.py
42.36 KB
Edit
Delete
Copy
Move
Remame
_sysconfigdata__x86_64-linux-gnu.py
42.36 KB
Edit
Delete
Copy
Move
Remame
_threading_local.py
7.05 KB
Edit
Delete
Copy
Move
Remame
_weakrefset.py
5.75 KB
Edit
Delete
Copy
Move
Remame
abc.py
6.37 KB
Edit
Delete
Copy
Move
Remame
aifc.py
33.41 KB
Edit
Delete
Copy
Move
Remame
antigravity.py
0.49 KB
Edit
Delete
Copy
Move
Remame
argparse.py
97.28 KB
Edit
Delete
Copy
Move
Remame
ast.py
59.25 KB
Edit
Delete
Copy
Move
Remame
asynchat.py
11.3 KB
Edit
Delete
Copy
Move
Remame
asyncio
34 Items
Change directory
Remove directory
Rename directory
asyncore.py
19.83 KB
Edit
Delete
Copy
Move
Remame
base64.py
20.53 KB
Edit
Delete
Copy
Move
Remame
bdb.py
31.59 KB
Edit
Delete
Copy
Move
Remame
bisect.py
3.06 KB
Edit
Delete
Copy
Move
Remame
bz2.py
11.57 KB
Edit
Delete
Copy
Move
Remame
cProfile.py
6.19 KB
Edit
Delete
Copy
Move
Remame
calendar.py
24.17 KB
Edit
Delete
Copy
Move
Remame
cgi.py
33.61 KB
Edit
Delete
Copy
Move
Remame
cgitb.py
12.13 KB
Edit
Delete
Copy
Move
Remame
chunk.py
5.37 KB
Edit
Delete
Copy
Move
Remame
cmd.py
14.52 KB
Edit
Delete
Copy
Move
Remame
code.py
10.37 KB
Edit
Delete
Copy
Move
Remame
codecs.py
35.85 KB
Edit
Delete
Copy
Move
Remame
codeop.py
5.47 KB
Edit
Delete
Copy
Move
Remame
collections
3 Items
Change directory
Remove directory
Rename directory
colorsys.py
3.93 KB
Edit
Delete
Copy
Move
Remame
compileall.py
19.78 KB
Edit
Delete
Copy
Move
Remame
concurrent
3 Items
Change directory
Remove directory
Rename directory
configparser.py
53.96 KB
Edit
Delete
Copy
Move
Remame
contextlib.py
26.44 KB
Edit
Delete
Copy
Move
Remame
contextvars.py
0.13 KB
Edit
Delete
Copy
Move
Remame
copy.py
8.48 KB
Edit
Delete
Copy
Move
Remame
copyreg.py
7.5 KB
Edit
Delete
Copy
Move
Remame
crypt.py
3.82 KB
Edit
Delete
Copy
Move
Remame
csv.py
15.65 KB
Edit
Delete
Copy
Move
Remame
ctypes
6 Items
Change directory
Remove directory
Rename directory
curses
6 Items
Change directory
Remove directory
Rename directory
dataclasses.py
56.5 KB
Edit
Delete
Copy
Move
Remame
datetime.py
89.85 KB
Edit
Delete
Copy
Move
Remame
dbm
5 Items
Change directory
Remove directory
Rename directory
decimal.py
0.31 KB
Edit
Delete
Copy
Move
Remame
difflib.py
81.36 KB
Edit
Delete
Copy
Move
Remame
dis.py
28.28 KB
Edit
Delete
Copy
Move
Remame
distutils
31 Items
Change directory
Remove directory
Rename directory
doctest.py
102.71 KB
Edit
Delete
Copy
Move
Remame
email
23 Items
Change directory
Remove directory
Rename directory
encodings
123 Items
Change directory
Remove directory
Rename directory
enum.py
76.81 KB
Edit
Delete
Copy
Move
Remame
filecmp.py
9.94 KB
Edit
Delete
Copy
Move
Remame
fileinput.py
15.33 KB
Edit
Delete
Copy
Move
Remame
fnmatch.py
5.86 KB
Edit
Delete
Copy
Move
Remame
fractions.py
28 KB
Edit
Delete
Copy
Move
Remame
ftplib.py
34.66 KB
Edit
Delete
Copy
Move
Remame
functools.py
37.51 KB
Edit
Delete
Copy
Move
Remame
genericpath.py
4.86 KB
Edit
Delete
Copy
Move
Remame
getopt.py
7.31 KB
Edit
Delete
Copy
Move
Remame
getpass.py
5.85 KB
Edit
Delete
Copy
Move
Remame
gettext.py
20.8 KB
Edit
Delete
Copy
Move
Remame
glob.py
8.48 KB
Edit
Delete
Copy
Move
Remame
graphlib.py
9.43 KB
Edit
Delete
Copy
Move
Remame
gzip.py
23.51 KB
Edit
Delete
Copy
Move
Remame
hashlib.py
11.49 KB
Edit
Delete
Copy
Move
Remame
heapq.py
22.48 KB
Edit
Delete
Copy
Move
Remame
hmac.py
7.54 KB
Edit
Delete
Copy
Move
Remame
html
4 Items
Change directory
Remove directory
Rename directory
http
6 Items
Change directory
Remove directory
Rename directory
imaplib.py
53.58 KB
Edit
Delete
Copy
Move
Remame
imghdr.py
3.86 KB
Edit
Delete
Copy
Move
Remame
imp.py
10.36 KB
Edit
Delete
Copy
Move
Remame
importlib
12 Items
Change directory
Remove directory
Rename directory
inspect.py
121.28 KB
Edit
Delete
Copy
Move
Remame
io.py
4.14 KB
Edit
Delete
Copy
Move
Remame
ipaddress.py
76.45 KB
Edit
Delete
Copy
Move
Remame
json
6 Items
Change directory
Remove directory
Rename directory
keyword.py
1.04 KB
Edit
Delete
Copy
Move
Remame
lib-dynload
46 Items
Change directory
Remove directory
Rename directory
lib2to3
16 Items
Change directory
Remove directory
Rename directory
linecache.py
5.56 KB
Edit
Delete
Copy
Move
Remame
locale.py
77.15 KB
Edit
Delete
Copy
Move
Remame
logging
4 Items
Change directory
Remove directory
Rename directory
lzma.py
12.97 KB
Edit
Delete
Copy
Move
Remame
mailbox.py
76.95 KB
Edit
Delete
Copy
Move
Remame
mailcap.py
9.15 KB
Edit
Delete
Copy
Move
Remame
mimetypes.py
22.26 KB
Edit
Delete
Copy
Move
Remame
modulefinder.py
23.14 KB
Edit
Delete
Copy
Move
Remame
multiprocessing
23 Items
Change directory
Remove directory
Rename directory
netrc.py
6.77 KB
Edit
Delete
Copy
Move
Remame
nntplib.py
40.12 KB
Edit
Delete
Copy
Move
Remame
ntpath.py
28.95 KB
Edit
Delete
Copy
Move
Remame
nturl2path.py
2.82 KB
Edit
Delete
Copy
Move
Remame
numbers.py
10.11 KB
Edit
Delete
Copy
Move
Remame
opcode.py
10.2 KB
Edit
Delete
Copy
Move
Remame
operator.py
10.71 KB
Edit
Delete
Copy
Move
Remame
optparse.py
58.95 KB
Edit
Delete
Copy
Move
Remame
os.py
38.58 KB
Edit
Delete
Copy
Move
Remame
pathlib.py
47.44 KB
Edit
Delete
Copy
Move
Remame
pdb.py
62.4 KB
Edit
Delete
Copy
Move
Remame
pickle.py
63.43 KB
Edit
Delete
Copy
Move
Remame
pickletools.py
91.29 KB
Edit
Delete
Copy
Move
Remame
pipes.py
8.77 KB
Edit
Delete
Copy
Move
Remame
pkgutil.py
24.04 KB
Edit
Delete
Copy
Move
Remame
platform.py
41.28 KB
Edit
Delete
Copy
Move
Remame
plistlib.py
27.59 KB
Edit
Delete
Copy
Move
Remame
poplib.py
14.84 KB
Edit
Delete
Copy
Move
Remame
posixpath.py
16.61 KB
Edit
Delete
Copy
Move
Remame
pprint.py
23.92 KB
Edit
Delete
Copy
Move
Remame
profile.py
22.33 KB
Edit
Delete
Copy
Move
Remame
pstats.py
28.67 KB
Edit
Delete
Copy
Move
Remame
pty.py
5.09 KB
Edit
Delete
Copy
Move
Remame
py_compile.py
7.69 KB
Edit
Delete
Copy
Move
Remame
pyclbr.py
11.13 KB
Edit
Delete
Copy
Move
Remame
pydoc.py
106.57 KB
Edit
Delete
Copy
Move
Remame
pydoc_data
4 Items
Change directory
Remove directory
Rename directory
queue.py
11.23 KB
Edit
Delete
Copy
Move
Remame
quopri.py
7.1 KB
Edit
Delete
Copy
Move
Remame
random.py
31.41 KB
Edit
Delete
Copy
Move
Remame
re
6 Items
Change directory
Remove directory
Rename directory
reprlib.py
5.31 KB
Edit
Delete
Copy
Move
Remame
rlcompleter.py
7.64 KB
Edit
Delete
Copy
Move
Remame
runpy.py
12.85 KB
Edit
Delete
Copy
Move
Remame
sched.py
6.2 KB
Edit
Delete
Copy
Move
Remame
secrets.py
1.98 KB
Edit
Delete
Copy
Move
Remame
selectors.py
19.03 KB
Edit
Delete
Copy
Move
Remame
shelve.py
8.36 KB
Edit
Delete
Copy
Move
Remame
shlex.py
13.18 KB
Edit
Delete
Copy
Move
Remame
shutil.py
53.58 KB
Edit
Delete
Copy
Move
Remame
signal.py
2.38 KB
Edit
Delete
Copy
Move
Remame
site.py
23.17 KB
Edit
Delete
Copy
Move
Remame
sitecustomize.py
0.15 KB
Edit
Delete
Copy
Move
Remame
smtpd.py
30.43 KB
Edit
Delete
Copy
Move
Remame
smtplib.py
44.35 KB
Edit
Delete
Copy
Move
Remame
sndhdr.py
7.27 KB
Edit
Delete
Copy
Move
Remame
socket.py
36.41 KB
Edit
Delete
Copy
Move
Remame
socketserver.py
26.94 KB
Edit
Delete
Copy
Move
Remame
sqlite3
4 Items
Change directory
Remove directory
Rename directory
sre_compile.py
0.23 KB
Edit
Delete
Copy
Move
Remame
sre_constants.py
0.23 KB
Edit
Delete
Copy
Move
Remame
sre_parse.py
0.22 KB
Edit
Delete
Copy
Move
Remame
ssl.py
52.71 KB
Edit
Delete
Copy
Move
Remame
stat.py
5.36 KB
Edit
Delete
Copy
Move
Remame
statistics.py
46.59 KB
Edit
Delete
Copy
Move
Remame
string.py
11.51 KB
Edit
Delete
Copy
Move
Remame
stringprep.py
12.61 KB
Edit
Delete
Copy
Move
Remame
struct.py
0.25 KB
Edit
Delete
Copy
Move
Remame
subprocess.py
83.74 KB
Edit
Delete
Copy
Move
Remame
sunau.py
18.05 KB
Edit
Delete
Copy
Move
Remame
symtable.py
10.13 KB
Edit
Delete
Copy
Move
Remame
sysconfig.py
31.35 KB
Edit
Delete
Copy
Move
Remame
tabnanny.py
11.03 KB
Edit
Delete
Copy
Move
Remame
tarfile.py
95.25 KB
Edit
Delete
Copy
Move
Remame
telnetlib.py
22.75 KB
Edit
Delete
Copy
Move
Remame
tempfile.py
34.66 KB
Edit
Delete
Copy
Move
Remame
test
10 Items
Change directory
Remove directory
Rename directory
textwrap.py
19.26 KB
Edit
Delete
Copy
Move
Remame
this.py
0.98 KB
Edit
Delete
Copy
Move
Remame
threading.py
56.46 KB
Edit
Delete
Copy
Move
Remame
timeit.py
13.18 KB
Edit
Delete
Copy
Move
Remame
token.py
2.33 KB
Edit
Delete
Copy
Move
Remame
tokenize.py
25.72 KB
Edit
Delete
Copy
Move
Remame
tomllib
5 Items
Change directory
Remove directory
Rename directory
trace.py
28.52 KB
Edit
Delete
Copy
Move
Remame
traceback.py
37.52 KB
Edit
Delete
Copy
Move
Remame
tracemalloc.py
17.62 KB
Edit
Delete
Copy
Move
Remame
tty.py
0.86 KB
Edit
Delete
Copy
Move
Remame
turtle.py
140.97 KB
Edit
Delete
Copy
Move
Remame
types.py
9.83 KB
Edit
Delete
Copy
Move
Remame
typing.py
114.35 KB
Edit
Delete
Copy
Move
Remame
unittest
14 Items
Change directory
Remove directory
Rename directory
urllib
7 Items
Change directory
Remove directory
Rename directory
uu.py
6.86 KB
Edit
Delete
Copy
Move
Remame
uuid.py
26.95 KB
Edit
Delete
Copy
Move
Remame
venv
4 Items
Change directory
Remove directory
Rename directory
warnings.py
20.53 KB
Edit
Delete
Copy
Move
Remame
wave.py
21.33 KB
Edit
Delete
Copy
Move
Remame
weakref.py
21.01 KB
Edit
Delete
Copy
Move
Remame
webbrowser.py
24.5 KB
Edit
Delete
Copy
Move
Remame
wsgiref
8 Items
Change directory
Remove directory
Rename directory
xdrlib.py
5.84 KB
Edit
Delete
Copy
Move
Remame
xml
6 Items
Change directory
Remove directory
Rename directory
xmlrpc
4 Items
Change directory
Remove directory
Rename directory
zipapp.py
7.36 KB
Edit
Delete
Copy
Move
Remame
zipfile.py
90.81 KB
Edit
Delete
Copy
Move
Remame
zipimport.py
30.17 KB
Edit
Delete
Copy
Move
Remame
zoneinfo
5 Items
Change directory
Remove directory
Rename directory