Cross Reference: /external/protobuf/src/google/protobuf/stubs/strutil.cc

Lines Matching refs:digits
236 //    The implementation of \x parses any positive number of hex digits,
296         case '0': case '1': case '2': case '3':  // octal digit: 1 to 3 digits
318           while (isxdigit(p[1]))  // arbitrarily many hex digits
328           // \uhhhh => convert 4 hex digits to UTF-8
336                 << "\\u must be followed by 4 hex digits: \\"
345           // \Uhhhhhhhh => convert 8 hex digits to UTF-8
364                 << "\\U must be followed by 8 hex digits: \\"
734   int digits;
738   // and by outputting two digits at a time rather than one.
743     digits = u / 100000000;  // 100,000,000
744     ASCII_digits = two_ASCII_digits[digits];
749     u -= digits * 100000000;  // 100,000,000
751     digits = u / 1000000;  // 1,000,000
752     ASCII_digits = two_ASCII_digits[digits];
757     u -= digits * 1000000;  // 1,000,000
759     digits = u / 10000;  // 10,000
760     ASCII_digits = two_ASCII_digits[digits];
765     u -= digits * 10000;  // 10,000
767     digits = u / 100;
768     ASCII_digits = two_ASCII_digits[digits];
773     u -= digits * 100;
775     digits = u;
776     ASCII_digits = two_ASCII_digits[digits];
786     digits = u;
788     *buffer++ = '0' + digits;
793     digits = u / 100;
794     *buffer++ = '0' + digits;
799     digits = u / 10000;  //    10,000
800     *buffer++ = '0' + digits;
805     digits = u / 1000000;  //   1,000,000
806     *buffer++ = '0' + digits;
810   digits = u / 100000000;   // 100,000,000
811   *buffer++ = '0' + digits;
825   int digits;
835   digits = u / 10000000;  // 10,000,000
836   GOOGLE_DCHECK_LT(digits, 100);
837   ASCII_digits = two_ASCII_digits[digits];
841   u -= digits * 10000000;  // 10,000,000
842   digits = u / 100000;  // 100,000
843   ASCII_digits = two_ASCII_digits[digits];
847   u -= digits * 100000;  // 100,000
848   digits = u / 1000;  // 1,000
849   ASCII_digits = two_ASCII_digits[digits];
853   u -= digits * 1000;  // 1,000
854   digits = u / 10;
855   ASCII_digits = two_ASCII_digits[digits];
859   u -= digits * 10;
860   digits = u;
861   *buffer++ = '0' + digits;
930 //    not want to print more digits than necessary.  This turns out to be
935 //    significant digits when printing numbers that actually need them.
942 //    give a precise result, but may use more digits than necessary.
950 //    more accurate (in that it will never use more digits than
957 //    generate the digits in the first place rather than use snprintf(),
1111   // print the number 1.5, then stripping off the digits.  As far as I can