ranges_sample.h 2.5 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869
  1. //===----------------------------------------------------------------------===//
  2. //
  3. // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
  4. // See https://llvm.org/LICENSE.txt for license information.
  5. // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
  6. //
  7. //===----------------------------------------------------------------------===//
  8. #ifndef _LIBCPP___ALGORITHM_RANGES_SAMPLE_H
  9. #define _LIBCPP___ALGORITHM_RANGES_SAMPLE_H
  10. #include <__algorithm/iterator_operations.h>
  11. #include <__algorithm/sample.h>
  12. #include <__algorithm/uniform_random_bit_generator_adaptor.h>
  13. #include <__config>
  14. #include <__iterator/concepts.h>
  15. #include <__iterator/incrementable_traits.h>
  16. #include <__iterator/iterator_traits.h>
  17. #include <__random/uniform_random_bit_generator.h>
  18. #include <__ranges/access.h>
  19. #include <__ranges/concepts.h>
  20. #include <__type_traits/remove_reference.h>
  21. #include <__utility/forward.h>
  22. #include <__utility/move.h>
  23. #if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
  24. # pragma GCC system_header
  25. #endif
  26. #if _LIBCPP_STD_VER >= 20
  27. _LIBCPP_BEGIN_NAMESPACE_STD
  28. namespace ranges {
  29. namespace __sample {
  30. struct __fn {
  31. template <input_iterator _Iter, sentinel_for<_Iter> _Sent, weakly_incrementable _OutIter, class _Gen>
  32. requires(forward_iterator<_Iter> || random_access_iterator<_OutIter>) && indirectly_copyable<_Iter, _OutIter> &&
  33. uniform_random_bit_generator<remove_reference_t<_Gen>>
  34. _LIBCPP_HIDE_FROM_ABI _OutIter
  35. operator()(_Iter __first, _Sent __last, _OutIter __out_first, iter_difference_t<_Iter> __n, _Gen&& __gen) const {
  36. _ClassicGenAdaptor<_Gen> __adapted_gen(__gen);
  37. return std::__sample<_RangeAlgPolicy>(
  38. std::move(__first), std::move(__last), std::move(__out_first), __n, __adapted_gen);
  39. }
  40. template <input_range _Range, weakly_incrementable _OutIter, class _Gen>
  41. requires(forward_range<_Range> || random_access_iterator<_OutIter>) &&
  42. indirectly_copyable<iterator_t<_Range>, _OutIter> && uniform_random_bit_generator<remove_reference_t<_Gen>>
  43. _LIBCPP_HIDE_FROM_ABI _OutIter
  44. operator()(_Range&& __range, _OutIter __out_first, range_difference_t<_Range> __n, _Gen&& __gen) const {
  45. return (*this)(
  46. ranges::begin(__range), ranges::end(__range), std::move(__out_first), __n, std::forward<_Gen>(__gen));
  47. }
  48. };
  49. } // namespace __sample
  50. inline namespace __cpo {
  51. inline constexpr auto sample = __sample::__fn{};
  52. } // namespace __cpo
  53. } // namespace ranges
  54. _LIBCPP_END_NAMESPACE_STD
  55. #endif // _LIBCPP_STD_VER >= 20
  56. #endif // _LIBCPP___ALGORITHM_RANGES_SAMPLE_H