/dports/math/z3/z3-z3-4.8.13/src/util/ |
H A D | inf_rational.h | 250 (r1 == r2.m_first && r2.m_second.is_pos()); 282 bool is_pos() const { in is_pos() function 284 m_first.is_pos() || in is_pos() 285 (m_first.is_zero() && m_second.is_pos()); in is_pos() 290 m_first.is_pos() || in is_nonneg()
|
H A D | double_manager.h | 80 bool is_pos(double a) const { return a > m_zero_tolerance; } in is_pos() function 83 bool is_nonpos(double a) const { return !is_pos(a); } in is_nonpos()
|
/dports/math/py-z3-solver/z3-z3-4.8.10/src/math/simplex/ |
H A D | simplex_def.h | 504 is_below = m.is_pos(m_vars[x_i].m_base_coeff); in make_var_feasible() 562 bool is_neg = is_below ? m.is_neg(a_ij) : m.is_pos(a_ij); in select_pivot_core() 563 bool is_pos = !is_neg; in select_pivot_core() local 564 bool can_pivot = ((is_pos && above_lower(x_j)) || (is_neg && below_upper(x_j))); in select_pivot_core() 623 bool is_neg = is_below ? m.is_neg(a_ij) : m.is_pos(a_ij); in select_pivot_blands() 739 for (; it != end && is_pos(delta); ++it) { in move_to_bound() 755 bool base_to_lower = (m.is_pos(coeff) != m.is_pos(base_coeff)) == to_lower; in move_to_bound() 806 bool inc_x = m.is_pos(it->m_coeff) == m.is_pos(m_vars[v].m_base_coeff); in select_pivot_primal() 872 bool sign_eq = (m.is_pos(a_ii) == m.is_pos(a_ij)); in pick_var_to_leave() 965 SASSERT(is_pos(curr_error)); in select_error_var()
|
H A D | network_flow_def.h | 40 if (cost.is_pos()) { in choose_entering_edge() 63 return cost.is_pos(); in choose_entering_edge() 79 if (new_cost.is_pos()) { in choose_entering_edge() 92 return cost.is_pos(); in choose_entering_edge() 107 if (!new_cost.is_pos()) { in choose_entering_edge() 114 return cost.is_pos(); in choose_entering_edge() 341 if (m_flows[num_edges - i].is_pos()) return true; in is_infeasible()
|
/dports/math/z3/z3-z3-4.8.13/src/math/simplex/ |
H A D | simplex_def.h | 504 is_below = m.is_pos(m_vars[x_i].m_base_coeff); in make_var_feasible() 562 bool is_neg = is_below ? m.is_neg(a_ij) : m.is_pos(a_ij); in select_pivot_core() 563 bool is_pos = !is_neg; in select_pivot_core() local 564 bool can_pivot = ((is_pos && above_lower(x_j)) || (is_neg && below_upper(x_j))); in select_pivot_core() 623 bool is_neg = is_below ? m.is_neg(a_ij) : m.is_pos(a_ij); in select_pivot_blands() 739 for (; it != end && is_pos(delta); ++it) { in move_to_bound() 755 bool base_to_lower = (m.is_pos(coeff) != m.is_pos(base_coeff)) == to_lower; in move_to_bound() 806 bool inc_x = m.is_pos(it->m_coeff) == m.is_pos(m_vars[v].m_base_coeff); in select_pivot_primal() 872 bool sign_eq = (m.is_pos(a_ii) == m.is_pos(a_ij)); in pick_var_to_leave() 965 SASSERT(is_pos(curr_error)); in select_error_var()
|
H A D | network_flow_def.h | 40 if (cost.is_pos()) { in choose_entering_edge() 63 return cost.is_pos(); in choose_entering_edge() 79 if (new_cost.is_pos()) { in choose_entering_edge() 92 return cost.is_pos(); in choose_entering_edge() 107 if (!new_cost.is_pos()) { in choose_entering_edge() 114 return cost.is_pos(); in choose_entering_edge() 341 if (m_flows[num_edges - i].is_pos()) return true; in is_infeasible()
|
/dports/games/retroarch/RetroArch-1.9.7/input/drivers_joypad/ |
H A D | xdk_joypad.c | 139 bool is_pos = false; in xdk_joypad_axis_state() local 149 is_pos = true; in xdk_joypad_axis_state() 172 else if (is_pos && val < 0) in xdk_joypad_axis_state()
|
H A D | ps2_joypad.c | 101 bool is_pos = false; in ps2_joypad_axis_state() local 111 is_pos = true; in ps2_joypad_axis_state() 130 else if (is_pos && val < 0) in ps2_joypad_axis_state()
|
H A D | ps3_joypad.c | 85 bool is_pos = false; in ps3_joypad_axis_state() local 95 is_pos = true; in ps3_joypad_axis_state() 114 else if (is_pos && val < 0) in ps3_joypad_axis_state()
|
H A D | dinput_joypad_inl.h | 184 bool is_pos = false; in dinput_joypad_axis_state() local 194 is_pos = true; in dinput_joypad_axis_state() 227 else if (is_pos && val < 0) in dinput_joypad_axis_state()
|
/dports/math/chuffed/chuffed-e04bedd/chuffed/globals/ |
H A D | mddglobals.cpp | 22 …_MDD mdd_table(MDDTable& mddtab, int arity, vec<int>& doms, vec< vec<int> >& entries, bool is_pos); 96 _MDD mdd_table(MDDTable& mddtab, int arity, vec<int>& doms, vec< vec<int> >& entries, bool is_pos) in mdd_table() argument 107 if( !is_pos ) in mdd_table()
|
/dports/math/z3/z3-z3-4.8.13/src/math/lp/ |
H A D | test_bound_analyzer.h | 73 static int sign (const mpq & t) { return is_pos(t) ? 1: -1;} 118 …m_implied_bounds.push_back(implied_bound(l, j, false, is_pos(m_coeffs[i]), m_row_or_term_index, st… 209 …m_implied_bounds.push_back(implied_bound(l, j, true, is_pos(m_coeffs[i]), m_row_or_term_index, str…
|
/dports/math/py-z3-solver/z3-z3-4.8.10/src/math/lp/ |
H A D | test_bound_analyzer.h | 73 static int sign (const mpq & t) { return is_pos(t) ? 1: -1;} 118 …m_implied_bounds.push_back(implied_bound(l, j, false, is_pos(m_coeffs[i]), m_row_or_term_index, st… 209 …m_implied_bounds.push_back(implied_bound(l, j, true, is_pos(m_coeffs[i]), m_row_or_term_index, str…
|
/dports/misc/otter/otter-3.3f/source/ |
H A D | av.c | 30 static struct is_pos *is_pos_avail; 646 struct is_pos *get_is_pos(void) in get_is_pos() 648 struct is_pos *p; in get_is_pos() 652 p = (struct is_pos *) tp_alloc((int) sizeof(struct is_pos)); in get_is_pos() 668 void free_is_pos(struct is_pos *p) in free_is_pos() 1269 void free_is_pos_list(struct is_pos *p) in free_is_pos_list() 1271 struct is_pos *q; in free_is_pos_list() 1432 …t is_pos), is_pos_gets, is_pos_frees, is_pos_gets - is_pos_frees, is_pos_avails, (((is_pos_gets - … in print_mem()
|
/dports/biology/ncbi-cxx-toolkit/ncbi_cxx--25_2_0/src/algo/cobalt/ |
H A D | kmercounts.cpp | 222 bool is_pos = InitPosBits(sv, pos, i, kNumBits, kmer_len); in Reset() local 223 if (is_pos) { in Reset() 230 for (;i < seq_len && is_pos;i++) { in Reset() 241 is_pos = InitPosBits(sv, pos, i, kNumBits, kmer_len); in Reset() 243 if (i >= seq_len || !is_pos) { in Reset()
|
/dports/math/z3/z3-z3-4.8.13/src/test/ |
H A D | rational.cpp | 33 ENSURE(r1.is_pos()); in tst1() 80 ENSURE(rational(3).is_pos()); in tst1() 82 ENSURE(rational(3).is_pos()); in tst1() 122 ENSURE(r1.is_pos()); in tst2() 157 ENSURE(rational("300000000000000").is_pos()); in tst2() 160 ENSURE(rational("3000000000000000000/2").is_pos()); in tst2()
|
H A D | mpff.cpp | 373 ENSURE(m.is_zero(a) && !m.is_pos(a) && !m.is_neg(a) && m.is_nonpos(a) && m.is_nonneg(a)); in tst_sgn() 375 ENSURE(!m.is_zero(a) && m.is_pos(a) && !m.is_neg(a) && !m.is_nonpos(a) && m.is_nonneg(a)); in tst_sgn() 377 ENSURE(!m.is_zero(a) && !m.is_pos(a) && m.is_neg(a) && m.is_nonpos(a) && !m.is_nonneg(a)); in tst_sgn() 380 ENSURE(!m.is_zero(a) && m.is_pos(a) && !m.is_neg(a) && !m.is_nonpos(a) && m.is_nonneg(a)); in tst_sgn() 384 ENSURE(!m.is_zero(a) && !m.is_pos(a) && m.is_neg(a) && m.is_nonpos(a) && !m.is_nonneg(a)); in tst_sgn() 403 ENSURE(!m.eq(a,b) && m.is_pos(a)); in tst_sgn() 419 ENSURE(m.is_pos(a)); in tst_limits() 462 ENSURE(!m.is_zero(a) && m.is_pos(a)); in tst_limits()
|
/dports/math/py-z3-solver/z3-z3-4.8.10/src/test/ |
H A D | rational.cpp | 33 ENSURE(r1.is_pos()); in tst1() 80 ENSURE(rational(3).is_pos()); in tst1() 82 ENSURE(rational(3).is_pos()); in tst1() 122 ENSURE(r1.is_pos()); in tst2() 157 ENSURE(rational("300000000000000").is_pos()); in tst2() 160 ENSURE(rational("3000000000000000000/2").is_pos()); in tst2()
|
H A D | mpff.cpp | 373 ENSURE(m.is_zero(a) && !m.is_pos(a) && !m.is_neg(a) && m.is_nonpos(a) && m.is_nonneg(a)); in tst_sgn() 375 ENSURE(!m.is_zero(a) && m.is_pos(a) && !m.is_neg(a) && !m.is_nonpos(a) && m.is_nonneg(a)); in tst_sgn() 377 ENSURE(!m.is_zero(a) && !m.is_pos(a) && m.is_neg(a) && m.is_nonpos(a) && !m.is_nonneg(a)); in tst_sgn() 380 ENSURE(!m.is_zero(a) && m.is_pos(a) && !m.is_neg(a) && !m.is_nonpos(a) && m.is_nonneg(a)); in tst_sgn() 384 ENSURE(!m.is_zero(a) && !m.is_pos(a) && m.is_neg(a) && m.is_nonpos(a) && !m.is_nonneg(a)); in tst_sgn() 403 ENSURE(!m.eq(a,b) && m.is_pos(a)); in tst_sgn() 419 ENSURE(m.is_pos(a)); in tst_limits() 462 ENSURE(!m.is_zero(a) && m.is_pos(a)); in tst_limits()
|
/dports/math/octave-forge-stk/stk/inst/misc/text/ |
H A D | stk_sprintf_colvect_fixedpoint.m | 47 is_pos = (x > 0); variable 48 is_pinf = is_inf & is_pos; 49 is_minf = is_inf & (~ is_pos);
|
/dports/math/z3/z3-z3-4.8.13/src/muz/rel/ |
H A D | dl_interval_relation.cpp | 504 …relation_plugin::is_linear(expr* e, unsigned& neg, unsigned& pos, rational& k, bool is_pos) const { in is_linear() 506 if (is_pos &&pos == UINT_MAX) { \ in is_linear() 510 if (!is_pos && neg == UINT_MAX) { \ in is_linear() 528 if (!is_linear(a->get_arg(i), neg, pos, k, is_pos)) return false; in is_linear() 535 is_linear(a->get_arg(0), neg, pos, k, is_pos) && in is_linear() 536 is_linear(a->get_arg(1), neg, pos, k, !is_pos); in is_linear() 548 if (is_pos) { in is_linear()
|
/dports/math/py-z3-solver/z3-z3-4.8.10/src/muz/rel/ |
H A D | dl_interval_relation.cpp | 504 …relation_plugin::is_linear(expr* e, unsigned& neg, unsigned& pos, rational& k, bool is_pos) const { in is_linear() 506 if (is_pos &&pos == UINT_MAX) { \ in is_linear() 510 if (!is_pos && neg == UINT_MAX) { \ in is_linear() 528 if (!is_linear(a->get_arg(i), neg, pos, k, is_pos)) return false; in is_linear() 535 is_linear(a->get_arg(0), neg, pos, k, is_pos) && in is_linear() 536 is_linear(a->get_arg(1), neg, pos, k, !is_pos); in is_linear() 548 if (is_pos) { in is_linear()
|
/dports/math/py-z3-solver/z3-z3-4.8.10/src/util/ |
H A D | double_manager.h | 80 bool is_pos(double a) const { return a > m_zero_tolerance; } in is_pos() function 83 bool is_nonpos(double a) const { return !is_pos(a); } in is_nonpos()
|
/dports/graphics/blender/blender-2.91.0/source/blender/blenkernel/intern/ |
H A D | studiolight.c | 306 bool is_pos = (dir[0] > 0.0f); in UNUSED_FUNCTION() local 307 *r_face = is_pos ? STUDIOLIGHT_X_POS : STUDIOLIGHT_X_NEG; in UNUSED_FUNCTION() 308 r_uv[0] = dir[2] / fabsf(dir[0]) * (is_pos ? 1 : -1); in UNUSED_FUNCTION() 309 r_uv[1] = dir[1] / fabsf(dir[0]) * (is_pos ? -1 : -1); in UNUSED_FUNCTION() 312 bool is_pos = (dir[1] > 0.0f); in UNUSED_FUNCTION() local 313 *r_face = is_pos ? STUDIOLIGHT_Y_POS : STUDIOLIGHT_Y_NEG; in UNUSED_FUNCTION() 314 r_uv[0] = dir[0] / fabsf(dir[1]) * (is_pos ? 1 : 1); in UNUSED_FUNCTION() 315 r_uv[1] = dir[2] / fabsf(dir[1]) * (is_pos ? -1 : 1); in UNUSED_FUNCTION() 318 bool is_pos = (dir[2] > 0.0f); in UNUSED_FUNCTION() local 320 r_uv[0] = dir[0] / fabsf(dir[2]) * (is_pos ? -1 : 1); in UNUSED_FUNCTION() [all …]
|
/dports/devel/boost-docs/boost_1_72_0/boost/polygon/detail/ |
H A D | voronoi_ctypes.hpp | 101 bool is_pos() const { in is_pos() function in boost::polygon::detail::extended_exponent_fpt 211 bool is_pos(const extended_exponent_fpt<_fpt>& that) { in is_pos() function 212 return that.is_pos(); in is_pos() 309 bool is_pos() const { in is_pos() function in boost::polygon::detail::extended_int 583 bool is_pos(const extended_int<N>& that) { in is_pos() function
|