@@ -1366,15 +1366,15 @@ impl<R: Rng> RandBigInt for R {
1366
1366
impl BigInt {
1367
1367
/// Creates and initializes a BigInt.
1368
1368
///
1369
- /// The digits are in little-endian base 2^32 .
1369
+ /// The digits are in little-endian base 2<sup>32</sup> .
1370
1370
#[ inline]
1371
1371
pub fn new ( sign : Sign , digits : Vec < BigDigit > ) -> BigInt {
1372
1372
BigInt :: from_biguint ( sign, BigUint :: new ( digits) )
1373
1373
}
1374
1374
1375
1375
/// Creates and initializes a `BigInt`.
1376
1376
///
1377
- /// The digits are in little-endian base 2^32 .
1377
+ /// The digits are in little-endian base 2<sup>32</sup> .
1378
1378
#[ inline]
1379
1379
pub fn from_biguint ( mut sign : Sign , mut data : BigUint ) -> BigInt {
1380
1380
if sign == NoSign {
@@ -1444,7 +1444,7 @@ impl BigInt {
1444
1444
/// Creates and initializes a `BigInt` from an array of bytes in
1445
1445
/// two's complement binary representation.
1446
1446
///
1447
- /// The digits are in big-endian base 2^8 .
1447
+ /// The digits are in big-endian base 2<sup>8</sup> .
1448
1448
#[ inline]
1449
1449
pub fn from_signed_bytes_be ( digits : & [ u8 ] ) -> BigInt {
1450
1450
let sign = match digits. first ( ) {
@@ -1465,7 +1465,7 @@ impl BigInt {
1465
1465
1466
1466
/// Creates and initializes a `BigInt` from an array of bytes in two's complement.
1467
1467
///
1468
- /// The digits are in little-endian base 2^8 .
1468
+ /// The digits are in little-endian base 2<sup>8</sup> .
1469
1469
#[ inline]
1470
1470
pub fn from_signed_bytes_le ( digits : & [ u8 ] ) -> BigInt {
1471
1471
let sign = match digits. last ( ) {
0 commit comments