| /third_party/boost/libs/asio/test/execution/ |
| D | outstanding_work.cpp | 28 typedef exec::outstanding_work_t::tracked_t n2; typedef
746 BOOST_ASIO_CHECK(n2() == exec::outstanding_work.tracked); in test_vars()
755 BOOST_ASIO_TEST_CASE3(test_can_query<ex_nq_nr, n2, false>)
765 BOOST_ASIO_TEST_CASE3(test_can_require<ex_nq_nr, n2, false>)
771 BOOST_ASIO_TEST_CASE3(test_can_prefer<ex_nq_nr, n2, true>)
774 BOOST_ASIO_TEST_CASE3(test_prefer<ex_nq_nr, n2, n1>)
778 BOOST_ASIO_TEST_CASE5(test_can_query<ex_cq_nr<s, s, n1>, n2, true>)
779 BOOST_ASIO_TEST_CASE5(test_can_query<ex_cq_nr<s, s, n2>, s, true>)
780 BOOST_ASIO_TEST_CASE5(test_can_query<ex_cq_nr<s, s, n2>, n1, true>)
781 BOOST_ASIO_TEST_CASE5(test_can_query<ex_cq_nr<s, s, n2>, n2, true>)
[all …]
|
| D | relationship.cpp | 28 typedef exec::relationship_t::continuation_t n2; typedef
746 BOOST_ASIO_CHECK(n2() == exec::relationship.continuation); in test_vars()
755 BOOST_ASIO_TEST_CASE3(test_can_query<ex_nq_nr, n2, false>)
765 BOOST_ASIO_TEST_CASE3(test_can_require<ex_nq_nr, n2, false>)
771 BOOST_ASIO_TEST_CASE3(test_can_prefer<ex_nq_nr, n2, true>)
774 BOOST_ASIO_TEST_CASE3(test_prefer<ex_nq_nr, n2, n1>)
778 BOOST_ASIO_TEST_CASE5(test_can_query<ex_cq_nr<s, s, n1>, n2, true>)
779 BOOST_ASIO_TEST_CASE5(test_can_query<ex_cq_nr<s, s, n2>, s, true>)
780 BOOST_ASIO_TEST_CASE5(test_can_query<ex_cq_nr<s, s, n2>, n1, true>)
781 BOOST_ASIO_TEST_CASE5(test_can_query<ex_cq_nr<s, s, n2>, n2, true>)
[all …]
|
| D | blocking_adaptation.cpp | 28 typedef exec::blocking_adaptation_t::allowed_t n2; typedef
814 BOOST_ASIO_CHECK(n2() == exec::blocking_adaptation.allowed); in test_vars()
823 BOOST_ASIO_TEST_CASE3(test_can_query<ex_nq_nr, n2, false>)
833 BOOST_ASIO_TEST_CASE3(test_can_require<ex_nq_nr, n2, true>)
836 BOOST_ASIO_TEST_CASE3(test_require<ex_nq_nr, n2, n2>)
840 BOOST_ASIO_TEST_CASE3(test_can_prefer<ex_nq_nr, n2, false>)
846 BOOST_ASIO_TEST_CASE5(test_can_query<ex_cq_nr<s, s, n1>, n2, true>)
847 BOOST_ASIO_TEST_CASE5(test_can_query<ex_cq_nr<s, s, n2>, s, true>)
848 BOOST_ASIO_TEST_CASE5(test_can_query<ex_cq_nr<s, s, n2>, n1, true>)
849 BOOST_ASIO_TEST_CASE5(test_can_query<ex_cq_nr<s, s, n2>, n2, true>)
[all …]
|
| D | blocking.cpp | 28 typedef exec::blocking_t::always_t n2; typedef
747 BOOST_ASIO_CHECK(n2() == exec::blocking.always); in test_vars()
757 BOOST_ASIO_TEST_CASE3(test_can_query<ex_nq_nr, n2, false>)
768 BOOST_ASIO_TEST_CASE3(test_can_require<ex_nq_nr, n2, false>)
775 BOOST_ASIO_TEST_CASE3(test_can_prefer<ex_nq_nr, n2, false>)
783 BOOST_ASIO_TEST_CASE5(test_can_query<ex_cq_nr<s, s, n1>, n2, true>)
785 BOOST_ASIO_TEST_CASE5(test_can_query<ex_cq_nr<s, s, n2>, s, true>)
786 BOOST_ASIO_TEST_CASE5(test_can_query<ex_cq_nr<s, s, n2>, n1, true>)
787 BOOST_ASIO_TEST_CASE5(test_can_query<ex_cq_nr<s, s, n2>, n2, true>)
788 BOOST_ASIO_TEST_CASE5(test_can_query<ex_cq_nr<s, s, n2>, n3, true>)
[all …]
|
| D | bulk_guarantee.cpp | 28 typedef exec::bulk_guarantee_t::sequenced_t n2; typedef
747 BOOST_ASIO_CHECK(n2() == exec::bulk_guarantee.sequenced); in test_vars()
757 BOOST_ASIO_TEST_CASE3(test_can_query<ex_nq_nr, n2, false>)
768 BOOST_ASIO_TEST_CASE3(test_can_require<ex_nq_nr, n2, false>)
775 BOOST_ASIO_TEST_CASE3(test_can_prefer<ex_nq_nr, n2, true>)
779 BOOST_ASIO_TEST_CASE3(test_prefer<ex_nq_nr, n2, n1>)
784 BOOST_ASIO_TEST_CASE5(test_can_query<ex_cq_nr<s, s, n1>, n2, true>)
786 BOOST_ASIO_TEST_CASE5(test_can_query<ex_cq_nr<s, s, n2>, s, true>)
787 BOOST_ASIO_TEST_CASE5(test_can_query<ex_cq_nr<s, s, n2>, n1, true>)
788 BOOST_ASIO_TEST_CASE5(test_can_query<ex_cq_nr<s, s, n2>, n2, true>)
[all …]
|
| D | mapping.cpp | 28 typedef exec::mapping_t::new_thread_t n2; typedef
747 BOOST_ASIO_CHECK(n2() == exec::mapping.new_thread); in test_vars()
757 BOOST_ASIO_TEST_CASE3(test_can_query<ex_nq_nr, n2, false>)
768 BOOST_ASIO_TEST_CASE3(test_can_require<ex_nq_nr, n2, false>)
775 BOOST_ASIO_TEST_CASE3(test_can_prefer<ex_nq_nr, n2, true>)
779 BOOST_ASIO_TEST_CASE3(test_prefer<ex_nq_nr, n2, n1>)
784 BOOST_ASIO_TEST_CASE5(test_can_query<ex_cq_nr<s, s, n1>, n2, true>)
786 BOOST_ASIO_TEST_CASE5(test_can_query<ex_cq_nr<s, s, n2>, s, true>)
787 BOOST_ASIO_TEST_CASE5(test_can_query<ex_cq_nr<s, s, n2>, n1, true>)
788 BOOST_ASIO_TEST_CASE5(test_can_query<ex_cq_nr<s, s, n2>, n2, true>)
[all …]
|
| /third_party/boost/boost/ratio/detail/mpl/ |
| D | gcd.hpp | 63 , T n2
66 : gcd<integral_c<T,n1>,integral_c<T,n2> >
78 , typename T2, boost::intmax_t n2, bool n2_is_0 >
80 : gcd_aux<T2, n2, n2==0, T1, (n1 % n2), (n1 % n2)==0>
83 template <typename T1, boost::intmax_t n1, typename T2, boost::intmax_t n2>
84 struct gcd_aux<T1, n1, false, T2, n2, true> : integral_c<T1, n1>
87 template <typename T1, boost::intmax_t n1, typename T2, boost::intmax_t n2, bool C>
88 struct gcd_aux<T1, n1, true, T2, n2, C> : integral_c<T2, n2>
93 template< typename T1, T1 n1, bool n1_is_0, typename T2, T2 n2, bool n2_is_0 >
96 : gcd_aux<T2, n2, n2==0,
[all …]
|
| D | lcm.hpp | 63 , T n2
66 : lcm<integral_c<T,n1>,integral_c<T,n2> >
77 , typename T2, boost::intmax_t n2, bool n2_is_0 >
80 ( n1 / gcd<integral_c<T1,n1>, integral_c<T2,n2> >::value * n2 )
84 template <typename T1, boost::intmax_t n1, typename T2, boost::intmax_t n2>
85 struct lcm_aux<T1, n1, false, T2, n2, true> : integral_c<T2, 0>
88 template <typename T1, boost::intmax_t n1, typename T2, boost::intmax_t n2, bool C>
89 struct lcm_aux<T1, n1, true, T2, n2, C> : integral_c<T1, 0>
96 template< typename T1, T1 n1, bool n1_is_0, typename T2, T2 n2, bool n2_is_0 >
100 ( n1 / gcd<integral_c<T1,n1>, integral_c<T2,n2> >::value * n2 )
[all …]
|
| /third_party/typescript/tests/baselines/reference/ |
| D | typeArgumentsWithStringLiteralTypes01.js | 51 namespace n2 {
157 var n2; variable
158 (function (n2) { argument
161 n2.a = fun1("Hello", "Hello");
162 n2.b = fun1("Hello", "World");
163 n2.c = fun2("Hello", "Hello");
164 n2.d = fun2("Hello", "World");
165 n2.e = fun3("Hello", "World");
167 n2.a = takeReturnString(n2.a);
168 n2.b = takeReturnString(n2.b);
[all …]
|
| /third_party/cmsis/CMSIS/DSP/Source/TransformFunctions/ |
| D | arm_cfft_radix2_q15.c | 96 uint32_t n1, n2, ia; in arm_radix2_butterfly_q15() local
102 n2 = fftLen; in arm_radix2_butterfly_q15()
104 n1 = n2; in arm_radix2_butterfly_q15()
105 n2 = n2 >> 1; in arm_radix2_butterfly_q15()
109 for (i = 0; i < n2; i++) in arm_radix2_butterfly_q15()
115 l = i + n2; in arm_radix2_butterfly_q15()
177 n1 = n2; in arm_radix2_butterfly_q15()
178 n2 = n2 >> 1; in arm_radix2_butterfly_q15()
182 for (j = 0; j < n2; j++) in arm_radix2_butterfly_q15()
191 l = i + n2; in arm_radix2_butterfly_q15()
[all …]
|
| D | arm_cfft_radix2_q31.c | 97 unsigned n1, n2, ia; in arm_radix2_butterfly_q31() local
102 n2 = fftLen; in arm_radix2_butterfly_q31()
104 n1 = n2; in arm_radix2_butterfly_q31()
105 n2 = n2 >> 1; in arm_radix2_butterfly_q31()
109 for (i = 0; i < n2; i++) in arm_radix2_butterfly_q31()
115 l = i + n2; in arm_radix2_butterfly_q31()
138 n1 = n2; in arm_radix2_butterfly_q31()
139 n2 = n2 >> 1; in arm_radix2_butterfly_q31()
143 for (j = 0; j < n2; j++) in arm_radix2_butterfly_q31()
154 l = i + n2; in arm_radix2_butterfly_q31()
[all …]
|
| D | arm_cfft_radix2_f32.c | 121 uint32_t n1, n2, ia; in arm_radix2_butterfly_f32() local
129 n2 = fftLen >> 1; in arm_radix2_butterfly_f32()
134 for (k = n2; k > 0; k--) in arm_radix2_butterfly_f32()
144 l = i + n2; in arm_radix2_butterfly_f32()
170 for (k = n2; k > 2; k = k >> 1) in arm_radix2_butterfly_f32()
172 n1 = n2; in arm_radix2_butterfly_f32()
173 n2 = n2 >> 1; in arm_radix2_butterfly_f32()
188 l = i + n2; in arm_radix2_butterfly_f32()
209 } while ( j < n2); // groups loop end in arm_radix2_butterfly_f32()
230 n2 = fftLen; in arm_radix2_butterfly_f32()
[all …]
|
| D | arm_cfft_radix2_f16.c | 123 uint32_t n1, n2, ia; in arm_radix2_butterfly_f16() local
131 n2 = fftLen >> 1; in arm_radix2_butterfly_f16()
136 for (k = n2; k > 0; k--) in arm_radix2_butterfly_f16()
146 l = i + n2; in arm_radix2_butterfly_f16()
172 for (k = n2; k > 2; k = k >> 1) in arm_radix2_butterfly_f16()
174 n1 = n2; in arm_radix2_butterfly_f16()
175 n2 = n2 >> 1; in arm_radix2_butterfly_f16()
190 l = i + n2; in arm_radix2_butterfly_f16()
211 } while ( j < n2); // groups loop end in arm_radix2_butterfly_f16()
232 n2 = fftLen; in arm_radix2_butterfly_f16()
[all …]
|
| D | arm_cfft_q31.c | 48 uint32_t n1, n2; in _arm_radix4_butterfly_q31_mve() local
61 n2 = fftLen; in _arm_radix4_butterfly_q31_mve()
62 n1 = n2; in _arm_radix4_butterfly_q31_mve()
63 n2 >>= 2u; in _arm_radix4_butterfly_q31_mve()
79 q31_t *inB = inA + n2 * CMPLX_DIM; in _arm_radix4_butterfly_q31_mve()
80 q31_t *inC = inB + n2 * CMPLX_DIM; in _arm_radix4_butterfly_q31_mve()
81 q31_t *inD = inC + n2 * CMPLX_DIM; in _arm_radix4_butterfly_q31_mve()
87 blkCnt = n2 / 2; in _arm_radix4_butterfly_q31_mve()
153 n1 = n2; in _arm_radix4_butterfly_q31_mve()
154 n2 >>= 2u; in _arm_radix4_butterfly_q31_mve()
[all …]
|
| D | arm_cfft_q15.c | 46 uint32_t n1, n2; in _arm_radix4_butterfly_q15_mve() local
58 n2 = fftLen; in _arm_radix4_butterfly_q15_mve()
59 n1 = n2; in _arm_radix4_butterfly_q15_mve()
60 n2 >>= 2u; in _arm_radix4_butterfly_q15_mve()
76 q15_t *inB = inA + n2 * CMPLX_DIM; in _arm_radix4_butterfly_q15_mve()
77 q15_t *inC = inB + n2 * CMPLX_DIM; in _arm_radix4_butterfly_q15_mve()
78 q15_t *inD = inC + n2 * CMPLX_DIM; in _arm_radix4_butterfly_q15_mve()
84 blkCnt = n2 / 4; in _arm_radix4_butterfly_q15_mve()
151 n1 = n2; in _arm_radix4_butterfly_q15_mve()
152 n2 >>= 2u; in _arm_radix4_butterfly_q15_mve()
[all …]
|
| /third_party/openssl/crypto/bn/ |
| D | bn_mul.c | 175 void bn_mul_recursive(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n2, in bn_mul_recursive() argument
178 int n = n2 / 2, c1, c2; in bn_mul_recursive()
185 if (n2 == 4) { in bn_mul_recursive()
194 if (n2 == 8 && dna == 0 && dnb == 0) { in bn_mul_recursive()
200 if (n2 < BN_MUL_RECURSIVE_SIZE_NORMAL) { in bn_mul_recursive()
201 bn_mul_normal(r, a, n2 + dna, b, n2 + dnb); in bn_mul_recursive()
203 memset(&r[2 * n2 + dna + dnb], 0, in bn_mul_recursive()
247 bn_mul_comba4(&(t[n2]), t, &(t[n])); in bn_mul_recursive()
249 memset(&t[n2], 0, sizeof(*t) * 8); in bn_mul_recursive()
252 bn_mul_comba4(&(r[n2]), &(a[n]), &(b[n])); in bn_mul_recursive()
[all …]
|
| D | bn_sqr.c | 156 void bn_sqr_recursive(BN_ULONG *r, const BN_ULONG *a, int n2, BN_ULONG *t) in bn_sqr_recursive() argument
158 int n = n2 / 2; in bn_sqr_recursive()
162 if (n2 == 4) { in bn_sqr_recursive()
169 } else if (n2 == 8) { in bn_sqr_recursive()
177 if (n2 < BN_SQR_RECURSIVE_SIZE_NORMAL) { in bn_sqr_recursive()
178 bn_sqr_normal(r, a, n2, t); in bn_sqr_recursive()
192 p = &(t[n2 * 2]); in bn_sqr_recursive()
195 bn_sqr_recursive(&(t[n2]), t, n, p); in bn_sqr_recursive()
197 memset(&t[n2], 0, sizeof(*t) * n2); in bn_sqr_recursive()
199 bn_sqr_recursive(&(r[n2]), &(a[n]), n, p); in bn_sqr_recursive()
[all …]
|
| /third_party/selinux/libsepol/src/ |
| D | ebitmap.c | 20 const ebitmap_node_t *n1, *n2; in ebitmap_or() local
26 n2 = e2->node; in ebitmap_or()
28 while (n1 || n2) { in ebitmap_or()
35 if (n1 && n2 && n1->startbit == n2->startbit) { in ebitmap_or()
37 new->map = n1->map | n2->map; in ebitmap_or()
39 n2 = n2->next; in ebitmap_or()
40 } else if (!n2 || (n1 && n1->startbit < n2->startbit)) { in ebitmap_or()
45 new->startbit = n2->startbit; in ebitmap_or()
46 new->map = n2->map; in ebitmap_or()
47 n2 = n2->next; in ebitmap_or()
[all …]
|
| /third_party/skia/third_party/externals/dawn/src/tests/unittests/ |
| D | LinkedListTests.cpp | 108 Node n2(2); in TEST() local
109 list.Append(&n2); in TEST()
112 EXPECT_EQ(&n2, list.tail()); in TEST()
133 Node n2(2); in TEST() local
139 list.Append(&n2); in TEST()
174 EXPECT_EQ(&n2, list.head()); in TEST()
182 n2.RemoveFromList(); in TEST()
191 list.Append(&n2); in TEST()
208 Node n2(2); in TEST() local
213 list.Append(&n2); in TEST()
[all …]
|
| /third_party/flutter/skia/third_party/externals/icu/source/common/ |
| D | unorm.cpp | 51 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, *pErrorCode); in unorm_quickCheck() local
52 return unorm2_quickCheck((const UNormalizer2 *)n2, src, srcLength, pErrorCode); in unorm_quickCheck()
59 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, *pErrorCode); in unorm_quickCheckWithOptions() local
61 FilteredNormalizer2 fn2(*n2, *uniset_getUnicode32Instance(*pErrorCode)); in unorm_quickCheckWithOptions()
66 return unorm2_quickCheck((const UNormalizer2 *)n2, src, srcLength, pErrorCode); in unorm_quickCheckWithOptions()
74 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, *pErrorCode); in unorm_isNormalized() local
75 return unorm2_isNormalized((const UNormalizer2 *)n2, src, srcLength, pErrorCode); in unorm_isNormalized()
82 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, *pErrorCode); in unorm_isNormalizedWithOptions() local
84 FilteredNormalizer2 fn2(*n2, *uniset_getUnicode32Instance(*pErrorCode)); in unorm_isNormalizedWithOptions()
89 return unorm2_isNormalized((const UNormalizer2 *)n2, src, srcLength, pErrorCode); in unorm_isNormalizedWithOptions()
[all …]
|
| /third_party/skia/third_party/externals/icu/source/common/ |
| D | unorm.cpp | 51 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, *pErrorCode); in unorm_quickCheck() local
52 return unorm2_quickCheck((const UNormalizer2 *)n2, src, srcLength, pErrorCode); in unorm_quickCheck()
59 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, *pErrorCode); in unorm_quickCheckWithOptions() local
61 FilteredNormalizer2 fn2(*n2, *uniset_getUnicode32Instance(*pErrorCode)); in unorm_quickCheckWithOptions()
66 return unorm2_quickCheck((const UNormalizer2 *)n2, src, srcLength, pErrorCode); in unorm_quickCheckWithOptions()
74 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, *pErrorCode); in unorm_isNormalized() local
75 return unorm2_isNormalized((const UNormalizer2 *)n2, src, srcLength, pErrorCode); in unorm_isNormalized()
82 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, *pErrorCode); in unorm_isNormalizedWithOptions() local
84 FilteredNormalizer2 fn2(*n2, *uniset_getUnicode32Instance(*pErrorCode)); in unorm_isNormalizedWithOptions()
89 return unorm2_isNormalized((const UNormalizer2 *)n2, src, srcLength, pErrorCode); in unorm_isNormalizedWithOptions()
[all …]
|
| /third_party/icu/icu4c/source/common/ |
| D | unorm.cpp | 51 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, *pErrorCode); in unorm_quickCheck() local
52 return unorm2_quickCheck((const UNormalizer2 *)n2, src, srcLength, pErrorCode); in unorm_quickCheck()
59 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, *pErrorCode); in unorm_quickCheckWithOptions() local
61 FilteredNormalizer2 fn2(*n2, *uniset_getUnicode32Instance(*pErrorCode)); in unorm_quickCheckWithOptions()
66 return unorm2_quickCheck((const UNormalizer2 *)n2, src, srcLength, pErrorCode); in unorm_quickCheckWithOptions()
74 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, *pErrorCode); in unorm_isNormalized() local
75 return unorm2_isNormalized((const UNormalizer2 *)n2, src, srcLength, pErrorCode); in unorm_isNormalized()
82 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, *pErrorCode); in unorm_isNormalizedWithOptions() local
84 FilteredNormalizer2 fn2(*n2, *uniset_getUnicode32Instance(*pErrorCode)); in unorm_isNormalizedWithOptions()
89 return unorm2_isNormalized((const UNormalizer2 *)n2, src, srcLength, pErrorCode); in unorm_isNormalizedWithOptions()
[all …]
|
| /third_party/node/deps/icu-small/source/common/ |
| D | unorm.cpp | 51 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, *pErrorCode); in unorm_quickCheck() local
52 return unorm2_quickCheck((const UNormalizer2 *)n2, src, srcLength, pErrorCode); in unorm_quickCheck()
59 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, *pErrorCode); in unorm_quickCheckWithOptions() local
61 FilteredNormalizer2 fn2(*n2, *uniset_getUnicode32Instance(*pErrorCode)); in unorm_quickCheckWithOptions()
66 return unorm2_quickCheck((const UNormalizer2 *)n2, src, srcLength, pErrorCode); in unorm_quickCheckWithOptions()
74 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, *pErrorCode); in unorm_isNormalized() local
75 return unorm2_isNormalized((const UNormalizer2 *)n2, src, srcLength, pErrorCode); in unorm_isNormalized()
82 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, *pErrorCode); in unorm_isNormalizedWithOptions() local
84 FilteredNormalizer2 fn2(*n2, *uniset_getUnicode32Instance(*pErrorCode)); in unorm_isNormalizedWithOptions()
89 return unorm2_isNormalized((const UNormalizer2 *)n2, src, srcLength, pErrorCode); in unorm_isNormalizedWithOptions()
[all …]
|
| /third_party/glslang/Test/baseResults/ |
| D | spv.offsets.frag.out | 19 Name 12 "n2"
20 MemberName 12(n2) 0 "e"
21 MemberName 12(n2) 1 "f"
22 MemberName 12(n2) 2 "g"
23 MemberName 12(n2) 3 "h"
32 MemberDecorate 12(n2) 0 Offset 32
33 MemberDecorate 12(n2) 1 Offset 48
34 MemberDecorate 12(n2) 2 Offset 16
35 MemberDecorate 12(n2) 3 Offset 0
36 Decorate 12(n2) BufferBlock
[all …]
|
| /third_party/boost/libs/random/test/ |
| D | statistic_tests.cpp | 59 void run(RNG & rng, int n1, int n2) in run() argument
66 experiment_generator(equi, uint_linear, n1), n2)); in run()
68 experiment_generator(equi, uint_linear, n1), 2*n2)); in run()
76 experiment_generator(equi_2d, uint_square, n1), n2)); in run()
78 experiment_generator(equi_2d, uint_square, n1), 2*n2)); in run()
96 void run(RNG & rng, int n1, int n2) in run() argument
99 run(rng, ud, n1, n2); in run()
102 void run(RNG & rng, const Dist& dist, int n1, int n2) in run() argument
108 ks_experiment_generator(ks, rng, dist), n2)); in run()
110 ks_experiment_generator(ks, rng, dist), 2*n2)); in run()
[all …]
|