2 //===-------------------------- algorithm ---------------------------------===//
4 // The LLVM Compiler Infrastructure
6 // This file is dual licensed under the MIT and the University of Illinois Open
7 // Source Licenses. See LICENSE.TXT for details.
9 //===----------------------------------------------------------------------===//
11 #ifndef _LIBCPP_EXPERIMENTAL_ALGORITHM
12 #define _LIBCPP_EXPERIMENTAL_ALGORITHM
15 experimental/algorithm synopsis
20 namespace experimental {
21 inline namespace fundamentals_v1 {
23 template <class ForwardIterator, class Searcher>
24 ForwardIterator search(ForwardIterator first, ForwardIterator last,
25 const Searcher &searcher);
26 template <class PopulationIterator, class SampleIterator, class Distance,
27 class UniformRandomNumberGenerator>
28 SampleIterator sample(PopulationIterator first, PopulationIterator last,
29 SampleIterator out, Distance n,
30 UniformRandomNumberGenerator &&g);
32 } // namespace fundamentals_v1
33 } // namespace experimental
38 #include <experimental/__config>
40 #include <type_traits>
42 #include <__undef_min_max>
46 #if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
47 #pragma GCC system_header
50 _LIBCPP_BEGIN_NAMESPACE_LFTS
53 template <class _ForwardIterator, class _Searcher>
54 _LIBCPP_INLINE_VISIBILITY
55 _ForwardIterator search(_ForwardIterator __f, _ForwardIterator __l, const _Searcher &__s)
56 { return __s(__f, __l).first; }
59 template <class _PopulationIterator, class _SampleIterator, class _Distance,
60 class _UniformRandomNumberGenerator>
61 inline _LIBCPP_INLINE_VISIBILITY
62 _SampleIterator sample(_PopulationIterator __first, _PopulationIterator __last,
63 _SampleIterator __out, _Distance __n,
64 _UniformRandomNumberGenerator &&__g) {
65 return _VSTD::__sample(__first, __last, __out, __n, __g);
68 _LIBCPP_END_NAMESPACE_LFTS
70 #endif /* _LIBCPP_EXPERIMENTAL_ALGORITHM */