| /dports/finance/py-quantecon/quantecon-0.5.2/quantecon/markov/ |
| H A D | ddp.py | 759 max_iter=max_iter)
762 max_iter=max_iter)
770 max_iter=max_iter)
786 max_iter = self.max_iter
815 max_iter=max_iter)
829 max_iter = self.max_iter
854 max_iter=max_iter)
869 max_iter = self.max_iter
912 max_iter=max_iter,
925 max_iter = self.max_iter * self.num_states
[all …]
|
| /dports/devel/boost-docs/boost_1_72_0/libs/compute/test/ |
| H A D | test_extrema.cpp | 70 BOOST_CHECK(max_iter == vector.end() - 512); in BOOST_AUTO_TEST_CASE()
72 BOOST_CHECK_EQUAL(max_iter.read(queue), 513); in BOOST_AUTO_TEST_CASE()
115 BOOST_CHECK(max_iter == vector.end() - 512); in BOOST_AUTO_TEST_CASE()
273 BOOST_CHECK(max_iter == vector.end() - 1); in BOOST_AUTO_TEST_CASE()
274 BOOST_CHECK_EQUAL(*max_iter, 4999); in BOOST_AUTO_TEST_CASE()
285 max_iter = in BOOST_AUTO_TEST_CASE()
292 BOOST_CHECK_EQUAL(*max_iter, 3999); in BOOST_AUTO_TEST_CASE()
301 max_iter = in BOOST_AUTO_TEST_CASE()
303 BOOST_CHECK(max_iter == vector.end() - 1); in BOOST_AUTO_TEST_CASE()
304 BOOST_CHECK_EQUAL(*max_iter, 2499); in BOOST_AUTO_TEST_CASE()
[all …]
|
| /dports/devel/boost-python-libs/boost_1_72_0/libs/compute/test/ |
| H A D | test_extrema.cpp | 70 BOOST_CHECK(max_iter == vector.end() - 512); in BOOST_AUTO_TEST_CASE()
72 BOOST_CHECK_EQUAL(max_iter.read(queue), 513); in BOOST_AUTO_TEST_CASE()
115 BOOST_CHECK(max_iter == vector.end() - 512); in BOOST_AUTO_TEST_CASE()
273 BOOST_CHECK(max_iter == vector.end() - 1); in BOOST_AUTO_TEST_CASE()
274 BOOST_CHECK_EQUAL(*max_iter, 4999); in BOOST_AUTO_TEST_CASE()
285 max_iter = in BOOST_AUTO_TEST_CASE()
292 BOOST_CHECK_EQUAL(*max_iter, 3999); in BOOST_AUTO_TEST_CASE()
301 max_iter = in BOOST_AUTO_TEST_CASE()
303 BOOST_CHECK(max_iter == vector.end() - 1); in BOOST_AUTO_TEST_CASE()
304 BOOST_CHECK_EQUAL(*max_iter, 2499); in BOOST_AUTO_TEST_CASE()
[all …]
|
| /dports/devel/boost-libs/boost_1_72_0/libs/compute/test/ |
| H A D | test_extrema.cpp | 70 BOOST_CHECK(max_iter == vector.end() - 512); in BOOST_AUTO_TEST_CASE()
72 BOOST_CHECK_EQUAL(max_iter.read(queue), 513); in BOOST_AUTO_TEST_CASE()
115 BOOST_CHECK(max_iter == vector.end() - 512); in BOOST_AUTO_TEST_CASE()
273 BOOST_CHECK(max_iter == vector.end() - 1); in BOOST_AUTO_TEST_CASE()
274 BOOST_CHECK_EQUAL(*max_iter, 4999); in BOOST_AUTO_TEST_CASE()
285 max_iter = in BOOST_AUTO_TEST_CASE()
292 BOOST_CHECK_EQUAL(*max_iter, 3999); in BOOST_AUTO_TEST_CASE()
301 max_iter = in BOOST_AUTO_TEST_CASE()
303 BOOST_CHECK(max_iter == vector.end() - 1); in BOOST_AUTO_TEST_CASE()
304 BOOST_CHECK_EQUAL(*max_iter, 2499); in BOOST_AUTO_TEST_CASE()
[all …]
|
| /dports/devel/hyperscan/boost_1_75_0/libs/compute/test/ |
| H A D | test_extrema.cpp | 70 BOOST_CHECK(max_iter == vector.end() - 512); in BOOST_AUTO_TEST_CASE()
72 BOOST_CHECK_EQUAL(max_iter.read(queue), 513); in BOOST_AUTO_TEST_CASE()
115 BOOST_CHECK(max_iter == vector.end() - 512); in BOOST_AUTO_TEST_CASE()
273 BOOST_CHECK(max_iter == vector.end() - 1); in BOOST_AUTO_TEST_CASE()
274 BOOST_CHECK_EQUAL(*max_iter, 4999); in BOOST_AUTO_TEST_CASE()
285 max_iter = in BOOST_AUTO_TEST_CASE()
292 BOOST_CHECK_EQUAL(*max_iter, 3999); in BOOST_AUTO_TEST_CASE()
301 max_iter = in BOOST_AUTO_TEST_CASE()
303 BOOST_CHECK(max_iter == vector.end() - 1); in BOOST_AUTO_TEST_CASE()
304 BOOST_CHECK_EQUAL(*max_iter, 2499); in BOOST_AUTO_TEST_CASE()
[all …]
|
| /dports/science/py-nilearn/nilearn-0.8.1/nilearn/decoding/tests/ |
| H A D | test_same_api.py | 117 max_iter=max_iter)[0]
119 max_iter=max_iter,
127 max_iter=max_iter, standardize=standardize).fit(X, y)
130 max_iter=max_iter, standardize=standardize).fit(X, y)
156 max_iter=max_iter)[0]
158 max_iter=max_iter)[0]
163 max_iter=max_iter,
172 max_iter=max_iter,
196 max_iter = 20
200 penalty="graph-net", max_iter=max_iter,
[all …]
|
| /dports/science/py-scikit-learn/scikit-learn-1.0.2/sklearn/svm/ |
| H A D | _classes.py | 204 max_iter=1000, argument
215 self.max_iter = max_iter
444 self.max_iter = max_iter
745 max_iter=-1, argument
764 max_iter=max_iter,
999 max_iter=-1, argument
1018 max_iter=max_iter,
1200 max_iter=-1, argument
1217 max_iter=max_iter,
1387 max_iter=-1, argument
[all …]
|
| /dports/science/py-scikit-learn/scikit-learn-1.0.2/sklearn/neural_network/tests/ |
| H A D | test_mlp.py | 95 max_iter=1,
261 max_iter=150,
279 max_iter=150,
348 max_iter=1,
374 max_iter=150,
386 max_iter=150,
620 max_iter=1,
627 max_iter=1,
753 max_iter = 3
769 max_iter = 3000
[all …]
|
| /dports/games/frogatto/frogatto-1.3.1/MacOSJet/boost/include/boost/math/tools/ |
| H A D | roots.hpp | 154 max_iter -= count; in bisect()
160 if(max_iter > max_count) in bisect()
162 max_count = max_iter; in bisect()
196 boost::uintmax_t count(max_iter); in newton_raphson_iterate()
248 max_iter -= count; in newton_raphson_iterate()
254 if(max_iter > max_count) in newton_raphson_iterate()
256 max_count = max_iter; in newton_raphson_iterate()
408 max_iter -= count; in halley_iterate()
502 max_iter -= count; in schroeder_iterate()
508 if(max_iter > max_count) in schroeder_iterate()
[all …]
|
| /dports/databases/percona57-pam-for-mysql/boost_1_59_0/boost/math/tools/ |
| H A D | roots.hpp | 154 max_iter -= count; in bisect()
160 if(max_iter > max_count) in bisect()
162 max_count = max_iter; in bisect()
196 boost::uintmax_t count(max_iter); in newton_raphson_iterate()
248 max_iter -= count; in newton_raphson_iterate()
254 if(max_iter > max_count) in newton_raphson_iterate()
256 max_count = max_iter; in newton_raphson_iterate()
418 max_iter -= count; in halley_iterate()
512 max_iter -= count; in schroeder_iterate()
518 if(max_iter > max_count) in schroeder_iterate()
[all …]
|
| H A D | toms748_solve.hpp | 317 max_iter = 0; in toms748_solve()
454 max_iter -= count; in toms748_solve()
463 BOOST_MATH_LOG_COUNT(max_iter) in toms748_solve()
476 max_iter -= 2; in toms748_solve()
478 max_iter += 2; in toms748_solve()
551 max_iter -= count; in bracket_and_solve_root()
552 max_iter += 1; in bracket_and_solve_root()
580 max_iter -= count; in bracket_and_solve_root()
581 max_iter += 1; in bracket_and_solve_root()
591 max_iter += count; in bracket_and_solve_root()
[all …]
|
| /dports/databases/percona57-server/boost_1_59_0/boost/math/tools/ |
| H A D | roots.hpp | 154 max_iter -= count; in bisect()
160 if(max_iter > max_count) in bisect()
162 max_count = max_iter; in bisect()
196 boost::uintmax_t count(max_iter); in newton_raphson_iterate()
248 max_iter -= count; in newton_raphson_iterate()
254 if(max_iter > max_count) in newton_raphson_iterate()
256 max_count = max_iter; in newton_raphson_iterate()
418 max_iter -= count; in halley_iterate()
512 max_iter -= count; in schroeder_iterate()
518 if(max_iter > max_count) in schroeder_iterate()
[all …]
|
| /dports/databases/xtrabackup/boost_1_59_0/boost/math/tools/ |
| H A D | roots.hpp | 154 max_iter -= count; in bisect()
160 if(max_iter > max_count) in bisect()
162 max_count = max_iter; in bisect()
196 boost::uintmax_t count(max_iter); in newton_raphson_iterate()
248 max_iter -= count; in newton_raphson_iterate()
254 if(max_iter > max_count) in newton_raphson_iterate()
256 max_count = max_iter; in newton_raphson_iterate()
418 max_iter -= count; in halley_iterate()
512 max_iter -= count; in schroeder_iterate()
518 if(max_iter > max_count) in schroeder_iterate()
[all …]
|
| H A D | toms748_solve.hpp | 317 max_iter = 0; in toms748_solve()
454 max_iter -= count; in toms748_solve()
463 BOOST_MATH_LOG_COUNT(max_iter) in toms748_solve()
476 max_iter -= 2; in toms748_solve()
478 max_iter += 2; in toms748_solve()
551 max_iter -= count; in bracket_and_solve_root()
552 max_iter += 1; in bracket_and_solve_root()
580 max_iter -= count; in bracket_and_solve_root()
581 max_iter += 1; in bracket_and_solve_root()
591 max_iter += count; in bracket_and_solve_root()
[all …]
|
| /dports/databases/percona57-client/boost_1_59_0/boost/math/tools/ |
| H A D | roots.hpp | 154 max_iter -= count; in bisect()
160 if(max_iter > max_count) in bisect()
162 max_count = max_iter; in bisect()
196 boost::uintmax_t count(max_iter); in newton_raphson_iterate()
248 max_iter -= count; in newton_raphson_iterate()
254 if(max_iter > max_count) in newton_raphson_iterate()
256 max_count = max_iter; in newton_raphson_iterate()
418 max_iter -= count; in halley_iterate()
512 max_iter -= count; in schroeder_iterate()
518 if(max_iter > max_count) in schroeder_iterate()
[all …]
|
| /dports/databases/mysqlwsrep57-server/boost_1_59_0/boost/math/tools/ |
| H A D | roots.hpp | 154 max_iter -= count; in bisect()
160 if(max_iter > max_count) in bisect()
162 max_count = max_iter; in bisect()
196 boost::uintmax_t count(max_iter); in newton_raphson_iterate()
248 max_iter -= count; in newton_raphson_iterate()
254 if(max_iter > max_count) in newton_raphson_iterate()
256 max_count = max_iter; in newton_raphson_iterate()
418 max_iter -= count; in halley_iterate()
512 max_iter -= count; in schroeder_iterate()
518 if(max_iter > max_count) in schroeder_iterate()
[all …]
|
| /dports/databases/mysql57-client/mysql-5.7.36/boost/boost_1_59_0/boost/math/tools/ |
| H A D | roots.hpp | 154 max_iter -= count; in bisect()
160 if(max_iter > max_count) in bisect()
162 max_count = max_iter; in bisect()
196 boost::uintmax_t count(max_iter); in newton_raphson_iterate()
248 max_iter -= count; in newton_raphson_iterate()
254 if(max_iter > max_count) in newton_raphson_iterate()
256 max_count = max_iter; in newton_raphson_iterate()
418 max_iter -= count; in halley_iterate()
512 max_iter -= count; in schroeder_iterate()
518 if(max_iter > max_count) in schroeder_iterate()
[all …]
|
| /dports/games/frogatto/frogatto-1.3.1/MacOSJet/boost/include/boost/math/distributions/detail/ |
| H A D | inv_discrete_quantile.hpp | 237 max_iter += 1; in do_inverse_discrete_quantile()
253 max_iter -= count; in do_inverse_discrete_quantile()
272 max_iter += count; in do_inverse_discrete_quantile()
305 max_iter); in inverse_discrete_quantile()
337 max_iter)); in inverse_discrete_quantile()
347 max_iter)); in inverse_discrete_quantile()
379 max_iter)); in inverse_discrete_quantile()
389 max_iter)); in inverse_discrete_quantile()
416 max_iter)); in inverse_discrete_quantile()
442 max_iter)); in inverse_discrete_quantile()
[all …]
|
| /dports/math/py-statsmodels/statsmodels-0.13.1/statsmodels/tsa/statespace/tests/results/frbny_nowcast/Nowcasting/ |
| H A D | test_DFM.m | 29 %% Test 1: p=1, k=1, max_iter=1
32 max_iter = 1; variable
51 %% Test 2: p=1, k=1, max_iter=2
54 max_iter = 2; variable
73 %% Test 3: p=1, k=1, max_iter=5000
76 max_iter = 5000; variable
94 %% Test 4: p=2, k=2, max_iter=1
97 max_iter = 1; variable
116 %% Test 5: p=2, k=2, max_iter=2
119 max_iter = 2; variable
[all …]
|
| /dports/science/hypre/hypre-2.23.0/src/test/TEST_ij/ |
| H A D | matrix.jobs | 19 mpirun -np 2 ./ij -test_ij -solver 2 -tol 0 -max_iter 5 -chunk 1 -add 1 > matrix.out.4
21 mpirun -np 2 ./ij -test_ij -solver 2 -tol 0 -max_iter 5 -chunk 1 -add 1 -off_proc 1 > matrix.out.5
23 mpirun -np 2 ./ij -test_ij -solver 2 -tol 0 -max_iter 5 -chunk 1 -off_proc 1 > matrix.out.6
25 mpirun -np 2 ./ij -test_ij -solver 2 -tol 0 -max_iter 5 -chunk 1 -off_proc 1 -omp 1 > matrix.out.7
27 mpirun -np 2 ./ij -test_ij -solver 2 -tol 0 -max_iter 5 -chunk 1 -off_proc 1 -omp 1 -add 1 > matrix…
29 mpirun -np 2 ./ij -test_ij -solver 2 -tol 0 -max_iter 5 -chunk 1 -omp 1 -exact_size > matrix.out.9
31 mpirun -np 2 ./ij -test_ij -solver 2 -tol 0 -max_iter 5 -chunk 1 -omp 1 > matrix.out.10
35 mpirun -np 2 ./ij -test_ij -solver 2 -tol 0 -max_iter 5 -chunk 1 -add 1 -check_constant 1 > matrix.…
|
| /dports/science/py-dlib/dlib-19.22/dlib/optimization/ |
| H A D | optimization_stop_strategies.h | 35 unsigned long max_iter in objective_delta_stop_strategy() argument
36 …) : _verbose(false), _been_used(false), _min_delta(min_delta), _max_iter(max_iter), _cur_iter(0), … in objective_delta_stop_strategy()
39 min_delta >= 0 && max_iter > 0, in objective_delta_stop_strategy()
43 << "\n\t max_iter: " << max_iter in objective_delta_stop_strategy()
114 unsigned long max_iter in gradient_norm_stop_strategy() argument
115 ) : _verbose(false), _min_norm(min_norm), _max_iter(max_iter), _cur_iter(0) in gradient_norm_stop_strategy()
118 min_norm >= 0 && max_iter > 0, in gradient_norm_stop_strategy()
122 << "\n\t max_iter: " << max_iter in gradient_norm_stop_strategy()
|
| /dports/science/dlib-cpp/dlib-19.22/dlib/optimization/ |
| H A D | optimization_stop_strategies.h | 35 unsigned long max_iter in objective_delta_stop_strategy() argument
36 …) : _verbose(false), _been_used(false), _min_delta(min_delta), _max_iter(max_iter), _cur_iter(0), … in objective_delta_stop_strategy()
39 min_delta >= 0 && max_iter > 0, in objective_delta_stop_strategy()
43 << "\n\t max_iter: " << max_iter in objective_delta_stop_strategy()
114 unsigned long max_iter in gradient_norm_stop_strategy() argument
115 ) : _verbose(false), _min_norm(min_norm), _max_iter(max_iter), _cur_iter(0) in gradient_norm_stop_strategy()
118 min_norm >= 0 && max_iter > 0, in gradient_norm_stop_strategy()
122 << "\n\t max_iter: " << max_iter in gradient_norm_stop_strategy()
|
| /dports/science/py-scikit-learn/scikit-learn-1.0.2/sklearn/semi_supervised/tests/ |
| H A D | test_self_training.py | 53 def test_invalid_params(max_iter, threshold): argument
56 st = SelfTrainingClassifier(base_estimator, max_iter=max_iter)
91 max_iter = 10
93 base_estimator, max_iter=max_iter, threshold=threshold, criterion=selection_crit
100 base_estimator, max_iter=max_iter, criterion=selection_crit, threshold=threshold
119 assert np.max(st.labeled_iter_) <= st.n_iter_ <= max_iter
132 max_iter=None,
186 clf1 = SelfTrainingClassifier(base_estimator, max_iter=0)
210 def test_labeled_iter(max_iter): argument
213 st = SelfTrainingClassifier(KNeighborsClassifier(), max_iter=max_iter)
[all …]
|
| /dports/science/py-scikit-learn/scikit-learn-1.0.2/sklearn/linear_model/tests/ |
| H A D | test_sgd.py | 409 max_iter=2,
418 max_iter=1,
472 max_iter = 10
480 max_iter=max_iter,
492 max_iter=max_iter,
630 max_iter=1,
704 max_iter=1,
1225 max_iter=1,
1734 max_iter = 15
1740 max_iter=max_iter,
[all …]
|
| /dports/finance/py-quantecon/quantecon-0.5.2/quantecon/game_theory/tests/ |
| H A D | test_lemke_howson.py | 92 max_iter = 10**6 # big number
95 NE0, res0 = lemke_howson(g, init_pivot=k, max_iter=max_iter,
97 NE1, res1 = lemke_howson(g, init_pivot=k, max_iter=max_iter,
98 capping=max_iter, full_output=True)
104 max_iter = m+n
105 NE, res = lemke_howson(g, init_pivot=init_pivot, max_iter=max_iter,
107 eq_(res.num_iter, max_iter)
|