Home
last modified time | relevance | path

Searched refs:pol (Results 251 – 275 of 9632) sorted by relevance

1...<<11121314151617181920>>...386

/dports/devel/R-cran-BH/BH/inst/include/boost/math/special_functions/
H A Dgamma.hpp261 result = log(gamma_imp(z, pol, l));
747 + lgamma_small_imp<T>(dz+2, dz + 1, dz, tag_type(), pol, l), pol);
756 result = boost::math::expm1(lgamma_small_imp<T>(dz+1, dz, dz-1, tag_type(), pol, l), pol);
1027 T p = boost::math::powm1(x, a, pol); in tgamma_small_upper_part()
1650 return boost::math::tgamma(z, pol) / boost::math::tgamma(z + delta, pol);
1720 return boost::math::tgamma(x, pol) / boost::math::tgamma(y, pol);
1736 return prefix * boost::math::tgamma(x, pol) / boost::math::tgamma(y, pol);
1741 return exp(boost::math::lgamma(x, pol) - boost::math::lgamma(y, pol));
1756 return prefix * boost::math::tgamma(x, pol) / boost::math::tgamma(y, pol);
1761 return exp(boost::math::lgamma(x, pol) - boost::math::lgamma(y, pol));
[all …]
H A Dtrunc.hpp63 inline int itrunc(const T& v, const Policy& pol) in itrunc() argument
67 result_type r = boost::math::trunc(v, pol); in itrunc()
79 inline long ltrunc(const T& v, const Policy& pol) in ltrunc() argument
83 result_type r = boost::math::trunc(v, pol); in ltrunc()
99 result_type r = boost::math::trunc(v, pol); in lltrunc()
122 iconvert(const T& v, const Policy& pol) in iconvert() argument
125 return itrunc(v, pol); in iconvert()
137 lconvert(const T& v, const Policy& pol) in lconvert() argument
140 return ltrunc(v, pol); in lconvert()
152 llconvertert(const T& v, const Policy& pol) in llconvertert() argument
[all …]
/dports/games/frogatto/frogatto-1.3.1/MacOSJet/boost/include/boost/math/special_functions/
H A Dnext.hpp51 T float_next(const T& val, const Policy& pol)
60 "Argument must be finite, but got %1%", val, pol);
85 "Argument must be finite, but got %1%", val, pol); in float_next()
101 T float_prior(const T& val, const Policy& pol)
110 "Argument must be finite, but got %1%", val, pol);
136 "Argument must be finite, but got %1%", val, pol); in float_prior()
154 … < direction ? boost::math::float_next(val, pol) : val == direction ? val : boost::math::float_pri… in nextafter()
249 T float_advance(T val, int distance, const Policy& pol)
261 return -float_advance(-val, -distance, pol);
265 return float_next(val, pol);
[all …]
H A Dfactorials.hpp31 inline T factorial(unsigned i, const Policy& pol) in factorial() argument
45 T result = boost::math::tgamma(static_cast<T>(i+1), pol); in factorial()
75 T double_factorial(unsigned i, const Policy& pol)
99 T result = factorial<T>(n, pol);
118 T rising_factorial_imp(T x, int n, const Policy& pol)
177 unsigned n2 = itrunc((T)floor(xp1), pol); in falling_factorial_imp()
185 result *= falling_factorial(x - 1, n - n2, pol); in falling_factorial_imp()
211 falling_factorial(RT x, unsigned n, const Policy& pol) in falling_factorial() argument
215 static_cast<result_type>(x), n, pol); in falling_factorial()
229 rising_factorial(RT x, int n, const Policy& pol) in rising_factorial() argument
[all …]
/dports/math/cvc4/CVC4-1.7/src/theory/quantifiers/
H A Drelevant_domain.cpp184 computeRelevantDomainLit( q, hasPol, pol, n ); in computeRelevantDomain()
185 if( d_rel_dom_lit[hasPol][pol][n].d_merge ){ in computeRelevantDomain()
186 …Assert( d_rel_dom_lit[hasPol][pol][n].d_rd[0]!=NULL && d_rel_dom_lit[hasPol][pol][n].d_rd[1]!=NULL… in computeRelevantDomain()
223 if( d_rel_dom_lit[hasPol][pol].find( n )==d_rel_dom_lit[hasPol][pol].end() ){ in computeRelevantDomainLit()
224 d_rel_dom_lit[hasPol][pol][n].d_merge = false; in computeRelevantDomainLit()
240 d_rel_dom_lit[hasPol][pol][n].d_merge = true; in computeRelevantDomainLit()
245 d_rel_dom_lit[hasPol][pol][n].d_rd[0] = d_rel_dom_lit[hasPol][pol][n].d_rd[varCh]; in computeRelevantDomainLit()
295 if( d_rel_dom_lit[hasPol][pol][n].d_merge ){ in computeRelevantDomainLit()
297 if( hasPol && !pol ){ in computeRelevantDomainLit()
303 if( !hasPol || !pol ){ in computeRelevantDomainLit()
[all …]
/dports/math/e-antic/e-antic-1.0.0-rc.13/libeantic/src/fmpz_poly_extra/
H A Dpositive_root_upper_bound_2exp.c37 int sgn = fmpz_sgn(pol + len - 1); in _fmpz_poly_positive_root_upper_bound_2exp_local_max()
40 if (fmpz_sgn(pol + i) == 0 || fmpz_sgn(pol + i) == sgn) continue; in _fmpz_poly_positive_root_upper_bound_2exp_local_max()
51 fmpz_set(tmp, pol + i); in _fmpz_poly_positive_root_upper_bound_2exp_local_max()
55 fmpz_set(tmp, pol + j); in _fmpz_poly_positive_root_upper_bound_2exp_local_max()
82 slong _fmpz_poly_positive_root_upper_bound_2exp(const fmpz * pol, slong len) in _fmpz_poly_positive_root_upper_bound_2exp() argument
84 return _fmpz_poly_positive_root_upper_bound_2exp_local_max(pol, len); in _fmpz_poly_positive_root_upper_bound_2exp()
87 slong fmpz_poly_positive_root_upper_bound_2exp(const fmpz_poly_t pol) in fmpz_poly_positive_root_upper_bound_2exp() argument
91 if (fmpz_poly_is_zero(pol)) return 0; in fmpz_poly_positive_root_upper_bound_2exp()
94 while (fmpz_is_zero(pol->coeffs + i0)) i0++; in fmpz_poly_positive_root_upper_bound_2exp()
97 pol->coeffs + i0, in fmpz_poly_positive_root_upper_bound_2exp()
[all …]
/dports/devel/boost-docs/boost_1_72_0/boost/math/special_functions/
H A Dtrunc.hpp60 inline int itrunc(const T& v, const Policy& pol) in itrunc() argument
64 result_type r = boost::math::trunc(v, pol); in itrunc()
76 inline long ltrunc(const T& v, const Policy& pol) in ltrunc() argument
80 result_type r = boost::math::trunc(v, pol); in ltrunc()
98 result_type r = boost::math::trunc(v, pol); in lltrunc()
120 iconvert(const T& v, const Policy& pol) in iconvert() argument
123 return itrunc(v, pol); in iconvert()
135 lconvert(const T& v, const Policy& pol) in lconvert() argument
138 return ltrunc(v, pol); in lconvert()
152 llconvertert(const T& v, const Policy& pol) in llconvertert() argument
[all …]
/dports/devel/hyperscan/boost_1_75_0/boost/math/special_functions/
H A Dtrunc.hpp60 inline int itrunc(const T& v, const Policy& pol) in itrunc() argument
64 result_type r = boost::math::trunc(v, pol); in itrunc()
76 inline long ltrunc(const T& v, const Policy& pol) in ltrunc() argument
80 result_type r = boost::math::trunc(v, pol); in ltrunc()
98 result_type r = boost::math::trunc(v, pol); in lltrunc()
120 iconvert(const T& v, const Policy& pol) in iconvert() argument
123 return itrunc(v, pol); in iconvert()
135 lconvert(const T& v, const Policy& pol) in lconvert() argument
138 return ltrunc(v, pol); in lconvert()
152 llconvertert(const T& v, const Policy& pol) in llconvertert() argument
[all …]
/dports/net/samba412/samba-4.12.15/source4/scripting/bin/
H A Dsamba3dump32 def print_samba3_policy(pol):
36 if pol['user must logon to change password']:
38 if pol['maximum password age']:
40 if pol['minimum password age']:
42 if pol['lockout duration']:
43 print("Lockout duration: %d" % pol['lockout duration'])
44 if pol['reset count minutes']:
46 if pol['bad lockout attempt']:
48 if pol['disconnect time']:
49 print("Disconnect Time: %d" % pol['disconnect time'])
[all …]
/dports/math/stanmath/math-4.2.0/lib/boost_1.75.0/boost/math/special_functions/
H A Dtrunc.hpp60 inline int itrunc(const T& v, const Policy& pol) in itrunc() argument
64 result_type r = boost::math::trunc(v, pol); in itrunc()
76 inline long ltrunc(const T& v, const Policy& pol) in ltrunc() argument
80 result_type r = boost::math::trunc(v, pol); in ltrunc()
98 result_type r = boost::math::trunc(v, pol); in lltrunc()
120 iconvert(const T& v, const Policy& pol) in iconvert() argument
123 return itrunc(v, pol); in iconvert()
135 lconvert(const T& v, const Policy& pol) in lconvert() argument
138 return ltrunc(v, pol); in lconvert()
152 llconvertert(const T& v, const Policy& pol) in llconvertert() argument
[all …]
/dports/science/py-scipy/scipy-1.7.1/scipy/_lib/boost/boost/math/special_functions/
H A Dtrunc.hpp60 inline int itrunc(const T& v, const Policy& pol) in itrunc() argument
64 result_type r = boost::math::trunc(v, pol); in itrunc()
76 inline long ltrunc(const T& v, const Policy& pol) in ltrunc() argument
80 result_type r = boost::math::trunc(v, pol); in ltrunc()
98 result_type r = boost::math::trunc(v, pol); in lltrunc()
120 iconvert(const T& v, const Policy& pol) in iconvert() argument
123 return itrunc(v, pol); in iconvert()
135 lconvert(const T& v, const Policy& pol) in lconvert() argument
138 return ltrunc(v, pol); in lconvert()
152 llconvertert(const T& v, const Policy& pol) in llconvertert() argument
[all …]
/dports/devel/boost-libs/boost_1_72_0/boost/math/special_functions/
H A Dtrunc.hpp60 inline int itrunc(const T& v, const Policy& pol) in itrunc() argument
64 result_type r = boost::math::trunc(v, pol); in itrunc()
76 inline long ltrunc(const T& v, const Policy& pol) in ltrunc() argument
80 result_type r = boost::math::trunc(v, pol); in ltrunc()
98 result_type r = boost::math::trunc(v, pol); in lltrunc()
120 iconvert(const T& v, const Policy& pol) in iconvert() argument
123 return itrunc(v, pol); in iconvert()
135 lconvert(const T& v, const Policy& pol) in lconvert() argument
138 return ltrunc(v, pol); in lconvert()
152 llconvertert(const T& v, const Policy& pol) in llconvertert() argument
[all …]
/dports/devel/boost-python-libs/boost_1_72_0/boost/math/special_functions/
H A Dtrunc.hpp60 inline int itrunc(const T& v, const Policy& pol) in itrunc() argument
64 result_type r = boost::math::trunc(v, pol); in itrunc()
76 inline long ltrunc(const T& v, const Policy& pol) in ltrunc() argument
80 result_type r = boost::math::trunc(v, pol); in ltrunc()
98 result_type r = boost::math::trunc(v, pol); in lltrunc()
120 iconvert(const T& v, const Policy& pol) in iconvert() argument
123 return itrunc(v, pol); in iconvert()
135 lconvert(const T& v, const Policy& pol) in lconvert() argument
138 return ltrunc(v, pol); in lconvert()
152 llconvertert(const T& v, const Policy& pol) in llconvertert() argument
[all …]
/dports/devel/py-pythran/pythran-0.11.0/pythran/boost/math/special_functions/
H A Dtrunc.hpp60 inline int itrunc(const T& v, const Policy& pol) in itrunc() argument
64 result_type r = boost::math::trunc(v, pol); in itrunc()
76 inline long ltrunc(const T& v, const Policy& pol) in ltrunc() argument
80 result_type r = boost::math::trunc(v, pol); in ltrunc()
98 result_type r = boost::math::trunc(v, pol); in lltrunc()
120 iconvert(const T& v, const Policy& pol) in iconvert() argument
123 return itrunc(v, pol); in iconvert()
135 lconvert(const T& v, const Policy& pol) in lconvert() argument
138 return ltrunc(v, pol); in lconvert()
152 llconvertert(const T& v, const Policy& pol) in llconvertert() argument
[all …]
/dports/devel/py-pythran/pythran-0.11.0/third_party/boost/math/special_functions/
H A Dtrunc.hpp60 inline int itrunc(const T& v, const Policy& pol) in itrunc() argument
64 result_type r = boost::math::trunc(v, pol); in itrunc()
76 inline long ltrunc(const T& v, const Policy& pol) in ltrunc() argument
80 result_type r = boost::math::trunc(v, pol); in ltrunc()
98 result_type r = boost::math::trunc(v, pol); in lltrunc()
120 iconvert(const T& v, const Policy& pol) in iconvert() argument
123 return itrunc(v, pol); in iconvert()
135 lconvert(const T& v, const Policy& pol) in lconvert() argument
138 return ltrunc(v, pol); in lconvert()
152 llconvertert(const T& v, const Policy& pol) in llconvertert() argument
[all …]
/dports/math/mlpack/mlpack-3.4.2/src/mlpack/core/boost_backport/
H A Dbernoulli.hpp21 T bernoulli_b2n(const int i, const Policy &pol);
28 const Policy& pol);
34 T tangent_t2n(const int i, const Policy &pol);
41 const Policy& pol);
87 return get_bernoulli_numbers_cache<T, Policy>().copy_bernoulli_numbers(out, start, n, pol);
93 inline T bernoulli_b2n(const int i, const Policy &pol) in bernoulli_b2n() argument
100 …boost::math::detail::bernoulli_number_imp<T>(&result, static_cast<std::size_t>(i), 1u, pol, tag_ty… in bernoulli_b2n()
114 const Policy& pol) in bernoulli_b2n() argument
135 inline T tangent_t2n(const int i, const Policy &pol) in tangent_t2n() argument
141 …t::math::detail::get_bernoulli_numbers_cache<T, Policy>().copy_tangent_numbers(&result, i, 1, pol); in tangent_t2n()
[all …]
/dports/lang/gcc6-aux/gcc-6-20180516/gcc/
H A Dtree-chkp-opt.c54 vec<struct pol_item> pol; member
164 addr.pol[n].cst = fold_build2 (PLUS_EXPR, TREE_TYPE (addr.pol[n].cst), in chkp_add_addr_item()
192 addr.pol[n].cst = fold_build2 (MINUS_EXPR, TREE_TYPE (addr.pol[n].cst), in chkp_sub_addr_item()
206 chkp_add_addr_item (addr, delta.pol[i].cst, delta.pol[i].var); in chkp_add_addr_addr()
215 chkp_sub_addr_item (addr, delta.pol[i].cst, delta.pol[i].var); in chkp_sub_addr_addr()
224 addr.pol[i].cst = fold_build2 (MULT_EXPR, TREE_TYPE (addr.pol[i].cst), in chkp_mult_addr()
295 addr.pol.create (0); in chkp_collect_addr_value()
315 addr.pol.create (0); in chkp_collect_addr_value()
318 addr.pol.release (); in chkp_collect_addr_value()
321 addr.pol.create (0); in chkp_collect_addr_value()
[all …]
/dports/lang/gcc8/gcc-8.5.0/gcc/
H A Dtree-chkp-opt.c54 vec<struct pol_item> pol; member
164 addr.pol[n].cst = fold_build2 (PLUS_EXPR, TREE_TYPE (addr.pol[n].cst), in chkp_add_addr_item()
192 addr.pol[n].cst = fold_build2 (MINUS_EXPR, TREE_TYPE (addr.pol[n].cst), in chkp_sub_addr_item()
206 chkp_add_addr_item (addr, delta.pol[i].cst, delta.pol[i].var); in chkp_add_addr_addr()
215 chkp_sub_addr_item (addr, delta.pol[i].cst, delta.pol[i].var); in chkp_sub_addr_addr()
224 addr.pol[i].cst = fold_build2 (MULT_EXPR, TREE_TYPE (addr.pol[i].cst), in chkp_mult_addr()
295 addr.pol.create (0); in chkp_collect_addr_value()
315 addr.pol.create (0); in chkp_collect_addr_value()
318 addr.pol.release (); in chkp_collect_addr_value()
321 addr.pol.create (0); in chkp_collect_addr_value()
[all …]
/dports/devel/riscv64-none-elf-gcc/gcc-8.4.0/gcc/
H A Dtree-chkp-opt.c54 vec<struct pol_item> pol; member
164 addr.pol[n].cst = fold_build2 (PLUS_EXPR, TREE_TYPE (addr.pol[n].cst), in chkp_add_addr_item()
192 addr.pol[n].cst = fold_build2 (MINUS_EXPR, TREE_TYPE (addr.pol[n].cst), in chkp_sub_addr_item()
206 chkp_add_addr_item (addr, delta.pol[i].cst, delta.pol[i].var); in chkp_add_addr_addr()
215 chkp_sub_addr_item (addr, delta.pol[i].cst, delta.pol[i].var); in chkp_sub_addr_addr()
224 addr.pol[i].cst = fold_build2 (MULT_EXPR, TREE_TYPE (addr.pol[i].cst), in chkp_mult_addr()
295 addr.pol.create (0); in chkp_collect_addr_value()
315 addr.pol.create (0); in chkp_collect_addr_value()
318 addr.pol.release (); in chkp_collect_addr_value()
321 addr.pol.create (0); in chkp_collect_addr_value()
[all …]
/dports/devel/arm-none-eabi-gcc/gcc-8.4.0/gcc/
H A Dtree-chkp-opt.c54 vec<struct pol_item> pol; member
164 addr.pol[n].cst = fold_build2 (PLUS_EXPR, TREE_TYPE (addr.pol[n].cst), in chkp_add_addr_item()
192 addr.pol[n].cst = fold_build2 (MINUS_EXPR, TREE_TYPE (addr.pol[n].cst), in chkp_sub_addr_item()
206 chkp_add_addr_item (addr, delta.pol[i].cst, delta.pol[i].var); in chkp_add_addr_addr()
215 chkp_sub_addr_item (addr, delta.pol[i].cst, delta.pol[i].var); in chkp_sub_addr_addr()
224 addr.pol[i].cst = fold_build2 (MULT_EXPR, TREE_TYPE (addr.pol[i].cst), in chkp_mult_addr()
295 addr.pol.create (0); in chkp_collect_addr_value()
315 addr.pol.create (0); in chkp_collect_addr_value()
318 addr.pol.release (); in chkp_collect_addr_value()
321 addr.pol.create (0); in chkp_collect_addr_value()
[all …]
/dports/devel/riscv32-unknown-elf-gcc/gcc-8.4.0/gcc/
H A Dtree-chkp-opt.c54 vec<struct pol_item> pol; member
164 addr.pol[n].cst = fold_build2 (PLUS_EXPR, TREE_TYPE (addr.pol[n].cst), in chkp_add_addr_item()
192 addr.pol[n].cst = fold_build2 (MINUS_EXPR, TREE_TYPE (addr.pol[n].cst), in chkp_sub_addr_item()
206 chkp_add_addr_item (addr, delta.pol[i].cst, delta.pol[i].var); in chkp_add_addr_addr()
215 chkp_sub_addr_item (addr, delta.pol[i].cst, delta.pol[i].var); in chkp_sub_addr_addr()
224 addr.pol[i].cst = fold_build2 (MULT_EXPR, TREE_TYPE (addr.pol[i].cst), in chkp_mult_addr()
295 addr.pol.create (0); in chkp_collect_addr_value()
315 addr.pol.create (0); in chkp_collect_addr_value()
318 addr.pol.release (); in chkp_collect_addr_value()
321 addr.pol.create (0); in chkp_collect_addr_value()
[all …]
/dports/devel/aarch64-none-elf-gcc/gcc-8.4.0/gcc/
H A Dtree-chkp-opt.c54 vec<struct pol_item> pol; member
164 addr.pol[n].cst = fold_build2 (PLUS_EXPR, TREE_TYPE (addr.pol[n].cst), in chkp_add_addr_item()
192 addr.pol[n].cst = fold_build2 (MINUS_EXPR, TREE_TYPE (addr.pol[n].cst), in chkp_sub_addr_item()
206 chkp_add_addr_item (addr, delta.pol[i].cst, delta.pol[i].var); in chkp_add_addr_addr()
215 chkp_sub_addr_item (addr, delta.pol[i].cst, delta.pol[i].var); in chkp_sub_addr_addr()
224 addr.pol[i].cst = fold_build2 (MULT_EXPR, TREE_TYPE (addr.pol[i].cst), in chkp_mult_addr()
295 addr.pol.create (0); in chkp_collect_addr_value()
315 addr.pol.create (0); in chkp_collect_addr_value()
318 addr.pol.release (); in chkp_collect_addr_value()
321 addr.pol.create (0); in chkp_collect_addr_value()
[all …]
/dports/lang/gnat_util/gcc-6-20180516/gcc/
H A Dtree-chkp-opt.c54 vec<struct pol_item> pol; member
164 addr.pol[n].cst = fold_build2 (PLUS_EXPR, TREE_TYPE (addr.pol[n].cst), in chkp_add_addr_item()
192 addr.pol[n].cst = fold_build2 (MINUS_EXPR, TREE_TYPE (addr.pol[n].cst), in chkp_sub_addr_item()
206 chkp_add_addr_item (addr, delta.pol[i].cst, delta.pol[i].var); in chkp_add_addr_addr()
215 chkp_sub_addr_item (addr, delta.pol[i].cst, delta.pol[i].var); in chkp_sub_addr_addr()
224 addr.pol[i].cst = fold_build2 (MULT_EXPR, TREE_TYPE (addr.pol[i].cst), in chkp_mult_addr()
295 addr.pol.create (0); in chkp_collect_addr_value()
315 addr.pol.create (0); in chkp_collect_addr_value()
318 addr.pol.release (); in chkp_collect_addr_value()
321 addr.pol.create (0); in chkp_collect_addr_value()
[all …]
/dports/devel/riscv64-gcc/gcc-8.3.0/gcc/
H A Dtree-chkp-opt.c54 vec<struct pol_item> pol; member
164 addr.pol[n].cst = fold_build2 (PLUS_EXPR, TREE_TYPE (addr.pol[n].cst), in chkp_add_addr_item()
192 addr.pol[n].cst = fold_build2 (MINUS_EXPR, TREE_TYPE (addr.pol[n].cst), in chkp_sub_addr_item()
206 chkp_add_addr_item (addr, delta.pol[i].cst, delta.pol[i].var); in chkp_add_addr_addr()
215 chkp_sub_addr_item (addr, delta.pol[i].cst, delta.pol[i].var); in chkp_sub_addr_addr()
224 addr.pol[i].cst = fold_build2 (MULT_EXPR, TREE_TYPE (addr.pol[i].cst), in chkp_mult_addr()
295 addr.pol.create (0); in chkp_collect_addr_value()
315 addr.pol.create (0); in chkp_collect_addr_value()
318 addr.pol.release (); in chkp_collect_addr_value()
321 addr.pol.create (0); in chkp_collect_addr_value()
[all …]
/dports/math/e-antic/e-antic-1.0.0-rc.13/libeantic/upstream/antic/nf_elem/profile/
H A Dp-norm.c42 fmpq_poly_fit_length(pol, length); in random_fmpq_poly()
44 arr = fmpq_poly_numref(pol); in random_fmpq_poly()
51 _fmpq_poly_set_length(pol, length); in random_fmpq_poly()
52 _fmpq_poly_normalise(pol); in random_fmpq_poly()
53 fmpq_poly_canonicalise(pol); in random_fmpq_poly()
58 slong len = nf->pol->length - 1; in random_nf_elem()
78 fmpq_poly_t pol; in sample() local
83 fmpq_poly_init(pol); in sample()
91 fmpz_one(fmpq_poly_denref(pol)); in sample()
95 nf_init(nf, pol); in sample()
[all …]

1...<<11121314151617181920>>...386