/usr/include/CGAL/compare_vertices.h is in libcgal-dev 4.5-2.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 | // Copyright (c) 1999
// Max-Planck-Institute Saarbruecken (Germany). All rights reserved.
//
// This file is part of CGAL (www.cgal.org).
// You can redistribute it and/or modify it under the terms of the GNU
// General Public License as published by the Free Software Foundation,
// either version 3 of the License, or (at your option) any later version.
//
// Licensees holding a valid commercial license may use this file in
// accordance with the commercial license agreement provided with the software.
//
// This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
// WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
//
// $URL$
// $Id$
//
//
// Author(s) : Matthias Baesken
#ifndef CGAL_COMPARE_VERTICES_H
#define CGAL_COMPARE_VERTICES_H
namespace CGAL {
namespace internal {
// compare function objects for the priority queues used in nearest neighbor search
template<class VP, class NT,class MAP_TYPE>
class compare_vertices {
public:
//std::map<VP,NT,std::less<VP> > *pmap;
MAP_TYPE* pmap;
compare_vertices(MAP_TYPE *p){ pmap=p; }
bool operator()(VP e1, VP e2)
// get the priorities from the map and return result of comparison ...
{ NT& v1 = (*pmap)[e1];
NT& v2 = (*pmap)[e2];
return (v1 > v2);
}
};
} // namespace internal
} //namespace CGAL
#endif // CGAL_COMPARE_VERTICES_H
|