UpsilonNumworks/Upsilon
1
0
Fork 0
mirror of https://github.com/UpsilonNumworks/Upsilon.git synced 2026-03-30 04:00:02 +02:00
Code Issues Packages Projects Releases Wiki Activity

[poincare] Fix and add tests on Integer::Division

Browse Source
This commit is contained in:
Émilie Feral
2018-08-14 13:21:13 +02:00
parent ca1bd60688
commit dab9b5cd21
4 changed files with 31 additions and 25 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
poincare/src/integer.cpp
View File

@@ -277,8 +277,8 @@ IntegerDivision NaturalIntegerAbstract::udiv(const NaturalIntegerAbstract * nume
int n = B.node()->numberOfHalfDigits();
int m = A.node()->numberOfHalfDigits()-n;
half_native_uint_t qDigits[k_maxNumberOfDigits+1];
memset(qDigits, 0, (m/2+1)*sizeof(native_uint_t));
half_native_uint_t qDigits[2*k_maxNumberOfDigits]; // qDigits is a half_native_uint_t array
memset(qDigits, 0, 2*k_maxNumberOfDigits*sizeof(half_native_uint_t));
Integer betam = IntegerWithHalfDigitAtIndex(1, m+1);
Integer betaMB = Integer::Multiplication(betam, B); // TODO: can swift all digits by m! B.swift16(mg)
if (Integer::NaturalOrder(A,betaMB) > 0) {