7ed7d4ccb8
This is a fairly mechanical change, it just moves each algorithm into its own header. This is a NFC. Note: during this change, I burned down all the includes, so this follows "include only and exactly what you use." Differential Revision: https://reviews.llvm.org/D103583
112 lines
2.9 KiB
C++
112 lines
2.9 KiB
C++
//===----------------------------------------------------------------------===//
|
|
//
|
|
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
|
|
// See https://llvm.org/LICENSE.txt for license information.
|
|
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
#ifndef _LIBCPP___ALGORITHM_REMOVE_H
|
|
#define _LIBCPP___ALGORITHM_REMOVE_H
|
|
|
|
#include <__config>
|
|
#include <__algorithm/find.h>
|
|
#include <__algorithm/find_if.h>
|
|
#include <type_traits>
|
|
|
|
#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
|
|
#pragma GCC system_header
|
|
#endif
|
|
|
|
_LIBCPP_PUSH_MACROS
|
|
#include <__undef_macros>
|
|
|
|
_LIBCPP_BEGIN_NAMESPACE_STD
|
|
|
|
// remove
|
|
|
|
template <class _ForwardIterator, class _Tp>
|
|
_LIBCPP_NODISCARD_EXT _LIBCPP_CONSTEXPR_AFTER_CXX17 _ForwardIterator
|
|
remove(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_)
|
|
{
|
|
__first = _VSTD::find(__first, __last, __value_);
|
|
if (__first != __last)
|
|
{
|
|
_ForwardIterator __i = __first;
|
|
while (++__i != __last)
|
|
{
|
|
if (!(*__i == __value_))
|
|
{
|
|
*__first = _VSTD::move(*__i);
|
|
++__first;
|
|
}
|
|
}
|
|
}
|
|
return __first;
|
|
}
|
|
|
|
// remove_if
|
|
|
|
template <class _ForwardIterator, class _Predicate>
|
|
_LIBCPP_NODISCARD_EXT _LIBCPP_CONSTEXPR_AFTER_CXX17 _ForwardIterator
|
|
remove_if(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred)
|
|
{
|
|
__first = _VSTD::find_if<_ForwardIterator, typename add_lvalue_reference<_Predicate>::type>
|
|
(__first, __last, __pred);
|
|
if (__first != __last)
|
|
{
|
|
_ForwardIterator __i = __first;
|
|
while (++__i != __last)
|
|
{
|
|
if (!__pred(*__i))
|
|
{
|
|
*__first = _VSTD::move(*__i);
|
|
++__first;
|
|
}
|
|
}
|
|
}
|
|
return __first;
|
|
}
|
|
|
|
// remove_copy
|
|
|
|
template <class _InputIterator, class _OutputIterator, class _Tp>
|
|
inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17
|
|
_OutputIterator
|
|
remove_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result, const _Tp& __value_)
|
|
{
|
|
for (; __first != __last; ++__first)
|
|
{
|
|
if (!(*__first == __value_))
|
|
{
|
|
*__result = *__first;
|
|
++__result;
|
|
}
|
|
}
|
|
return __result;
|
|
}
|
|
|
|
// remove_copy_if
|
|
|
|
template <class _InputIterator, class _OutputIterator, class _Predicate>
|
|
inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17
|
|
_OutputIterator
|
|
remove_copy_if(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _Predicate __pred)
|
|
{
|
|
for (; __first != __last; ++__first)
|
|
{
|
|
if (!__pred(*__first))
|
|
{
|
|
*__result = *__first;
|
|
++__result;
|
|
}
|
|
}
|
|
return __result;
|
|
}
|
|
|
|
_LIBCPP_END_NAMESPACE_STD
|
|
|
|
_LIBCPP_POP_MACROS
|
|
|
|
#endif // _LIBCPP___ALGORITHM_REMOVE_H
|