326 lines
9.6 KiB
C++
326 lines
9.6 KiB
C++
// Boost.Geometry (aka GGL, Generic Geometry Library)
|
|
|
|
// Copyright (c) 2007-2012 Barend Gehrels, Amsterdam, the Netherlands.
|
|
|
|
// This file was modified by Oracle on 2013, 2014.
|
|
// Modifications copyright (c) 2013-2014 Oracle and/or its affiliates.
|
|
|
|
// Use, modification and distribution is subject to the Boost Software License,
|
|
// Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
|
|
// http://www.boost.org/LICENSE_1_0.txt)
|
|
|
|
// Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle
|
|
|
|
#ifndef BOOST_GEOMETRY_UTIL_RANGE_HPP
|
|
#define BOOST_GEOMETRY_UTIL_RANGE_HPP
|
|
|
|
#include <algorithm>
|
|
|
|
#include <boost/assert.hpp>
|
|
#include <boost/concept_check.hpp>
|
|
#include <boost/config.hpp>
|
|
#include <boost/range/concepts.hpp>
|
|
#include <boost/range/begin.hpp>
|
|
#include <boost/range/end.hpp>
|
|
#include <boost/range/empty.hpp>
|
|
#include <boost/range/size.hpp>
|
|
#include <boost/type_traits/is_convertible.hpp>
|
|
|
|
#include <boost/geometry/core/mutable_range.hpp>
|
|
|
|
namespace boost { namespace geometry { namespace range {
|
|
|
|
// NOTE: For SinglePassRanges at could iterate over all elements until the i-th element is met.
|
|
|
|
/*!
|
|
\brief Short utility to conveniently return an element of a RandomAccessRange.
|
|
\ingroup utility
|
|
*/
|
|
template <typename RandomAccessRange>
|
|
inline typename boost::range_value<RandomAccessRange const>::type const&
|
|
at(RandomAccessRange const& rng,
|
|
typename boost::range_size<RandomAccessRange const>::type i)
|
|
{
|
|
BOOST_RANGE_CONCEPT_ASSERT(( boost::RandomAccessRangeConcept<RandomAccessRange const> ));
|
|
BOOST_ASSERT(i < boost::size(rng));
|
|
return *(boost::begin(rng) + i);
|
|
}
|
|
|
|
/*!
|
|
\brief Short utility to conveniently return an element of a RandomAccessRange.
|
|
\ingroup utility
|
|
*/
|
|
template <typename RandomAccessRange>
|
|
inline typename boost::range_value<RandomAccessRange>::type &
|
|
at(RandomAccessRange & rng,
|
|
typename boost::range_size<RandomAccessRange>::type i)
|
|
{
|
|
BOOST_RANGE_CONCEPT_ASSERT(( boost::RandomAccessRangeConcept<RandomAccessRange> ));
|
|
BOOST_ASSERT(i < boost::size(rng));
|
|
return *(boost::begin(rng) + i);
|
|
}
|
|
|
|
/*!
|
|
\brief Short utility to conveniently return the front element of a Range.
|
|
\ingroup utility
|
|
*/
|
|
template <typename Range>
|
|
inline typename boost::range_value<Range>::type const&
|
|
front(Range const& rng)
|
|
{
|
|
BOOST_ASSERT(!boost::empty(rng));
|
|
return *boost::begin(rng);
|
|
}
|
|
|
|
/*!
|
|
\brief Short utility to conveniently return the front element of a Range.
|
|
\ingroup utility
|
|
*/
|
|
template <typename Range>
|
|
inline typename boost::range_value<Range>::type &
|
|
front(Range & rng)
|
|
{
|
|
BOOST_ASSERT(!boost::empty(rng));
|
|
return *boost::begin(rng);
|
|
}
|
|
|
|
// NOTE: For SinglePassRanges back() could iterate over all elements until the last element is met.
|
|
|
|
/*!
|
|
\brief Short utility to conveniently return the back element of a BidirectionalRange.
|
|
\ingroup utility
|
|
*/
|
|
template <typename BidirectionalRange>
|
|
inline typename boost::range_value<BidirectionalRange>::type const&
|
|
back(BidirectionalRange const& rng)
|
|
{
|
|
BOOST_RANGE_CONCEPT_ASSERT(( boost::BidirectionalRangeConcept<BidirectionalRange const> ));
|
|
BOOST_ASSERT(!boost::empty(rng));
|
|
return *(--boost::end(rng));
|
|
}
|
|
|
|
/*!
|
|
\brief Short utility to conveniently return the back element of a BidirectionalRange.
|
|
\ingroup utility
|
|
*/
|
|
template <typename BidirectionalRange>
|
|
inline typename boost::range_value<BidirectionalRange>::type &
|
|
back(BidirectionalRange & rng)
|
|
{
|
|
BOOST_RANGE_CONCEPT_ASSERT(( boost::BidirectionalRangeConcept<BidirectionalRange> ));
|
|
BOOST_ASSERT(!boost::empty(rng));
|
|
return *(--boost::end(rng));
|
|
}
|
|
|
|
|
|
/*!
|
|
\brief Short utility to conveniently clear a mutable range.
|
|
It uses traits::clear<>.
|
|
\ingroup utility
|
|
*/
|
|
template <typename Range>
|
|
inline void clear(Range & rng)
|
|
{
|
|
// NOTE: this trait is probably not needed since it could be implemented using resize()
|
|
geometry::traits::clear<Range>::apply(rng);
|
|
}
|
|
|
|
/*!
|
|
\brief Short utility to conveniently insert a new element at the end of a mutable range.
|
|
It uses boost::geometry::traits::push_back<>.
|
|
\ingroup utility
|
|
*/
|
|
template <typename Range>
|
|
inline void push_back(Range & rng,
|
|
typename boost::range_value<Range>::type const& value)
|
|
{
|
|
geometry::traits::push_back<Range>::apply(rng, value);
|
|
}
|
|
|
|
/*!
|
|
\brief Short utility to conveniently resize a mutable range.
|
|
It uses boost::geometry::traits::resize<>.
|
|
\ingroup utility
|
|
*/
|
|
template <typename Range>
|
|
inline void resize(Range & rng,
|
|
typename boost::range_size<Range>::type new_size)
|
|
{
|
|
geometry::traits::resize<Range>::apply(rng, new_size);
|
|
}
|
|
|
|
|
|
/*!
|
|
\brief Short utility to conveniently remove an element from the back of a mutable range.
|
|
It uses resize().
|
|
\ingroup utility
|
|
*/
|
|
template <typename Range>
|
|
inline void pop_back(Range & rng)
|
|
{
|
|
BOOST_ASSERT(!boost::empty(rng));
|
|
range::resize(rng, boost::size(rng) - 1);
|
|
}
|
|
|
|
namespace detail {
|
|
|
|
#ifndef BOOST_NO_CXX11_RVALUE_REFERENCES
|
|
|
|
template <typename It,
|
|
typename OutIt,
|
|
bool UseMove = boost::is_convertible
|
|
<
|
|
typename std::iterator_traits<It>::value_type &&,
|
|
typename std::iterator_traits<OutIt>::value_type
|
|
>::value>
|
|
struct copy_or_move_impl
|
|
{
|
|
static inline OutIt apply(It first, It last, OutIt out)
|
|
{
|
|
return std::move(first, last, out);
|
|
}
|
|
};
|
|
|
|
template <typename It, typename OutIt>
|
|
struct copy_or_move_impl<It, OutIt, false>
|
|
{
|
|
static inline OutIt apply(It first, It last, OutIt out)
|
|
{
|
|
return std::copy(first, last, out);
|
|
}
|
|
};
|
|
|
|
template <typename It, typename OutIt>
|
|
inline OutIt copy_or_move(It first, It last, OutIt out)
|
|
{
|
|
return copy_or_move_impl<It, OutIt>::apply(first, last, out);
|
|
}
|
|
|
|
#else
|
|
|
|
template <typename It, typename OutIt>
|
|
inline OutIt copy_or_move(It first, It last, OutIt out)
|
|
{
|
|
return std::copy(first, last, out);
|
|
}
|
|
|
|
#endif
|
|
|
|
} // namespace detail
|
|
|
|
/*!
|
|
\brief Short utility to conveniently remove an element from a mutable range.
|
|
It uses std::copy() and resize(). Version taking mutable iterators.
|
|
\ingroup utility
|
|
*/
|
|
template <typename Range>
|
|
inline typename boost::range_iterator<Range>::type
|
|
erase(Range & rng,
|
|
typename boost::range_iterator<Range>::type it)
|
|
{
|
|
BOOST_ASSERT(!boost::empty(rng));
|
|
BOOST_ASSERT(it != boost::end(rng));
|
|
|
|
typename boost::range_difference<Range>::type const
|
|
d = std::distance(boost::begin(rng), it);
|
|
|
|
typename boost::range_iterator<Range>::type
|
|
next = it;
|
|
++next;
|
|
|
|
detail::copy_or_move(next, boost::end(rng), it);
|
|
range::resize(rng, boost::size(rng) - 1);
|
|
|
|
// NOTE: In general this should be sufficient:
|
|
// return it;
|
|
// But in MSVC using the returned iterator causes
|
|
// assertion failures when iterator debugging is enabled
|
|
// Furthermore the code below should work in the case if resize()
|
|
// invalidates iterators when the container is resized down.
|
|
return boost::begin(rng) + d;
|
|
}
|
|
|
|
/*!
|
|
\brief Short utility to conveniently remove an element from a mutable range.
|
|
It uses std::copy() and resize(). Version taking non-mutable iterators.
|
|
\ingroup utility
|
|
*/
|
|
template <typename Range>
|
|
inline typename boost::range_iterator<Range>::type
|
|
erase(Range & rng,
|
|
typename boost::range_iterator<Range const>::type cit)
|
|
{
|
|
BOOST_RANGE_CONCEPT_ASSERT(( boost::RandomAccessRangeConcept<Range> ));
|
|
|
|
typename boost::range_iterator<Range>::type
|
|
it = boost::begin(rng)
|
|
+ std::distance(boost::const_begin(rng), cit);
|
|
|
|
return erase(rng, it);
|
|
}
|
|
|
|
/*!
|
|
\brief Short utility to conveniently remove a range of elements from a mutable range.
|
|
It uses std::copy() and resize(). Version taking mutable iterators.
|
|
\ingroup utility
|
|
*/
|
|
template <typename Range>
|
|
inline typename boost::range_iterator<Range>::type
|
|
erase(Range & rng,
|
|
typename boost::range_iterator<Range>::type first,
|
|
typename boost::range_iterator<Range>::type last)
|
|
{
|
|
typename boost::range_difference<Range>::type const
|
|
diff = std::distance(first, last);
|
|
BOOST_ASSERT(diff >= 0);
|
|
|
|
std::size_t const count = static_cast<std::size_t>(diff);
|
|
BOOST_ASSERT(count <= boost::size(rng));
|
|
|
|
if ( count > 0 )
|
|
{
|
|
typename boost::range_difference<Range>::type const
|
|
d = std::distance(boost::begin(rng), first);
|
|
|
|
detail::copy_or_move(last, boost::end(rng), first);
|
|
range::resize(rng, boost::size(rng) - count);
|
|
|
|
// NOTE: In general this should be sufficient:
|
|
// return first;
|
|
// But in MSVC using the returned iterator causes
|
|
// assertion failures when iterator debugging is enabled
|
|
// Furthermore the code below should work in the case if resize()
|
|
// invalidates iterators when the container is resized down.
|
|
return boost::begin(rng) + d;
|
|
}
|
|
|
|
return first;
|
|
}
|
|
|
|
/*!
|
|
\brief Short utility to conveniently remove a range of elements from a mutable range.
|
|
It uses std::copy() and resize(). Version taking non-mutable iterators.
|
|
\ingroup utility
|
|
*/
|
|
template <typename Range>
|
|
inline typename boost::range_iterator<Range>::type
|
|
erase(Range & rng,
|
|
typename boost::range_iterator<Range const>::type cfirst,
|
|
typename boost::range_iterator<Range const>::type clast)
|
|
{
|
|
BOOST_RANGE_CONCEPT_ASSERT(( boost::RandomAccessRangeConcept<Range> ));
|
|
|
|
typename boost::range_iterator<Range>::type
|
|
first = boost::begin(rng)
|
|
+ std::distance(boost::const_begin(rng), cfirst);
|
|
typename boost::range_iterator<Range>::type
|
|
last = boost::begin(rng)
|
|
+ std::distance(boost::const_begin(rng), clast);
|
|
|
|
return erase(rng, first, last);
|
|
}
|
|
|
|
}}} // namespace boost::geometry::range
|
|
|
|
#endif // BOOST_GEOMETRY_UTIL_RANGE_HPP
|