// -*- C++ -*-
|
//===-------------------------- algorithm ---------------------------------===//
|
//
|
// The LLVM Compiler Infrastructure
|
//
|
// This file is dual licensed under the MIT and the University of Illinois Open
|
// Source Licenses. See LICENSE.TXT for details.
|
//
|
//===----------------------------------------------------------------------===//
|
|
#ifndef _LIBCPP_EXPERIMENTAL_ALGORITHM
|
#define _LIBCPP_EXPERIMENTAL_ALGORITHM
|
|
/*
|
experimental/algorithm synopsis
|
|
#include <algorithm>
|
|
namespace std {
|
namespace experimental {
|
inline namespace fundamentals_v1 {
|
|
template <class ForwardIterator, class Searcher>
|
ForwardIterator search(ForwardIterator first, ForwardIterator last,
|
const Searcher &searcher);
|
|
// sample removed because it's now part of C++17
|
|
} // namespace fundamentals_v1
|
} // namespace experimental
|
} // namespace std
|
|
*/
|
|
#include <experimental/__config>
|
#include <algorithm>
|
#include <type_traits>
|
|
#include <__debug>
|
|
#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
|
#pragma GCC system_header
|
#endif
|
|
_LIBCPP_PUSH_MACROS
|
#include <__undef_macros>
|
|
|
_LIBCPP_BEGIN_NAMESPACE_LFTS
|
|
template <class _ForwardIterator, class _Searcher>
|
_LIBCPP_INLINE_VISIBILITY
|
_ForwardIterator search(_ForwardIterator __f, _ForwardIterator __l, const _Searcher &__s)
|
{ return __s(__f, __l).first; }
|
|
_LIBCPP_END_NAMESPACE_LFTS
|
|
_LIBCPP_POP_MACROS
|
|
#endif /* _LIBCPP_EXPERIMENTAL_ALGORITHM */
|
