@@ -179,11 +179,11 @@ bool is_gte(int64_t s, uint64_t u) {
179
179
mantissa[i] = 0 ;
180
180
}
181
181
// Skip leading zeroes
182
- uint32_t firstDigit = 0 ;
183
- while (firstDigit < (digits) .size () && digits[firstDigit] == 0 ) {
182
+ int32_t firstDigit = 0 ;
183
+ while (firstDigit < static_cast < int32_t > (digits.size () ) && digits[firstDigit] == 0 ) {
184
184
firstDigit += 1 ;
185
185
}
186
- if (firstDigit == (digits) .size ()) {
186
+ if (firstDigit == static_cast < int32_t > (digits.size () )) {
187
187
return 0 ; // All zeroes
188
188
}
189
189
int32_t expCorr = -firstDigit;
@@ -200,7 +200,7 @@ bool is_gte(int64_t s, uint64_t u) {
200
200
digits = truncated;
201
201
firstDigit = 0 ;
202
202
}
203
- for (uint32_t i = ((digits).size ()) - 1 ; i >= (firstDigit); i--) { // digits, starting from the last
203
+ for (int32_t i = static_cast < int32_t > ((digits).size ()) - 1 ; i >= (firstDigit); i--) { // digits, starting from the last
204
204
mantissa[0 ] |= (static_cast <uint64_t >(digits[i])) << 32 ;
205
205
divBuffBy10 (mantissa);
206
206
}
@@ -223,7 +223,7 @@ bool is_gte(int64_t s, uint64_t u) {
223
223
// @param buffer the buffer to check
224
224
// @return {@code true} if the buffer is empty, {@code false} otherwise
225
225
template <std::size_t N> bool QuadrupleBuilder::isEmpty (std::array<uint64_t ,N>& buffer) {
226
- for (uint32_t i = (0 ); i < ((buffer).size ()); i++) {
226
+ for (size_t i = (0 ); i < ((buffer).size ()); i++) {
227
227
if (buffer[i] != 0 ) {
228
228
return false ;
229
229
}
@@ -340,7 +340,7 @@ bool is_gte(int64_t s, uint64_t u) {
340
340
}
341
341
// Copies from into to.
342
342
template <std::size_t N> void QuadrupleBuilder::array_copy (std::array<uint64_t ,N>& source,std::array<uint64_t ,4 >& dest) {
343
- for (uint32_t i = (0 ); i < ((dest).size ()); i++) {
343
+ for (size_t i = (0 ); i < ((dest).size ()); i++) {
344
344
dest[i] = source[i];
345
345
}
346
346
}
@@ -365,7 +365,7 @@ bool is_gte(int64_t s, uint64_t u) {
365
365
// @param factor2 an array of longs containing factor 2 as packed quasidecimal
366
366
// @param result an array of 12 longs filled with the product of mantissas
367
367
void QuadrupleBuilder::multPacked3x64_simply (std::array<uint64_t ,4 >& factor1,std::array<uint64_t ,4 >& factor2,std::array<uint64_t ,12 >& result) {
368
- for (uint32_t i = (0 ); i < ((result).size ()); i++) {
368
+ for (size_t i = (0 ); i < ((result).size ()); i++) {
369
369
result[i] = 0 ;
370
370
}
371
371
// TODO2 19.01.16 21:23:06 for the next version -- rebuild the table of powers to make the
@@ -413,7 +413,7 @@ bool is_gte(int64_t s, uint64_t u) {
413
413
// Multiplying a 128-bit number by another 192-bit number,
414
414
// as well as multiplying of two 192-bit numbers,
415
415
// can never produce 320 (or 384 bits, respectively) of 0x1999_9999L, 0x9999_9999L,
416
- for (uint32_t i = (1 ); i < ((buffer).size ()); i++) {
416
+ for (size_t i = (1 ); i < ((buffer).size ()); i++) {
417
417
// so this loop can't be covered entirely
418
418
if (buffer[i] < 0x99999999LL ) {
419
419
return true ;
@@ -431,7 +431,7 @@ bool is_gte(int64_t s, uint64_t u) {
431
431
// @param factor2 an array of 4 longs containing packed quasidecimal power of two
432
432
// @param product a buffer of at least 12 longs to hold the product
433
433
void QuadrupleBuilder::multUnpacked6x32byPacked (std::array<uint64_t ,6 >& factor1,std::array<uint64_t ,4 >& factor2,std::array<uint64_t ,12 >& product) {
434
- for (uint32_t i = (0 ); i < ((product).size ()); i++) {
434
+ for (size_t i = (0 ); i < ((product).size ()); i++) {
435
435
product[i] = 0 ;
436
436
}
437
437
std::array<uint64_t , 6 >& unpacked2 = this ->buffer6x32B ;
@@ -572,4 +572,4 @@ bool is_gte(int64_t s, uint64_t u) {
572
572
}
573
573
} // namespace util
574
574
} // namespace firestore
575
- } // namespace firebase
575
+ } // namespace firebase
0 commit comments