0
3
0
... | ... |
@@ -383,3 +383,4 @@ |
383 | 383 |
|
384 |
_block_size = std::max( int(BLOCK_SIZE_FACTOR * |
|
384 |
_block_size = std::max( int(BLOCK_SIZE_FACTOR * |
|
385 |
std::sqrt(double(_arc_num))), |
|
385 | 386 |
MIN_BLOCK_SIZE ); |
... | ... |
@@ -459,3 +460,4 @@ |
459 | 460 |
|
460 |
_list_length = std::max( int(LIST_LENGTH_FACTOR * |
|
461 |
_list_length = std::max( int(LIST_LENGTH_FACTOR * |
|
462 |
std::sqrt(double(_arc_num))), |
|
461 | 463 |
MIN_LIST_LENGTH ); |
... | ... |
@@ -579,3 +581,4 @@ |
579 | 581 |
|
580 |
_block_size = std::max( int(BLOCK_SIZE_FACTOR * |
|
582 |
_block_size = std::max( int(BLOCK_SIZE_FACTOR * |
|
583 |
std::sqrt(double(_arc_num))), |
|
581 | 584 |
MIN_BLOCK_SIZE ); |
... | ... |
@@ -1227,3 +1230,3 @@ |
1227 | 1230 |
// Store the arcs in a mixed order |
1228 |
int k = std::max(int(sqrt(_arc_num)), 10); |
|
1231 |
int k = std::max(int(std::sqrt(double(_arc_num))), 10); |
|
1229 | 1232 |
int i = 0; |
... | ... |
@@ -67,3 +67,3 @@ |
67 | 67 |
for(EdgeIt e(g);e!=INVALID;++e) |
68 |
tlen+=sqrt((coords[g.v(e)]-coords[g.u(e)]).normSquare()); |
|
68 |
tlen+=std::sqrt((coords[g.v(e)]-coords[g.u(e)]).normSquare()); |
|
69 | 69 |
return tlen; |
... | ... |
@@ -190,3 +190,3 @@ |
190 | 190 |
|
191 |
return d / (2 * a) + sqrt((d * d + e * e) / (4 * a * a) + f / a); |
|
191 |
return d / (2 * a) + std::sqrt((d * d + e * e) / (4 * a * a) + f / a); |
|
192 | 192 |
} |
... | ... |
@@ -208,3 +208,3 @@ |
208 | 208 |
double d = (q.x - sx) * (p.x - sx) * (p - q).normSquare(); |
209 |
return (b - sqrt(d)) / a; |
|
209 |
return (b - std::sqrt(d)) / a; |
|
210 | 210 |
} |
... | ... |
@@ -815,3 +815,3 @@ |
815 | 815 |
for(EdgeIt e(g);e!=INVALID;++e) |
816 |
tlen+=sqrt((coords[g.v(e)]-coords[g.u(e)]).normSquare()); |
|
816 |
tlen+=std::sqrt((coords[g.v(e)]-coords[g.u(e)]).normSquare()); |
|
817 | 817 |
std::cout << "Total arc length : " << tlen << std::endl; |
0 comments (0 inline)