/usr/include/CGAL/iterator_range.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 52 53 54 55 56 57 58 59 60 | // 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>
namespace CGAL {
template <typename I>
class iterator_range
: public std::pair<I,I>{
typedef std::pair<I,I> Base;
public:
typedef I iterator;
typedef const I const_iterator;
iterator_range(I b, I e)
: Base(b,e)
{}
iterator_range(const std::pair<I,I>& ip)
: Base(ip)
{}
const I& begin() const
{
return this->first;
}
const I& end() const
{
return this->second;
}
};
} // namespace CGAL
#endif // CGAL_ITERATOR_RANGE_H
|