From ccf97c0e745384cc124589e73b7145cbdd49ab93 Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?=C3=89milie=20Feral?= Date: Mon, 4 Dec 2017 17:48:09 +0100 Subject: [PATCH] [poincare] Clean Integer::udiv Change-Id: I40735d10499ea2cf3c9a9f8f327eb3fec9ebee7b --- poincare/src/integer.cpp | 3 +-- 1 file changed, 1 insertion(+), 2 deletions(-) diff --git a/poincare/src/integer.cpp b/poincare/src/integer.cpp index a69e35d4b..f758a9d4e 100644 --- a/poincare/src/integer.cpp +++ b/poincare/src/integer.cpp @@ -429,7 +429,7 @@ IntegerDivision Integer::udiv(const Integer & numerator, const Integer & denomin Integer A = numerator; Integer B = denominator; - native_int_t base = (double_native_uint_t)1 << 16; + native_int_t base = 1 << 16; // TODO: optimize by just swifting digit and finding 2^kB that makes B normalized native_int_t d = base/(native_int_t)(B.halfDigit(B.numberOfHalfDigits()-1)+1); A = Multiplication(Integer(d), A); @@ -446,7 +446,6 @@ IntegerDivision Integer::udiv(const Integer & numerator, const Integer & denomin A = Subtraction(A, betaMB); } for (int j = m-1; j >= 0; j--) { - native_uint_t base = 1 << 16; native_uint_t qj2 = ((native_uint_t)A.halfDigit(n+j)*base+(native_uint_t)A.halfDigit(n+j-1))/(native_uint_t)B.halfDigit(n-1); half_native_uint_t baseMinus1 = (1 << 16) -1; qDigits[j] = qj2 < (native_uint_t)baseMinus1 ? (half_native_uint_t)qj2 : baseMinus1;