add-determinism 0.7.3

RPM buildroot helper to strip nondeterministic bits in files
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129

a

Z��^(c@s�dZddlmZmZgd�ZGdd�ded�ZGdd�de�Ze�e�Gd	d
�d
e�Z	e	�e
�Gdd�de	�ZGd
d�de�Ze�e
�dS)z~Abstract Base Classes (ABCs) for numbers, according to PEP 3141.

TODO: Fill out more detailed documentation on the operators.�)�ABCMeta�abstractmethod)�Number�Complex�Real�Rational�Integralc@seZdZdZdZdZdS)rz�All 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__Z__hash__rrr�/usr/lib64/python3.9/numbers.pyrsr)Z	metaclassc@s�eZdZdZdZedd��Zdd�Zeedd���Z	eed	d
���Z
edd��Zed
d��Zedd��Z
edd��Zdd�Zdd�Zedd��Zedd��Zedd��Zedd��Zedd ��Zed!d"��Zed#d$��Zed%d&��Zed'd(��Zd)S)*rabComplex 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.
    rcC�dS)z<Return a builtin complex instance. Called for complex(self).Nr��selfrrr�__complex__-�zComplex.__complex__cCs|dkS)z)True if self != 0. Called for bool(self).rrrrrr�__bool__1rzComplex.__bool__cC�t�dS)zXRetrieve the real component of this number.

        This should subclass Real.
        N�ZNotImplementedErrorrrrr�real5�zComplex.realcCr)z]Retrieve the imaginary component of this number.

        This should subclass Real.
        Nrrrrr�imag>rzComplex.imagcCr)zself + otherNr�rZotherrrr�__add__G�zComplex.__add__cCr)zother + selfNrrrrr�__radd__LrzComplex.__radd__cCr)z-selfNrrrrr�__neg__QrzComplex.__neg__cCr)z+selfNrrrrr�__pos__VrzComplex.__pos__cCs
||S)zself - otherrrrrr�__sub__[rzComplex.__sub__cCs
||S)zother - selfrrrrr�__rsub___rzComplex.__rsub__cCr)zself * otherNrrrrr�__mul__crzComplex.__mul__cCr)zother * selfNrrrrr�__rmul__hrzComplex.__rmul__cCr)z5self / other: Should promote to float when necessary.Nrrrrr�__truediv__mrzComplex.__truediv__cCr)zother / selfNrrrrr�__rtruediv__rrzComplex.__rtruediv__cCr)zBself**exponent; should promote to float or complex when necessary.Nr)r�exponentrrr�__pow__wrzComplex.__pow__cCr)zbase ** selfNr)rZbaserrr�__rpow__|rzComplex.__rpow__cCr)z7Returns the Real distance from 0. Called for abs(self).Nrrrrr�__abs__�rzComplex.__abs__cCr)z$(x+y*i).conjugate() returns (x-y*i).Nrrrrr�	conjugate�rzComplex.conjugatecCr)z
self == otherNrrrrr�__eq__�rzComplex.__eq__N)r	r
rrr
rrr�propertyrrrrrrr r!r"r#r$r%r'r(r)r*r+rrrrr sN













rc@s�eZdZdZdZedd��Zedd��Zedd��Zed	d
��Z	ed&dd
��Z
dd�Zdd�Zedd��Z
edd��Zedd��Zedd��Zedd��Zedd��Zdd�Zed d!��Zed"d#��Zd$d%�ZdS)'rz�To Complex, Real adds the operations that work on real numbers.

    In short, those are: a conversion to float, trunc(), divmod,
    %, <, <=, >, and >=.

    Real also provides defaults for the derived operations.
    rcCr)zTAny Real can be converted to a native float object.

        Called for float(self).Nrrrrr�	__float__��zReal.__float__cCr)aGtrunc(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".
        Nrrrrr�	__trunc__�szReal.__trunc__cCr)z$Finds the greatest Integral <= self.Nrrrrr�	__floor__�rzReal.__floor__cCr)z!Finds the least Integral >= self.Nrrrrr�__ceil__�rz
