Lines Matching refs:denominator
35 (?:/(?P<denom>\d+))? # an optional denominator
49 be Rational. The numerator defaults to 0 and the denominator
68 def __new__(cls, numerator=0, denominator=None):
72 numerator/denominator pair, or a float.
101 if denominator is None:
104 self._denominator = numerator.denominator
129 denominator = int(denom)
131 denominator = 1
136 denominator *= scale
143 denominator *= 10**-exp
152 isinstance(denominator, Rational)):
153 numerator, denominator = (
154 numerator.numerator * denominator.denominator,
155 denominator.numerator * numerator.denominator
161 if denominator == 0:
163 g = gcd(numerator, denominator)
165 self._denominator = denominator // g
207 """Closest Fraction to self with denominator at most max_denominator.
229 # To find a best rational approximation with denominator <= M,
231 # denominator <= M and take whichever of these is closer to x.
232 # In the event of a tie, the bound with smaller denominator is
266 def denominator(a):
294 # Both types have numerators/denominator attributes,
297 return Fraction(self.numerator * other.denominator +
298 other.numerator * self.denominator,
299 self.denominator * other.denominator)
313 return Fraction(self.numerator * other.denominator +
314 other.numerator * self.denominator,
315 self.denominator * other.denominator)
389 return Fraction(a.numerator * b.denominator +
390 b.numerator * a.denominator,
391 a.denominator * b.denominator)
397 return Fraction(a.numerator * b.denominator -
398 b.numerator * a.denominator,
399 a.denominator * b.denominator)
405 return Fraction(a.numerator * b.numerator, a.denominator * b.denominator)
411 return Fraction(a.numerator * b.denominator,
412 a.denominator * b.numerator)
425 return div.numerator // div.denominator
437 return div.numerator // div.denominator
460 if b.denominator == 1:
482 return Fraction(a.numerator, a.denominator) ** b
531 a._denominator == b.denominator)
558 return op(self._numerator * other.denominator,
