forked from dtolnay/syn
-
Notifications
You must be signed in to change notification settings - Fork 0
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Merge pull request dtolnay#683 from dtolnay/lit
Switch to base10_digits() as the main numeric literal accessor
- Loading branch information
Showing
11 changed files
with
306 additions
and
230 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,69 @@ | ||
use std::ops::{AddAssign, MulAssign}; | ||
|
||
// For implementing base10_digits() accessor on LitInt. | ||
pub struct BigInt { | ||
digits: Vec<u8>, | ||
} | ||
|
||
impl BigInt { | ||
pub fn new() -> Self { | ||
BigInt { | ||
digits: Vec::new(), | ||
} | ||
} | ||
|
||
pub fn to_string(&self) -> String { | ||
let mut repr = String::with_capacity(self.digits.len()); | ||
|
||
let mut has_nonzero = false; | ||
for digit in self.digits.iter().rev() { | ||
has_nonzero |= *digit != 0; | ||
if has_nonzero { | ||
repr.push((*digit + b'0') as char); | ||
} | ||
} | ||
|
||
if repr.is_empty() { | ||
repr.push('0'); | ||
} | ||
|
||
repr | ||
} | ||
|
||
fn reserve_two_digits(&mut self) { | ||
let len = self.digits.len(); | ||
let desired = len | ||
+ !self.digits.ends_with(&[0, 0]) as usize | ||
+ !self.digits.ends_with(&[0]) as usize; | ||
self.digits.resize(desired, 0); | ||
} | ||
} | ||
|
||
impl AddAssign<u8> for BigInt { | ||
// Assumes increment <16. | ||
fn add_assign(&mut self, mut increment: u8) { | ||
self.reserve_two_digits(); | ||
|
||
let mut i = 0; | ||
while increment > 0 { | ||
let sum = self.digits[i] + increment; | ||
self.digits[i] = sum % 10; | ||
increment = sum / 10; | ||
i += 1; | ||
} | ||
} | ||
} | ||
|
||
impl MulAssign<u8> for BigInt { | ||
// Assumes base <=16. | ||
fn mul_assign(&mut self, base: u8) { | ||
self.reserve_two_digits(); | ||
|
||
let mut carry = 0; | ||
for digit in &mut self.digits { | ||
let prod = *digit * base + carry; | ||
*digit = prod % 10; | ||
carry = prod / 10; | ||
} | ||
} | ||
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Oops, something went wrong.