mirror of https://github.com/CGAL/cgal
Spatial_searching
This commit is contained in:
parent
2e14ff9f04
commit
f76e744bff
|
|
@ -22,6 +22,9 @@
|
|||
|
||||
#ifndef CGAL_POINT_GENERATORS_D_H
|
||||
#define CGAL_POINT_GENERATORS_D_H 1
|
||||
|
||||
#include <CGAL/disable_warnings.h>
|
||||
|
||||
#include <CGAL/generators.h>
|
||||
#include <CGAL/number_type_basic.h>
|
||||
#include <cmath>
|
||||
|
|
@ -208,5 +211,7 @@ points_on_cube_grid_d( int dimension, double a,
|
|||
|
||||
} //namespace CGAL
|
||||
|
||||
#include <CGAL/enable_warnings.h>
|
||||
|
||||
#endif // CGAL_POINT_GENERATORS_D_H //
|
||||
// EOF //
|
||||
|
|
|
|||
|
|
@ -80,7 +80,7 @@ private:
|
|||
{
|
||||
#ifdef _MSC_VER
|
||||
DWORD pid = GetCurrentProcessId();
|
||||
size_type result;
|
||||
size_type result=0;
|
||||
HANDLE hProcess;
|
||||
PROCESS_MEMORY_COUNTERS pmc;
|
||||
hProcess = OpenProcess( PROCESS_QUERY_INFORMATION |
|
||||
|
|
|
|||
|
|
@ -26,6 +26,8 @@
|
|||
#ifndef CGAL_HANDLE_FOR_H
|
||||
#define CGAL_HANDLE_FOR_H
|
||||
|
||||
#include <CGAL/disable_warnings.h>
|
||||
|
||||
#include <CGAL/config.h>
|
||||
#include <CGAL/assertions.h> // for CGAL_assume
|
||||
|
||||
|
|
@ -313,4 +315,6 @@ get_pointee_or_identity(const T &t)
|
|||
# pragma warning(pop)
|
||||
#endif
|
||||
|
||||
#include <CGAL/enable_warnings.h>
|
||||
|
||||
#endif // CGAL_HANDLE_FOR_H
|
||||
|
|
|
|||
|
|
@ -24,6 +24,7 @@
|
|||
|
||||
#include <CGAL/license/Spatial_searching.h>
|
||||
|
||||
#include <CGAL/disable_warnings.h>
|
||||
|
||||
#include <cstring>
|
||||
#include <list>
|
||||
|
|
@ -550,4 +551,6 @@ namespace CGAL {
|
|||
|
||||
} // namespace CGAL
|
||||
|
||||
#include <CGAL/enable_warnings.h>
|
||||
|
||||
#endif // CGAL_INCREMENTAL_NEIGHBOR_SEARCH_H
|
||||
|
|
|
|||
|
|
@ -24,6 +24,7 @@
|
|||
|
||||
#include <CGAL/license/Spatial_searching.h>
|
||||
|
||||
#include <CGAL/disable_warnings.h>
|
||||
|
||||
#include <CGAL/internal/K_neighbor_search.h>
|
||||
#include <CGAL/internal/Get_dimension_tag.h>
|
||||
|
|
@ -142,5 +143,6 @@ private:
|
|||
|
||||
} // namespace CGAL
|
||||
|
||||
#include <CGAL/enable_warnings.h>
|
||||
|
||||
#endif // CGAL_K_NEIGHBOR_SEARCH_H
|
||||
|
|
|
|||
|
|
@ -417,7 +417,6 @@ private:
|
|||
//if (traits().construct_cartesian_const_iterator_d_object()(p)[newparent->cutting_dimension()] >= newparent->cutting_value())
|
||||
return remove_(p, parent, islower, newparent, false, newparent->upper(), equal_to_p);
|
||||
|
||||
CGAL_assertion(false); // Point was not found
|
||||
}
|
||||
|
||||
// Actual removal
|
||||
|
|
|
|||
|
|
@ -553,7 +553,7 @@ namespace CGAL {
|
|||
|
||||
inline
|
||||
void set_separator(Separator& sep){
|
||||
cut_dim = sep.cutting_dimension();
|
||||
cut_dim = static_cast<boost::uint8_t>(sep.cutting_dimension());
|
||||
cut_val = sep.cutting_value();
|
||||
}
|
||||
|
||||
|
|
|
|||
|
|
@ -24,6 +24,7 @@
|
|||
|
||||
#include <CGAL/license/Spatial_searching.h>
|
||||
|
||||
#include <CGAL/disable_warnings.h>
|
||||
|
||||
#include <cstring>
|
||||
#include <list>
|
||||
|
|
@ -621,4 +622,6 @@ namespace CGAL {
|
|||
|
||||
} // namespace CGAL
|
||||
|
||||
#include <CGAL/enable_warnings.h>
|
||||
|
||||
#endif // CGAL_ORTHOGONAL_INCREMENTAL_NEIGHBOR_SEARCH_H
|
||||
|
|
|
|||
|
|
@ -24,6 +24,7 @@
|
|||
|
||||
#include <CGAL/license/Spatial_searching.h>
|
||||
|
||||
#include <CGAL/disable_warnings.h>
|
||||
|
||||
#include <CGAL/internal/K_neighbor_search.h>
|
||||
|
||||
|
|
@ -194,4 +195,6 @@ private:
|
|||
|
||||
} // namespace CGAL
|
||||
|
||||
#include <CGAL/enable_warnings.h>
|
||||
|
||||
#endif // CGAL_ORTHOGONAL_K_NEIGHBOR_SEARCH_H
|
||||
|
|
|
|||
|
|
@ -24,6 +24,7 @@
|
|||
|
||||
#include <CGAL/license/Spatial_searching.h>
|
||||
|
||||
#include <CGAL/disable_warnings.h>
|
||||
|
||||
#include <CGAL/Kd_tree_rectangle.h>
|
||||
#include <CGAL/Euclidean_distance.h> //for default distance specialization
|
||||
|
|
@ -193,4 +194,6 @@ public:
|
|||
|
||||
}//namespace CGAL
|
||||
|
||||
#include <CGAL/enable_warnings.h>
|
||||
|
||||
#endif //CGAL_SEARCH_TRAITS_WITH_INFO
|
||||
|
|
|
|||
Loading…
Reference in New Issue