songsenand
/
cgal
mirror of https://github.com/CGAL/cgal
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

int -> size_t and static_casts

This commit is contained in:
Andreas Fabri 2010-06-23 08:30:32 +00:00
parent ff7e506767
commit bfa1c00225
2 changed files with 5 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
Kinetic_data_structures/src/CGAL/JAMA_numeric_solver.cpp
View File

@ -78,7 +78,7 @@ void jama_polynomial_compute_roots(const double *begin, const double *end,
double lb, double ub, double lb, double ub,
std::vector<double> &roots) std::vector<double> &roots)
{ {
int degree= end-begin-1; std::size_t degree= end-begin-1;
switch( degree) { switch( degree) {
case -1: case -1:
case 0: case 0:
@ -104,7 +104,7 @@ void jama_polynomial_compute_cleaned_roots(const double *begin, const double *en
double lb, double ub, double lb, double ub,
std::vector<double> &roots) std::vector<double> &roots)
{ {
int degree= end-begin-1; std::size_t degree= end-begin-1;
switch( degree) { switch( degree) {
case -1: case -1:
case 0: case 0:

6
Kinetic_data_structures/src/CGAL/Turkowski_numeric_solver.cpp
View File

@ -362,7 +362,7 @@ static void Turkowski_polynomial_compute_roots_t(const double *begin,
cc[i]=std::numeric_limits<double>::infinity(); cc[i]=std::numeric_limits<double>::infinity();
} }
FindPolynomialRoots(begin, rp, cp, cc, numc-1, 10*numc, 40); FindPolynomialRoots(begin, rp, cp, cc, static_cast<long>(numc)-1, 10*static_cast<long>(numc), 40);
/*if (CLEAN) { /*if (CLEAN) {
lb-= .000005; lb-= .000005;
@ -393,7 +393,7 @@ void Turkowski_polynomial_compute_roots(const double *begin, const double *end,
std::vector<double> &roots) std::vector<double> &roots)
{ {
int degree= end-begin-1; std::size_t degree= end-begin-1;
switch( degree) { switch( degree) {
case -1: case -1:
case 0: case 0:
@ -426,7 +426,7 @@ void Turkowski_polynomial_compute_cleaned_roots(const double *begin, const doubl
double lb, double ub, double lb, double ub,
std::vector<double> &roots) std::vector<double> &roots)
{ {
int degree= end-begin-1; std::size_t degree= end-begin-1;
switch( degree) { switch( degree) {
case -1: case -1:
case 0: case 0: