mirror of https://github.com/CGAL/cgal
45 lines
1.3 KiB
C++
45 lines
1.3 KiB
C++
// ======================================================================
|
|
//
|
|
// Copyright (c) 2002 The CGAL Consortium
|
|
//
|
|
// This software and related documentation is part of an INTERNAL release
|
|
// of the Computational Geometry Algorithms Library (CGAL). It is not
|
|
// intended for general use.
|
|
//
|
|
// ----------------------------------------------------------------------
|
|
//
|
|
// release :
|
|
// release_date :
|
|
//
|
|
// file : include/CGAL/Search_traits.h
|
|
// package : ASPAS
|
|
// revision : 3.0
|
|
// revision_date : 2003/07/10
|
|
// authors : Hans Tangelder (<hanst@cs.uu.nl>)
|
|
// maintainer : Hans Tangelder (<hanst@cs.uu.nl>)
|
|
// coordinator : Utrecht University
|
|
//
|
|
// ======================================================================
|
|
|
|
|
|
#ifndef CGAL_KD_TREE_TRAITS_POINT_H
|
|
#define CGAL_KD_TREE_TRAITS_POINT_H
|
|
|
|
|
|
namespace CGAL {
|
|
|
|
template <class FT_, class Point, class CartesianCoordinateIterator, class ConstructCartesianCoordinateIterator>
|
|
class Search_traits {
|
|
|
|
public:
|
|
typedef CartesianCoordinateIterator Cartesian_const_iterator_d;
|
|
typedef ConstructCartesianCoordinateIterator Construct_cartesian_const_iterator_d;
|
|
typedef Point Point_d;
|
|
typedef FT_ FT;
|
|
|
|
};
|
|
|
|
|
|
} // namespace CGAL
|
|
#endif // KD_TREE_TRAITS_POINT_H
|