Lines Matching refs:buffer
6112 buffer. This adapter is a very low level adapter.
6378 // check if buffer needs to be filled
6387 // use buffer
6402 /// a buffer for UTF-8 bytes
7356 end_of_input, ///< indicating the end of the input buffer
7544 scanning, bytes are escaped and copied into buffer token_buffer. Then the
8917 /// buffer for variable-length tokens (numbers, strings)
17367 Generates V = buffer * 10^decimal_exponent, such that M- <= V <= M+.
17370 inline void grisu2_digit_gen(char* buffer, int& length, int& decimal_exponent,
17377 // number V = buffer * 10^decimal_exponent in the range [M-, M+]. The diyfp's
17437 // M+ = buffer * 10^n + (p1 + p2 * 2^e) (buffer = 0 for n = k)
17443 // M+ = buffer * 10^n + (d * 10^(n-1) + r) + p2 * 2^e
17444 // = (buffer * 10 + d) * 10^(n-1) + (r + p2 * 2^e)
17447 buffer[length++] = static_cast<char>('0' + d); // buffer := buffer * 10 + d
17449 // M+ = buffer * 10^(n-1) + (r + p2 * 2^e)
17454 // M+ = buffer * 10^n + (p1 + p2 * 2^e)
17469 // V = buffer * 10^n, with M- <= V <= M+.
17473 // We may now just stop. But instead look if the buffer could be
17483 grisu2_round(buffer, length, dist, delta, rest, ten_n);
17499 // = buffer + p2 * 2^e
17527 // M+ = buffer + p2 * 2^e
17528 // = buffer + 10^-m * (d + r * 2^e)
17529 // = (buffer * 10^m + d) * 10^-m + 10^-m * r * 2^e
17539 // M+ = buffer * 10^-m + 10^-m * (d[-m-1] / 10 + d[-m-2] / 10^2 + ...) * 2^e
17540 // = buffer * 10^-m + 10^-m * (p2 ) * 2^e
17541 // = buffer * 10^-m + 10^-m * (1/10 * (10 * p2) ) * 2^e
17542 // = buffer * 10^-m + 10^-m * (1/10 * ((10*p2 div 2^-e) * 2^-e + (10*p2 mod 2^-e)) * 2^e
17549 // M+ = buffer * 10^-m + 10^-m * (1/10 * (d * 2^-e + r) * 2^e
17550 // = buffer * 10^-m + 10^-m * (1/10 * (d + r * 2^e))
17551 // = (buffer * 10 + d) * 10^(-m-1) + 10^(-m-1) * r * 2^e
17554 buffer[length++] = static_cast<char>('0' + d); // buffer := buffer * 10 + d
17556 // M+ = buffer * 10^(-m-1) + 10^(-m-1) * r * 2^e
17561 // M+ = buffer * 10^-m + 10^-m * p2 * 2^e
17577 // V = buffer * 10^-m, with M- <= V <= M+.
17588 grisu2_round(buffer, length, dist, delta, p2, ten_m);
17607 len is the length of the buffer (number of decimal digits)
17608 The buffer must be large enough, i.e. >= max_digits10.
17666 len is the length of the buffer (number of decimal digits)
17667 The buffer must be large enough, i.e. >= max_digits10.
17773 // k is the length of the buffer (number of decimal digits)
17774 // n is the position of the decimal point relative to the start of the buffer.
17842 @note The buffer must be large enough.
17878 // Compute v = buffer * 10^decimal_exponent.
17879 // The decimal digits are stored in the buffer, which needs to be interpreted
17881 // len is the length of the buffer, i.e. the number of decimal digits.
17888 // Format the buffer like printf("%.*g", prec, value)
18368 // copy byte to buffer (all previous bytes
18376 // write buffer and reset index; there must be 13 bytes
18412 // reset length buffer to the last accepted index;
18435 // write buffer and reset index; there must be 13 bytes
18464 // code point will not be escaped - copy byte to buffer
18476 // write buffer
18623 // use a pointer to fill the buffer
18723 // check if buffer was large enough
18849 /// a (hopefully) large enough character buffer
18859 /// string buffer