Home
last modified time | relevance | path

Searched refs:generate_n (Results 1 – 25 of 25) sorted by relevance

/llvm-project-15.0.7/libcxx/test/std/algorithms/alg.modifying.operations/alg.generate/
H A Dranges_generate_n.pass.cpp53 std::ranges::generate_n(std::forward<Iter>(iter), 0, std::forward<Gen>(gen));
76 std::same_as<Iter> decltype(auto) result = std::ranges::generate_n(std::move(begin), n, gen); in test_one()
128 auto result = std::ranges::generate_n(in.begin(), N2, gen); in test()
H A Dgenerate_n.pass.cpp37 auto it = std::generate_n(std::begin(ib), N, gen_test()); in test_constexpr()
53 assert(std::generate_n(Iter(ia), Size(n), gen_test()) == Iter(ia+n)); in test2()
/llvm-project-15.0.7/pstl/test/std/algorithms/alg.modifying.operations/
H A Dgenerate.pass.cpp59 auto actual_last = generate_n(exec, first, m, g); in operator ()()
89 generate_n(exec, iter, 0, non_const(gen)); in operator ()()
/llvm-project-15.0.7/libcxx/include/__algorithm/
H A Dgenerate_n.h24 generate_n(_OutputIterator __first, _Size __orig_n, _Generator __gen) in generate_n() function
H A Dranges_generate_n.h54 inline constexpr auto generate_n = __generate_n::__fn{};
/llvm-project-15.0.7/libcxx/benchmarks/
H A Dto_chars.bench.cpp19 std::generate_n(result.begin(), result.size(), [&] { return distribution(generator); }); in __anon59109a170102()
H A DGenerateInput.h46 std::generate_n(str.begin(), Len, &getRandomChar); in getRandomString()
H A Dformatter_int.bench.cpp22 std::generate_n(result.begin(), result.size(), [&] { return distribution(generator); }); in __anonfa9e66020102()
/llvm-project-15.0.7/libcxx/test/std/algorithms/
H A Dranges_robust_against_proxy_iterators.pass.cpp124 std::ranges::generate_n(in.begin(), count, gen); in run_tests()
H A Drobust_against_adl.compile.pass.cpp88 (void)std::generate_n(first, count, NullaryValue()); in all_the_algorithms()
H A Drobust_re_difference_type.compile.pass.cpp125 (void)std::generate_n(first, count, NullaryValue()); in all_the_algorithms()
H A Drobust_against_proxy_iterators_lifetime_bugs.pass.cpp711 test_n(simple_in, [&](I b, size_t n) { std::generate_n(b, n, gen); }); in test()
/llvm-project-15.0.7/libcxx/test/libcxx/algorithms/
H A Drobust_against_cpp20_hostile_iterators.compile.pass.cpp118 (void) std::generate_n(it, 0, pred); in test()
H A Drobust_against_copying_comparators.pass.cpp131 (void)std::generate_n(first, count, NullaryValue<T>(&copies)); assert(copies == 0); in all_the_algorithms()
H A Dranges_robust_against_copying_comparators.pass.cpp126 (void)std::ranges::generate_n(first, count, NullaryValue(&copies)); assert(copies == 0); in all_the_algorithms()
/llvm-project-15.0.7/libcxx/test/std/library/description/conventions/customization.point.object/
H A Dniebloid.compile.pass.cpp87 static_assert(test(std::ranges::generate_n, a, 10, gen));
/llvm-project-15.0.7/libcxx/docs/Status/
H A DRangesAlgorithms.csv49 Write,generate_n,Konstantin Varlamov,`D130552 <https://llvm.org/D130552>`_,✅
/llvm-project-15.0.7/pstl/include/pstl/internal/
H A Dglue_algorithm_defs.h208 generate_n(_ExecutionPolicy&& __exec, _ForwardIterator __first, _Size count, _Generator __g);
H A Dglue_algorithm_impl.h426 generate_n(_ExecutionPolicy&& __exec, _ForwardIterator __first, _Size __count, _Generator __g) in generate_n() function
H A Dalgorithm_impl.h2623 return std::generate_n(__first, __count, __g); in __brick_generate_n()
/llvm-project-15.0.7/libcxx/include/
H A DCMakeLists.txt27 __algorithm/generate_n.h
H A Dmodule.modulemap.in269 module generate_n { private header "__algorithm/generate_n.h" }
H A Dalgorithm410 …constexpr O generate_n(O first, iter_difference_t<O> n, F gen); // Since C…
1294 generate_n(OutputIterator first, Size n, Generator gen);
1741 #include <__algorithm/generate_n.h>
/llvm-project-15.0.7/llvm/utils/gn/secondary/libcxx/include/
H A DBUILD.gn96 "__algorithm/generate_n.h",
/llvm-project-15.0.7/clang/include/clang/Tooling/Inclusions/
H A DStdSymbolMap.inc406 SYMBOL(generate_n, std::, <algorithm>)