From 961f00d52b0d65e14d9a220d1ee397047a994525 Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Fri, 12 Jan 2024 07:04:01 +0000
Subject: [PATCH] Kernel_d: Use integral_division()

---
 .../CGAL/Kernel_d/Linear_algebraHd_impl.h        | 16 ++++++++--------
 1 file changed, 8 insertions(+), 8 deletions(-)

diff --git a/Kernel_d/include/CGAL/Kernel_d/Linear_algebraHd_impl.h b/Kernel_d/include/CGAL/Kernel_d/Linear_algebraHd_impl.h
index df22d36cf9a..9398b3964e9 100644
--- a/Kernel_d/include/CGAL/Kernel_d/Linear_algebraHd_impl.h
+++ b/Kernel_d/include/CGAL/Kernel_d/Linear_algebraHd_impl.h
@@ -95,13 +95,13 @@ linear_solver(const Matrix& A, const Vector& b,
 
       for(i = k + 1; i < rows; i++)
         for (j = 0; j <  rows; j++)  //and all columns of |L|
-          L(i,j) = (L(i,j)*C(k,k) - C(i,k)*L(k,j))/denom;
+          L(i,j) = integral_division((L(i,j)*C(k,k) - C(i,k)*L(k,j)), denom);
 
       for(i = k + 1; i < rows; i++) {
         /* the following iteration uses and changes |C(i,k)| */
         RT temp = C(i,k);
         for (j = k; j <= cols; j++)
-          C(i,j) = (C(i,j)*C(k,k) - temp*C(k,j))/denom;
+          C(i,j) = integral_division((C(i,j)*C(k,k) - temp*C(k,j)), denom);
       }
       denom = C(k,k);
       #ifdef CGAL_LA_SELFTEST
@@ -140,7 +140,7 @@ linear_solver(const Matrix& A, const Vector& b,
       for (j = i + 1; j < rank; j++) {
         h -= C(i,j)*x[var[j]];
       }
-      x[var[i]]= h / C(i,i);
+      x[var[i]]= integral_division(h, C(i,i));
     }
     #ifdef CGAL_LA_SELFTEST
       CGAL_assertion( (M*x).is_zero() );
@@ -156,7 +156,7 @@ linear_solver(const Matrix& A, const Vector& b,
           RT_ h = - C(i,rank + l)*D;
           for ( j= i + 1; j<rank; j++)
             h -= C(i,j)*spanning_vectors(var[j],l);
-          spanning_vectors(var[i],l)= h / C(i,i);
+          spanning_vectors(var[i],l)= integral_division(h, C(i,i));
         }
     #ifdef CGAL_LA_SELFTEST
           /* we check whether the $l$ - th spanning vector is a solution
@@ -908,13 +908,13 @@ homogeneous_linear_solver(const Matrix &A,
 
       for(i = k + 1; i < rows; i++)
         for (j = 0; j <  rows; j++)  //and all columns of |L|
-          L(i,j) = (L(i,j)*C(k,k) - C(i,k)*L(k,j))/denom;
+          L(i,j) = integral_division(L(i,j)*C(k,k) - C(i,k)*L(k,j),denom);
 
       for(i = k + 1; i < rows; i++) {
         /* the following iteration uses and changes |C(i,k)| */
         RT temp = C(i,k);
         for (j = k; j <= cols; j++)
-          C(i,j) = (C(i,j)*C(k,k) - temp*C(k,j))/denom;
+          C(i,j) = integral_division(C(i,j)*C(k,k) - temp*C(k,j), denom);
       }
       denom = C(k,k);
       #ifdef CGAL_LA_SELFTEST
@@ -949,7 +949,7 @@ homogeneous_linear_solver(const Matrix &A,
     for (j = i + 1; j < rank; j++) {
       h -= C(i,j)*x[var[j]];
     }
-    x[var[i]]= h / C(i,i);
+    x[var[i]]= integral_division(h, C(i,i));
   }
   #ifdef CGAL_LA_SELFTEST
     CGAL_assertion( (M*x).is_zero() );
@@ -965,7 +965,7 @@ homogeneous_linear_solver(const Matrix &A,
         RT_ h = - C(i,rank + l)*D;
         for ( j= i + 1; j<rank; j++)
           h -= C(i,j)*spanning_vectors(var[j],l);
-        spanning_vectors(var[i],l)= h / C(i,i);
+        spanning_vectors(var[i],l)= integral_division(h , C(i,i));
       }
   #ifdef CGAL_LA_SELFTEST
         /* we check whether the $l$ - th spanning vector is a solution