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

*** empty log message ***

This commit is contained in:
Hans Tangelder 2002-08-16 08:37:39 +00:00
parent 81a72247da
commit fbb9f44dce
2 changed files with 9 additions and 8 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
Packages/Spatial_searching/include/CGAL/Nearest_neighbour_Linf.h
View File

@ -65,7 +65,7 @@ class Priority_higher
search_nearest = s.Search_nearest();
}
//highest priority is smallest distance
bool operator() (Node_with_distance* n1, Node_with_distance* n2) const
bool operator() (Node_with_distance* n1, Node_with_distance* n2) const
{
if (search_nearest) { return (n1->second > n2->second);}
else {return (n2->second > n1->second);}
@ -85,7 +85,7 @@ class Distance_smaller
}
//highest priority is smallest distance
bool operator() (Item_with_distance* p1, Item_with_distance* p2) const
bool operator() (Item_with_distance* p1, Item_with_distance* p2) const
{
if (search_nearest) {return (p1->second > p2->second);}
else {return (p2->second > p1->second);}

13
Packages/Spatial_searching/include/CGAL/Points_container.h
View File

@ -59,12 +59,12 @@ namespace CGAL {
typedef Points_container<Item> Self;
private:
Points_list *p_list; // array of sorted lists of pointers to points
int built_coord; // a coordinate for which the pointer list is built
Points_list *p_list;// array of sorted lists of pointers to points
int built_coord; // a coordinate for which the pointer list is built
// Points points;// points container
Box<NT> bbox; // bounding box, i.e. cell of node
Box<NT> tbox; // tight bounding box, i.e. minimal enclosing bounding
// box of points
Box<NT> bbox; // bounding box, i.e. cell of node
Box<NT> tbox; // tight bounding box, i.e. minimal enclosing bounding
// box of points
struct build_max_span_list : public std::unary_function<Item, void> {
Points_list *x;
@ -107,7 +107,8 @@ namespace CGAL {
inline NT max_tight_span_upper() const {
return tbox.upper(max_tight_span_coord());}
inline NT max_spread() const { return max_span_upper() - max_span_lower(); }
inline NT max_spread() const
{ return max_span_upper() - max_span_lower(); }
inline NT max_tight_spread() const {
return max_tight_span_upper() - max_tight_span_lower(); }