mirror of https://github.com/CGAL/cgal
227 lines
7.7 KiB
C++
227 lines
7.7 KiB
C++
// Copyright (c) 2008-2009 GeometryFactory and INRIA
|
|
// 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) : Andreas Fabri and Laurent Saboret
|
|
|
|
#ifndef CGAL_POINT_SET_PROPERTY_MAP_H
|
|
#define CGAL_POINT_SET_PROPERTY_MAP_H
|
|
|
|
#include <CGAL/value_type_traits.h>
|
|
|
|
#include <boost/version.hpp>
|
|
#if BOOST_VERSION >= 104000
|
|
#include <boost/property_map/property_map.hpp>
|
|
#else
|
|
#include <boost/property_map.hpp>
|
|
#endif
|
|
#include <boost/tuple/tuple.hpp>
|
|
|
|
#include <utility> // defines std::pair
|
|
|
|
namespace CGAL {
|
|
|
|
|
|
/// Property map that converts a 'T*' pointer (or in general
|
|
/// an iterator over 'T' elements) to the 'T' object.
|
|
///
|
|
/// @heading Is Model for the Concepts:
|
|
/// Model of boost::LvaluePropertyMap concept.
|
|
|
|
template <typename T>
|
|
struct Dereference_property_map
|
|
: public boost::put_get_helper<T&, Dereference_property_map<T> >
|
|
{
|
|
typedef T* key_type; ///< typedef to 'T*'
|
|
typedef T value_type; ///< typedef to 'T'
|
|
typedef value_type& reference; ///< typedef to 'T&'
|
|
typedef boost::lvalue_property_map_tag category; ///< boost::lvalue_property_map_tag
|
|
|
|
/// Access a property map element.
|
|
///
|
|
/// @commentheading Template Parameters:
|
|
/// @param Iter Type convertible to key_type.
|
|
template <class Iter>
|
|
reference operator[](Iter it) const { return reference(*it); }
|
|
};
|
|
|
|
/// Free function to create a Dereference_property_map property map.
|
|
///
|
|
/// @relates Dereference_property_map
|
|
|
|
template <class Iter> // Type convertible to key_type
|
|
Dereference_property_map<typename CGAL::value_type_traits<Iter>::type>
|
|
make_dereference_property_map(Iter)
|
|
{
|
|
// value_type_traits is a workaround as back_insert_iterator's value_type is void
|
|
return Dereference_property_map<typename CGAL::value_type_traits<Iter>::type>();
|
|
}
|
|
|
|
|
|
//=========================================================================
|
|
|
|
// Property maps Pair* -> Pair::first_type
|
|
// and Pair* -> Pair::second_type.
|
|
|
|
/// Property map that accesses the first item of a std::pair.
|
|
///
|
|
/// @heading Is Model for the Concepts:
|
|
/// Model of boost::LvaluePropertyMap concept.
|
|
///
|
|
/// @heading Parameters:
|
|
/// @param Pair Instance of std::pair.
|
|
|
|
template <typename Pair>
|
|
struct First_of_pair_property_map
|
|
: public boost::put_get_helper<typename Pair::first_type&,
|
|
First_of_pair_property_map<Pair> >
|
|
{
|
|
typedef Pair* key_type; ///< typedef to 'Pair*'
|
|
typedef typename Pair::first_type value_type; ///< typedef to Pair::first_type
|
|
typedef value_type& reference; ///< typedef to value_type&
|
|
typedef boost::lvalue_property_map_tag category; ///< boost::lvalue_property_map_tag
|
|
|
|
/// Access a property map element.
|
|
///
|
|
/// @commentheading Template Parameters:
|
|
/// @param Iter Type convertible to key_type.
|
|
template <class Iter>
|
|
reference operator[](Iter pair) const { return reference(pair->first); }
|
|
};
|
|
|
|
/// Free function to create a First_of_pair_property_map property map.
|
|
///
|
|
/// @relates First_of_pair_property_map
|
|
|
|
template <class Iter> // Type convertible to key_type
|
|
First_of_pair_property_map<typename CGAL::value_type_traits<Iter>::type>
|
|
make_first_of_pair_property_map(Iter)
|
|
{
|
|
// value_type_traits is a workaround as back_insert_iterator's value_type is void
|
|
return First_of_pair_property_map<typename CGAL::value_type_traits<Iter>::type>();
|
|
}
|
|
|
|
/// Property map that accesses the second item of a std::pair.
|
|
///
|
|
/// @heading Is Model for the Concepts:
|
|
/// Model of boost::LvaluePropertyMap concept.
|
|
///
|
|
/// @heading Parameters:
|
|
/// @param Pair Instance of std::pair.
|
|
|
|
template <typename Pair>
|
|
struct Second_of_pair_property_map
|
|
: public boost::put_get_helper<typename Pair::second_type&,
|
|
Second_of_pair_property_map<Pair> >
|
|
{
|
|
typedef Pair* key_type; ///< typedef to 'Pair*'
|
|
typedef typename Pair::second_type value_type; ///< typedef to Pair::second_type
|
|
typedef value_type& reference; ///< typedef to value_type&
|
|
typedef boost::lvalue_property_map_tag category; ///< boost::lvalue_property_map_tag
|
|
|
|
/// Access a property map element.
|
|
///
|
|
/// @commentheading Template Parameters:
|
|
/// @param Iter Type convertible to key_type.
|
|
template <class Iter>
|
|
reference operator[](Iter pair) const { return reference(pair->second); }
|
|
};
|
|
|
|
/// Free function to create a Second_of_pair_property_map property map.
|
|
///
|
|
/// @relates Second_of_pair_property_map
|
|
|
|
template <class Iter> // Type convertible to key_type
|
|
Second_of_pair_property_map<typename CGAL::value_type_traits<Iter>::type>
|
|
make_second_of_pair_property_map(Iter)
|
|
{
|
|
// value_type_traits is a workaround as back_insert_iterator's value_type is void
|
|
return Second_of_pair_property_map<typename CGAL::value_type_traits<Iter>::type>();
|
|
}
|
|
|
|
|
|
//=========================================================================
|
|
|
|
|
|
/// Property map that accesses the Nth item of a boost::tuple.
|
|
///
|
|
/// @heading Is Model for the Concepts:
|
|
/// Model of boost::LvaluePropertyMap concept.
|
|
///
|
|
/// @heading Parameters:
|
|
/// @param N Index of the item to access.
|
|
/// @param Tuple Instance of boost::tuple.
|
|
|
|
template <int N, typename Tuple>
|
|
struct Nth_of_tuple_property_map
|
|
: public boost::put_get_helper<typename boost::tuples::element<N,Tuple>::type&,
|
|
Nth_of_tuple_property_map<N,Tuple> >
|
|
{
|
|
typedef Tuple* key_type; ///< typedef to 'Tuple*'
|
|
typedef typename boost::tuples::element<N,Tuple>::type value_type; ///< typedef to boost::tuples::element<N,Tuple>::type
|
|
typedef value_type& reference; ///< typedef to value_type&
|
|
typedef boost::lvalue_property_map_tag category; ///< boost::lvalue_property_map_tag
|
|
|
|
/// Access a property map element.
|
|
///
|
|
/// @commentheading Template Parameters:
|
|
/// @param Iter Type convertible to key_type.
|
|
template <class Iter>
|
|
reference operator[](Iter tuple) const { return (reference) tuple->template get<N>(); }
|
|
};
|
|
|
|
/// Free function to create a Nth_of_tuple_property_map property map.
|
|
///
|
|
/// @relates Nth_of_tuple_property_map
|
|
|
|
template <int N, class Iter> // Type convertible to key_type
|
|
Nth_of_tuple_property_map<N, typename CGAL::value_type_traits<Iter>::type>
|
|
make_nth_of_tuple_property_map(Iter)
|
|
{
|
|
// value_type_traits is a workaround as back_insert_iterator's value_type is void
|
|
return Nth_of_tuple_property_map<N, typename CGAL::value_type_traits<Iter>::type>();
|
|
}
|
|
|
|
//=========================================================================
|
|
|
|
/// Property map that accesses a value from an iterator
|
|
///
|
|
/// @heading Is Model for the Concepts:
|
|
/// Model of boost::ReadablePropertyMap concept.
|
|
///
|
|
/// @heading Parameters:
|
|
/// @param InputIterator an input iterator
|
|
template<class InputIterator>
|
|
struct Input_iterator_property_map{
|
|
typedef InputIterator key_type;
|
|
typedef typename std::iterator_traits<InputIterator>::value_type value_type;
|
|
typedef typename std::iterator_traits<InputIterator>::reference reference;
|
|
typedef boost::readable_property_map_tag category;
|
|
};
|
|
|
|
/// Free function to use a get the value from an iterator using Input_iterator_property_map.
|
|
///
|
|
/// @relates Input_iterator_property_map
|
|
template <class InputIterator>
|
|
inline
|
|
typename std::iterator_traits<InputIterator>::reference
|
|
get(Input_iterator_property_map<InputIterator>,InputIterator it){ return *it; }
|
|
|
|
|
|
} // namespace CGAL
|
|
|
|
#endif // CGAL_POINT_SET_PROPERTY_MAP_H
|