OXIESEC PANEL

Name	Size	Modified	Perms
📁 ..	-	01/31/2023 12:38:15 PM	rwxr-xr-x
📄 algorithm	3.02 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 any	15.55 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 array	3.16 KB	12/04/2019 02:25:41 PM	rw-r--r--
📁 bits	-	01/31/2023 12:38:15 PM	rwxr-xr-x
📄 chrono	1.89 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 deque	2.26 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 filesystem	2.14 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 forward_list	2.32 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 functional	12.26 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 iterator	3.43 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 list	2.23 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 map	2.57 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 memory	5.9 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 memory_resource	12.5 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 numeric	2.73 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 optional	28.17 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 propagate_const	14.95 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 random	2.42 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 ratio	2.36 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 regex	2.05 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 set	2.44 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 source_location	2.61 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 string	2.79 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 string_view	21.28 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 system_error	1.98 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 tuple	2.39 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 type_traits	10.76 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 unordered_map	2.81 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 unordered_set	2.69 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 utility	1.59 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 vector	2.33 KB	12/04/2019 02:25:41 PM	rw-r--r--

Editing: algorithm

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

// Copyright (C) 2014-2017 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.
 */

#ifndef _GLIBCXX_EXPERIMENTAL_ALGORITHM
#define _GLIBCXX_EXPERIMENTAL_ALGORITHM 1

#pragma GCC system_header

#if __cplusplus >= 201402L

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

namespace std _GLIBCXX_VISIBILITY(default)
{
namespace experimental
{
inline namespace fundamentals_v1
{
_GLIBCXX_BEGIN_NAMESPACE_VERSION

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 std::__sample(__first, __last, __pop_cat{}, __out, __samp_cat{},
			   __d,
			   std::forward<_UniformRandomNumberGenerator>(__g));
    }

_GLIBCXX_END_NAMESPACE_VERSION
} // namespace fundamentals_v1
} // namespace experimental
} // namespace std

#endif // C++14

#endif // _GLIBCXX_EXPERIMENTAL_ALGORITHM