atoi/lib.rs
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687
//! A crate for parsing integers directly from ASCII (`[u8]`) without encoding them into utf8
//! first. The name is inspired by the famous C function.
//!
//! Using `str::from_utf8` and `str::parse`
//! is likely to be more idiomatic. Use this crate if you want to avoid decoding bytes into utf8
//! (e.g. for performance reasons).
//!
//! Note that if you want to know how much of the input has been used, you can use the
//! `FromRadix10` trait, for example:
//!
//! ```rust
//! use atoi::FromRadix10;
//!
//! /// Return the parsed integer and remaining slice if successful.
//! fn atoi_with_rest<I: FromRadix10>(text: &[u8]) -> ((&[u8], Option<I>)) {
//! match I::from_radix_10(text) {
//! (_, 0) => (text, None),
//! (n, used) => (&text[used..], Some(n)),
//! }
//! }
//! ```
#![cfg_attr(not(std), no_std)]
use num_traits::{
ops::checked::{CheckedAdd, CheckedMul},
Bounded, CheckedSub, One, Signed, Zero,
};
use core::{
cmp::{max, min},
ops::{AddAssign, DivAssign, MulAssign, SubAssign},
};
/// Parses an integer from a slice.
///
/// Contrary to its 'C' counterpart atoi is generic and will require a type argument if the type
/// inference can not determine its result. It will also check for overflow / underflow and allow
/// for Signs.
///
/// Use [`FromRadix10`] or [`FromRadix10Checked`] directly if you do not want to allow signs. Use
/// [`FromRadix10`] or [`FromRadix10Signed`] if you want to opt out overflow / underflow checking.
///
/// # Example
///
/// ```
/// use atoi::atoi;
/// // Parsing to digits from a slice
/// assert_eq!(Some(42), atoi::<u32>(b"42"));
/// // Additional bytes after the number are ignored. If you want to know how many bytes were used
/// // to parse the number use `FromRadix10::from_radix_10`.
/// assert_eq!(Some(42), atoi::<u32>(b"42 is the answer to life, the universe and everything"));
/// // `None` is returned if the slice does not start with a digit
/// assert_eq!(None, atoi::<u32>(b"Sadly we do not know the question"));
/// // While signed integer types are supported...
/// assert_eq!(Some(42), atoi::<i32>(b"42"));
/// // Signs are allowed.
/// assert_eq!(Some(-42), atoi::<i32>(b"-42"));
/// // Leading zeros are allowed
/// assert_eq!(Some(42), atoi::<u32>(b"0042"));
/// // Overflows will return `None`
/// assert_eq!(None, atoi::<u8>(b"256"));
/// ```
///
/// # Return
///
/// Returns a a number if the slice started with a number, otherwise `None` is returned.
pub fn atoi<I>(text: &[u8]) -> Option<I>
where
I: FromRadix10SignedChecked,
{
match I::from_radix_10_signed_checked(text) {
(_, 0) | (None, _) => None,
(Some(n), _) => Some(n),
}
}
/// Types implementing this trait can be parsed from a positional numeral system with radix 10
pub trait FromRadix10: Sized {
/// Parses an integer from a slice.
///
/// # Example
///
/// ```
/// use atoi::FromRadix10;
/// // Parsing to digits from a slice
/// assert_eq!((42,2), u32::from_radix_10(b"42"));
/// // Additional bytes after the number are ignored
/// assert_eq!((42,2), u32::from_radix_10(b"42 is the answer to life, the universe and everything"));
/// // (0,0) is returned if the slice does not start with a digit
/// assert_eq!((0,0), u32::from_radix_10(b"Sadly we do not know the question"));
/// // While signed integer types are supported...
/// assert_eq!((42,2), i32::from_radix_10(b"42"));
/// // Signs are not allowed (even for signed integer types)
/// assert_eq!((0,0), i32::from_radix_10(b"-42"));
/// // Leading zeros are allowed
/// assert_eq!((42,4), u32::from_radix_10(b"0042"));
/// ```
///
/// # Return
///
/// Returns a tuple with two numbers. The first is the integer parsed or zero, the second is the
/// index of the byte right after the parsed number. If the second element is zero the slice
/// did not start with an ASCII digit.
fn from_radix_10(_: &[u8]) -> (Self, usize);
}
/// Types implementing this trait can be parsed from a positional numeral system with radix 10.
/// Acts much like `FromRadix10`, but performs additional checks for overflows.
pub trait FromRadix10Checked: FromRadix10 {
/// Parses an integer from a slice.
///
/// # Example
///
/// ```
/// use atoi::FromRadix10Checked;
/// // Parsing to digits from a slice
/// assert_eq!((Some(42),2), u32::from_radix_10_checked(b"42"));
/// // Additional bytes after the number are ignored
/// assert_eq!((Some(42),2), u32::from_radix_10_checked(b"42 is the answer to life, the universe and everything"));
/// // (0,0) is returned if the slice does not start with a digit
/// assert_eq!((Some(0),0), u32::from_radix_10_checked(b"Sadly we do not know the question"));
/// // While signed integer types are supported...
/// assert_eq!((Some(42),2), i32::from_radix_10_checked(b"42"));
/// // Signs are not allowed (even for signed integer types)
/// assert_eq!((Some(0),0), i32::from_radix_10_checked(b"-42"));
/// // Leading zeros are allowed
/// assert_eq!((Some(42),4), u32::from_radix_10_checked(b"0042"));
/// // Overflow is indicated by `None`
/// assert_eq!((None, 3), u8::from_radix_10_checked(b"256"));
/// ```
///
/// # Return
///
/// Returns a tuple with two numbers. The first is the integer parsed or zero if no digit has
/// been found. None, if there were too many, or too high dighits and the parsing overflowed.
/// The second is the index of the byte right after the parsed number. If the second element is
/// zero the slice did not start with an ASCII digit.
fn from_radix_10_checked(_: &[u8]) -> (Option<Self>, usize);
}
/// Types implementing this trait can be parsed from a positional numeral system with radix 16
pub trait FromRadix16: Sized {
/// Parses an integer from a slice.
///
/// # Example
///
/// ```
/// use atoi::FromRadix16;
/// // Parsing to digits from a slice
/// assert_eq!((42,2), u32::from_radix_16(b"2a"));
/// // Additional bytes after the number are ignored
/// assert_eq!((42,2), u32::from_radix_16(b"2a is the answer to life, the universe and everything"));
/// // (0,0) is returned if the slice does not start with a digit
/// assert_eq!((0,0), u32::from_radix_16(b"Sadly we do not know the question"));
/// // While signed integer types are supported...
/// assert_eq!((42,2), i32::from_radix_16(b"2a"));
/// // Signs are not allowed (even for signed integer types)
/// assert_eq!((0,0), i32::from_radix_16(b"-2a"));
/// // Leading zeros are allowed
/// assert_eq!((42,4), u32::from_radix_16(b"002a"));
/// // so are uppercase letters
/// assert_eq!((42,4), u32::from_radix_16(b"002A"));
/// ```
///
/// # Return
///
/// Returns a tuple with two numbers. The first is the integer parsed or zero, the second is the
/// index of the byte right after the parsed number. If the second element is zero the slice
/// did not start with an ASCII digit.
fn from_radix_16(_: &[u8]) -> (Self, usize);
}
/// Types implementing this trait can be parsed from a positional numeral system with radix 16.
/// Acts much like `FromRadix16`, but performs additional checks for overflows.
pub trait FromRadix16Checked: FromRadix16 {
/// Parses an integer from a slice.
///
/// # Example
///
/// ```
/// use atoi::FromRadix16Checked;
/// // Parsing to digits from a slice
/// assert_eq!((Some(42),2), u32::from_radix_16_checked(b"2a"));
/// // Additional bytes after the number are ignored
/// assert_eq!((Some(42),2), u32::from_radix_16_checked(b"2a is the answer to life, the \
/// universe and everything"));
/// // (0,0) is returned if the slice does not start with a digit
/// assert_eq!((Some(0),0), u32::from_radix_16_checked(b"Sadly we do not know the question"));
/// // While signed integer types are supported...
/// assert_eq!((Some(42),2), i32::from_radix_16_checked(b"2a"));
/// // Signs are not allowed (even for signed integer types)
/// assert_eq!((Some(0),0), i32::from_radix_16_checked(b"-2a"));
/// // Leading zeros are allowed
/// assert_eq!((Some(42),4), u32::from_radix_16_checked(b"002a"));
/// // So are uppercase letters
/// assert_eq!((Some(42),2), u32::from_radix_16_checked(b"2A"))
/// ```
///
/// # Return
///
/// Returns a tuple with two numbers. The first is the integer parsed or zero if no digit has
/// been found. None, if there were too many, or too high dighits and the parsing overflowed.
/// The second is the index of the byte right after the parsed number. If the second element is
/// zero the slice did not start with an ASCII digit.
fn from_radix_16_checked(_: &[u8]) -> (Option<Self>, usize);
}
/// Types implementing this trait can be parsed from a positional numeral system with radix 10. This
/// trait allows for an additional sign character (`+` or `-`) in front of the actual number in
/// order, to allow for parsing negative values.
pub trait FromRadix10Signed: Sized {
/// Parses an integer from a slice.
///
/// # Example
///
/// ```
/// use atoi::FromRadix10Signed;
/// // Parsing to digits from a slice
/// assert_eq!((42,2), i32::from_radix_10_signed(b"42"));
/// // Additional bytes after the number are ignored
/// assert_eq!((42,2), i32::from_radix_10_signed(b"42 is the answer to life, the universe and everything"));
/// // (0,0) is returned if the slice does not start with a digit
/// assert_eq!((0,0), i32::from_radix_10_signed(b"Sadly we do not know the question"));
/// // Signs are allowed
/// assert_eq!((-42,3), i32::from_radix_10_signed(b"-42"));
/// // Signs are allowed
/// assert_eq!((42,3), i32::from_radix_10_signed(b"+42"));
/// // Even on unsigned types.
/// assert_eq!((0,2), u32::from_radix_10_signed(b"-0"));
/// // Leading zeros are allowed
/// assert_eq!((42,4), i32::from_radix_10_signed(b"0042"));
/// ```
///
/// # Return
///
/// Returns a tuple with two numbers. The first is the integer parsed or zero, the second is the
/// index of the byte right after the parsed number. If the second element is zero the slice
/// did not start with an ASCII digit.
fn from_radix_10_signed(_: &[u8]) -> (Self, usize);
}
/// Types implementing this trait can be parsed from a positional numeral system with radix 10.
/// Acts much like `FromRadix10Signed`, but performs additional checks for overflows.
pub trait FromRadix10SignedChecked: FromRadix10Signed {
/// Parses an integer from a slice.
///
/// # Example
///
/// ```
/// use atoi::FromRadix10SignedChecked;
/// // Parsing to digits from a slice
/// assert_eq!((Some(42),2), u32::from_radix_10_signed_checked(b"42"));
/// // Additional bytes after the number are ignored
/// assert_eq!((Some(42),2), u32::from_radix_10_signed_checked(b"42 is the answer to life, the universe and everything"));
/// // (0,0) is returned if the slice does not start with a digit
/// assert_eq!((Some(0),0), u32::from_radix_10_signed_checked(b"Sadly we do not know the question"));
/// // While signed integer types are supported...
/// assert_eq!((Some(42),2), i32::from_radix_10_signed_checked(b"42"));
/// // Signs are allowed
/// assert_eq!((Some(-42),3), i32::from_radix_10_signed_checked(b"-42"));
/// // -0 is ok, even for an unsigned type
/// assert_eq!((Some(0),2), u32::from_radix_10_signed_checked(b"-0"));
/// // -1 is an Underflow
/// assert_eq!((None,2), u32::from_radix_10_signed_checked(b"-1"));
/// // Negative values for unsigned types are handled as `None`.
/// assert_eq!((None,3), u32::from_radix_10_signed_checked(b"-42"));
/// // Leading zeros are allowed
/// assert_eq!((Some(42),4), u32::from_radix_10_signed_checked(b"0042"));
/// // Overflow is indicated by `None`
/// assert_eq!((None, 3), u8::from_radix_10_signed_checked(b"256"));
/// assert_eq!((None, 4), i8::from_radix_10_signed_checked(b"+128"));
/// assert_eq!((None, 4), i8::from_radix_10_signed_checked(b"-129"));
/// ```
///
/// # Return
///
/// Returns a tuple with two numbers. The first is the integer parsed or zero if no digit has
/// been found. None, if there were too many, or too high dighits and the parsing overflowed.
/// The second is the index of the byte right after the parsed number. If the second element is
/// zero the slice did not start with an ASCII digit.
fn from_radix_10_signed_checked(_: &[u8]) -> (Option<Self>, usize);
}
/// A bounded integer, whose representation can overflow and therefore can only store a maximum
/// number of digits
pub trait MaxNumDigits {
/// Given a representation with a radix character I, what is the maximum number of digits we can
/// parse without the integer overflowing for sure?
fn max_num_digits(radix: Self) -> usize;
/// Returns the maximum number of digits a negative representation of `I` can have depending on
/// `radix`.
fn max_num_digits_negative(radix: Self) -> usize;
}
impl<I> MaxNumDigits for I
where
I: Bounded + Zero + DivAssign + Ord + Copy,
{
/// Returns the maximum number of digits a nonnegative representation of `I` can have depending
/// on `radix`.
fn max_num_digits(radix: I) -> usize {
let mut max = I::max_value();
let mut d = 0;
while max > I::zero() {
d += 1;
max /= radix;
}
d
}
/// Returns the maximum number of digits a negative representation of `I` can have depending
/// on `radix`.
fn max_num_digits_negative(radix: I) -> usize {
let mut min = I::min_value();
let mut d = 0;
while min < I::zero() {
d += 1;
min /= radix;
}
d
}
}
/// Converts an ascii character to digit
///
/// # Example
///
/// ```
/// use atoi::ascii_to_digit;
/// assert_eq!(Some(5), ascii_to_digit(b'5'));
/// assert_eq!(None, ascii_to_digit::<u32>(b'x'));
/// ```
pub fn ascii_to_digit<I>(character: u8) -> Option<I>
where
I: Zero + One,
{
match character {
b'0' => Some(nth(0)),
b'1' => Some(nth(1)),
b'2' => Some(nth(2)),
b'3' => Some(nth(3)),
b'4' => Some(nth(4)),
b'5' => Some(nth(5)),
b'6' => Some(nth(6)),
b'7' => Some(nth(7)),
b'8' => Some(nth(8)),
b'9' => Some(nth(9)),
_ => None,
}
}
impl<I> FromRadix10 for I
where
I: Zero + One + AddAssign + MulAssign,
{
fn from_radix_10(text: &[u8]) -> (Self, usize) {
let mut index = 0;
let mut number = I::zero();
while index != text.len() {
if let Some(digit) = ascii_to_digit(text[index]) {
number *= nth(10);
number += digit;
index += 1;
} else {
break;
}
}
(number, index)
}
}
impl<I> FromRadix10Signed for I
where
I: Zero + One + AddAssign + SubAssign + MulAssign,
{
fn from_radix_10_signed(text: &[u8]) -> (Self, usize) {
let mut index;
let mut number = I::zero();
let (sign, offset) = text
.first()
.and_then(|&byte| Sign::try_from(byte))
.map(|sign| (sign, 1))
.unwrap_or((Sign::Plus, 0));
index = offset;
// Having two dedicated loops for both the negative and the nonnegative case is rather
// verbose, yet performed up to 40% better then a more terse single loop with
// `number += digit * signum`.
match sign {
Sign::Plus => {
while index != text.len() {
if let Some(digit) = ascii_to_digit::<I>(text[index]) {
number *= nth(10);
number += digit;
index += 1;
} else {
break;
}
}
}
Sign::Minus => {
while index != text.len() {
if let Some(digit) = ascii_to_digit::<I>(text[index]) {
number *= nth(10);
number -= digit;
index += 1;
} else {
break;
}
}
}
}
(number, index)
}
}
impl<I> FromRadix10SignedChecked for I
where
I: Zero
+ One
+ AddAssign
+ MulAssign
+ SubAssign
+ CheckedAdd
+ CheckedSub
+ CheckedMul
+ MaxNumDigits,
{
fn from_radix_10_signed_checked(text: &[u8]) -> (Option<Self>, usize) {
let mut index;
let mut number = I::zero();
let (sign, offset) = text
.first()
.and_then(|&byte| Sign::try_from(byte))
.map(|sign| (sign, 1))
.unwrap_or((Sign::Plus, 0));
index = offset;
// Having two dedicated loops for both the negative and the nonnegative case is rather
// verbose, yet performed up to 40% better then a more terse single loop with
// `number += digit * signum`.
match sign {
Sign::Plus => {
let max_safe_digits = max(1, I::max_num_digits(nth(10))) - 1;
let max_safe_index = min(text.len(), max_safe_digits + offset);
while index != max_safe_index {
if let Some(digit) = ascii_to_digit::<I>(text[index]) {
number *= nth(10);
number += digit;
index += 1;
} else {
break;
}
}
// We parsed the digits, which do not need checking now lets see the next one:
let mut number = Some(number);
while index != text.len() {
if let Some(digit) = ascii_to_digit(text[index]) {
number = number.and_then(|n| n.checked_mul(&nth(10)));
number = number.and_then(|n| n.checked_add(&digit));
index += 1;
} else {
break;
}
}
(number, index)
}
Sign::Minus => {
let max_safe_digits = max(1, I::max_num_digits_negative(nth(10))) - 1;
let max_safe_index = min(text.len(), max_safe_digits + offset);
while index != max_safe_index {
if let Some(digit) = ascii_to_digit::<I>(text[index]) {
number *= nth(10);
number -= digit;
index += 1;
} else {
break;
}
}
// We parsed the digits, which do not need checking now lets see the next one:
let mut number = Some(number);
while index != text.len() {
if let Some(digit) = ascii_to_digit(text[index]) {
number = number.and_then(|n| n.checked_mul(&nth(10)));
number = number.and_then(|n| n.checked_sub(&digit));
index += 1;
} else {
break;
}
}
(number, index)
}
}
}
}
impl<I> FromRadix10Checked for I
where
I: Zero + One + FromRadix10 + CheckedMul + CheckedAdd + MaxNumDigits,
{
fn from_radix_10_checked(text: &[u8]) -> (Option<I>, usize) {
let max_safe_digits = max(1, I::max_num_digits_negative(nth(10))) - 1;
let (number, mut index) = I::from_radix_10(&text[..min(text.len(), max_safe_digits)]);
let mut number = Some(number);
// We parsed the digits, which do not need checking now lets see the next one:
while index != text.len() {
if let Some(digit) = ascii_to_digit(text[index]) {
number = number.and_then(|n| n.checked_mul(&nth(10)));
number = number.and_then(|n| n.checked_add(&digit));
index += 1;
} else {
break;
}
}
(number, index)
}
}
/// Converts an ascii character to digit
fn ascii_to_hexdigit<I>(character: u8) -> Option<I>
where
I: Zero + One,
{
match character {
b'0' => Some(nth(0)),
b'1' => Some(nth(1)),
b'2' => Some(nth(2)),
b'3' => Some(nth(3)),
b'4' => Some(nth(4)),
b'5' => Some(nth(5)),
b'6' => Some(nth(6)),
b'7' => Some(nth(7)),
b'8' => Some(nth(8)),
b'9' => Some(nth(9)),
b'a' | b'A' => Some(nth(10)),
b'b' | b'B' => Some(nth(11)),
b'c' | b'C' => Some(nth(12)),
b'd' | b'D' => Some(nth(13)),
b'e' | b'E' => Some(nth(14)),
b'f' | b'F' => Some(nth(15)),
_ => None,
}
}
impl<I> FromRadix16 for I
where
I: Zero + One + AddAssign + MulAssign,
{
fn from_radix_16(text: &[u8]) -> (Self, usize) {
let mut index = 0;
let mut number = I::zero();
while index != text.len() {
if let Some(digit) = ascii_to_hexdigit(text[index]) {
number *= nth(16);
number += digit;
index += 1;
} else {
break;
}
}
(number, index)
}
}
impl<I> FromRadix16Checked for I
where
I: Zero + One + FromRadix16 + CheckedMul + CheckedAdd + MaxNumDigits,
{
fn from_radix_16_checked(text: &[u8]) -> (Option<I>, usize) {
let max_safe_digits = max(1, I::max_num_digits_negative(nth(10))) - 1;
let (number, mut index) = I::from_radix_16(&text[..min(text.len(), max_safe_digits)]);
let mut number = Some(number);
// We parsed the digits, which do not need checking now lets see the next one:
while index != text.len() {
if let Some(digit) = ascii_to_hexdigit(text[index]) {
number = number.and_then(|n| n.checked_mul(&nth(16)));
number = number.and_then(|n| n.checked_add(&digit));
index += 1;
} else {
break;
}
}
(number, index)
}
}
/// Representation of a numerical sign
#[derive(Clone, Copy, Debug, PartialEq, Eq)]
pub enum Sign {
Plus,
Minus,
}
impl Sign {
/// Trys to convert an ascii character into a `Sign`
///
/// # Example
///
/// ```
/// use atoi::Sign;
/// assert_eq!(Some(Sign::Plus), Sign::try_from(b'+'));
/// assert_eq!(Some(Sign::Minus), Sign::try_from(b'-'));
/// assert_eq!(None, Sign::try_from(b'1'));
/// ```
pub fn try_from(byte: u8) -> Option<Sign> {
match byte {
b'+' => Some(Sign::Plus),
b'-' => Some(Sign::Minus),
_ => None,
}
}
/// Returns either `+1` or `-1`
pub fn signum<I>(self) -> I
where
I: Signed,
{
match self {
Sign::Plus => I::one(),
Sign::Minus => -I::one(),
}
}
}
// At least for primitive types this function does not incur runtime costs, since it is only called
// with constants
fn nth<I>(n: u8) -> I
where
I: Zero + One,
{
let mut i = I::zero();
for _ in 0..n {
i = i + I::one();
}
i
}
#[cfg(test)]
mod test {
use super::*;
#[test]
fn max_digits() {
assert_eq!(10, i32::max_num_digits(10));
assert_eq!(10, u32::max_num_digits(10));
assert_eq!(19, i64::max_num_digits(10));
assert_eq!(20, u64::max_num_digits(10));
assert_eq!(3, u8::max_num_digits(10));
assert_eq!(3, i8::max_num_digits(10));
}
#[test]
fn max_digits_negative() {
assert_eq!(10, i32::max_num_digits_negative(10));
assert_eq!(0, u32::max_num_digits_negative(10));
assert_eq!(19, i64::max_num_digits_negative(10));
assert_eq!(0, u64::max_num_digits_negative(10));
assert_eq!(0, u8::max_num_digits_negative(10));
assert_eq!(3, i8::max_num_digits_negative(10));
}
#[test]
fn checked_parsing() {
assert_eq!((Some(255), 3), u8::from_radix_10_checked(b"255"));
assert_eq!((None, 3), u8::from_radix_10_checked(b"256"));
assert_eq!((None, 4), u8::from_radix_10_checked(b"1000"));
assert_eq!((Some(25), 2), u8::from_radix_10_checked(b"25"));
assert_eq!((Some(25), 2), u8::from_radix_10_checked(b"25Blub"));
}
#[test]
fn checked_parsing_radix_16() {
assert_eq!((Some(255), 2), u8::from_radix_16_checked(b"FF"));
assert_eq!((None, 3), u8::from_radix_16_checked(b"100"));
assert_eq!((None, 4), u8::from_radix_16_checked(b"1000"));
assert_eq!((Some(25), 2), u8::from_radix_16_checked(b"19"));
assert_eq!((Some(25), 2), u8::from_radix_16_checked(b"19!Blub"));
}
}