mirror of
https://github.com/opnsense/src.git
synced 2026-02-14 08:13:38 -05:00
9729cf0934
numbers):
r242679 Implement the plugin-based version of std::search. There are no
searchers yet; those are coming soon.
r242682 Implement the default searcher for std::experimental::search.
r243728 Add <experimental/any> v2.
r245330 implement more of N4258 - Cleaning up noexcept in the standard
library. Specifically add new noexcept stuff to vector and
string's move-assignment operations
r245334 Fix PR22606 - Leak pthread_key with static storage duration to
ensure all of thread-local destructors are called.
r245335 Fix PR23589: std::function doesn't recognize null pointer to
varargs function.
r247036 Implementation of Boyer-Moore and Boyer-Moore-Horspool
searchers for the LFTS.
r249325 Implement LWG#2063, and update the issues links to point to the
github generated pages
r249738 Split <ctype.h> out of <cctype>.
r249739 Split <errno.h> out of <cerrno>.
r249740 Split <float.h> out of <cfloat>.
r249741 Split <inttypes.h> out of <cinttypes>.
r249742 Split <math.h> out of <cmath>.
r249743 Split <setjmp.h> out of <csetjmp>.
r249761 Split <stddef.h> out of <cstddef>.
r249798 Split <stdio.h> out of <cstdio>.
r249800 Split <stdlib.h> out of <cstdlib>.
r249889 Split <wchar.h> out of <cwchar>.
r249890 Split <wctype.h> out of <cwctype>.
r249929 Split <string.h> out of <cstring>.
r250254 ABI versioning macros for libc++.
r251246 Fix LWG#2244: basic_istream::seekg
r251247 Fix LWG#2127: Move-construction with raw_storage_iterator.
r251253 Fix LWG#2476: scoped_allocator_adaptor is not assignable
r251257 Fix LWG#2489: mem_fn() should be noexcept
r251618 Implement P0004R1 'Remove Deprecated iostreams aliases'
r251766 Implement the first part of P0006R0: Adopt Type Traits Variable
Templates for C++17.
r252195 Implement P0092R1 for C++1z
r252350 Allow deque to handle incomplete types.
r252406 More of P0006R0: type traits variable aliases for C++17.
r252407 Implement LWG#2353: std::next is over-constrained
r252905 Implement P0074: Making owner_less more flexible
r253215 Implement P0013R1: Logical Operator Type Traits.
r253274 Implement P0007: Constant View: A proposal for a std::as_const
helper function template.
r254119 Add static_assert to set/multiset/map/multimap/forward_list/deque
that the allocator's value_type match the container's value_type.
r254283 Implement more of P0006; Type Traits Variable Templates.
r255941 LWG2485: get() should be overloaded for const tuple&&.
r256325 Fix LWG Issue #2367 - Fixing std::tuple and std::pair's default
constructors.
r256652 Fix for ALL undefined behavior in <list>.
r256859 First half of LWG#2354: 'Unnecessary copying when inserting
into maps with braced-init syntax'
Exp-run: antoine
Relnotes: yes
120 lines
3.9 KiB
C++
120 lines
3.9 KiB
C++
// -*- 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);
|
|
template <class PopulationIterator, class SampleIterator, class Distance,
|
|
class UniformRandomNumberGenerator>
|
|
SampleIterator sample(PopulationIterator first, PopulationIterator last,
|
|
SampleIterator out, Distance n,
|
|
UniformRandomNumberGenerator &&g);
|
|
|
|
} // namespace fundamentals_v1
|
|
} // namespace experimental
|
|
} // namespace std
|
|
|
|
*/
|
|
|
|
#include <experimental/__config>
|
|
#include <algorithm>
|
|
#include <type_traits>
|
|
|
|
#include <__undef_min_max>
|
|
|
|
#include <__debug>
|
|
|
|
#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
|
|
#pragma GCC system_header
|
|
#endif
|
|
|
|
_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); }
|
|
|
|
|
|
template <class _PopulationIterator, class _SampleIterator, class _Distance,
|
|
class _UniformRandomNumberGenerator>
|
|
_LIBCPP_INLINE_VISIBILITY
|
|
_SampleIterator __sample(_PopulationIterator __first,
|
|
_PopulationIterator __last, _SampleIterator __out,
|
|
_Distance __n,
|
|
_UniformRandomNumberGenerator &&__g,
|
|
input_iterator_tag) {
|
|
|
|
_Distance __k = 0;
|
|
for (; __first != __last && __k < __n; ++__first, (void)++__k)
|
|
__out[__k] = *__first;
|
|
_Distance __sz = __k;
|
|
for (; __first != __last; ++__first, (void)++__k) {
|
|
_Distance __r = _VSTD::uniform_int_distribution<_Distance>(0, __k)(__g);
|
|
if (__r < __sz)
|
|
__out[__r] = *__first;
|
|
}
|
|
return __out + _VSTD::min(__n, __k);
|
|
}
|
|
|
|
template <class _PopulationIterator, class _SampleIterator, class _Distance,
|
|
class _UniformRandomNumberGenerator>
|
|
_LIBCPP_INLINE_VISIBILITY
|
|
_SampleIterator __sample(_PopulationIterator __first,
|
|
_PopulationIterator __last, _SampleIterator __out,
|
|
_Distance __n,
|
|
_UniformRandomNumberGenerator &&__g,
|
|
forward_iterator_tag) {
|
|
_Distance __unsampled_sz = _VSTD::distance(__first, __last);
|
|
for (__n = _VSTD::min(__n, __unsampled_sz); __n != 0; ++__first) {
|
|
_Distance __r =
|
|
_VSTD::uniform_int_distribution<_Distance>(0, --__unsampled_sz)(__g);
|
|
if (__r < __n) {
|
|
*__out++ = *__first;
|
|
--__n;
|
|
}
|
|
}
|
|
return __out;
|
|
}
|
|
|
|
template <class _PopulationIterator, class _SampleIterator, class _Distance,
|
|
class _UniformRandomNumberGenerator>
|
|
_LIBCPP_INLINE_VISIBILITY
|
|
_SampleIterator sample(_PopulationIterator __first,
|
|
_PopulationIterator __last, _SampleIterator __out,
|
|
_Distance __n, _UniformRandomNumberGenerator &&__g) {
|
|
typedef typename iterator_traits<_PopulationIterator>::iterator_category
|
|
_PopCategory;
|
|
typedef typename iterator_traits<_PopulationIterator>::difference_type
|
|
_Difference;
|
|
typedef typename common_type<_Distance, _Difference>::type _CommonType;
|
|
_LIBCPP_ASSERT(__n >= 0, "N must be a positive number.");
|
|
return _VSTD_LFTS::__sample(
|
|
__first, __last, __out, _CommonType(__n),
|
|
_VSTD::forward<_UniformRandomNumberGenerator>(__g),
|
|
_PopCategory());
|
|
}
|
|
|
|
_LIBCPP_END_NAMESPACE_LFTS
|
|
|
|
#endif /* _LIBCPP_EXPERIMENTAL_ALGORITHM */
|