mirror of https://github.com/axmolengine/axmol.git
82 lines
2.4 KiB
C++
82 lines
2.4 KiB
C++
|
/// \file
|
||
|
|
// Range v3 library
|
||
|
|
//
|
||
|
|
// Copyright Eric Niebler 2014-present
|
||
|
|
//
|
||
|
|
// 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)
|
||
|
|
//
|
||
|
|
// Project home: https://github.com/ericniebler/range-v3
|
||
|
|
//
|
||
|
|
#ifndef RANGES_V3_ALGORITHM_REMOVE_IF_HPP
|
||
|
|
#define RANGES_V3_ALGORITHM_REMOVE_IF_HPP
|
||
|
|
|
||
|
|
#include <meta/meta.hpp>
|
||
|
|
|
||
|
|
#include <range/v3/range_fwd.hpp>
|
||
|
|
|
||
|
|
#include <range/v3/algorithm/find_if.hpp>
|
||
|
|
#include <range/v3/functional/identity.hpp>
|
||
|
|
#include <range/v3/functional/invoke.hpp>
|
||
|
|
#include <range/v3/iterator/concepts.hpp>
|
||
|
|
#include <range/v3/iterator/operations.hpp>
|
||
|
|
#include <range/v3/iterator/traits.hpp>
|
||
|
|
#include <range/v3/range/access.hpp>
|
||
|
|
#include <range/v3/range/concepts.hpp>
|
||
|
|
#include <range/v3/range/dangling.hpp>
|
||
|
|
#include <range/v3/range/traits.hpp>
|
||
|
|
#include <range/v3/utility/static_const.hpp>
|
||
|
|
|
||
|
|
#include <range/v3/detail/prologue.hpp>
|
||
|
|
|
||
|
|
namespace ranges
|
||
|
|
{
|
||
|
|
/// \addtogroup group-algorithms
|
||
|
|
/// @{
|
||
|
|
RANGES_FUNC_BEGIN(remove_if)
|
||
|
|
|
||
|
|
/// \brief function template \c remove_if
|
||
|
|
template(typename I, typename S, typename C, typename P = identity)(
|
||
|
|
requires permutable<I> AND sentinel_for<S, I> AND
|
||
|
|
indirect_unary_predicate<C, projected<I, P>>)
|
||
|
|
constexpr I RANGES_FUNC(remove_if)(I first, S last, C pred, P proj = P{})
|
||
|
|
{
|
||
|
|
first = find_if(std::move(first), last, ranges::ref(pred), ranges::ref(proj));
|
||
|
|
if(first != last)
|
||
|
|
{
|
||
|
|
for(I i = next(first); i != last; ++i)
|
||
|
|
{
|
||
|
|
if(!(invoke(pred, invoke(proj, *i))))
|
||
|
|
{
|
||
|
|
*first = iter_move(i);
|
||
|
|
++first;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
}
|
||
|
|
return first;
|
||
|
|
}
|
||
|
|
|
||
|
|
/// \overload
|
||
|
|
template(typename Rng, typename C, typename P = identity)(
|
||
|
|
requires forward_range<Rng> AND permutable<iterator_t<Rng>> AND
|
||
|
|
indirect_unary_predicate<C, projected<iterator_t<Rng>, P>>)
|
||
|
|
constexpr borrowed_iterator_t<Rng> RANGES_FUNC(remove_if)(Rng && rng, C pred, P proj = P{})
|
||
|
|
{
|
||
|
|
return (*this)(begin(rng), end(rng), std::move(pred), std::move(proj));
|
||
|
|
}
|
||
|
|
|
||
|
|
RANGES_FUNC_END(remove_if)
|
||
|
|
|
||
|
|
namespace cpp20
|
||
|
|
{
|
||
|
|
using ranges::remove_if;
|
||
|
|
}
|
||
|
|
/// @}
|
||
|
|
} // namespace ranges
|
||
|
|
|
||
|
|
#include <range/v3/detail/epilogue.hpp>
|
||
|
|
|
||
|
|
#endif
|