Home
last modified time | relevance | path

Searched refs:lra (Results 1 – 25 of 1545) sorted by relevance

12345678910>>...62

/dports/math/z3/z3-z3-4.8.13/src/math/lp/
H A Dint_cube.cpp25 int_cube::int_cube(int_solver& lia):lia(lia), lra(lia.lra) {} in int_cube()
32 tout << lra.constraints(); in operator ()()
35 lra.push(); in operator ()()
37 lra.pop(); in operator ()()
45 lra.pop(); in operator ()()
50 lra.pop(); in operator ()()
51 lra.round_to_integer_solution(); in operator ()()
60 if (!lra.term_is_used_as_row(i)) in tighten_term_for_cube()
62 const lar_term* t = lra.terms()[i]; in tighten_term_for_cube()
80 lra.find_feasible_solution(); in find_feasible_solution()
[all …]
H A Dint_gcd_test.cpp55 … int_gcd_test::int_gcd_test(int_solver& lia): lia(lia), lra(lia.lra), m_next_gcd(0), m_delay(0) {} in int_gcd_test()
81 unsigned basic_var = lra.r_basis()[i]; in gcd_test()
92 for (const auto & c : lra.get_column(j)) { in gcd_test()
113 unsigned basic_var = lra.r_basis()[i]; in gcd_test_for_row()
127 if (lra.column_is_fixed(j)) { in gcd_test_for_row()
131 else if (lra.column_is_real(j)) { in gcd_test_for_row()
199 if (lra.column_is_fixed(j)) in ext_gcd_test()
201 SASSERT(!lra.column_is_real(j)); in ext_gcd_test()
206 SASSERT(lra.column_is_bounded(j)); in ext_gcd_test()
247 if (lra.column_is_fixed(c.var())) in fill_explanation_from_fixed_columns()
[all …]
H A Dint_solver.cpp19 lra(lia.lra), in patcher()
119 lra(lar_slv), in int_solver()
126 lra.set_int_solver(this); in int_solver()
131 lar_solver& lra; member
134 lra(ls), in check_return_helper()
156 check_return_helper pc(lra); in check()
183 lra.print_row(lra.A_r().m_rows[i], out); in display_inf_rows()
212 return lra.has_inf_int(); in has_inf_int()
228 return lra.settings(); in settings()
232 return lra.settings(); in settings()
[all …]
H A Dint_branch.cpp25 int_branch::int_branch(int_solver& lia):lia(lia), lra(lia.lra) {} in int_branch()
28 lra.move_non_basic_columns_to_bounds(true); in operator ()()
37 lia.m_t.add_monomial(mpq(1), lra.column_to_reported_index(j)); in create_branch_on_column()
60 lar_core_solver & lcs = lra.m_mpq_lar_core_solver; in find_inf_int_base_column()
67 for (; k < lra.r_basis().size(); k++) { in find_inf_int_base_column()
68 j = lra.r_basis()[k]; in find_inf_int_base_column()
71 usage = lra.usage_in_terms(j); in find_inf_int_base_column()
86 SASSERT(k == lra.r_basis().size() || n == 1); in find_inf_int_base_column()
88 for (; k < lra.r_basis().size(); k++) { in find_inf_int_base_column()
89 j = lra.r_basis()[k]; in find_inf_int_base_column()
[all …]
H A Dhnf_cutter.cpp20 lra(lia.lra), in hnf_cutter()
234 const lar_term& t = lra.get_term(i); in try_add_term_to_A_for_hnf()
237 … if (!is_full() && lra.get_equality_and_right_side_for_term_on_current_x(i, rs, ci, upper_bound)) { in try_add_term_to_A_for_hnf()
251 for (unsigned i = 0; i < lra.terms().size() && !is_full(); i++) { in init_terms_for_hnf_cut()
264 lra.constraints().display(tout, i); in make_hnf_cut()
266 tout << lra.constraints(); in make_hnf_cut()
269 vector<mpq> x0 = transform_to_local_columns(lra.r_x()); in make_hnf_cut()
279 lra.print_term(lia.m_t, tout << "cut:"); in make_hnf_cut()
282 lra.constraints().display(tout, i); in make_hnf_cut()
H A Dgomory.cpp55 bool column_is_fixed(unsigned j) const { return lia.lra.column_is_fixed(j); } in column_is_fixed()
120 tout << "m_t = "; lia.lra.print_term(m_t, tout) << "\nk: " << m_k << "\n";); in real_case_in_gomory_cut()
194 auto t = lia.lra.column2tv(c.column()); in dump_coeff()
225 auto t = lia.lra.column2tv(p.column()); in dump_declarations()
285 lia.lra.print_column_info(p.var(), out); in dump()
393 for (unsigned j : lra.r_basis()) { in find_basic_var()
396 const row_strip<mpq>& row = lra.get_row(lia.row_of_basic_column(j)); in find_basic_var()
412 lra.move_non_basic_columns_to_bounds(true); in operator ()()
416 const row_strip<mpq>& row = lra.get_row(r); in operator ()()
417 SASSERT(lra.row_is_correct(r)); in operator ()()
[all …]
/dports/math/py-z3-solver/z3-z3-4.8.10/src/math/lp/
H A Dint_cube.cpp25 int_cube::int_cube(int_solver& lia):lia(lia), lra(lia.lra) {} in int_cube()
32 tout << lra.constraints(); in operator ()()
35 lra.push(); in operator ()()
37 lra.pop(); in operator ()()
45 lra.pop(); in operator ()()
50 lra.pop(); in operator ()()
51 lra.round_to_integer_solution(); in operator ()()
60 if (!lra.term_is_used_as_row(i)) in tighten_term_for_cube()
62 const lar_term* t = lra.terms()[i]; in tighten_term_for_cube()
80 lra.find_feasible_solution(); in find_feasible_solution()
[all …]
H A Dint_gcd_test.cpp53 … int_gcd_test::int_gcd_test(int_solver& lia): lia(lia), lra(lia.lra), m_next_gcd(0), m_delay(0) {} in int_gcd_test()
79 const auto & A = lra.A_r(); // getting the matrix in gcd_test()
96 unsigned basic_var = lra.r_basis()[i]; in gcd_test_for_row()
109 if (lra.column_is_fixed(j)) { in gcd_test_for_row()
111 consts += aux * lra.column_lower_bound(j).x; in gcd_test_for_row()
113 else if (lra.column_is_real(j)) { in gcd_test_for_row()
119 least_coeff_is_bounded = lra.column_is_bounded(j); in gcd_test_for_row()
178 if (lra.column_is_fixed(j)) in ext_gcd_test()
180 SASSERT(!lra.column_is_real(j)); in ext_gcd_test()
185 SASSERT(lra.column_is_bounded(j)); in ext_gcd_test()
[all …]
H A Dint_solver.cpp19 lra(lia.lra), in patcher()
119 lra(lar_slv), in int_solver()
126 lra.set_int_solver(this); in int_solver()
131 lar_solver& lra; member
134 lra(ls), in check_return_helper()
156 check_return_helper pc(lra); in check()
183 lra.print_row(lra.A_r().m_rows[i], out); in display_inf_rows()
212 return lra.has_inf_int(); in has_inf_int()
228 return lra.settings(); in settings()
232 return lra.settings(); in settings()
[all …]
H A Dint_branch.cpp25 int_branch::int_branch(int_solver& lia):lia(lia), lra(lia.lra) {} in int_branch()
28 lra.move_non_basic_columns_to_bounds(true); in operator ()()
37 lia.m_t.add_monomial(mpq(1), lra.column_to_reported_index(j)); in create_branch_on_column()
60 lar_core_solver & lcs = lra.m_mpq_lar_core_solver; in find_inf_int_base_column()
67 for (; k < lra.r_basis().size(); k++) { in find_inf_int_base_column()
68 j = lra.r_basis()[k]; in find_inf_int_base_column()
71 usage = lra.usage_in_terms(j); in find_inf_int_base_column()
86 SASSERT(k == lra.r_basis().size() || n == 1); in find_inf_int_base_column()
88 for (; k < lra.r_basis().size(); k++) { in find_inf_int_base_column()
89 j = lra.r_basis()[k]; in find_inf_int_base_column()
[all …]
H A Dhnf_cutter.cpp20 lra(lia.lra), in hnf_cutter()
234 const lar_term& t = lra.get_term(i); in try_add_term_to_A_for_hnf()
237 … if (!is_full() && lra.get_equality_and_right_side_for_term_on_current_x(i, rs, ci, upper_bound)) { in try_add_term_to_A_for_hnf()
251 for (unsigned i = 0; i < lra.terms().size() && !is_full(); i++) { in init_terms_for_hnf_cut()
264 lra.constraints().display(tout, i); in make_hnf_cut()
266 tout << lra.constraints(); in make_hnf_cut()
269 vector<mpq> x0 = transform_to_local_columns(lra.r_x()); in make_hnf_cut()
279 lra.print_term(lia.m_t, tout << "cut:"); in make_hnf_cut()
282 lra.constraints().display(tout, i); in make_hnf_cut()
H A Dgomory.cpp55 bool column_is_fixed(unsigned j) const { return lia.lra.column_is_fixed(j); } in column_is_fixed()
120 tout << "m_t = "; lia.lra.print_term(m_t, tout) << "\nk: " << m_k << "\n";); in real_case_in_gomory_cut()
194 auto t = lia.lra.column2tv(c.column()); in dump_coeff()
225 auto t = lia.lra.column2tv(p.column()); in dump_declarations()
285 lia.lra.print_column_info(p.var(), out); in dump()
393 for (unsigned j : lra.r_basis()) { in find_basic_var()
396 const row_strip<mpq>& row = lra.get_row(lia.row_of_basic_column(j)); in find_basic_var()
412 lra.move_non_basic_columns_to_bounds(true); in operator ()()
416 const row_strip<mpq>& row = lra.get_row(r); in operator ()()
417 SASSERT(lra.row_is_correct(r)); in operator ()()
[all …]
/dports/mail/evolution/evolution-3.42.1/src/e-util/
H A De-config-lookup-result.c263 EConfigLookupResult *lra, *lrb; in e_config_lookup_result_compare() local
269 lra = E_CONFIG_LOOKUP_RESULT (lookup_result_a); in e_config_lookup_result_compare()
311 if (!lra || !lrb || lra == lrb) in e_config_lookup_result_equal()
312 return lra == lrb; in e_config_lookup_result_equal()
314 return e_config_lookup_result_get_kind (lra) == in e_config_lookup_result_equal()
316 e_config_lookup_result_get_priority (lra) == in e_config_lookup_result_equal()
318 (e_config_lookup_result_get_is_complete (lra) ? 1 : 0) == in e_config_lookup_result_equal()
320 g_strcmp0 (e_config_lookup_result_get_protocol (lra), in e_config_lookup_result_equal()
322 g_strcmp0 (e_config_lookup_result_get_display_name (lra), in e_config_lookup_result_equal()
324 g_strcmp0 (e_config_lookup_result_get_description (lra), in e_config_lookup_result_equal()
[all …]
/dports/lang/guile1/guile-1.8.8/libguile/
H A Dramap.c326 SCM y = lra; in scm_ramapc()
847 if (! (scm_is_pair (lra) && scm_is_pair (SCM_CDR (lra))))
870 while (!scm_is_null (lra) && !scm_is_null (SCM_CDR (lra)))
873 lra = SCM_CDR (lra);
877 while (!scm_is_null (lra) && !scm_is_null (SCM_CDR (lra)))
880 lra = SCM_CDR (lra);
915 lra = SCM_CDR (lra);
919 if (SCM_IMP (lra) || SCM_IMP (SCM_CDR (lra)))
921 lra = SCM_CDR (lra);
925 lra = SCM_CDR (lra);
[all …]
/dports/science/py-scipy/scipy-1.7.1/scipy/linalg/src/id_dist/src/
H A Diddp_aid.f231 integer m,n,krank,n2,irat,lrat,iscal,lscal,ira,lra,lra2 local
244 lra = 0
246 ira = lra+1
248 lra = lra+lra2
250 irat = lra+1
252 lra = lra+lrat
254 iscal = lra+1
256 lra = lra+lscal
H A Didzp_aid.f235 integer m,n,krank,n2,irat,lrat,iscal,lscal,ira,lra,lra2 local
249 lra = 0
251 ira = lra+1
253 lra = lra+lra2
255 irat = lra+1
257 lra = lra+lrat
259 iscal = lra+1
261 lra = lra+lscal
H A Diddp_rid.f86 1 lra,ier,k local
107 lra = lproj-lwork
108 call idd_findrank(lra,eps,m,n,matvect,p1,p2,p3,p4,
142 subroutine idd_findrank(lra,eps,m,n,matvect,p1,p2,p3,p4, argument
190 integer m,n,lw,krank,ix,lx,iy,ly,iscal,lscal,lra,ier local
210 call idd_findrank0(lra,eps,m,n,matvect,p1,p2,p3,p4,
220 subroutine idd_findrank0(lra,eps,m,n,matvect,p1,p2,p3,p4, argument
228 integer m,n,krank,ifrescal,k,lra,ier local
246 if(lra .lt. n*2*(krank+1)) then
H A Didzp_rid.f86 1 lra,ier,k local
108 lra = lproj-lwork
109 call idz_findrank(lra,eps,m,n,matveca,p1,p2,p3,p4,
143 subroutine idz_findrank(lra,eps,m,n,matveca,p1,p2,p3,p4, argument
192 integer m,n,lw,krank,ix,lx,iy,ly,iscal,lscal,lra,ier local
213 call idz_findrank0(lra,eps,m,n,matveca,p1,p2,p3,p4,
223 subroutine idz_findrank0(lra,eps,m,n,matveca,p1,p2,p3,p4, argument
231 integer m,n,krank,ifrescal,k,lra,ier,m2 local
249 if(lra .lt. n*2*(krank+1)) then
/dports/lang/sbcl/sbcl-1.3.13/src/runtime/
H A Dbacktrace.c248 lispobj lra; member
298 info->lra = 0; in call_info_from_lisp_state()
329 info->lra = NIL; in call_info_from_context()
349 lispobj lra; in previous_info() local
357 info->lra = this_frame->saved_lra; in previous_info()
363 lra = info->lra; in previous_info()
364 if (lra == NIL) { in previous_info()
377 } else if (fixnump(lra)) { in previous_info()
380 info->lra = NIL; in previous_info()
411 if (info.lra != NIL && in lisp_backtrace()
[all …]
H A Dbreakpoint.c160 lispobj code, lra; in handle_fun_end_breakpoint() local
184 lra = codeptr->constants[REAL_LRA_SLOT]; in handle_fun_end_breakpoint()
189 *os_context_register_addr(context, reg_LRA) = lra; in handle_fun_end_breakpoint()
192 *os_context_register_addr(context, reg_CODE) = lra; in handle_fun_end_breakpoint()
199 return (void *)(lra-OTHER_POINTER_LOWTAG+sizeof(lispobj)); in handle_fun_end_breakpoint()
201 return compute_pc(lra, fixnum_value(codeptr->constants[REAL_LRA_SLOT+1])); in handle_fun_end_breakpoint()
/dports/lang/sbcl/sbcl-1.3.13/src/assembly/mips/
H A Darith.lisp54 (lisp-return lra lip :offset 2)
63 (lisp-return lra lip :offset 2)
103 (lisp-return lra lip :offset 2)
112 (lisp-return lra lip :offset 2)
160 (lisp-return lra lip :offset 2)
182 (lisp-return lra lip :offset 2)
191 (lisp-return lra lip :offset 2)
326 (lisp-return lra lip :offset 2)
370 (lisp-return lra lip :offset 2)
406 (lisp-return lra lip :offset 2)
[all …]
/dports/mail/mew-devel/Mew-6.8-72-gfc4bca6/
H A Dmew-virtual.el75 rfolder lra)
90 (setq lra (list (cons rfolder pfolder)))
100 (mew-summary-selection-by-pick-with-grep prog opts pattern pfolder msgs rfolder lra))
104 (mew-summary-selection-by-pick-with-mewl pattern pfolder msgs rfolder lra))))))))))
106 (defun mew-summary-selection-by-pick-with-mewl (pattern _folder src-msgs rfolder lra)
114 (mew-local-retrieve 'vir opts nil lra)))
116 (defun mew-summary-selection-by-pick-with-grep (prog opts pattern _folder msgs rfolder lra)
124 (mew-local-retrieve 'vir args func lra nil rttl)))
/dports/mail/mew/mew-6.8/
H A Dmew-virtual.el75 rfolder lra)
90 (setq lra (list (cons rfolder pfolder)))
100 (mew-summary-selection-by-pick-with-grep prog opts pattern pfolder msgs rfolder lra))
104 (mew-summary-selection-by-pick-with-mewl pattern pfolder msgs rfolder lra))))))))))
106 (defun mew-summary-selection-by-pick-with-mewl (pattern _folder src-msgs rfolder lra)
114 (mew-local-retrieve 'vir opts nil lra)))
116 (defun mew-summary-selection-by-pick-with-grep (prog opts pattern _folder msgs rfolder lra)
124 (mew-local-retrieve 'vir args func lra nil rttl)))
/dports/lang/sbcl/sbcl-1.3.13/src/assembly/hppa/
H A Darith.lisp102 (:temp lra descriptor-reg lra-offset)
117 (lisp-return lra :offset 1)
127 (lisp-return lra :offset 1)
150 (:temp lra descriptor-reg lra-offset)
165 (lisp-return lra :offset 1)
175 (lisp-return lra :offset 1)
212 (lisp-return lra :offset 1)
238 (:temp lra descriptor-reg lra-offset)
250 (lisp-return lra :offset 1)
275 (:temp lra descriptor-reg lra-offset)
[all …]
H A Dassem-rtns.lisp13 (:temp lra descriptor-reg lra-offset)
65 (lisp-return lra))
127 (:temp lra descriptor-reg lra-offset)
146 (loadw lra cur-uwp unwind-block-entry-pc-slot)
147 (lisp-return lra :frob-code nil)
186 (:temp lra descriptor-reg lra-offset))
188 (store-symbol-value lra *c-lra*)
192 (inst addi 19 nl0 lra) ; then setup the new LRA (rest of this routine after branch)

12345678910>>...62