[gcc r15-2652] libstdc++: Fix incomplete change to reduce iterations for simulators

[Jonathan Wakely via Libstdc++-cvs]

https://gcc.gnu.org/g:0ba18853f7dbb038449322fea2ae311c2b26ceb6

commit r15-2652-g0ba18853f7dbb038449322fea2ae311c2b26ceb6
Author: Jonathan Wakely <jwak...@redhat.com>
Date:   Wed Jul 31 22:15:40 2024 +0100

    libstdc++: Fix incomplete change to reduce iterations for simulators
    
    This should have been done as part of r13-693-ge3b8b4f7814c54, but I
    only added the preprocessor logic and didn't use ARGS in the code.
    
    libstdc++-v3/ChangeLog:
    
            * 
testsuite/26_numerics/random/discrete_distribution/operators/values.cc:
            Use ARGS to limit number of iterations for simulators.

Diff:
---
 .../26_numerics/random/discrete_distribution/operators/values.cc    | 6 +++---
 1 file changed, 3 insertions(+), 3 deletions(-)

diff --git 
a/libstdc++-v3/testsuite/26_numerics/random/discrete_distribution/operators/values.cc
 
b/libstdc++-v3/testsuite/26_numerics/random/discrete_distribution/operators/values.cc
index 3cfe0d69f403..a6a2e713d3e5 100644
--- 
a/libstdc++-v3/testsuite/26_numerics/random/discrete_distribution/operators/values.cc
+++ 
b/libstdc++-v3/testsuite/26_numerics/random/discrete_distribution/operators/values.cc
@@ -40,16 +40,16 @@ void test01()
 
   std::discrete_distribution<> dd1({ });
   auto bdd1 = std::bind(dd1, eng);
-  testDiscreteDist(bdd1, [](int n) { return discrete_pdf(n, { }); } );
+  testDiscreteDist<ARGS>(bdd1, [](int n) { return discrete_pdf(n, { }); } );
 
   std::discrete_distribution<> dd2({ 1.0, 3.0, 2.0});
   auto bdd2 = std::bind(dd2, eng);
-  testDiscreteDist(bdd2, [](int n)
+  testDiscreteDist<ARGS>(bdd2, [](int n)
                   { return discrete_pdf(n, { 1.0, 3.0, 2.0}); } );
 
   std::discrete_distribution<> dd3({ 2.0, 2.0, 1.0, 0.0, 4.0});
   auto bdd3 = std::bind(dd3, eng);
-  testDiscreteDist(bdd3, [](int n)
+  testDiscreteDist<ARGS>(bdd3, [](int n)
                   { return discrete_pdf(n, { 2.0, 2.0, 1.0, 0.0, 4.0}); } );
 }