Gecko [ 0.0.0.0 ]

Name	Size	Permission
bits	[ DIR ]	drwxr-xr-x
algorithm	3.67 KB	-rw-r--r--
any	15.72 KB	-rw-r--r--
array	3.36 KB	-rw-r--r--
buffer	28.12 KB	-rw-r--r--
chrono	2.03 KB	-rw-r--r--
contract	2.52 KB	-rw-r--r--
deque	2.31 KB	-rw-r--r--
executor	55 KB	-rw-r--r--
filesystem	1.62 KB	-rw-r--r--
forward_list	2.38 KB	-rw-r--r--
functional	12.01 KB	-rw-r--r--
internet	68.82 KB	-rw-r--r--
io_context	22.16 KB	-rw-r--r--
iterator	3.52 KB	-rw-r--r--
list	2.28 KB	-rw-r--r--
map	2.79 KB	-rw-r--r--
memory	5.97 KB	-rw-r--r--
memory_resource	17.83 KB	-rw-r--r--
net	1.58 KB	-rw-r--r--
netfwd	3.73 KB	-rw-r--r--
numeric	3.4 KB	-rw-r--r--
optional	26.06 KB	-rw-r--r--
propagate_const	16.73 KB	-rw-r--r--
random	2.61 KB	-rw-r--r--
ratio	2.45 KB	-rw-r--r--
regex	2.14 KB	-rw-r--r--
scope	14.17 KB	-rw-r--r--
set	2.66 KB	-rw-r--r--
simd	2.88 KB	-rw-r--r--
socket	76.44 KB	-rw-r--r--
source_location	2.68 KB	-rw-r--r--
string	2.92 KB	-rw-r--r--
string_view	21.96 KB	-rw-r--r--
synchronized_value	3.27 KB	-rw-r--r--
system_error	2.07 KB	-rw-r--r--
timer	5.74 KB	-rw-r--r--
tuple	2.48 KB	-rw-r--r--
type_traits	11.79 KB	-rw-r--r--
unordered_map	3.07 KB	-rw-r--r--
unordered_set	2.94 KB	-rw-r--r--
utility	1.76 KB	-rw-r--r--
vector	2.37 KB	-rw-r--r--

Code Editor : algorithm

// <experimental/algorithm> -*- C++ -*-

// Copyright (C) 2014-2024 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
// <http://www.gnu.org/licenses/>.

/** @file experimental/algorithm
 *  This is a TS C++ Library header.
 *  @ingroup libfund-ts
 */

#ifndef _GLIBCXX_EXPERIMENTAL_ALGORITHM
#define _GLIBCXX_EXPERIMENTAL_ALGORITHM 1

#pragma GCC system_header

#include <bits/requires_hosted.h> // experimental is currently omitted

#if __cplusplus >= 201402L

#include <algorithm>
#include <experimental/bits/lfts_config.h>
#include <experimental/random>

namespace std _GLIBCXX_VISIBILITY(default)
{
_GLIBCXX_BEGIN_NAMESPACE_VERSION

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

#define __cpp_lib_experimental_sample 201402

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

static_assert(
	  __or_<is_convertible<__pop_cat, forward_iterator_tag>,
		is_convertible<__samp_cat, random_access_iterator_tag>>::value,
	  "output range must use a RandomAccessIterator when input range"
	  " does not meet the ForwardIterator requirements");

static_assert(is_integral<_Distance>::value,
		    "sample size must be an integer type");

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

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

template<typename _RandomAccessIterator>
    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

${this.title}

Code Editor : algorithm