/usr/include/CGAL/Iterator_range.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 104 105 106 107 108 109 110 111 112 113 114 115 | // Copyright (c) 2014 GeometryFactory (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 Lesser 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) : Andreas Fabri
#ifndef CGAL_ITERATOR_RANGE_H
#define CGAL_ITERATOR_RANGE_H
#include <CGAL/tuple.h>
#include <utility>
#include <boost/foreach.hpp>
namespace CGAL {
/*!
\ingroup PkgStlExtension
/// `CGAL::Iterator_range` is a...
*/
template <typename I>
class Iterator_range
: public std::pair<I,I>{
typedef std::pair<I,I> Base;
public:
typedef I iterator;
typedef I const_iterator;
Iterator_range(I b, I e)
: Base(b,e)
{}
// Iterator_range(const Iterator_range& ip)
// : Base(ip)
// {}
Iterator_range(const std::pair<I,I>& ip)
: Base(ip)
{}
I begin() const
{
return this->first;
}
I end() const
{
return this->second;
}
/// returns `std::distance(begin(), end())`
std::size_t
size() const
{
return static_cast<std::size_t>(std::distance(begin(), end()));
}
/// returns `std::distance(begin(), end())==0`
bool empty() const
{
return begin()==end();
}
};
template <typename T>
Iterator_range<T>
make_range(const T& b, const T&e)
{
return Iterator_range<T>(b,e);
}
template <typename T>
Iterator_range<T>
make_range(const std::pair<T,T>& p)
{
return Iterator_range<T>(p.first,p.second);
}
} // namespace CGAL
// At global scope...
template<typename T>
inline boost::mpl::true_ *
boost_foreach_is_lightweight_proxy( CGAL::Iterator_range<T> *&, boost::foreach::tag )
{
return 0;
}
namespace boost { namespace foreach
{
template<typename T>
struct is_lightweight_proxy< CGAL::Iterator_range<T> >
: mpl::true_
{
};
}}
#endif // CGAL_ITERATOR_RANGE_H
|