| /dports/net/samba412/samba-4.12.15/lib/util/ |
| H A D | ms_fnmatch.c | 50 struct max_n { struct
62 struct max_n *max_n, const char *ldot, in ms_fnmatch_core() argument
75 if (max_n != NULL && max_n->predot && in ms_fnmatch_core()
85 if (max_n != NULL && (!max_n->predot || in ms_fnmatch_core()
87 max_n->predot = n; in ms_fnmatch_core()
95 if (max_n != NULL && max_n->predot && in ms_fnmatch_core()
99 if (max_n != NULL && max_n->postdot && in ms_fnmatch_core()
117 if (max_n != NULL && (!max_n->predot || in ms_fnmatch_core()
119 max_n->predot = n; in ms_fnmatch_core()
229 struct max_n max_n[count]; in ms_fnmatch_protocol() local
[all …]
|
| /dports/net/samba412/samba-4.12.15/source3/lib/ |
| H A D | ms_fnmatch.c | 45 struct max_n { struct
57 struct max_n *max_n, const smb_ucs2_t *ldot, in ms_fnmatch_core() argument
67 if (max_n->predot && max_n->predot <= n) { in ms_fnmatch_core()
75 if (!max_n->predot || max_n->predot > n) max_n->predot = n; in ms_fnmatch_core()
82 if (max_n->predot && max_n->predot <= n) { in ms_fnmatch_core()
85 if (max_n->postdot && max_n->postdot <= n && n <= ldot) { in ms_fnmatch_core()
92 if (!max_n->postdot || max_n->postdot > n) max_n->postdot = n; in ms_fnmatch_core()
96 if (!max_n->predot || max_n->predot > n) max_n->predot = n; in ms_fnmatch_core()
155 struct max_n *max_n = NULL; in ms_fnmatch() local
216 max_n = SMB_CALLOC_ARRAY(struct max_n, count); in ms_fnmatch()
[all …]
|
| /dports/net-mgmt/wmi-client/wmi-1.3.16/Samba/source/lib/util/ |
| H A D | ms_fnmatch.c | 50 struct max_n { struct
62 struct max_n *max_n, const char *ldot) in ms_fnmatch_core() argument
74 if (max_n->predot && max_n->predot <= n) { in ms_fnmatch_core()
83 if (!max_n->predot || max_n->predot > n) max_n->predot = n; in ms_fnmatch_core()
90 if (max_n->predot && max_n->predot <= n) { in ms_fnmatch_core()
93 if (max_n->postdot && max_n->postdot <= n && n <= ldot) { in ms_fnmatch_core()
101 if (!max_n->postdot || max_n->postdot > n) max_n->postdot = n; in ms_fnmatch_core()
105 if (!max_n->predot || max_n->predot > n) max_n->predot = n; in ms_fnmatch_core()
161 struct max_n *max_n = NULL; in ms_fnmatch() local
205 max_n = talloc_array(NULL, struct max_n, count); in ms_fnmatch()
[all …]
|
| /dports/math/py-yt/yt-4.0.1/yt/frontends/enzo_e/tests/ |
| H A D | test_misc.py | 13 if max_n == 1:
16 elif max_n < 1:
22 max_l = int(np.log2(max_n))
75 max_n = 64
77 n, l, b = get_random_block_string(max_n=max_n, random_state=rs)
80 assert left == float(n) / max_n
93 max_n = 2 ** i
94 n1, l1, b1 = get_random_block_string(max_n=max_n, random_state=rs, level=0)
99 assert nrb == max_n
108 max_n = 2 ** i
[all …]
|
| /dports/math/p5-Algorithm-Combinatorics/Algorithm-Combinatorics-0.27/ |
| H A D | Combinatorics.xs | 52 offset = max_n - len_tuple; in __next_combination()
81 if (n < max_n) { in __next_combination_with_repetition()
114 while (++n <= max_n) { in __next_variation()
208 I32 max_n, j, h, k; in __next_permutation() local
211 max_n = av_len(tuple); in __next_permutation()
277 max_n = av_len(tuple); in __next_derangement()
278 min_j = max_n; in __next_derangement()
435 int max_n
440 int max_n
446 int max_n
[all …]
|
| /dports/devel/p5-InlineX-CPP2XS/InlineX-CPP2XS-0.25/demos/cpp2xs_utility/src/ |
| H A D | FastSieve.cpp | 41 std::vector<bool>::size_type max_n; member in _Sieve
53 max_n = 0UL; in _Sieve()
68 if( n < 2 || n > max_n ) return false; // Bounds checking. in isprime()
97 upper > max_n || // upper exceeds upper bound. in ranged_primes()
98 lower > max_n || // lower exceeds upper bound. in ranged_primes()
122 if( n < 2 || n > max_n ) return 0; // Bounds checking. in nearest_le()
142 if( n > max_n ) return 0UL; // Bounds checking. in nearest_ge()
144 std::vector<bool>::size_type max_idx = max_n/2; in nearest_ge()
174 num_primes = this->count_le( max_n ); in count_sieve()
183 if( n <= 1 || n > max_n ) return 0UL; in count_le()
[all …]
|
| /dports/devel/llvm-cheri/llvm-project-37c49ff00e3eadce5d8703fdc4497f28458c64a8/pstl/test/std/algorithms/alg.sorting/alg.lex.comparison/ |
| H A D | lexicographical_compare.pass.cpp | 50 const std::size_t max_n = 1000000; in test() local
51 Sequence<T1> in1(max_n, [](std::size_t k) { return T1(k); }); in test()
57 …_all_policies(test_one_policy(), in1.cbegin(), in1.cbegin() + max_n, in2.cbegin() + 3 * max_n / 10, in test()
58 in2.cbegin() + 5 * max_n / 10); in test()
61 std::size_t max_n2 = max_n / 10; in test()
68 max_n2 = 2 * max_n; in test()
98 const std::size_t max_n = 1000000; in test_string() local
101 for (std::size_t n1 = 0; n1 <= max_n; ++n1) in test_string()
106 for (std::size_t n1 = 0; n1 <= 2 * max_n; ++n1) in test_string()
128 …_all_policies(test_one_policy(), in1.cbegin(), in1.cbegin() + max_n, in2.cbegin() + 3 * max_n / 10, in test_string()
[all …]
|
| /dports/devel/llvm-devel/llvm-project-f05c95f10fc1d8171071735af8ad3a9e87633120/pstl/test/std/algorithms/alg.sorting/alg.lex.comparison/ |
| H A D | lexicographical_compare.pass.cpp | 50 const std::size_t max_n = 1000000; in test() local
51 Sequence<T1> in1(max_n, [](std::size_t k) { return T1(k); }); in test()
57 …_all_policies(test_one_policy(), in1.cbegin(), in1.cbegin() + max_n, in2.cbegin() + 3 * max_n / 10, in test()
58 in2.cbegin() + 5 * max_n / 10); in test()
61 std::size_t max_n2 = max_n / 10; in test()
68 max_n2 = 2 * max_n; in test()
98 const std::size_t max_n = 1000000; in test_string() local
101 for (std::size_t n1 = 0; n1 <= max_n; ++n1) in test_string()
106 for (std::size_t n1 = 0; n1 <= 2 * max_n; ++n1) in test_string()
128 …_all_policies(test_one_policy(), in1.cbegin(), in1.cbegin() + max_n, in2.cbegin() + 3 * max_n / 10, in test_string()
[all …]
|
| /dports/lang/gcc11/gcc-11.2.0/libstdc++-v3/testsuite/25_algorithms/pstl/alg_sorting/ |
| H A D | lexicographical_compare.cc | 59 const std::size_t max_n = 1000000; in test() local
60 Sequence<T1> in1(max_n, [](std::size_t k) { return T1(k); }); in test()
66 …_all_policies(test_one_policy(), in1.cbegin(), in1.cbegin() + max_n, in2.cbegin() + 3 * max_n / 10, in test()
67 in2.cbegin() + 5 * max_n / 10); in test()
70 std::size_t max_n2 = max_n / 10; in test()
77 max_n2 = 2 * max_n; in test()
107 const std::size_t max_n = 1000000; in test_string() local
110 for (std::size_t n1 = 0; n1 <= max_n; ++n1) in test_string()
115 for (std::size_t n1 = 0; n1 <= 2 * max_n; ++n1) in test_string()
137 …_all_policies(test_one_policy(), in1.cbegin(), in1.cbegin() + max_n, in2.cbegin() + 3 * max_n / 10, in test_string()
[all …]
|
| /dports/lang/gcc12-devel/gcc-12-20211205/libstdc++-v3/testsuite/25_algorithms/pstl/alg_sorting/ |
| H A D | lexicographical_compare.cc | 59 const std::size_t max_n = 1000000; in test() local
60 Sequence<T1> in1(max_n, [](std::size_t k) { return T1(k); }); in test()
66 …_all_policies(test_one_policy(), in1.cbegin(), in1.cbegin() + max_n, in2.cbegin() + 3 * max_n / 10, in test()
67 in2.cbegin() + 5 * max_n / 10); in test()
70 std::size_t max_n2 = max_n / 10; in test()
77 max_n2 = 2 * max_n; in test()
107 const std::size_t max_n = 1000000; in test_string() local
110 for (std::size_t n1 = 0; n1 <= max_n; ++n1) in test_string()
115 for (std::size_t n1 = 0; n1 <= 2 * max_n; ++n1) in test_string()
137 …_all_policies(test_one_policy(), in1.cbegin(), in1.cbegin() + max_n, in2.cbegin() + 3 * max_n / 10, in test_string()
[all …]
|
| /dports/lang/gcc10/gcc-10.3.0/libstdc++-v3/testsuite/25_algorithms/pstl/alg_sorting/ |
| H A D | lexicographical_compare.cc | 59 const std::size_t max_n = 1000000; in test() local
60 Sequence<T1> in1(max_n, [](std::size_t k) { return T1(k); }); in test()
66 …_all_policies(test_one_policy(), in1.cbegin(), in1.cbegin() + max_n, in2.cbegin() + 3 * max_n / 10, in test()
67 in2.cbegin() + 5 * max_n / 10); in test()
70 std::size_t max_n2 = max_n / 10; in test()
77 max_n2 = 2 * max_n; in test()
107 const std::size_t max_n = 1000000; in test_string() local
110 for (std::size_t n1 = 0; n1 <= max_n; ++n1) in test_string()
115 for (std::size_t n1 = 0; n1 <= 2 * max_n; ++n1) in test_string()
137 …_all_policies(test_one_policy(), in1.cbegin(), in1.cbegin() + max_n, in2.cbegin() + 3 * max_n / 10, in test_string()
[all …]
|
| /dports/lang/gcc11-devel/gcc-11-20211009/libstdc++-v3/testsuite/25_algorithms/pstl/alg_sorting/ |
| H A D | lexicographical_compare.cc | 59 const std::size_t max_n = 1000000; in test() local
60 Sequence<T1> in1(max_n, [](std::size_t k) { return T1(k); }); in test()
66 …_all_policies(test_one_policy(), in1.cbegin(), in1.cbegin() + max_n, in2.cbegin() + 3 * max_n / 10, in test()
67 in2.cbegin() + 5 * max_n / 10); in test()
70 std::size_t max_n2 = max_n / 10; in test()
77 max_n2 = 2 * max_n; in test()
107 const std::size_t max_n = 1000000; in test_string() local
110 for (std::size_t n1 = 0; n1 <= max_n; ++n1) in test_string()
115 for (std::size_t n1 = 0; n1 <= 2 * max_n; ++n1) in test_string()
137 …_all_policies(test_one_policy(), in1.cbegin(), in1.cbegin() + max_n, in2.cbegin() + 3 * max_n / 10, in test_string()
[all …]
|
| /dports/devel/avr-gcc/gcc-10.2.0/libstdc++-v3/testsuite/25_algorithms/pstl/alg_sorting/ |
| H A D | lexicographical_compare.cc | 58 const std::size_t max_n = 1000000; in test() local
59 Sequence<T1> in1(max_n, [](std::size_t k) { return T1(k); }); in test()
65 …_all_policies(test_one_policy(), in1.cbegin(), in1.cbegin() + max_n, in2.cbegin() + 3 * max_n / 10, in test()
66 in2.cbegin() + 5 * max_n / 10); in test()
69 std::size_t max_n2 = max_n / 10; in test()
76 max_n2 = 2 * max_n; in test()
106 const std::size_t max_n = 1000000; in test_string() local
109 for (std::size_t n1 = 0; n1 <= max_n; ++n1) in test_string()
114 for (std::size_t n1 = 0; n1 <= 2 * max_n; ++n1) in test_string()
136 …_all_policies(test_one_policy(), in1.cbegin(), in1.cbegin() + max_n, in2.cbegin() + 3 * max_n / 10, in test_string()
[all …]
|
| /dports/lang/gcc9-devel/gcc-9-20211007/libstdc++-v3/testsuite/25_algorithms/pstl/alg_sorting/ |
| H A D | lexicographical_compare.cc | 58 const std::size_t max_n = 1000000; in test() local
59 Sequence<T1> in1(max_n, [](std::size_t k) { return T1(k); }); in test()
65 …_all_policies(test_one_policy(), in1.cbegin(), in1.cbegin() + max_n, in2.cbegin() + 3 * max_n / 10, in test()
66 in2.cbegin() + 5 * max_n / 10); in test()
69 std::size_t max_n2 = max_n / 10; in test()
76 max_n2 = 2 * max_n; in test()
106 const std::size_t max_n = 1000000; in test_string() local
109 for (std::size_t n1 = 0; n1 <= max_n; ++n1) in test_string()
114 for (std::size_t n1 = 0; n1 <= 2 * max_n; ++n1) in test_string()
136 …_all_policies(test_one_policy(), in1.cbegin(), in1.cbegin() + max_n, in2.cbegin() + 3 * max_n / 10, in test_string()
[all …]
|
| /dports/lang/gcc9/gcc-9.4.0/libstdc++-v3/testsuite/25_algorithms/pstl/alg_sorting/ |
| H A D | lexicographical_compare.cc | 58 const std::size_t max_n = 1000000; in test() local
59 Sequence<T1> in1(max_n, [](std::size_t k) { return T1(k); }); in test()
65 …_all_policies(test_one_policy(), in1.cbegin(), in1.cbegin() + max_n, in2.cbegin() + 3 * max_n / 10, in test()
66 in2.cbegin() + 5 * max_n / 10); in test()
69 std::size_t max_n2 = max_n / 10; in test()
76 max_n2 = 2 * max_n; in test()
106 const std::size_t max_n = 1000000; in test_string() local
109 for (std::size_t n1 = 0; n1 <= max_n; ++n1) in test_string()
114 for (std::size_t n1 = 0; n1 <= 2 * max_n; ++n1) in test_string()
136 …_all_policies(test_one_policy(), in1.cbegin(), in1.cbegin() + max_n, in2.cbegin() + 3 * max_n / 10, in test_string()
[all …]
|
| /dports/devel/wasi-compiler-rt12/llvm-project-12.0.1.src/pstl/test/std/algorithms/alg.sorting/alg.lex.comparison/ |
| H A D | lexicographical_compare.pass.cpp | 50 const std::size_t max_n = 1000000; in test() local
51 Sequence<T1> in1(max_n, [](std::size_t k) { return T1(k); }); in test()
57 …_all_policies(test_one_policy(), in1.cbegin(), in1.cbegin() + max_n, in2.cbegin() + 3 * max_n / 10, in test()
58 in2.cbegin() + 5 * max_n / 10); in test()
61 std::size_t max_n2 = max_n / 10; in test()
68 max_n2 = 2 * max_n; in test()
98 const std::size_t max_n = 1000000; in test_string() local
101 for (std::size_t n1 = 0; n1 <= max_n; ++n1) in test_string()
106 for (std::size_t n1 = 0; n1 <= 2 * max_n; ++n1) in test_string()
128 …_all_policies(test_one_policy(), in1.cbegin(), in1.cbegin() + max_n, in2.cbegin() + 3 * max_n / 10, in test_string()
[all …]
|
| /dports/devel/wasi-compiler-rt13/llvm-project-13.0.1.src/pstl/test/std/algorithms/alg.sorting/alg.lex.comparison/ |
| H A D | lexicographical_compare.pass.cpp | 50 const std::size_t max_n = 1000000; in test() local
51 Sequence<T1> in1(max_n, [](std::size_t k) { return T1(k); }); in test()
57 …_all_policies(test_one_policy(), in1.cbegin(), in1.cbegin() + max_n, in2.cbegin() + 3 * max_n / 10, in test()
58 in2.cbegin() + 5 * max_n / 10); in test()
61 std::size_t max_n2 = max_n / 10; in test()
68 max_n2 = 2 * max_n; in test()
98 const std::size_t max_n = 1000000; in test_string() local
101 for (std::size_t n1 = 0; n1 <= max_n; ++n1) in test_string()
106 for (std::size_t n1 = 0; n1 <= 2 * max_n; ++n1) in test_string()
128 …_all_policies(test_one_policy(), in1.cbegin(), in1.cbegin() + max_n, in2.cbegin() + 3 * max_n / 10, in test_string()
[all …]
|
| /dports/lang/gcc10-devel/gcc-10-20211008/libstdc++-v3/testsuite/25_algorithms/pstl/alg_sorting/ |
| H A D | lexicographical_compare.cc | 59 const std::size_t max_n = 1000000; in test() local
60 Sequence<T1> in1(max_n, [](std::size_t k) { return T1(k); }); in test()
66 …_all_policies(test_one_policy(), in1.cbegin(), in1.cbegin() + max_n, in2.cbegin() + 3 * max_n / 10, in test()
67 in2.cbegin() + 5 * max_n / 10); in test()
70 std::size_t max_n2 = max_n / 10; in test()
77 max_n2 = 2 * max_n; in test()
107 const std::size_t max_n = 1000000; in test_string() local
110 for (std::size_t n1 = 0; n1 <= max_n; ++n1) in test_string()
115 for (std::size_t n1 = 0; n1 <= 2 * max_n; ++n1) in test_string()
137 …_all_policies(test_one_policy(), in1.cbegin(), in1.cbegin() + max_n, in2.cbegin() + 3 * max_n / 10, in test_string()
[all …]
|
| /dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/llvm/pstl/test/std/algorithms/alg.sorting/alg.lex.comparison/ |
| H A D | lexicographical_compare.pass.cpp | 50 const std::size_t max_n = 1000000; in test() local
51 Sequence<T1> in1(max_n, [](std::size_t k) { return T1(k); }); in test()
57 …_all_policies(test_one_policy(), in1.cbegin(), in1.cbegin() + max_n, in2.cbegin() + 3 * max_n / 10, in test()
58 in2.cbegin() + 5 * max_n / 10); in test()
61 std::size_t max_n2 = max_n / 10; in test()
68 max_n2 = 2 * max_n; in test()
98 const std::size_t max_n = 1000000; in test_string() local
101 for (std::size_t n1 = 0; n1 <= max_n; ++n1) in test_string()
106 for (std::size_t n1 = 0; n1 <= 2 * max_n; ++n1) in test_string()
128 …_all_policies(test_one_policy(), in1.cbegin(), in1.cbegin() + max_n, in2.cbegin() + 3 * max_n / 10, in test_string()
[all …]
|
| /dports/devel/tinygo/tinygo-0.14.1/llvm-project/pstl/test/std/algorithms/alg.sorting/alg.lex.comparison/ |
| H A D | lexicographical_compare.pass.cpp | 50 const std::size_t max_n = 1000000; in test() local
51 Sequence<T1> in1(max_n, [](std::size_t k) { return T1(k); }); in test()
57 …_all_policies(test_one_policy(), in1.cbegin(), in1.cbegin() + max_n, in2.cbegin() + 3 * max_n / 10, in test()
58 in2.cbegin() + 5 * max_n / 10); in test()
61 std::size_t max_n2 = max_n / 10; in test()
68 max_n2 = 2 * max_n; in test()
98 const std::size_t max_n = 1000000; in test_string() local
101 for (std::size_t n1 = 0; n1 <= max_n; ++n1) in test_string()
106 for (std::size_t n1 = 0; n1 <= 2 * max_n; ++n1) in test_string()
128 …_all_policies(test_one_policy(), in1.cbegin(), in1.cbegin() + max_n, in2.cbegin() + 3 * max_n / 10, in test_string()
[all …]
|
| /dports/misc/cxx_atomics_pic/gcc-11.2.0/libstdc++-v3/testsuite/25_algorithms/pstl/alg_sorting/ |
| H A D | lexicographical_compare.cc | 59 const std::size_t max_n = 1000000; in test() local
60 Sequence<T1> in1(max_n, [](std::size_t k) { return T1(k); }); in test()
66 …_all_policies(test_one_policy(), in1.cbegin(), in1.cbegin() + max_n, in2.cbegin() + 3 * max_n / 10, in test()
67 in2.cbegin() + 5 * max_n / 10); in test()
70 std::size_t max_n2 = max_n / 10; in test()
77 max_n2 = 2 * max_n; in test()
107 const std::size_t max_n = 1000000; in test_string() local
110 for (std::size_t n1 = 0; n1 <= max_n; ++n1) in test_string()
115 for (std::size_t n1 = 0; n1 <= 2 * max_n; ++n1) in test_string()
137 …_all_policies(test_one_policy(), in1.cbegin(), in1.cbegin() + max_n, in2.cbegin() + 3 * max_n / 10, in test_string()
[all …]
|
| /dports/devel/wasi-libcxx/llvm-project-13.0.1.src/pstl/test/std/algorithms/alg.sorting/alg.lex.comparison/ |
| H A D | lexicographical_compare.pass.cpp | 50 const std::size_t max_n = 1000000; in test() local
51 Sequence<T1> in1(max_n, [](std::size_t k) { return T1(k); }); in test()
57 …_all_policies(test_one_policy(), in1.cbegin(), in1.cbegin() + max_n, in2.cbegin() + 3 * max_n / 10, in test()
58 in2.cbegin() + 5 * max_n / 10); in test()
61 std::size_t max_n2 = max_n / 10; in test()
68 max_n2 = 2 * max_n; in test()
98 const std::size_t max_n = 1000000; in test_string() local
101 for (std::size_t n1 = 0; n1 <= max_n; ++n1) in test_string()
106 for (std::size_t n1 = 0; n1 <= 2 * max_n; ++n1) in test_string()
128 …_all_policies(test_one_policy(), in1.cbegin(), in1.cbegin() + max_n, in2.cbegin() + 3 * max_n / 10, in test_string()
[all …]
|
| /dports/devel/llvm12/llvm-project-12.0.1.src/pstl/test/std/algorithms/alg.sorting/alg.lex.comparison/ |
| H A D | lexicographical_compare.pass.cpp | 50 const std::size_t max_n = 1000000; in test() local
51 Sequence<T1> in1(max_n, [](std::size_t k) { return T1(k); }); in test()
57 …_all_policies(test_one_policy(), in1.cbegin(), in1.cbegin() + max_n, in2.cbegin() + 3 * max_n / 10, in test()
58 in2.cbegin() + 5 * max_n / 10); in test()
61 std::size_t max_n2 = max_n / 10; in test()
68 max_n2 = 2 * max_n; in test()
98 const std::size_t max_n = 1000000; in test_string() local
101 for (std::size_t n1 = 0; n1 <= max_n; ++n1) in test_string()
106 for (std::size_t n1 = 0; n1 <= 2 * max_n; ++n1) in test_string()
128 …_all_policies(test_one_policy(), in1.cbegin(), in1.cbegin() + max_n, in2.cbegin() + 3 * max_n / 10, in test_string()
[all …]
|
| /dports/devel/llvm13/llvm-project-13.0.1.src/pstl/test/std/algorithms/alg.sorting/alg.lex.comparison/ |
| H A D | lexicographical_compare.pass.cpp | 50 const std::size_t max_n = 1000000;
51 Sequence<T1> in1(max_n, [](std::size_t k) { return T1(k); });
57 …_all_policies(test_one_policy(), in1.cbegin(), in1.cbegin() + max_n, in2.cbegin() + 3 * max_n / 10,
58 in2.cbegin() + 5 * max_n / 10);
61 std::size_t max_n2 = max_n / 10;
68 max_n2 = 2 * max_n;
98 const std::size_t max_n = 1000000;
101 for (std::size_t n1 = 0; n1 <= max_n; ++n1)
106 for (std::size_t n1 = 0; n1 <= 2 * max_n; ++n1)
128 …_all_policies(test_one_policy(), in1.cbegin(), in1.cbegin() + max_n, in2.cbegin() + 3 * max_n / 10,
[all …]
|
| /dports/lang/gcc9-aux/gcc-9.1.0/libstdc++-v3/testsuite/25_algorithms/pstl/alg_sorting/ |
| H A D | lexicographical_compare.cc | 58 const std::size_t max_n = 1000000; in test() local
59 Sequence<T1> in1(max_n, [](std::size_t k) { return T1(k); }); in test()
65 …_all_policies(test_one_policy(), in1.cbegin(), in1.cbegin() + max_n, in2.cbegin() + 3 * max_n / 10, in test()
66 in2.cbegin() + 5 * max_n / 10); in test()
69 std::size_t max_n2 = max_n / 10; in test()
76 max_n2 = 2 * max_n; in test()
106 const std::size_t max_n = 1000000; in test_string() local
109 for (std::size_t n1 = 0; n1 <= max_n; ++n1) in test_string()
114 for (std::size_t n1 = 0; n1 <= 2 * max_n; ++n1) in test_string()
136 …_all_policies(test_one_policy(), in1.cbegin(), in1.cbegin() + max_n, in2.cbegin() + 3 * max_n / 10, in test_string()
[all …]
|