Lines Matching refs:denominator
29 (?:/(?P<denom>\d+(_\d+)*))? # an optional denominator
43 be Rational. The numerator defaults to 0 and the denominator
62 def __new__(cls, numerator=0, denominator=None, *, _normalize=True):
66 numerator/denominator pair, or a float.
95 if denominator is None:
103 self._denominator = numerator.denominator
120 denominator = int(denom)
122 denominator = 1
128 denominator *= scale
135 denominator *= 10**-exp
143 elif type(numerator) is int is type(denominator):
147 isinstance(denominator, numbers.Rational)):
148 numerator, denominator = (
149 numerator.numerator * denominator.denominator,
150 denominator.numerator * numerator.denominator
156 if denominator == 0:
159 g = math.gcd(numerator, denominator)
160 if denominator < 0:
163 denominator //= g
165 self._denominator = denominator
198 Fraction and with a positive denominator.
203 """Closest Fraction to self with denominator at most max_denominator.
225 # To find a best rational approximation with denominator <= M,
227 # denominator <= M and take whichever of these is closer to x.
228 # In the event of a tie, the bound with smaller denominator is
262 def denominator(a):
291 # Both types have numerators/denominator attributes,
294 return Fraction(self.numerator * other.denominator +
295 other.numerator * self.denominator,
296 self.denominator * other.denominator)
310 return Fraction(self.numerator * other.denominator +
311 other.numerator * self.denominator,
312 self.denominator * other.denominator)
422 # denominator d could be much larger than g.
442 # in the denominator.
454 na, da = a.numerator, a.denominator
455 nb, db = b.numerator, b.denominator
470 na, da = a.numerator, a.denominator
471 nb, db = b.numerator, b.denominator
486 na, da = a.numerator, a.denominator
487 nb, db = b.numerator, b.denominator
503 na, da = a.numerator, a.denominator
504 nb, db = b.numerator, b.denominator
522 return (a.numerator * b.denominator) // (a.denominator * b.numerator)
528 da, db = a.denominator, b.denominator
536 da, db = a.denominator, b.denominator
550 if b.denominator == 1:
578 return Fraction(a.numerator, a.denominator) ** b
613 return a.numerator // a.denominator
618 return -(-a.numerator // a.denominator)
626 floor, remainder = divmod(self.numerator, self.denominator)
627 if remainder * 2 < self.denominator:
629 elif remainder * 2 > self.denominator:
684 a._denominator == b.denominator)
711 return op(self._numerator * other.denominator,