Lines Matching defs:number
11 1. If the mathematical result is a real number, but of magnitude too
15 2. If the mathematical result is a real number, but of magnitude too
1206 x as number: object
1215 math_ceil(PyObject *module, PyObject *number)
1220 if (!PyFloat_CheckExact(number)) {
1221 PyObject *method = _PyObject_LookupSpecialId(number, &PyId___ceil__);
1230 double x = PyFloat_AsDouble(number);
1272 x as number: object
1281 math_floor(PyObject *module, PyObject *number)
1288 if (PyFloat_CheckExact(number)) {
1289 x = PyFloat_AS_DOUBLE(number);
1293 PyObject *method = _PyObject_LookupSpecialId(number, &PyId___floor__);
1301 x = PyFloat_AsDouble(number);
1601 number of iterations is known in advance (it's exactly `floor(log2(log2(n)))`
1966 * equal to n - count_set_bits(n), where count_set_bits(n) gives the number of
1983 * Compute an upper bound on the number of bits required to store
1992 * We know that stop - 2 is the largest number to be multiplied. From
2008 /* find midpoint of range(start, stop), rounded up to next odd number. */
2311 However, intermediate overflow is possible for an int if the number of bits
2531 algorithm, effectively doubling the number of accurate bits.
2705 "both points must have the same number of dimensions");
2955 Return True if x is a NaN (not a number), and False otherwise.
3030 one infinity and one finite number. Two infinities of opposite
3063 just the last n bits of the true product, where n is the number of bits