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

int -> size_t

This commit is contained in:
Andreas Fabri 2010-06-22 10:34:02 +00:00
parent a8ffcea556
commit 8f720d178f
3 changed files with 6 additions and 6 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
Spatial_searching/include/CGAL/Fuzzy_iso_box.h
View File

@ -56,7 +56,7 @@ namespace CGAL {
Construct_cartesian_const_iterator_d construct_it; Construct_cartesian_const_iterator_d construct_it;
Cartesian_const_iterator_d begin = construct_it(p), Cartesian_const_iterator_d begin = construct_it(p),
end = construct_it(p,1); end = construct_it(p,1);
dim = end - begin; dim = static_cast<unsigned int>(end - begin);
Iso_box_d box = typename SearchTraits::Construct_iso_box_d()(p,q); Iso_box_d box = typename SearchTraits::Construct_iso_box_d()(p,q);
Construct_min_vertex_d construct_min_vertex_d; Construct_min_vertex_d construct_min_vertex_d;

4
Spatial_searching/include/CGAL/Kd_tree.h
View File

@ -85,7 +85,7 @@ private:
Node_handle Node_handle
create_leaf_node(Point_container& c) const create_leaf_node(Point_container& c) const
{ {
Node_handle nh = nodes.emplace(c.size(), Node::LEAF); Node_handle nh = nodes.emplace(static_cast<unsigned int>(c.size()), Node::LEAF);
nh->data = c.begin(); nh->data = c.begin();
return nh; return nh;
@ -191,7 +191,7 @@ public:
{ {
const Point_d& p = *pts.begin(); const Point_d& p = *pts.begin();
typename SearchTraits::Construct_cartesian_const_iterator_d ccci; typename SearchTraits::Construct_cartesian_const_iterator_d ccci;
int dim = std::distance(ccci(p), ccci(p,0)); int dim = static_cast<int>(std::distance(ccci(p), ccci(p,0)));
data.reserve(pts.size()); data.reserve(pts.size());
for(unsigned int i = 0; i < pts.size(); i++){ for(unsigned int i = 0; i < pts.size(); i++){

6
Spatial_searching/include/CGAL/Kd_tree_node.h
View File

@ -73,7 +73,7 @@ namespace CGAL {
: the_node_type(t) : the_node_type(t)
{} {}
Kd_tree_node(int n_, Node_type t ) Kd_tree_node(unsigned int n_, Node_type t )
: the_node_type(t), n(n_) : the_node_type(t), n(n_)
{} {}
@ -163,7 +163,7 @@ namespace CGAL {
} }
unsigned int std::size_t
num_items() num_items()
{ {
if (is_leaf()) return size(); if (is_leaf()) return size();
@ -171,7 +171,7 @@ namespace CGAL {
return lower()->num_items() + upper()->num_items(); return lower()->num_items() + upper()->num_items();
} }
unsigned int std::size_t
num_nodes() num_nodes()
{ {
if (is_leaf()) return 1; if (is_leaf()) return 1;