Home
last modified time | relevance | path

Searched +refs:floor +refs:rem +refs:bound (Results 1 – 25 of 499) sorted by relevance

12345678910>>...20

/dports/math/octave-forge-interval/interval-3.2.0/inst/@infsup/
H A Dsinrev.m79 ## Find a smaller upper bound for x, if the restriction from c allows it
84 n(select_u) = ceil (floor (sup (n(select_u) ./ (pi ./ 2))) ./ 2);
86 idx.subs = {(select_u & rem (n, 2) == 0)};
90 idx.subs = {(select_u & rem (n, 2) ~= 0)};
101 idx.subs = {(select_u & ~overlapping & rem (n, 2) == 0)};
104 idx.subs = {(select_u & ~overlapping & rem (n, 2) ~= 0)};
108 ## Find a larger lower bound for x, if the restriction from c allows it
113 n(select_l) = floor (ceil (inf (n(select_l) ./ (pi ./ 2))) ./ 2);
115 idx.subs = {(select_l & rem (n, 2) == 0)};
119 idx.subs = {(select_l & rem (n, 2) ~= 0)};
[all …]
H A Dcosrev.m79 ## Find a smaller upper bound for x, if the restriction from c allows it
85 n(select_u) = floor (sup (n(select_u) ./ pi));
87 idx.subs = {(select_u & rem (n, 2) == 0)};
91 idx.subs = {(select_u & rem (n, 2) ~= 0)};
102 idx.subs = {(select_u & ~overlapping & rem (n, 2) == 0)};
105 idx.subs = {(select_u & ~overlapping & rem (n, 2) ~= 0)};
109 ## Find a larger lower bound for x, if the restriction from c allows it
115 n(select_l) = floor (inf (n(select_l) ./ pi));
117 idx.subs = {(select_l & rem (n, 2) == 0)};
121 idx.subs = {(select_l & rem (n, 2) ~= 0)};
[all …]
/dports/math/libnormaliz/normaliz-3.9.0/source/libnormaliz/
H A Dinteger.h89 mpz_class floor(const mpq_class& q);
312 if (rem == 0) in minimal_remainder()
316 if ((rem < 0 && b > 0) || (rem > 0 && b < 0)) { in minimal_remainder()
317 rem += b; in minimal_remainder()
326 rem = -rem; in minimal_remainder()
1092 return floor(Num / Den); in floor_quot()
1103 inline mpz_class floor(const mpq_class& q) { in floor() function
1128 return floor(work); in round()
1151 mpz_class bound = 1; in mpq_to_nmz_float() local
1153 bound *= 10; in mpq_to_nmz_float()
[all …]
/dports/games/quakeforge/quakeforge-0.7.2/include/QF/
H A Dmathlib.h45 #ifndef bound
46 # define bound(a,b,c) (max(a, min(b, c))) macro
56 #define RINT(x) (floor ((x) + 0.5))
81 void FloorDivMod (double numer, double denom, int *quotient, int *rem);
/dports/math/givaro/givaro-4.1.1/src/kernel/ring/
H A Dzring.h132 …ctRational (Element& a, Element& b, const Element& x, const Element& m, const Element& bound) const
133 {this->RationalReconstruction(a,b, x, m, bound, true, true);}
136 Element bound = x/b_bound;
137 this->RationalReconstruction(a,b,x,m, (bound>a_bound?bound:a_bound), true, false);
140 …Element& quo (Element& q, const Element& a, const Element& b) const {return Integer::floor(q, a, b…
141 … Element& rem (Element& r, const Element& a, const Element& b) const {return Integer::mod(r,a,b);}
143 Element& remin (Element& a, const Element& b) const {return rem(a,a,b);}
148 return rem(r,a,b)==Element(0);
/dports/lang/sbcl/sbcl-1.3.13/src/compiler/
H A Dsrctran.lisp313 (deffrob floor)
775 (test-number (p int bound)
1053 (flet ((bound (v)
1059 (= (bound (interval-high x)) (bound (interval-low x))
1060 (bound (interval-high y)) (bound (interval-low y))))))
1976 (floor hi))
2297 (let ((type (lvar-type bound)))
3144 (deftransform floor ((number divisor)) unknown
3616 (def floor)
3629 (def floor)
[all …]
/dports/math/z3/z3-z3-4.8.13/src/sat/smt/
H A Darith_axioms.cpp160 expr_ref rem(a.mk_rem(dividend, divisor), m); in mk_rem_axiom() local
165 literal pos = eq_internalize(rem, mod); in mk_rem_axiom()
166 literal neg = eq_internalize(rem, mmod); in mk_rem_axiom()
282 cT = lp().mk_var_bound(vi, kT, bound); in mk_var_bound()
284 rational boundF = (bk == lp_api::lower_t) ? bound - 1 : bound + 1; in mk_var_bound()
288 cF = lp().mk_var_bound(vi, kF, bound); in mk_var_bound()
293 return alloc(api_bound, lit, v, vi, v_is_int, bound, bk, cT, cF); in mk_var_bound()
457 hi = floor(hi / mul); in check_idiv_bounds()
481 if (bound.is_zero()) in fixed_var_eh()
483 else if (bound.is_one()) in fixed_var_eh()
[all …]
/dports/math/py-z3-solver/z3-z3-4.8.10/src/sat/smt/
H A Darith_axioms.cpp160 expr_ref rem(a.mk_rem(dividend, divisor), m); in mk_rem_axiom() local
165 literal pos = eq_internalize(rem, mod); in mk_rem_axiom()
166 literal neg = eq_internalize(rem, mmod); in mk_rem_axiom()
270 …olver::mk_var_bound(sat::literal lit, theory_var v, lp_api::bound_kind bk, rational const& bound) { in mk_var_bound() argument
282 cT = lp().mk_var_bound(vi, kT, bound); in mk_var_bound()
284 rational boundF = (bk == lp_api::lower_t) ? bound - 1 : bound + 1; in mk_var_bound()
288 cF = lp().mk_var_bound(vi, kF, bound); in mk_var_bound()
293 return alloc(api_bound, lit, v, vi, v_is_int, bound, bk, cT, cF); in mk_var_bound()
454 hi = floor(hi / mul); in check_idiv_bounds()
/dports/math/yices/yices-2.6.2/doc/
H A DYICES-LANGUAGE84 abs floor ceil div mod divides to-int
93 bv-div bv-rem bv-sdiv bv-srem bv-smod
300 (floor x) largest integer less than or equal to x
312 (floor x) <= x < (floor x) + 1
329 (div x k) = (floor (/ x k)) if k > 0
351 (is-int x) iff (= x (floor x))
470 (bv-rem x y): remainder in the unsigned division of x by y
476 (bv-rem x 0) = x
749 when the number of learned clauses >= reduction bound
751 reduction-bound := r-factor * reduction-bound
[all …]
/dports/math/p5-Math-Pari/pari-2.3.5/src/basemath/
H A Dpolarit3.c468 f=(long)floor(d/floor(r));
2135 rem += 2; gel(rem,i) = p1; in FpX_divrem()
2143 rem -= 2; in FpX_divrem()
2241 rem += 2; gel(rem,i) = p1; in FpXQX_divrem()
2249 rem -= 2; in FpXQX_divrem()
3081 ulong bound, p, dp; in ZY_ZXY_resultant_all() local
3141 check_theta(bound); in ZY_ZXY_resultant_all()
3318 if (!bound) in ZX_resultant_all()
3321 if (bound > 50000) in ZX_resultant_all()
3336 check_theta(bound); in ZX_resultant_all()
[all …]
/dports/math/cvc4/CVC4-1.7/src/theory/arith/
H A Dapprox_simplex.cpp239 back = carry.floor(); in rationalToCfe()
267 Integer quot,rem; in estimateWithCFE() local
280 Integer::floorQR(quot, rem, num, den); in estimateWithCFE()
281 num = den; den = rem; in estimateWithCFE()
291 Integer::floorQR(quot, rem, num, den); in estimateWithCFE()
292 num = den; den = rem; in estimateWithCFE()
1460 rhs = std::floor(br_val); in branchCut()
1777 beta += bound * psi; in sumConstraints()
2107 Rational roundB = (b + Rational(1,2)).floor(); in applyCMIRRule()
2125 Rational floor_aj = a_j.floor(); in applyCMIRRule()
[all …]
/dports/math/octave-forge-control/control-3.3.1/inst/
H A D__slicot_identification__.m56 if (rem (nkv, 2))
142 s = min (2*n, n+10); # upper bound for n
165 base = floor (min (svl));
233 error ("%s: require upper bound s <= %d, but the requested s is %d", method, nobr, s);
/dports/math/fricas/fricas-1.3.7/src/algebra/
H A Dlodof2.spad480 pr_extra := -((c2 * pi) rem r_low)
507 pr_extra := (c2 * pi) rem r_low
557 for j in 0..floor(degree(f) /$FZ denom(slop)) repeat
1059 nstep := floor(3 /$FZ 2 * nstep) + 2
1139 bound(i) := bound(i) + s.singularity.dxt * v(i+1)
1141 bound := [-bound(degree(f) - j) + j * eb :: FZ for j in 1..degree(f)-1]
1172 t := try_factorization(sop :: LL, floor(degree(f) /$FZ 2), bound,
1180 t := try_factorization(sop :: LL, floor(degree(f) /$FZ 2), bound,
1188 eb, floor(degree(f) /$FZ 2)+1, "")
1228 fl := floor(degree(f) /$FZ 2)
[all …]
H A Dgalfact.spad59 retract(floor(x))@Z
447 ++ with overall bound.
451 ++ factor bound, \spad{false} for algorithm with overall bound.
608 if (p.exponent = 1) and (not zero? (lc rem p.factor)) and
609 (not zero? (tc rem ((p.factor)^2))) then return true
716 while (zero? ((leadingCoefficient p) rem cprime)) or
755 select(x +-> x <= nm and x rem n = 0, d)
786 -- using the single-factor bound technique
851 -- HenselLift before coefficient bound.
875 -- HenselLift before coefficient bound.
[all …]
/dports/lang/ocaml/ocaml-4.05.0/asmcomp/
H A Dcmmgen.ml320 floor(n / d) = floor(n * m / 2^(wordsize+p))
322 ceil(n / d) = floor(n * m / 2^(wordsize+p)) + 1
989 let check_ba_bound bound idx v =
1001 let bound =
1005 check_ba_bound bound idxn idx)
1011 let bound =
1014 if unsafe then add_int (mul_int (decr_int rem dbg) bound dbg) arg1 dbg
1017 bind "bound" bound (fun bound ->
1019 (* [offset = rem * (tag_int bound) + idx] *)
1021 add_int (mul_int (decr_int rem dbg) bound dbg) idx dbg
[all …]
/dports/lang/ocaml-nox11/ocaml-4.05.0/asmcomp/
H A Dcmmgen.ml320 floor(n / d) = floor(n * m / 2^(wordsize+p))
322 ceil(n / d) = floor(n * m / 2^(wordsize+p)) + 1
989 let check_ba_bound bound idx v =
1001 let bound =
1005 check_ba_bound bound idxn idx)
1011 let bound =
1014 if unsafe then add_int (mul_int (decr_int rem dbg) bound dbg) arg1 dbg
1017 bind "bound" bound (fun bound ->
1019 (* [offset = rem * (tag_int bound) + idx] *)
1021 add_int (mul_int (decr_int rem dbg) bound dbg) idx dbg
[all …]
/dports/math/z3/z3-z3-4.8.13/src/smt/
H A Dtheory_lra.cpp956 r = (k == lp_api::upper_t) ? floor(r) : ceil(r); in internalize_atom()
1109 expr_ref rem(a.mk_rem(dividend, divisor), m); in mk_rem_axiom() local
1114 literal pos = th.mk_eq(rem, mod, false); in mk_rem_axiom()
1115 literal neg = th.mk_eq(rem, mmod, false); in mk_rem_axiom()
1647 offset = floor(offset / g); in mk_bound()
1738 hi = floor(hi/mul); in check_idiv_bounds()
2241 bound = mk_literal(a.mk_le(w, a.mk_numeral(floor(be.m_bound), a.is_int(w)))); in refine_bound()
2871 rational boundF = (bk == lp_api::lower_t) ? bound - 1 : bound + 1; in mk_var_bound()
3008 rational bound(0); in report_equality_of_fixed_vars() local
3064 if (bound.is_zero()) in fixed_var_eh()
[all …]
H A Dtheory_arith_core.h590 expr * rem = m_util.mk_rem(dividend, divisor); in mk_rem_axiom() local
594 eq1 = m.mk_eq(rem, mod); in mk_rem_axiom()
595 eq2 = m.mk_eq(rem, m_util.mk_sub(zero, mod)); in mk_rem_axiom()
710 bound * l = alloc(bound, v, ival, B_LOWER, false); in internalize_numeral()
711 bound * u = alloc(bound, v, ival, B_UPPER, false); in internalize_numeral()
1271 _k = floor(_k); in internalize_atom()
2413 bound * u = upper(v); in assert_lower()
2414 bound * l = lower(v); in assert_lower()
2531 void theory_arith<Ext>::sign_bound_conflict(bound * b1, bound * b2) { in sign_bound_conflict()
3269 num = floor(num); in mk_value()
[all …]
/dports/math/py-z3-solver/z3-z3-4.8.10/src/smt/
H A Dtheory_lra.cpp942 r = (k == lp_api::upper_t) ? floor(r) : ceil(r); in internalize_atom()
1116 expr_ref rem(a.mk_rem(dividend, divisor), m); in mk_rem_axiom() local
1121 literal pos = th.mk_eq(rem, mod, false); in mk_rem_axiom()
1122 literal neg = th.mk_eq(rem, mmod, false); in mk_rem_axiom()
1673 offset = floor(offset / g); in mk_bound()
1764 hi = floor(hi/mul); in check_idiv_bounds()
2259 bound = mk_literal(a.mk_le(w, a.mk_numeral(floor(be.m_bound), a.is_int(w)))); in refine_bound()
2272 if (bound == null_literal) in refine_bound()
2903 rational boundF = (bk == lp_api::lower_t) ? bound - 1 : bound + 1; in mk_var_bound()
3039 rational bound; in report_equality_of_fixed_vars() local
[all …]
H A Dtheory_arith_core.h590 expr * rem = m_util.mk_rem(dividend, divisor); in mk_rem_axiom() local
594 eq1 = m.mk_eq(rem, mod); in mk_rem_axiom()
595 eq2 = m.mk_eq(rem, m_util.mk_sub(zero, mod)); in mk_rem_axiom()
710 bound * l = alloc(bound, v, ival, B_LOWER, false); in internalize_numeral()
711 bound * u = alloc(bound, v, ival, B_UPPER, false); in internalize_numeral()
1271 _k = floor(_k); in internalize_atom()
2413 bound * u = upper(v); in assert_lower()
2414 bound * l = lower(v); in assert_lower()
2531 void theory_arith<Ext>::sign_bound_conflict(bound * b1, bound * b2) { in sign_bound_conflict()
3269 num = floor(num); in mk_value()
[all …]
/dports/math/giacxcas/giac-1.6.0/src/
H A Dmodpoly.cc3649 q=std::floor(a/a1); in invmod()
3702 double q=std::floor(t/m); in multdoublepoly()
3725 *kt=d-std::floor(d/m)*m; in quoremdouble()
14934 gen bound=p1; in mod_gcd_c() local
14940 bound=p2*bound; in mod_gcd_c()
14947 gen bound_=bound; in mod_gcd_c()
14953 bound=prime*bound; in mod_gcd_c()
14968 bound=bound_; in mod_gcd_c()
15008 bound=prime*bound; in mod_gcd_c()
15024 bound=prime*bound; in mod_gcd_c()
[all …]
/dports/lang/librep/librep_0.92.7/lisp/rep/vm/
H A Ddisassembler.jl52 "mul" "div" "rem" "lnot" "not" "lor" "land"
71 "floor" "ceiling" "truncate" "round"
172 (declare (bound open-buffer clear-buffer goto-other-view
/dports/math/gretl/gretl-2021d/lib/src/
H A Dgenfuncs.c710 int m, rem, bt2, x0; in block_resample_series() local
730 rem = n % blocklen; in block_resample_series()
736 n = m + (rem > 0); in block_resample_series()
2968 x -= floor(x); in get_first_panel_period()
2973 x = (x-floor(x) > 0.5)? ceil(x) : floor(x); in get_first_panel_period()
3595 return floor(x); in correct_to_int()
5242 bound = NADBL; in imhof_bound()
5245 return bound; in imhof_bound()
6236 double fx = floor(x); in gretl_round()
6482 int rem = T % cfac; in tdisagg_matrix_from_series() local
[all …]
/dports/net/keycloak/keycloak-15.1.1/themes/keycloak/common/resources/web_modules/@patternfly/
H A Dreact-core.js.map1 …floor(containerBounds.left);\n const containerBoundsRight = Math.floor(containerBounds.right);\n …
/dports/lang/sbcl/sbcl-1.3.13/src/code/
H A Dearly-extensions.lisp54 (def!type index/2 () `(integer 0 (,(floor sb!xc:array-dimension-limit 2))))
67 (let ((bound (ash 1 s)))
68 `(integer 0 ,(- bound bite 1))))
78 (let ((bound (ash 1 (1- s))))
79 `(integer ,(- bound) ,(- bound bite 1))))
214 (not (zerop (rem x 3)))

12345678910>>...20