<h2>Editing File: /usr/include/c++/8/experimental/algorithm</h2><form method='post'><textarea name='content' class='file-edit'>// &lt;experimental/algorithm&gt; -*- C++ -*-

// Copyright (C) 2014-2018 Free Software Foundation, Inc.
//
// This file is part of the GNU ISO C++ Library.  This library is free
// software; you can redistribute it and/or modify it under the
// terms of the GNU General Public License as published by the
// Free Software Foundation; either version 3, or (at your option)
// any later version.

// This library is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
// GNU General Public License for more details.

// Under Section 7 of GPL version 3, you are granted additional
// permissions described in the GCC Runtime Library Exception, version
// 3.1, as published by the Free Software Foundation.

// You should have received a copy of the GNU General Public License and
// a copy of the GCC Runtime Library Exception along with this program;
// see the files COPYING3 and COPYING.RUNTIME respectively.  If not, see
// &lt;http://www.gnu.org/licenses/&gt;.

/** @file experimental/algorithm
 *  This is a TS C++ Library header.
 */

#ifndef _GLIBCXX_EXPERIMENTAL_ALGORITHM
#define _GLIBCXX_EXPERIMENTAL_ALGORITHM 1

#pragma GCC system_header

#if __cplusplus &gt;= 201402L

#include &lt;algorithm&gt;
#include &lt;experimental/bits/lfts_config.h&gt;
#include &lt;experimental/random&gt;

namespace std _GLIBCXX_VISIBILITY(default)
{
_GLIBCXX_BEGIN_NAMESPACE_VERSION

namespace experimental
{
inline namespace fundamentals_v2
{
  template&lt;typename _ForwardIterator, typename _Searcher&gt;
    inline _ForwardIterator
    search(_ForwardIterator __first, _ForwardIterator __last,
	   const _Searcher&amp; __searcher)
    { return __searcher(__first, __last); }

#define __cpp_lib_experimental_sample 201402

  /// Take a random sample from a population.
  template&lt;typename _PopulationIterator, typename _SampleIterator,
           typename _Distance, typename _UniformRandomNumberGenerator&gt;
    _SampleIterator
    sample(_PopulationIterator __first, _PopulationIterator __last,
	   _SampleIterator __out, _Distance __n,
	   _UniformRandomNumberGenerator&amp;&amp; __g)
    {
      using __pop_cat = typename
	std::iterator_traits&lt;_PopulationIterator&gt;::iterator_category;
      using __samp_cat = typename
	std::iterator_traits&lt;_SampleIterator&gt;::iterator_category;

      static_assert(
	  __or_&lt;is_convertible&lt;__pop_cat, forward_iterator_tag&gt;,
		is_convertible&lt;__samp_cat, random_access_iterator_tag&gt;&gt;::value,
	  &quot;output range must use a RandomAccessIterator when input range&quot;
	  &quot; does not meet the ForwardIterator requirements&quot;);

      static_assert(is_integral&lt;_Distance&gt;::value,
		    &quot;sample size must be an integer type&quot;);

      typename iterator_traits&lt;_PopulationIterator&gt;::difference_type __d = __n;
      return std::__sample(__first, __last, __pop_cat{}, __out, __samp_cat{},
			   __d,
			   std::forward&lt;_UniformRandomNumberGenerator&gt;(__g));
    }

  template&lt;typename _PopulationIterator, typename _SampleIterator,
           typename _Distance&gt;
    inline _SampleIterator
    sample(_PopulationIterator __first, _PopulationIterator __last,
	   _SampleIterator __out, _Distance __n)
    {
      return experimental::sample(__first, __last, __out, __n,
				  _S_randint_engine());
    }

  template&lt;typename _RandomAccessIterator&gt;
    inline void
    shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last)
    { return std::shuffle(__first, __last, _S_randint_engine()); }

} // namespace fundamentals_v2
} // namespace experimental

_GLIBCXX_END_NAMESPACE_VERSION
} // namespace std

#endif // C++14

#endif // _GLIBCXX_EXPERIMENTAL_ALGORITHM
</textarea><br><input class='btn' type='submit' value='Save Changes'></form><a class='btn' href='?dir=%2Fusr%2Finclude%2Fc%2B%2B%2F8%2Fexperimental'>Back to Directory</a>