/dports/devel/pijul/pijul-1.0.0.a55/cargo-crates/sanakirja-1.2.11/src/environment/ |
H A D | mod.rs | 127 n_roots: usize, in new_nolock() 158 n_roots: usize, in new_nolock_() 160 assert!(n_roots >= 1); in new_nolock_() 162 assert!(n_roots < 256); in new_nolock_() 167 init(map, n_roots); in new_nolock_() 171 n_roots in new_nolock_() 179 g.n_roots as usize in new_nolock_() 207 assert!(n_roots >= 1); in new_nolock_() 213 init(map, n_roots); in new_nolock_() 234 for i in 0..n_roots { in init() [all …]
|
H A D | global_header.rs | 11 pub n_roots: u8, field 30 n_roots: self.n_roots, in from_le() 41 n_roots: self.n_roots, in to_le()
|
/dports/math/cado-nfs/cado-nfs-f4284e2391121b2bfb97bc4880b6273c7250dc2f/sieve/ |
H A D | las-fbroot-qlattice.hpp | 34 const size_t n_roots); 51 const size_t n_roots) in fb_root_in_qlattice_31bits_batch() argument 74 const size_t n_roots) in fb_root_in_qlattice_127bits_batch() argument 78 n_roots); in fb_root_in_qlattice_127bits_batch() 103 const size_t n_roots) in fb_root_in_qlattice_batch() argument 123 const size_t n_roots) in fb_root_in_qlattice_batch() argument 126 n_roots); in fb_root_in_qlattice_batch() 233 const size_t n_roots) in fb_root_in_qlattice_31bits_batch() argument 258 uint32_t inverses[n_roots]; in fb_root_in_qlattice_31bits_batch() 427 const size_t n_roots) in fb_root_in_qlattice_127bits_batch() argument [all …]
|
/dports/sysutils/dvdisaster/dvdisaster-0.79.5/ |
H A D | rs03-common.c | 413 int n_roots = 0; 419 { n_roots = lay->eh->eccBytes; 446 n_roots = (int)round((GF_FIELDMAX*p) / (100.0+p)); 460 for(n_roots=170; n_roots>8; n_roots--) 461 if(ecc_size >= ecc_file_size(lay->dataSectors, n_roots)) 468 else if(!strcmp(Closure->redundancy, "high")) n_roots = 64; 469 else n_roots = atoi(Closure->redundancy); 474 if(n_roots < 8 || n_roots > 170) 475 Stop(_("Redundancy %d out of useful range [8..170]."),n_roots); 481 lay->nroots = n_roots; [all …]
|
/dports/www/firefox/firefox-99.0/third_party/prio/prio/ |
H A D | config.c | 21 const int n_roots = 1 << Generator2Order; in PrioConfig_maxDataFields() local 22 return (n_roots >> 1) - 1; in PrioConfig_maxDataFields() 39 cfg->n_roots = 1 << Generator2Order; in PrioConfig_new() 44 P_CHECKCB(cfg->n_roots > 1); in PrioConfig_new()
|
H A D | poly.c | 118 if (n_points > cfg->n_roots) { in poly_fft_get_roots() 127 const int step_size = cfg->n_roots / n_points; in poly_fft_get_roots() 159 if (n_points > cfg->n_roots) in poly_fft() 161 if (cfg->n_roots % n_points != 0) in poly_fft()
|
/dports/mail/thunderbird/thunderbird-91.8.0/third_party/prio/prio/ |
H A D | config.c | 21 const int n_roots = 1 << Generator2Order; in PrioConfig_maxDataFields() local 22 return (n_roots >> 1) - 1; in PrioConfig_maxDataFields() 39 cfg->n_roots = 1 << Generator2Order; in PrioConfig_new() 44 P_CHECKCB(cfg->n_roots > 1); in PrioConfig_new()
|
H A D | poly.c | 118 if (n_points > cfg->n_roots) { in poly_fft_get_roots() 127 const int step_size = cfg->n_roots / n_points; in poly_fft_get_roots() 159 if (n_points > cfg->n_roots) in poly_fft() 161 if (cfg->n_roots % n_points != 0) in poly_fft()
|
/dports/www/firefox-esr/firefox-91.8.0/third_party/prio/prio/ |
H A D | config.c | 21 const int n_roots = 1 << Generator2Order; in PrioConfig_maxDataFields() local 22 return (n_roots >> 1) - 1; in PrioConfig_maxDataFields() 39 cfg->n_roots = 1 << Generator2Order; in PrioConfig_new() 44 P_CHECKCB(cfg->n_roots > 1); in PrioConfig_new()
|
H A D | poly.c | 118 if (n_points > cfg->n_roots) { in poly_fft_get_roots() 127 const int step_size = cfg->n_roots / n_points; in poly_fft_get_roots() 159 if (n_points > cfg->n_roots) in poly_fft() 161 if (cfg->n_roots % n_points != 0) in poly_fft()
|
/dports/lang/spidermonkey78/firefox-78.9.0/third_party/prio/prio/ |
H A D | config.c | 21 const int n_roots = 1 << Generator2Order; in PrioConfig_maxDataFields() local 22 return (n_roots >> 1) - 1; in PrioConfig_maxDataFields() 39 cfg->n_roots = 1 << Generator2Order; in PrioConfig_new() 44 P_CHECKCB(cfg->n_roots > 1); in PrioConfig_new()
|
H A D | poly.c | 118 if (n_points > cfg->n_roots) { in poly_fft_get_roots() 127 const int step_size = cfg->n_roots / n_points; in poly_fft_get_roots() 159 if (n_points > cfg->n_roots) in poly_fft() 161 if (cfg->n_roots % n_points != 0) in poly_fft()
|
/dports/devel/hwloc/hwloc-1.11.13/include/hwloc/ |
H A D | deprecated.h | 90 hwloc_distributev(hwloc_topology_t topology, hwloc_obj_t *roots, unsigned n_roots, hwloc_cpuset_t *… 92 hwloc_distributev(hwloc_topology_t topology, hwloc_obj_t *roots, unsigned n_roots, hwloc_cpuset_t *… in hwloc_distributev() argument 94 hwloc_distrib(topology, roots, n_roots, set, n, until, 0); in hwloc_distributev()
|
/dports/net/openmpi3/openmpi-3.1.6/opal/mca/hwloc/hwloc1117/hwloc/include/hwloc/ |
H A D | deprecated.h | 90 hwloc_distributev(hwloc_topology_t topology, hwloc_obj_t *roots, unsigned n_roots, hwloc_cpuset_t *… 92 hwloc_distributev(hwloc_topology_t topology, hwloc_obj_t *roots, unsigned n_roots, hwloc_cpuset_t *… in hwloc_distributev() argument 94 hwloc_distrib(topology, roots, n_roots, set, n, until, 0); in hwloc_distributev()
|
/dports/misc/visp/visp-3.4.0/3rdparty/apriltag/ |
H A D | apriltag_pose.cpp | 155 void solve_poly_approx(double* p, int degree, double* roots, int* n_roots) { in solve_poly_approx() argument 159 *n_roots = 0; in solve_poly_approx() 162 *n_roots = 1; in solve_poly_approx() 179 *n_roots = 0; in solve_poly_approx() 240 roots[(*n_roots)++] = root; in solve_poly_approx() 243 roots[(*n_roots)++] = max; in solve_poly_approx() 398 int n_roots; in fix_pose_ambiguities() local 400 solve_poly_approx(data_points, 4, roots, &n_roots); in fix_pose_ambiguities() 404 for (int i = 0; i < n_roots; i++) { in fix_pose_ambiguities()
|
/dports/x11/xprop/xprop-1.2.5/ |
H A D | clientwin.c | 182 unsigned int i, n_roots; in Find_Client() local 186 roots = Find_Roots(dpy, root, &n_roots); in Find_Client() 187 for (i = 0; i < n_roots; i++) { in Find_Client()
|
/dports/x11/xwd/xwd-1.0.7/ |
H A D | clientwin.c | 182 unsigned long i, n_roots; in Find_Client() local 186 roots = Find_Roots(dpy, root, &n_roots); in Find_Client() 187 for (i = 0; i < n_roots; i++) { in Find_Client()
|
/dports/x11/xsnow/xsnow-3.4.2/src/ |
H A D | clientwin.c | 207 unsigned int i, n_roots; in Find_Client() local 211 roots = Find_Roots(dpy, root, &n_roots); in Find_Client() 212 for (i = 0; i < n_roots; i++) { in Find_Client()
|
/dports/x11/xwininfo/xwininfo-1.1.5/ |
H A D | clientwin.c | 213 unsigned int i, n_roots; in Find_Client() local 217 roots = Find_Roots(dpy, root, &n_roots); in Find_Client() 218 for (i = 0; i < n_roots; i++) { in Find_Client()
|
/dports/devel/boost-docs/boost_1_72_0/libs/math/example/ |
H A D | airy_zeros_example.cpp | 99 unsigned int n_roots = 5U; in main() local 101 boost::math::airy_ai_zero<double>(1U, n_roots, std::back_inserter(roots)); in main()
|
/dports/devel/boost-python-libs/boost_1_72_0/libs/math/example/ |
H A D | airy_zeros_example.cpp | 99 unsigned int n_roots = 5U; in main() local 101 boost::math::airy_ai_zero<double>(1U, n_roots, std::back_inserter(roots)); in main()
|
/dports/databases/percona57-pam-for-mysql/boost_1_59_0/libs/math/example/ |
H A D | airy_zeros_example.cpp | 99 unsigned int n_roots = 5U; in main() local 101 boost::math::airy_ai_zero<double>(1U, n_roots, std::back_inserter(roots)); in main()
|
/dports/databases/percona57-server/boost_1_59_0/libs/math/example/ |
H A D | airy_zeros_example.cpp | 99 unsigned int n_roots = 5U; in main() local 101 boost::math::airy_ai_zero<double>(1U, n_roots, std::back_inserter(roots)); in main()
|
/dports/databases/xtrabackup/boost_1_59_0/libs/math/example/ |
H A D | airy_zeros_example.cpp | 99 unsigned int n_roots = 5U; in main() local 101 boost::math::airy_ai_zero<double>(1U, n_roots, std::back_inserter(roots)); in main()
|
/dports/databases/percona57-client/boost_1_59_0/libs/math/example/ |
H A D | airy_zeros_example.cpp | 99 unsigned int n_roots = 5U; in main() local 101 boost::math::airy_ai_zero<double>(1U, n_roots, std::back_inserter(roots)); in main()
|