Mass Deface
, and >=.
Real also provides defaults for the derived operations.
c C s
t ‚ d S( sT Any Real can be converted to a native float object.
Called for float(self).N( R ( R ( ( s /usr/lib64/python2.7/numbers.pyt __float__´ s c C s
t ‚ d S( sG 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".
N( R ( R ( ( s /usr/lib64/python2.7/numbers.pyt __trunc__» s c C s | | | | f S( s™ divmod(self, other): The pair (self // other, self % other).
Sometimes this can be computed faster than the pair of
operations.
( ( R R ( ( s /usr/lib64/python2.7/numbers.pyt
__divmod__È s c C s | | | | f S( s™ divmod(other, self): The pair (self // other, self % other).
Sometimes this can be computed faster than the pair of
operations.
( ( R R ( ( s /usr/lib64/python2.7/numbers.pyt __rdivmod__Ð s c C s
t ‚ d S( s) self // other: The floor() of self/other.N( R ( R R ( ( s /usr/lib64/python2.7/numbers.pyt __floordiv__Ø s c C s
t ‚ d S( s) other // self: The floor() of other/self.N( R ( R R ( ( s /usr/lib64/python2.7/numbers.pyt
__rfloordiv__Ý s c C s
t ‚ d S( s self % otherN( R ( R R ( ( s /usr/lib64/python2.7/numbers.pyt __mod__â s c C s
t ‚ d S( s other % selfN( R ( R R ( ( s /usr/lib64/python2.7/numbers.pyt __rmod__ç s c C s
t ‚ d S( sR self < other
< on Reals defines a total ordering, except perhaps for NaN.N( R ( R R ( ( s /usr/lib64/python2.7/numbers.pyt __lt__ì s c C s
t ‚ d S( s
self <= otherN( R ( R R ( ( s /usr/lib64/python2.7/numbers.pyt __le__ó s c C s t t | ƒ ƒ S( s( complex(self) == complex(float(self), 0)( t complext float( R ( ( s /usr/lib64/python2.7/numbers.pyR ù s c C s |
S( s& Real numbers are their real component.( ( R ( ( s /usr/lib64/python2.7/numbers.pyR ý s c C s d S( s) Real numbers have no imaginary component.i ( ( R ( ( s /usr/lib64/python2.7/numbers.pyR s c C s |
S( s Conjugate is a no-op for Reals.( ( R ( ( s /usr/lib64/python2.7/numbers.pyR( s ( ( R R
R R
R R+ R, R- R. R/ R0 R1 R2 R3 R4 R t propertyR R R( ( ( ( s /usr/lib64/python2.7/numbers.pyR © s
c B s; e Z d Z d Z e d „ ƒ Z e d „ ƒ Z d „ Z RS( s6 .numerator and .denominator should be in lowest terms.c C s
t ‚ d S( N( R ( R ( ( s /usr/lib64/python2.7/numbers.pyt numerator s c C s
t ‚ d S( N( R ( R ( ( s /usr/lib64/python2.7/numbers.pyt denominator s c C s | j | j S( s 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.
( R8 R9 ( R ( ( s /usr/lib64/python2.7/numbers.pyR+ s ( ( R R
R R
R R8 R9 R+ ( ( ( s /usr/lib64/python2.7/numbers.pyR s
c B s
e Z d Z d Z e d „ ƒ Z d „ Z e d d „ ƒ Z e d „ ƒ Z e d „ ƒ Z
e d „ ƒ Z e d „ ƒ Z e d „ ƒ Z
e d „ ƒ Z e d
„ ƒ Z e d „ ƒ Z e d „ ƒ Z e d
„ ƒ Z e d „ ƒ Z d „ Z e d „ ƒ Z e d „ ƒ Z RS( sA Integral adds a conversion to long and the bit-string operations.c C s
t ‚ d S( s
long(self)N( R ( R ( ( s /usr/lib64/python2.7/numbers.pyt __long__, s c C s
t | ƒ S( s6 Called whenever an index is needed, such as in slicing( t long( R ( ( s /usr/lib64/python2.7/numbers.pyt __index__1 s c C s
t ‚ d S( s4 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.
N( R ( R R# t modulus( ( s /usr/lib64/python2.7/numbers.pyR$ 5 s c C s
t ‚ d S( s
self << otherN( R ( R R ( ( s /usr/lib64/python2.7/numbers.pyt
__lshift__@ s c C s
t ‚ d S( s
other << selfN( R ( R R ( ( s /usr/lib64/python2.7/numbers.pyt __rlshift__E s c C s
t ‚ d S( s
self >> otherN( R ( R R ( ( s /usr/lib64/python2.7/numbers.pyt
__rshift__J s c C s
t ‚ d S( s
other >> selfN( R ( R R ( ( s /usr/lib64/python2.7/numbers.pyt __rrshift__O s c C s
t ‚ d S( s self & otherN( R ( R R ( ( s /usr/lib64/python2.7/numbers.pyt __and__T s c C s
t ‚ d S( s other & selfN( R ( R R ( ( s /usr/lib64/python2.7/numbers.pyt __rand__Y s c C s
t ‚ d S( s self ^ otherN( R ( R R ( ( s /usr/lib64/python2.7/numbers.pyt __xor__^ s c C s
t ‚ d S( s other ^ selfN( R ( R R ( ( s /usr/lib64/python2.7/numbers.pyt __rxor__c s c C s
t ‚ d S( s self | otherN( R ( R R ( ( s /usr/lib64/python2.7/numbers.pyt __or__h s c C s
t ‚ d S( s other | selfN( R ( R R ( ( s /usr/lib64/python2.7/numbers.pyt __ror__m s c C s
t ‚ d S( s ~selfN( R ( R ( ( s /usr/lib64/python2.7/numbers.pyt
__invert__r s c C s t t | ƒ ƒ S( s float(self) == float(long(self))( R6 R; ( R ( ( s /usr/lib64/python2.7/numbers.pyR+ x s c C s |
S( s" Integers are their own numerators.( ( R ( ( s /usr/lib64/python2.7/numbers.pyR8 | s c C s d S( s! Integers have a denominator of 1.i ( ( R ( ( s /usr/lib64/python2.7/numbers.pyR9 s ( N( R R
R R
R R: R< R R$ R> R? R@ RA RB RC RD RE RF RG RH R+ R7 R8 R9 ( ( ( s /usr/lib64/python2.7/numbers.pyR ' s(
N( R t
__future__R t abcR R R t __all__t objectR R t registerR5 R R6 R R t intR; ( ( ( s /usr/lib64/python2.7/numbers.pyt