Real.__ceil__NcCr)z�Rounds 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.
        Nr)rZndigitsrrr�	__round__�rzReal.__round__cCs||||fS)z�divmod(self, other): The pair (self // other, self % other).

        Sometimes this can be computed faster than the pair of
        operations.
        rrrrr�
__divmod__��zReal.__divmod__cCs||||fS)z�divmod(other, self): The pair (self // other, self % other).

        Sometimes this can be computed faster than the pair of
        operations.
        rrrrr�__rdivmod__�r4zReal.__rdivmod__cCr)z)self // other: The floor() of self/other.Nrrrrr�__floordiv__�rzReal.__floordiv__cCr)z)other // self: The floor() of other/self.Nrrrrr�
__rfloordiv__�rzReal.__rfloordiv__cCr)zself % otherNrrrrr�__mod__�rzReal.__mod__cCr)zother % selfNrrrrr�__rmod__�rz
Real.__rmod__cCr)zRself < other

        < on Reals defines a total ordering, except perhaps for NaN.Nrrrrr�__lt__�r.zReal.__lt__cCr)z
self <= otherNrrrrr�__le__�rzReal.__le__cC�tt|��S)z(complex(self) == complex(float(self), 0))�complex�floatrrrrr�rzReal.__complex__cC�|
S)z&Real numbers are their real component.rrrrrr�rz	Real.realcCr)z)Real numbers have no imaginary component.rrrrrrr�rz	Real.imagcCr?)zConjugate is a no-op for Reals.rrrrrr*rzReal.conjugate�N)r	r
rrr
rr-r/r0r1r2r3r5r6r7r8r9r:r;rr,rrr*rrrrr�s@











rc@s<eZdZdZdZeedd���Zeedd���Zdd�Z	d	S)
rz6.numerator and .denominator should be in lowest terms.rcC�t�dSr@rrrrr�	numeratorrzRational.numeratorcCrAr@rrrrr�denominatorrzRational.denominatorcCs|j|jS)afloat(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.

        )rBrCrrrrr-szRational.__float__N)
r	r
rrr
r,rrBrCr-rrrrrsrc@s�eZdZdZdZedd��Zdd�Zed&dd	��Zed
d��Z	edd
��Z
edd��Zedd��Zedd��Z
edd��Zedd��Zedd��Zedd��Zedd��Zedd��Zd d!�Zed"d#��Zed$d%��ZdS)'rz@Integral adds a conversion to int and the bit-string operations.rcCr)z	int(self)Nrrrrr�__int__+rzIntegral.__int__cCst|�S)z6Called whenever an index is needed, such as in slicing)�intrrrr�	__index__0rzIntegral.__index__NcCr)a4self ** 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.
        Nr)rr&Zmodulusrrrr'4s	zIntegral.__pow__cCr)z
self << otherNrrrrr�
__lshift__?rzIntegral.__lshift__cCr)z
other << selfNrrrrr�__rlshift__DrzIntegral.__rlshift__cCr)z
self >> otherNrrrrr�
__rshift__IrzIntegral.__rshift__cCr)z
other >> selfNrrrrr�__rrshift__NrzIntegral.__rrshift__cCr)zself & otherNrrrrr�__and__SrzIntegral.__and__cCr)zother & selfNrrrrr�__rand__XrzIntegral.__rand__cCr)zself ^ otherNrrrrr�__xor__]rzIntegral.__xor__cCr)zother ^ selfNrrrrr�__rxor__brzIntegral.__rxor__cCr)zself | otherNrrrrr�__or__grzIntegral.__or__cCr)zother | selfNrrrrr�__ror__lrzIntegral.__ror__cCr)z~selfNrrrrr�
__invert__qrzIntegral.__invert__cCr<)zfloat(self) == float(int(self)))r>rErrrrr-wrzIntegral.__float__cCr?)z"Integers are their own numerators.rrrrrrB{rzIntegral.numeratorcCr)z!Integers have a denominator of 1.irrrrrrC�rzIntegral.denominatorr@)r	r
rrr
rrDrFr'rGrHrIrJrKrLrMrNrOrPrQr-r,rBrCrrrrr&sD













rN)rZabcrrZ__all__rrZregisterr=rr>rrrErrrrZ<module>sp
u
_