/usr/include/CGAL/partition_2.h is in libcgal-dev 4.2-5ubuntu1.
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 104 105 106 107 108 109 | // Copyright (c) 2000 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) : Susan Hert <hert@mpi-sb.mpg.de>
#ifndef CGAL_PARTITION_H
#define CGAL_PARTITION_H
#include <CGAL/Partition_2/partition_greene_approx_convex_2.h>
#include <CGAL/Partition_2/partition_optimal_convex_2.h>
#include <CGAL/Partition_2/partition_approx_convex_2.h>
#include <CGAL/Partition_2/partition_y_monotone_2.h>
namespace CGAL {
template <class InputIterator, class OutputIterator, class Traits>
inline
OutputIterator greene_approx_convex_partition_2(InputIterator first,
InputIterator beyond,
OutputIterator result,
const Traits& traits)
{
return partition_greene_approx_convex_2(first, beyond, result, traits);
}
template <class InputIterator, class OutputIterator>
inline
OutputIterator greene_approx_convex_partition_2(InputIterator first,
InputIterator beyond,
OutputIterator result)
{
return partition_greene_approx_convex_2(first, beyond, result);
}
template <class InputIterator, class OutputIterator, class Traits>
inline
OutputIterator optimal_convex_partition_2(InputIterator first,
InputIterator beyond,
OutputIterator result,
const Traits& traits)
{
return partition_optimal_convex_2(first, beyond, result, traits);
}
template <class InputIterator, class OutputIterator>
inline
OutputIterator optimal_convex_partition_2(InputIterator first,
InputIterator beyond,
OutputIterator result)
{
return partition_optimal_convex_2(first, beyond, result);
}
template <class InputIterator, class OutputIterator, class Traits>
inline
OutputIterator approx_convex_partition_2(InputIterator first,
InputIterator beyond,
OutputIterator result,
const Traits& traits)
{
return partition_approx_convex_2(first, beyond, result, traits);
}
template <class InputIterator, class OutputIterator>
inline
OutputIterator approx_convex_partition_2(InputIterator first,
InputIterator beyond,
OutputIterator result)
{
return partition_approx_convex_2(first, beyond, result);
}
template <class InputIterator, class OutputIterator, class Traits>
inline
OutputIterator y_monotone_partition_2(InputIterator first,
InputIterator beyond,
OutputIterator result,
const Traits& traits)
{
return partition_y_monotone_2(first, beyond, result, traits);
}
template <class InputIterator, class OutputIterator>
inline
OutputIterator y_monotone_partition_2(InputIterator first,
InputIterator beyond,
OutputIterator result)
{
return partition_y_monotone_2(first, beyond, result);
}
}
#endif // CGAL_PARTITION_H
|