Files
externals/linux/include/ActivBoost/range/algorithm/equal_range.hpp
T
2023-12-15 13:15:08 -05:00

81 lines
2.8 KiB
C++

// Copyright Neil Groves 2009. 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)
//
//
// For more information, see http://www.boost.org/libs/range/
//
#ifndef ACTIV_BOOST_RANGE_ALGORITHM_EQUAL_RANGE_HPP_INCLUDED
#define ACTIV_BOOST_RANGE_ALGORITHM_EQUAL_RANGE_HPP_INCLUDED
#include <ActivBoost/concept_check.hpp>
#include <ActivBoost/range/begin.hpp>
#include <ActivBoost/range/end.hpp>
#include <ActivBoost/range/concepts.hpp>
#include <algorithm>
namespace Boost
{
namespace range
{
/// \brief template function equal_range
///
/// range-based version of the equal_range std algorithm
///
/// \pre ForwardRange is a model of the ForwardRangeConcept
/// \pre SortPredicate is a model of the BinaryPredicateConcept
template<class ForwardRange, class Value>
inline std::pair<
ACTIV_BOOST_DEDUCED_TYPENAME Boost::range_iterator<ForwardRange>::type,
ACTIV_BOOST_DEDUCED_TYPENAME Boost::range_iterator<ForwardRange>::type
>
equal_range(ForwardRange& rng, const Value& val)
{
ACTIV_BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept<ForwardRange> ));
return std::equal_range(Boost::begin(rng), Boost::end(rng), val);
}
/// \overload
template<class ForwardRange, class Value>
inline std::pair<
ACTIV_BOOST_DEDUCED_TYPENAME Boost::range_iterator<const ForwardRange>::type,
ACTIV_BOOST_DEDUCED_TYPENAME Boost::range_iterator<const ForwardRange>::type
>
equal_range(const ForwardRange& rng, const Value& val)
{
ACTIV_BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept<const ForwardRange> ));
return std::equal_range(Boost::begin(rng), Boost::end(rng), val);
}
/// \overload
template<class ForwardRange, class Value, class SortPredicate>
inline std::pair<
ACTIV_BOOST_DEDUCED_TYPENAME Boost::range_iterator<ForwardRange>::type,
ACTIV_BOOST_DEDUCED_TYPENAME Boost::range_iterator<ForwardRange>::type
>
equal_range(ForwardRange& rng, const Value& val, SortPredicate pred)
{
ACTIV_BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept<ForwardRange> ));
return std::equal_range(Boost::begin(rng), Boost::end(rng), val, pred);
}
/// \overload
template<class ForwardRange, class Value, class SortPredicate>
inline std::pair<
ACTIV_BOOST_DEDUCED_TYPENAME Boost::range_iterator<const ForwardRange>::type,
ACTIV_BOOST_DEDUCED_TYPENAME Boost::range_iterator<const ForwardRange>::type
>
equal_range(const ForwardRange& rng, const Value& val, SortPredicate pred)
{
ACTIV_BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept<const ForwardRange> ));
return std::equal_range(Boost::begin(rng), Boost::end(rng), val, pred);
}
} // namespace range
using range::equal_range;
} // namespace Boost
#endif // include guard