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 <__algorithm/fill_n.h>
13 #include <__config>
14 #include <__iterator/iterator_traits.h>
15 #include <type_traits>
16 
17 #if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
18 #  pragma GCC system_header
19 #endif
20 
21 _LIBCPP_BEGIN_NAMESPACE_STD
22 
23 // fill isn't specialized for std::memset, because the compiler already optimizes the loop to a call to std::memset.
24 
25 template <class _ForwardIterator, class _Tp>
26 inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17
27 void
28 __fill(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value, forward_iterator_tag)
29 {
30     for (; __first != __last; ++__first)
31         *__first = __value;
32 }
33 
34 template <class _RandomAccessIterator, class _Tp>
35 inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17
36 void
37 __fill(_RandomAccessIterator __first, _RandomAccessIterator __last, const _Tp& __value, random_access_iterator_tag)
38 {
39     _VSTD::fill_n(__first, __last - __first, __value);
40 }
41 
42 template <class _ForwardIterator, class _Tp>
43 inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17
44 void
45 fill(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value)
46 {
47     _VSTD::__fill(__first, __last, __value, typename iterator_traits<_ForwardIterator>::iterator_category());
48 }
49 
50 _LIBCPP_END_NAMESPACE_STD
51 
52 #endif // _LIBCPP___ALGORITHM_FILL_H
53