1 // Copyright 2013-2014 The Rust Project Developers. See the COPYRIGHT
2 // file at the top-level directory of this distribution and at
3 // http://rust-lang.org/COPYRIGHT.
5 // Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or
6 // http://www.apache.org/licenses/LICENSE-2.0> or the MIT license
7 // <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your
8 // option. This file may not be copied, modified, or distributed
9 // except according to those terms.
11 // ignore-lexer-test FIXME #15679
13 #![allow(missing_docs)]
15 use self::ExponentFormat::*;
16 use self::SignificantDigits::*;
17 use self::SignFormat::*;
19 use char::{self, Char};
20 use num::{self, Int, Float, ToPrimitive};
21 use num::FpCategory as Fp;
28 /// A flag that specifies whether to use exponential (scientific) notation.
30 pub enum ExponentFormat {
31 /// Do not use exponential notation.
33 /// Use exponential notation with the exponent having a base of 10 and the
34 /// exponent sign being `e` or `E`. For example, 1000 would be printed
37 /// Use exponential notation with the exponent having a base of 2 and the
38 /// exponent sign being `p` or `P`. For example, 8 would be printed 1p3.
42 /// The number of digits used for emitting the fractional part of a number, if
45 pub enum SignificantDigits {
46 /// All calculable digits will be printed.
48 /// Note that bignums or fractions may cause a surprisingly large number
49 /// of digits to be printed.
52 /// At most the given number of digits will be printed, truncating any
56 /// Precisely the given number of digits will be printed.
60 /// How to emit the sign of a number.
63 /// No sign will be printed. The exponent sign will also be emitted.
65 /// `-` will be printed for negative values, but no sign will be emitted
66 /// for positive numbers.
68 /// `+` will be printed for positive values, and `-` will be printed for
73 /// Converts an integral number to its string representation as a byte vector.
74 /// This is meant to be a common base implementation for all integral string
75 /// conversion functions like `to_string()` or `to_str_radix()`.
79 /// - `num` - The number to convert. Accepts any number that
80 /// implements the numeric traits.
81 /// - `radix` - Base to use. Accepts only the values 2-36.
82 /// - `sign` - How to emit the sign. Options are:
83 /// - `SignNone`: No sign at all. Basically emits `abs(num)`.
84 /// - `SignNeg`: Only `-` on negative values.
85 /// - `SignAll`: Both `+` on positive, and `-` on negative numbers.
86 /// - `f` - a callback which will be invoked for each ascii character
87 /// which composes the string representation of this integer
91 /// - Panics if `radix` < 2 or `radix` > 36.
92 fn int_to_str_bytes_common<T, F>(num: T, radix: uint, sign: SignFormat, mut f: F) where
96 assert!(2 <= radix && radix <= 36);
98 let _0: T = Int::zero();
101 let radix_gen: T = num::cast(radix).unwrap();
103 let mut deccum = num;
104 // This is just for integral types, the largest of which is a u64. The
105 // smallest base that we can have is 2, so the most number of digits we're
106 // ever going to have is 64
107 let mut buf = [0u8; 64];
110 // Loop at least once to make sure at least a `0` gets emitted.
112 // Calculate the absolute value of each digit instead of only
113 // doing it once for the whole number because a
114 // representable negative number doesn't necessary have an
115 // representable additive inverse of the same type
116 // (See twos complement). But we assume that for the
117 // numbers [-35 .. 0] we always have [0 .. 35].
118 let current_digit_signed = deccum % radix_gen;
119 let current_digit = if current_digit_signed < _0 {
120 _0 - current_digit_signed
124 buf[cur] = match current_digit.to_u8().unwrap() {
125 i @ 0...9 => b'0' + i,
126 i => b'a' + (i - 10),
130 deccum = deccum / radix_gen;
131 // No more digits to calculate for the non-fractional part -> break
132 if deccum == _0 { break; }
135 // Decide what sign to put in front
137 SignNeg | SignAll if neg => { f(b'-'); }
138 SignAll => { f(b'+'); }
142 // We built the number in reverse order, so un-reverse it here
149 /// Converts a number to its string representation as a byte vector.
150 /// This is meant to be a common base implementation for all numeric string
151 /// conversion functions like `to_string()` or `to_str_radix()`.
155 /// - `num` - The number to convert. Accepts any number that
156 /// implements the numeric traits.
157 /// - `radix` - Base to use. Accepts only the values 2-36. If the exponential notation
158 /// is used, then this base is only used for the significand. The exponent
159 /// itself always printed using a base of 10.
160 /// - `negative_zero` - Whether to treat the special value `-0` as
162 /// - `sign` - How to emit the sign. See `SignFormat`.
163 /// - `digits` - The amount of digits to use for emitting the fractional
164 /// part, if any. See `SignificantDigits`.
165 /// - `exp_format` - Whether or not to use the exponential (scientific) notation.
166 /// See `ExponentFormat`.
167 /// - `exp_capital` - Whether or not to use a capital letter for the exponent sign, if
168 /// exponential notation is desired.
172 /// A tuple containing the byte vector, and a boolean flag indicating
173 /// whether it represents a special value like `inf`, `-inf`, `NaN` or not.
174 /// It returns a tuple because there can be ambiguity between a special value
175 /// and a number representation at higher bases.
179 /// - Panics if `radix` < 2 or `radix` > 36.
180 /// - Panics if `radix` > 14 and `exp_format` is `ExpDec` due to conflict
181 /// between digit and exponent sign `'e'`.
182 /// - Panics if `radix` > 25 and `exp_format` is `ExpBin` due to conflict
183 /// between digit and exponent sign `'p'`.
184 pub fn float_to_str_bytes_common<T: Float>(
185 num: T, radix: uint, negative_zero: bool,
186 sign: SignFormat, digits: SignificantDigits, exp_format: ExponentFormat, exp_upper: bool
187 ) -> (Vec<u8>, bool) {
188 assert!(2 <= radix && radix <= 36);
190 ExpDec if radix >= DIGIT_E_RADIX // decimal exponent 'e'
191 => panic!("float_to_str_bytes_common: radix {} incompatible with \
192 use of 'e' as decimal exponent", radix),
193 ExpBin if radix >= DIGIT_P_RADIX // binary exponent 'p'
194 => panic!("float_to_str_bytes_common: radix {} incompatible with \
195 use of 'p' as binary exponent", radix),
199 let _0: T = Float::zero();
200 let _1: T = Float::one();
202 match num.classify() {
203 Fp::Nan => { return (b"NaN".to_vec(), true); }
204 Fp::Infinite if num > _0 => {
206 SignAll => (b"+inf".to_vec(), true),
207 _ => (b"inf".to_vec(), true)
210 Fp::Infinite if num < _0 => {
212 SignNone => (b"inf".to_vec(), true),
213 _ => (b"-inf".to_vec(), true),
219 let neg = num < _0 || (negative_zero && _1 / num == Float::neg_infinity());
220 let mut buf = Vec::new();
221 let radix_gen: T = num::cast(radix as int).unwrap();
223 let (num, exp) = match exp_format {
224 ExpNone => (num, 0i32),
229 let (exp, exp_base) = match exp_format {
230 ExpDec => (num.abs().log10().floor(), num::cast::<f64, T>(10.0f64).unwrap()),
231 ExpBin => (num.abs().log2().floor(), num::cast::<f64, T>(2.0f64).unwrap()),
232 ExpNone => unreachable!()
235 (num / exp_base.powf(exp), num::cast::<T, i32>(exp).unwrap())
240 // First emit the non-fractional part, looping at least once to make
241 // sure at least a `0` gets emitted.
242 let mut deccum = num.trunc();
244 // Calculate the absolute value of each digit instead of only
245 // doing it once for the whole number because a
246 // representable negative number doesn't necessary have an
247 // representable additive inverse of the same type
248 // (See twos complement). But we assume that for the
249 // numbers [-35 .. 0] we always have [0 .. 35].
250 let current_digit = (deccum % radix_gen).abs();
252 // Decrease the deccumulator one digit at a time
253 deccum = deccum / radix_gen;
254 deccum = deccum.trunc();
256 buf.push(char::from_digit(current_digit.to_int().unwrap() as uint, radix)
259 // No more digits to calculate for the non-fractional part -> break
260 if deccum == _0 { break; }
263 // If limited digits, calculate one digit more for rounding.
264 let (limit_digits, digit_count, exact) = match digits {
265 DigAll => (false, 0u, false),
266 DigMax(count) => (true, count+1, false),
267 DigExact(count) => (true, count+1, true)
270 // Decide what sign to put in front
272 SignNeg | SignAll if neg => {
283 // Remember start of the fractional digits.
284 // Points one beyond end of buf if none get generated,
285 // or at the '.' otherwise.
286 let start_fractional_digits = buf.len();
288 // Now emit the fractional part, if any
289 deccum = num.fract();
290 if deccum != _0 || (limit_digits && exact && digit_count > 0) {
294 // calculate new digits while
295 // - there is no limit and there are digits left
296 // - or there is a limit, it's not reached yet and
298 // - or it's a maximum, and there are still digits left
299 while (!limit_digits && deccum != _0)
300 || (limit_digits && dig < digit_count && (
302 || (!exact && deccum != _0)
305 // Shift first fractional digit into the integer part
306 deccum = deccum * radix_gen;
308 // Calculate the absolute value of each digit.
309 // See note in first loop.
310 let current_digit = deccum.trunc().abs();
312 buf.push(char::from_digit(
313 current_digit.to_int().unwrap() as uint, radix).unwrap() as u8);
315 // Decrease the deccumulator one fractional digit at a time
316 deccum = deccum.fract();
320 // If digits are limited, and that limit has been reached,
321 // cut off the one extra digit, and depending on its value
322 // round the remaining ones.
323 if limit_digits && dig == digit_count {
324 let ascii2value = |&: chr: u8| {
325 (chr as char).to_digit(radix).unwrap()
327 let value2ascii = |&: val: uint| {
328 char::from_digit(val, radix).unwrap() as u8
331 let extra_digit = ascii2value(buf.pop().unwrap());
332 if extra_digit >= radix / 2 { // -> need to round
333 let mut i: int = buf.len() as int - 1;
335 // If reached left end of number, have to
336 // insert additional digit:
338 || buf[i as uint] == b'-'
339 || buf[i as uint] == b'+' {
340 buf.insert((i + 1) as uint, value2ascii(1));
345 if buf[i as uint] == b'.' { i -= 1; continue; }
347 // Either increment the digit,
348 // or set to 0 if max and carry the 1.
349 let current_digit = ascii2value(buf[i as uint]);
350 if current_digit < (radix - 1) {
351 buf[i as uint] = value2ascii(current_digit+1);
354 buf[i as uint] = value2ascii(0);
362 // if number of digits is not exact, remove all trailing '0's up to
363 // and including the '.'
365 let buf_max_i = buf.len() - 1;
367 // index to truncate from
368 let mut i = buf_max_i;
370 // discover trailing zeros of fractional part
371 while i > start_fractional_digits && buf[i] == b'0' {
375 // Only attempt to truncate digits if buf has fractional digits
376 if i >= start_fractional_digits {
377 // If buf ends with '.', cut that too.
378 if buf[i] == b'.' { i -= 1 }
380 // only resize buf if we actually remove digits
382 buf = buf.slice(0, i + 1).to_vec();
385 } // If exact and trailing '.', just cut that
387 let max_i = buf.len() - 1;
388 if buf[max_i] == b'.' {
389 buf = buf.slice(0, max_i).to_vec();
396 buf.push(match exp_format {
397 ExpDec if exp_upper => 'E',
398 ExpDec if !exp_upper => 'e',
399 ExpBin if exp_upper => 'P',
400 ExpBin if !exp_upper => 'p',
404 int_to_str_bytes_common(exp, 10, sign, |c| buf.push(c));
411 /// Converts a number to its string representation. This is a wrapper for
412 /// `to_str_bytes_common()`, for details see there.
414 pub fn float_to_str_common<T: Float>(
415 num: T, radix: uint, negative_zero: bool,
416 sign: SignFormat, digits: SignificantDigits, exp_format: ExponentFormat, exp_capital: bool
417 ) -> (String, bool) {
418 let (bytes, special) = float_to_str_bytes_common(num, radix,
419 negative_zero, sign, digits, exp_format, exp_capital);
420 (String::from_utf8(bytes).unwrap(), special)
423 // Some constants for from_str_bytes_common's input validation,
424 // they define minimum radix values for which the character is a valid digit.
425 static DIGIT_P_RADIX: uint = ('p' as uint) - ('a' as uint) + 11u;
426 static DIGIT_E_RADIX: uint = ('e' as uint) - ('a' as uint) + 11u;
430 use string::ToString;
433 fn test_int_to_str_overflow() {
434 let mut i8_val: i8 = 127_i8;
435 assert_eq!(i8_val.to_string(), "127");
438 assert_eq!(i8_val.to_string(), "-128");
440 let mut i16_val: i16 = 32_767_i16;
441 assert_eq!(i16_val.to_string(), "32767");
444 assert_eq!(i16_val.to_string(), "-32768");
446 let mut i32_val: i32 = 2_147_483_647_i32;
447 assert_eq!(i32_val.to_string(), "2147483647");
450 assert_eq!(i32_val.to_string(), "-2147483648");
452 let mut i64_val: i64 = 9_223_372_036_854_775_807_i64;
453 assert_eq!(i64_val.to_string(), "9223372036854775807");
456 assert_eq!(i64_val.to_string(), "-9223372036854775808");
465 use super::test::Bencher;
466 use rand::{weak_rng, Rng};
470 fn to_string(x: uint, base: u8) {
471 format!("{}", fmt::radix(x, base));
475 fn to_str_bin(b: &mut Bencher) {
476 let mut rng = weak_rng();
477 b.iter(|| { to_string(rng.gen::<uint>(), 2); })
481 fn to_str_oct(b: &mut Bencher) {
482 let mut rng = weak_rng();
483 b.iter(|| { to_string(rng.gen::<uint>(), 8); })
487 fn to_str_dec(b: &mut Bencher) {
488 let mut rng = weak_rng();
489 b.iter(|| { to_string(rng.gen::<uint>(), 10); })
493 fn to_str_hex(b: &mut Bencher) {
494 let mut rng = weak_rng();
495 b.iter(|| { to_string(rng.gen::<uint>(), 16); })
499 fn to_str_base_36(b: &mut Bencher) {
500 let mut rng = weak_rng();
501 b.iter(|| { to_string(rng.gen::<uint>(), 36); })
506 use super::test::Bencher;
507 use rand::{weak_rng, Rng};
511 fn to_string(x: int, base: u8) {
512 format!("{}", fmt::radix(x, base));
516 fn to_str_bin(b: &mut Bencher) {
517 let mut rng = weak_rng();
518 b.iter(|| { to_string(rng.gen::<int>(), 2); })
522 fn to_str_oct(b: &mut Bencher) {
523 let mut rng = weak_rng();
524 b.iter(|| { to_string(rng.gen::<int>(), 8); })
528 fn to_str_dec(b: &mut Bencher) {
529 let mut rng = weak_rng();
530 b.iter(|| { to_string(rng.gen::<int>(), 10); })
534 fn to_str_hex(b: &mut Bencher) {
535 let mut rng = weak_rng();
536 b.iter(|| { to_string(rng.gen::<int>(), 16); })
540 fn to_str_base_36(b: &mut Bencher) {
541 let mut rng = weak_rng();
542 b.iter(|| { to_string(rng.gen::<int>(), 36); })
547 use super::test::Bencher;
548 use rand::{weak_rng, Rng};
552 fn float_to_string(b: &mut Bencher) {
553 let mut rng = weak_rng();
554 b.iter(|| { f64::to_string(rng.gen()); })