Home
last modified time | relevance | path

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

123456789

/dports/devel/ppl/ppl-1.2/tests/Octagonal_Shape/
H A Dminconstraints1.cc47 dimension_type num_constraints = 0; in test01() local
51 ++num_constraints; in test01()
54 nout << "num_constraints == " << num_constraints << endl; in test01()
62 bool ok = (num_constraints == 3 && known_result == ph_oct); in test01()
85 dimension_type num_constraints = 0; in test02() local
89 ++num_constraints; in test02()
92 nout << "num_constraints == " << num_constraints << endl; in test02()
116 dimension_type num_constraints = 0; in test03() local
120 ++num_constraints; in test03()
123 nout << "num_constraints == " << num_constraints << endl; in test03()
[all …]
/dports/math/symphony/SYMPHONY-releases-5.6.17/SYMPHONY/Applications/MCKP/
H A Dmckp_main.c35 int *num_constraints);
39 int *num_constraints);
43 int *num_constraints);
96 nz = num_items*num_constraints; in main()
270 *num_constraints = tmpi; in mckp_parse_command_line()
346 int *num_constraints) in mckp_read_problem1() argument
488 int *num_constraints) in mckp_read_problem2() argument
539 *num_constraints = max_num_cons; in mckp_read_problem2()
604 *num_constraints = num_cons; in mckp_read_problem2()
616 int *num_constraints) in mckp_read_problem3() argument
[all …]
/dports/devel/ppl/ppl-1.2/src/
H A DH79_Certificate.cc34 : affine_dim(0), num_constraints(0) { in H79_Certificate()
47 ++num_constraints; in H79_Certificate()
70 if (num_constraints != y.num_constraints) { in compare()
71 return (num_constraints > y.num_constraints) ? 1 : -1; in compare()
119 if (ph_num_constraints != num_constraints) { in compare()
120 return (ph_num_constraints < num_constraints) ? 1 : -1; in compare()
H A DBHRZ03_Certificate.cc33 : affine_dim(0), lin_space_dim(0), num_constraints(0), num_points(0), in BHRZ03_Certificate()
51 PPL_ASSERT(num_constraints == 0); in BHRZ03_Certificate()
55 ++num_constraints; in BHRZ03_Certificate()
108 if (num_constraints != y.num_constraints) { in compare()
109 return (num_constraints > y.num_constraints) ? 1 : -1; in compare()
219 if (ph_num_constraints != num_constraints) { in compare()
220 return (ph_num_constraints < num_constraints) ? 1 : -1; in compare()
279 if (num_constraints < space_dim - affine_dim) { in OK()
289 << "but num_constraints = " << num_constraints << "!" in OK()
307 if (num_constraints > 0) { in OK()
H A DH79_Certificate_inlines.hh33 : affine_dim(0), num_constraints(0) { in H79_Certificate()
39 : affine_dim(y.affine_dim), num_constraints(y.num_constraints) { in H79_Certificate()
57 : affine_dim(0), num_constraints(0) { in H79_Certificate()
60 num_constraints = cert.num_constraints; in H79_Certificate()
H A DBHRZ03_Certificate_inlines.hh33 : affine_dim(0), lin_space_dim(0), num_constraints(0), num_points(1), in BHRZ03_Certificate()
42 num_constraints(y.num_constraints), num_points(y.num_points), in BHRZ03_Certificate()
H A Dtermination.cc139 const dimension_type m = num_constraints(cs); in fill_constraint_systems_MS()
356 const dimension_type s = num_constraints(cs_after); in fill_constraint_system_PR()
436 const dimension_type m = num_constraints(cs); in fill_constraint_system_PR_original()
533 output_function_MS_m = num_constraints(cs); in all_affine_ranking_functions_MS()
578 output_function_MS_m = num_constraints(cs); in all_affine_quasi_ranking_functions_MS()
622 output_function_PR_r = num_constraints(cs_before); in termination_test_PR()
623 output_function_PR_s = num_constraints(cs_after); in termination_test_PR()
688 output_function_PR_r = num_constraints(cs_before); in one_affine_ranking_function_PR()
689 output_function_PR_s = num_constraints(cs_after); in one_affine_ranking_function_PR()
797 output_function_PR_r = num_constraints(cs_before); in all_affine_ranking_functions_PR()
[all …]
/dports/devel/ppl/ppl-1.2/tests/Box/
H A Dminconstraints1.cc47 dimension_type num_constraints = 0; in test01() local
51 ++num_constraints; in test01()
54 nout << "num_constraints == " << num_constraints << endl; in test01()
62 bool ok = (num_constraints == 3 && known_result == ph_box); in test01()
78 dimension_type num_constraints = 0; in test02() local
82 ++num_constraints; in test02()
85 nout << "num_constraints == " << num_constraints << endl; in test02()
87 return num_constraints == 0; in test02()
/dports/devel/ppl/ppl-1.2/tests/BD_Shape/
H A Dminconstraints1.cc47 dimension_type num_constraints = 0; in test01() local
51 ++num_constraints; in test01()
54 nout << "num_constraints == " << num_constraints << endl; in test01()
62 bool ok = (num_constraints == 3 && ph_bds == known_result); in test01()
78 dimension_type num_constraints = 0; in test02() local
82 ++num_constraints; in test02()
85 nout << "num_constraints == " << num_constraints << endl; in test02()
87 return num_constraints == 0; in test02()
/dports/science/chrono/chrono-7.0.1/src/chrono_multicore/solver/
H A DChIterativeSolverMulticoreNSC.cpp94 if (data_manager->num_constraints > 0) { in RunTimeStep()
202 uint num_constraints = data_manager->num_constraints; in ComputeD() local
203 if (num_constraints <= 0) { in ComputeD()
257 b.resize(data_manager->num_constraints); in ComputeD()
277 if (data_manager->num_constraints <= 0) { in ComputeE()
281 data_manager->host_data.E.resize(data_manager->num_constraints); in ComputeE()
294 if (data_manager->num_constraints <= 0) { in ComputeR()
305 R.resize(data_manager->num_constraints); in ComputeR()
333 if (data_manager->num_constraints <= 0) { in SetR()
345 R.resize(data_manager->num_constraints); in SetR()
[all …]
H A DChSolverMulticoreGS.cpp38 uint num_constraints = data_manager->num_constraints; in Solve() local
45 D.resize(num_constraints, false); in Solve()
91 … blaze::subvector(ml, 0, 1 * data_manager->num_constraints)) - in Solve()
96 … ((row(Nshur, nc + i * 2 + 0), blaze::subvector(ml, 0, 1 * data_manager->num_constraints)) - in Solve()
101 … ((row(Nshur, nc + i * 2 + 1), blaze::subvector(ml, 0, 1 * data_manager->num_constraints)) - in Solve()
112 … blaze::subvector(ml, 0, 1 * data_manager->num_constraints)) - in Solve()
121 … blaze::subvector(ml, 0, 1 * data_manager->num_constraints)) - in Solve()
130 … blaze::subvector(ml, 0, 1 * data_manager->num_constraints)) - in Solve()
136 … blaze::subvector(ml, 0, 1 * data_manager->num_constraints)) - in Solve()
141 … blaze::subvector(ml, 0, 1 * data_manager->num_constraints)) - in Solve()
[all …]
H A DChSolverMulticoreJacobi.cpp37 uint num_constraints = data_manager->num_constraints; in Solve() local
49 D.resize(num_constraints, false); in Solve()
102 real gdiff = 1.0 / pow(data_manager->num_constraints, 2.0); in Solve()
/dports/science/dakota/dakota-6.13.0-release-public.src-UI/packages/external/acro/packages/scolib/src/libs/
H A Dc_EAgeneric.cpp45 if (num_constraints == 0) in eval()
50 for (int i=0; i<num_constraints; i++) in eval()
54 static int num_constraints; member in local::Container
58 int Container::num_constraints = 0; member in local::Container
186 c_EAgeneric_init_problem(local::Container::num_constraints); in c_EAgeneric_reset()
187 utilib::pvector<double> clower(local::Container::num_constraints); in c_EAgeneric_reset()
188 utilib::pvector<double> cupper(local::Container::num_constraints); in c_EAgeneric_reset()
198 app->config_nonlinear_constraints(local::Container::num_constraints,0); in c_EAgeneric_reset()
202 local::Container::cvec.resize(local::Container::num_constraints); in c_EAgeneric_reset()
/dports/math/py-or-tools/or-tools-9.2/ortools/math_opt/io/
H A Dproto_converter.cc129 const int num_constraints = model.constraint_size(); in MPModelProtoToMathOptModel() local
132 constraints->mutable_lower_bounds()->Reserve(num_constraints); in MPModelProtoToMathOptModel()
133 constraints->mutable_upper_bounds()->Reserve(num_constraints); in MPModelProtoToMathOptModel()
135 constraints->mutable_names()->Reserve(num_constraints); in MPModelProtoToMathOptModel()
137 for (int i = 0; i < num_constraints; ++i) { in MPModelProtoToMathOptModel()
155 for (int i = 0; i < num_constraints; ++i) { in MPModelProtoToMathOptModel()
203 const int num_constraints = NumConstraints(model.linear_constraints()); in MathOptModelToMPModelProto() local
204 output.mutable_constraint()->Reserve(num_constraints); in MathOptModelToMPModelProto()
205 for (int i = 0; i < num_constraints; ++i) { in MathOptModelToMPModelProto()
/dports/graphics/graphviz/graphviz-2.44.1/lib/neatogen/
H A Dmosek_quad_solve.c80 int num_constraints; in mosek_init_hier() local
113 num_constraints += num_divisions; in mosek_init_hier()
160 MSK_maketask(mskEnv->env, num_constraints, in mosek_init_hier()
173 2 * num_constraints + in mosek_init_hier()
293 assert(c_ind == num_constraints); in mosek_init_hier()
296 for (i = 0; i < num_constraints; i++) { in mosek_init_hier()
307 for (i = 0; i < num_constraints; i++) { in mosek_init_hier()
391 Constraint ** cs, int num_constraints) in mosek_init_sep() argument
454 MSK_maketask(mskEnv->env, num_constraints, in mosek_init_sep()
467 2 * num_constraints, in mosek_init_sep()
[all …]
/dports/graphics/box/box-0.4.0/libs/g/
H A Dconstraints.c71 size_t num_constraints = BoxGObj_Get_Num(cs->constraints), i; in Box_Lib_G_Constraints_At_Transform() local
82 srcs = Box_Mem_Safe_Alloc(sizeof(BoxPoint)*num_constraints); in Box_Lib_G_Constraints_At_Transform()
83 dsts = Box_Mem_Safe_Alloc(sizeof(BoxPoint)*num_constraints); in Box_Lib_G_Constraints_At_Transform()
84 weights = Box_Mem_Safe_Alloc(sizeof(BoxReal)*num_constraints); in Box_Lib_G_Constraints_At_Transform()
88 for (i = 0; i < num_constraints; i++) { in Box_Lib_G_Constraints_At_Transform()
114 BoxG_Auto_Transform(& transform, srcs, dsts, weights, num_constraints, allowed); in Box_Lib_G_Constraints_At_Transform()
/dports/devel/ppl/ppl-1.2/demos/ppl_pips/
H A Dppl_pips.cc209 PPL::dimension_type num_constraints, in update_pip() argument
293 PPL::dimension_type num_constraints; in read() local
299 iss >> num_constraints >> constraint_width; in read()
304 Coeff_Vector constraints(num_constraints * constraint_width); in read()
305 Int_Vector constraint_type(num_constraints); in read()
306 for (PPL::dimension_type i = 0; i < num_constraints; ++i) { in read()
357 PPL::dimension_type num_constraints; in read() local
359 in >> num_constraints >> num_ctx_rows; in read()
381 Int_Vector constraint_type(num_constraints); in read()
382 for (PPL::dimension_type i = 0; i < num_constraints; ++i) { in read()
[all …]
/dports/graphics/blender/blender-2.91.0/extern/ceres/internal/ceres/
H A Dpolynomial.cc331 int num_constraints = 0; in FindInterpolatingPolynomial() local
334 ++num_constraints; in FindInterpolatingPolynomial()
337 ++num_constraints; in FindInterpolatingPolynomial()
341 const int degree = num_constraints - 1; in FindInterpolatingPolynomial()
343 Matrix lhs = Matrix::Zero(num_constraints, num_constraints); in FindInterpolatingPolynomial()
344 Vector rhs = Vector::Zero(num_constraints); in FindInterpolatingPolynomial()
/dports/misc/openmvg/openMVG-2.0/src/third_party/ceres-solver/internal/ceres/
H A Dpolynomial.cc331 int num_constraints = 0; in FindInterpolatingPolynomial() local
334 ++num_constraints; in FindInterpolatingPolynomial()
337 ++num_constraints; in FindInterpolatingPolynomial()
341 const int degree = num_constraints - 1; in FindInterpolatingPolynomial()
343 Matrix lhs = Matrix::Zero(num_constraints, num_constraints); in FindInterpolatingPolynomial()
344 Vector rhs = Vector::Zero(num_constraints); in FindInterpolatingPolynomial()
/dports/math/ceres-solver/ceres-solver-2.0.0/internal/ceres/
H A Dpolynomial.cc331 int num_constraints = 0; in FindInterpolatingPolynomial() local
334 ++num_constraints; in FindInterpolatingPolynomial()
337 ++num_constraints; in FindInterpolatingPolynomial()
341 const int degree = num_constraints - 1; in FindInterpolatingPolynomial()
343 Matrix lhs = Matrix::Zero(num_constraints, num_constraints); in FindInterpolatingPolynomial()
344 Vector rhs = Vector::Zero(num_constraints); in FindInterpolatingPolynomial()
/dports/science/dakota/dakota-6.13.0-release-public.src-UI/packages/external/acro/packages/colin/test/unit/
H A DTDowncast.h35 TS_ASSERT_EQUALS(app.num_constraints, 0); in test_construct()
40 TS_ASSERT_EQUALS(app.num_constraints, 6); in test_construct()
57 TS_ASSERT_EQUALS(app.num_constraints, 6); in test_construct()
/dports/science/dakota/dakota-6.13.0-release-public.src-UI/packages/external/hopspack/src/src-citizens/citizen-gss/
H A DHOPSPACK_CddLibWrapper.c73 int num_constraints; in compute_cone_generators() local
80 num_constraints = num_equalities + num_inequalities; in compute_cone_generators()
84 if (num_constraints <= 0) { in compute_cone_generators()
85 printf("Bogus number of constraints specified: %d !!\n", num_constraints); in compute_cone_generators()
130 A = dd_CreateMatrix(num_constraints, n+1); in compute_cone_generators()
140 for (k = 0; i < num_constraints; i++, k++) { in compute_cone_generators()
/dports/math/py-or-tools/or-tools-9.2/examples/contrib/
H A Dvolsay2.cs51 int num_constraints = 2; in Solve()
52 IEnumerable<int> CONSTRAINTS = Enumerable.Range(0, num_constraints); in Solve()
53 Constraint[] cons = new Constraint[num_constraints]; in Solve()
/dports/math/py-mip/mip-1.13.0/examples/
H A Dconflict_finder.py14 num_constraints: int = 10, num_infeasible_sets: int = 20
20 for idx, rand_constraint in enumerate(np.linspace(1, 1000, num_constraints)):
29 num_constraint_inf = int(num_infeasible_sets / num_constraints)
/dports/math/z3/z3-z3-4.8.13/src/test/
H A Dsat_local_search.cpp21 int num_vars = 0, num_constraints = 0; in build_instance() local
22 sscanf_s(line, "%d %d", &num_vars, &num_constraints); in build_instance()
52 for (int c = 0; c < num_constraints; ++c) { in build_instance()

123456789