֦i, d Z ddlmZmZ g dZ G d de Z G d de Zej e G d d
e Z e j e
G d d e Z G d
de Z e j e
y)z~Abstract Base Classes (ABCs) for numbers, according to PEP 3141.
TODO: Fill out more detailed documentation on the operators. )ABCMetaabstractmethod)NumberComplexRealRationalIntegralc e Zd ZdZdZdZy)r zAll numbers inherit from this class.
If you just want to check if an argument x is a number, without
caring what kind, use isinstance(x, Number).
N)__name__
__module__ __qualname____doc__ __slots____hash__r /usr/lib64/python3.12/numbers.pyr r % s
I Hr r ) metaclassc : e Zd ZdZdZed Zd Zeed Z eed Z
ed Z ed Z ed Z
ed
Zd Zd Zed
Zed Zed Zed Zed Zed Zed Zed Zed Zy)r af Complex defines the operations that work on the builtin complex type.
In short, those are: a conversion to complex, .real, .imag, +, -,
*, /, **, abs(), .conjugate, ==, and !=.
If it is given heterogeneous arguments, and doesn't have special
knowledge about them, it should fall back to the builtin complex
type as described below.
r c y)z, and >=.
Real also provides defaults for the derived operations.
r c t )zTAny Real can be converted to a native float object.
Called for float(self).r r s r __float__zReal.__float__
"!r c t )aK trunc(self): Truncates self to an Integral.
Returns an Integral i such that:
* i > 0 iff self > 0;
* abs(i) <= abs(self);
* for any Integral j satisfying the first two conditions,
abs(i) >= abs(j) [i.e. i has "maximal" abs among those].
i.e. "truncate towards 0".
r r s r __trunc__zReal.__trunc__ s
"!r c t )z$Finds the greatest Integral <= self.r r s r __floor__zReal.__floor__ r' r c t )z!Finds the least Integral >= self.r r s r __ceil__z
Real.__ceil__ r' r Nc t )zRounds self to ndigits decimal places, defaulting to 0.
If ndigits is omitted or None, returns an Integral, otherwise
returns a Real. Rounds half toward even.
r )r ndigitss r __round__zReal.__round__ r r c | |z | |z fS )zdivmod(self, other): The pair (self // other, self % other).
Sometimes this can be computed faster than the pair of
operations.
r r$ s r
__divmod__zReal.__divmod__ s
te|,,r c || z || z fS )zdivmod(other, self): The pair (other // self, other % self).
Sometimes this can be computed faster than the pair of
operations.
r r$ s r __rdivmod__zReal.__rdivmod__ s
ut|,,r c t )z)self // other: The floor() of self/other.r r$ s r __floordiv__zReal.__floordiv__ r' r c t )z)other // self: The floor() of other/self.r r$ s r
__rfloordiv__zReal.__rfloordiv__ r' r c t )z self % otherr r$ s r __mod__z Real.__mod__ r' r c t )z other % selfr r$ s r __rmod__z
Real.__rmod__ r' r c t )zRself < other
< on Reals defines a total ordering, except perhaps for NaN.r r$ s r __lt__z Real.__lt__ rJ r c t )z
self <= otherr r$ s r __le__z Real.__le__ r' r c * t t | S )z(complex(self) == complex(float(self), 0))complexfloatr s r r zReal.__complex__ s uT{##r c | S )z&Real numbers are their real component.r r s r r z Real.real u r c y)z)Real numbers have no imaginary component.r r r s r r" z Real.imag r c | S )z Conjugate is a no-op for Reals.r r s r rC zReal.conjugate s u r N)r r
r r r r rI rL rN rP rS rU rW rY r[ r] r_ ra rc r rF r r" rC r r r r r s$ I" "
"
" " " " " " "-- " " " " " " " " " " " "
$ r r c N e Zd ZdZdZeed Zeed Zd Z y)r z6.numerator and .denominator should be in lowest terms.r c t rl r r s r numeratorzRational.numerator) r' r c t rl r r s r denominatorzRational.denominator. r' r c X t | j t | j z S )a float(self) = self.numerator / self.denominator
It's important that this conversion use the integer's "true"
division rather than casting one side to float before dividing
so that ratios of huge integers convert without overflowing.
)intro rq r s r rI zRational.__float__4 s# 4>>"S)9)9%:::r N)
r r
r r r rF r ro rq rI r r r r r $ sE @I
" " " ";r r c e Zd ZdZdZed Zd Zedd Zed Z ed Z
ed Z ed
Z ed Z
ed Zed
Zed Zed Zed Zed Zd Zed Zed Zy)r zIntegral adds methods that work on integral numbers.
In short, these are conversion to int, pow with modulus, and the
bit-string operations.
r c t )z int(self)r r s r __int__zIntegral.__int__H r' r c t | S )z6Called whenever an index is needed, such as in slicing)rs r s r __index__zIntegral.__index__M s 4yr Nc t )a4 self ** exponent % modulus, but maybe faster.
Accept the modulus argument if you want to support the
3-argument version of pow(). Raise a TypeError if exponent < 0
or any argument isn't Integral. Otherwise, just implement the
2-argument version described in Complex.
r )r r; moduluss r r< zIntegral.__pow__Q s
"!r c t )z
self << otherr r$ s r
__lshift__zIntegral.__lshift__\ r' r c t )z
other << selfr r$ s r __rlshift__zIntegral.__rlshift__a r' r c t )z
self >> otherr r$ s r
__rshift__zIntegral.__rshift__f r' r c t )z
other >> selfr r$ s r __rrshift__zIntegral.__rrshift__k r' r c t )z self & otherr r$ s r __and__zIntegral.__and__p r' r c t )z other & selfr r$ s r __rand__zIntegral.__rand__u r' r c t )z self ^ otherr r$ s r __xor__zIntegral.__xor__z r' r c t )z other ^ selfr r$ s r __rxor__zIntegral.__rxor__ r' r c t )z self | otherr r$ s r __or__zIntegral.__or__ r' r c t )z other | selfr r$ s r __ror__zIntegral.__ror__ r' r c t )z~selfr r s r
__invert__zIntegral.__invert__ r' r c * t t | S )z float(self) == float(int(self)))rf rs r s r rI zIntegral.__float__ s SY r c | S )z"Integers are their own numerators.r r s r ro zIntegral.numerator rh r c y)z!Integers have a denominator of 1. r r s r rq zIntegral.denominator rj r rl )r r
r r r r rv rx r< r| r~ r r r r r r r r r rI rF ro rq r r r r r ? sB I" " " " " " " " " " " " " " " " " " " " " " " " " "
r r N)r abcr r __all__r r registerre r rf r r rs r r r r s @: (
? w (n"f n"` s7 sj
e ;t ;6ax aF # r