libcxx/include/__cxx03/__algorithm/fill.h

   1 //===----------------------------------------------------------------------===//
   2 //
   3 // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
   4 // See https://llvm.org/LICENSE.txt for license information.
   5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
   6 //
   7 //===----------------------------------------------------------------------===//
   8
   9 #ifndef _LIBCPP___ALGORITHM_FILL_H
  10 #define _LIBCPP___ALGORITHM_FILL_H
  11
  12 #include <__cxx03/__algorithm/fill_n.h>
  13 #include <__cxx03/__config>
  14 #include <__cxx03/__iterator/iterator_traits.h>
  15
  16 #if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
  17 #  pragma GCC system_header
  18 #endif
  19
  20 _LIBCPP_BEGIN_NAMESPACE_STD
  21
  22 // fill isn't specialized for std::memset, because the compiler already optimizes the loop to a call to std::memset.
  23
  24 template <class _ForwardIterator, class _Tp>
  25 inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 void
  26 __fill(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value, forward_iterator_tag) {
  27   for (; __first != __last; ++__first)
  28     *__first = __value;
  29 }
  30
  31 template <class _RandomAccessIterator, class _Tp>
  32 inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 void
  33 __fill(_RandomAccessIterator __first, _RandomAccessIterator __last, const _Tp& __value, random_access_iterator_tag) {
  34   std::fill_n(__first, __last - __first, __value);
  35 }
  36
  37 template <class _ForwardIterator, class _Tp>
  38 inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 void
  39 fill(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value) {
  40   std::__fill(__first, __last, __value, typename iterator_traits<_ForwardIterator>::iterator_category());
  41 }
  42
  43 _LIBCPP_END_NAMESPACE_STD
  44
  45 #endif // _LIBCPP___ALGORITHM_FILL_H