/usr/include/CGAL/Mesh_3/utilities.h is in libcgal-dev 4.11-2build1.
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 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 | // Copyright (c) 2009 INRIA Sophia-Antipolis (France).
// 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) : Stephane Tayeb
//
//******************************************************************************
// File Description :
//******************************************************************************
#ifndef CGAL_MESH_3_UTILITIES_H
#define CGAL_MESH_3_UTILITIES_H
#include <CGAL/license/Mesh_3.h>
namespace CGAL {
namespace Mesh_3 {
namespace internal {
/**
* @class First_of
* Function object which returns the first element of a pair
*/
template <typename Pair>
struct First_of :
public std::unary_function<Pair, const typename Pair::first_type&>
{
typedef std::unary_function<Pair, const typename Pair::first_type&> Base;
typedef typename Base::result_type result_type;
typedef typename Base::argument_type argument_type;
result_type operator()(const argument_type& p) const { return p.first; }
}; // end class First_of
/**
* @class Ordered_pair
* Stores two elements in an ordered manner, i.e. first() < second()
*/
template <typename T>
class Ordered_pair
{
public:
Ordered_pair(const T& t1, const T& t2)
: data_(t1,t2)
{
if ( ! (t1 < t2) )
{
data_.second = t1;
data_.first = t2;
}
}
const T& first() const { return data_.first; }
const T& second() const { return data_.second; }
bool operator<(const Ordered_pair& rhs) const { return data_ < rhs.data_; }
private:
std::pair<T,T> data_;
};
/**
* @class Iterator_not_in_complex
* @brief A class to filter elements which do not belong to the complex
*/
template < typename C3T3 >
class Iterator_not_in_complex
{
const C3T3& c3t3_;
public:
Iterator_not_in_complex(const C3T3& c3t3) : c3t3_(c3t3) { }
template <typename Iterator>
bool operator()(Iterator it) const { return ! c3t3_.is_in_complex(*it); }
}; // end class Iterator_not_in_complex
} // end namespace internal
} // end namespace Mesh_3
} //namespace CGAL
#endif // CGAL_MESH_3_UTILITIES_H
|