// 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 #include namespace CGAL { template class iterator_range : public std::pair{ typedef std::pair Base; public: typedef I iterator; typedef const I const_iterator; iterator_range(I b, I e) : Base(b,e) {} iterator_range(const std::pair& ip) : Base(ip) {} operator Base() const { return std::make_pair(begin(),end()); } const I& begin() const { return this->first; } const I& end() const { return this->second; } }; template iterator_range make_range(const T& b, const T&e) { return iterator_range(b,e); } template inline T range_begin( iterator_range & x ) { return x.first; } template inline T range_end( iterator_range & x ) { return x.second; } template inline T range_begin(const iterator_range& x ) { return x.first; } template inline T range_end(const iterator_range& x ) { return x.second; } } // namespace CGAL namespace boost { template struct range_iterator; template struct range_mutable_iterator; template struct range_const_iterator; template struct range_iterator > { typedef T type; }; template struct range_mutable_iterator< CGAL::iterator_range > { typedef T type; }; template struct range_const_iterator< CGAL::iterator_range > { typedef T type; }; } #endif // CGAL_ITERATOR_RANGE_H