/dports/math/py-yt/yt-4.0.1/yt/utilities/ |
H A D | decompose.py | 27 def evaluate_domain_decomposition(n_d, pieces, ldom): 30 eff_dim = (n_d > 1).sum() 33 mask = np.where(n_d > 1) 34 nd_arr = np.array(n_d, dtype=np.float64)[mask] 36 load_balance = float(np.product(n_d)) / ( 37 float(pieces) * np.product((n_d - 1) // ldom + 1) 46 if np.any(ldom > n_d): 66 def get_psize(n_d, pieces): 87 quality = evaluate_domain_decomposition(n_d, pieces, ldom) 107 n_d = np.array(shape, dtype=np.int64) [all …]
|
/dports/science/cp2k/cp2k-2e995eec7fd208c8a72d9544807bd8b8ba8cd1cc/tools/hfx_tools/contraction/templates/ |
H A D | subroutine_specific | 8 REAL(dp), DIMENSION(nco(n_a)*nco(n_b)*nco(n_c)*nco(n_d)), INTENT(IN) :: work 13 REAL(dp), DIMENSION(nco(n_d),nso(n_d)*nl_d), INTENT(IN) :: sphi_d 15 REAL(dp), DIMENSION(nso(n_a)*nl_a, nso(n_b)*nl_b,nso(n_c)*nl_c,nso(n_d)*nl_d) :: primitives 16 REAL(dp), DIMENSION(nco(n_a)* nco(n_b)*nco(n_c)*nco(n_d)) :: buffer1, buffer2 31 imax=nco(n_b)*nco(n_c)*nco(n_d) 38 imax=nso(n_a)*nco(n_c)*nco(n_d) 45 imax=nso(n_a)*nso(n_b)*nco(n_d) 52 kmax=nco(n_d) 62 s_offset_d1 = s_offset_d1 + nso(n_d)
|
/dports/science/cp2k-data/cp2k-7.1.0/tools/hfx_tools/contraction/templates/ |
H A D | subroutine_specific | 8 REAL(dp), DIMENSION(nco(n_a)*nco(n_b)*nco(n_c)*nco(n_d)), INTENT(IN) :: work 13 REAL(dp), DIMENSION(nco(n_d),nso(n_d)*nl_d), INTENT(IN) :: sphi_d 15 REAL(dp), DIMENSION(nso(n_a)*nl_a, nso(n_b)*nl_b,nso(n_c)*nl_c,nso(n_d)*nl_d) :: primitives 16 REAL(dp), DIMENSION(nco(n_a)* nco(n_b)*nco(n_c)*nco(n_d)) :: buffer1, buffer2 31 imax=nco(n_b)*nco(n_c)*nco(n_d) 38 imax=nso(n_a)*nco(n_c)*nco(n_d) 45 imax=nso(n_a)*nso(n_b)*nco(n_d) 52 kmax=nco(n_d) 62 s_offset_d1 = s_offset_d1 + nso(n_d)
|
/dports/mail/rspamd/rspamd-3.1/contrib/kann/ |
H A D | kautodiff.c | 28 s->n_d = n_d, s->op = op, s->n_child = n_child; in kad_new_core() 39 p->n_d = n_d; in kad_vleaf() 169 if (x->n_d != 4 || w->n_d != 4) return 0; in kad_conv2d() 200 if (x->n_d != 3 || w->n_d != 3) return 0; in kad_conv1d() 613 if (p->n_d) fwrite(p->d, 4, p->n_d, fp); in kad_save1() 1090 dst->n_d = src->n_d; in kad_copy_dim1() 1177 …n_col = q[0]->d[q[0]->n_d - 1] > q[1]->d[q[1]->n_d - 1]? q[0]->d[q[0]->n_d - 1] : q[1]->d[q[1]->n_… in kad_op_cmul() 1299 p->n_d = q->n_d - 1; in kad_op_reduce_sum() 1328 p->n_d = q->n_d - 1; in kad_op_reduce_mean() 1888 p->n_d = q->n_d + 1; in kad_op_stack() [all …]
|
H A D | kautodiff.h | 68 uint8_t n_d; /* number of dimensions; no larger than KAD_MAX_DIM */ member 143 kad_node_t *kad_var(float *x, float *g, int n_d, ...); /* a variable; gradients to be computed; not… 144 kad_node_t *kad_const(float *x, int n_d, ...); /* a constant; no gradients computed; not un… 145 kad_node_t *kad_feed(int n_d, ...); /* an input/output; no gradients computed; u… 201 kad_node_t *kad_reshape(kad_node_t *x, int n_d, int *d); /* reshape; similar behavior to… 242 for (i = 0; i < p->n_d; ++i) n *= p->d[i]; in kad_len()
|
H A D | kann.c | 68 if (cost->n_d != 0) return 0; in kann_new() 179 …++k, n = a->v[i]->n_d > 1? kad_len(a->v[i]) / a->v[i]->d[0] : a->v[i]->n_d == 1? a->v[i]->d[0] : 1; in kann_feed_dim() 236 n = t->d[t->n_d - 1], m = kad_len(t) / n; in kann_class_error_core() 400 if (p->pre && p->n_d >= 2 && p->d[0] == B) { in kann_cost() 425 for (i = 1; i < p->n_d; ++i) d1 *= p->d[i]; in kann_eval_out() 539 p->n_d = n_d, p->flag = flag; in kann_new_leaf_array() 540 memcpy(p->d, d, n_d * sizeof(int32_t)); in kann_new_leaf_array() 543 if (p->n_d <= 1) { in kann_new_leaf_array() 560 va_start(ap, n_d); for (i = 0; i < n_d; ++i) d[i] = va_arg(ap, int); va_end(ap); in kann_new_leaf2() 660 va_start(ap, n_d); for (i = 0; i < n_d; ++i) d[i] = va_arg(ap, int); va_end(ap); in kann_new_leaf() [all …]
|
/dports/mail/rspamd-devel/rspamd-93430bb/contrib/kann/ |
H A D | kautodiff.c | 28 s->n_d = n_d, s->op = op, s->n_child = n_child; in kad_new_core() 39 p->n_d = n_d; in kad_vleaf() 169 if (x->n_d != 4 || w->n_d != 4) return 0; in kad_conv2d() 200 if (x->n_d != 3 || w->n_d != 3) return 0; in kad_conv1d() 613 if (p->n_d) fwrite(p->d, 4, p->n_d, fp); in kad_save1() 1090 dst->n_d = src->n_d; in kad_copy_dim1() 1177 …n_col = q[0]->d[q[0]->n_d - 1] > q[1]->d[q[1]->n_d - 1]? q[0]->d[q[0]->n_d - 1] : q[1]->d[q[1]->n_… in kad_op_cmul() 1299 p->n_d = q->n_d - 1; in kad_op_reduce_sum() 1328 p->n_d = q->n_d - 1; in kad_op_reduce_mean() 1888 p->n_d = q->n_d + 1; in kad_op_stack() [all …]
|
H A D | kautodiff.h | 68 uint8_t n_d; /* number of dimensions; no larger than KAD_MAX_DIM */ member 143 kad_node_t *kad_var(float *x, float *g, int n_d, ...); /* a variable; gradients to be computed; not… 144 kad_node_t *kad_const(float *x, int n_d, ...); /* a constant; no gradients computed; not un… 145 kad_node_t *kad_feed(int n_d, ...); /* an input/output; no gradients computed; u… 201 kad_node_t *kad_reshape(kad_node_t *x, int n_d, int *d); /* reshape; similar behavior to… 242 for (i = 0; i < p->n_d; ++i) n *= p->d[i]; in kad_len()
|
H A D | kann.c | 68 if (cost->n_d != 0) return 0; in kann_new() 179 …++k, n = a->v[i]->n_d > 1? kad_len(a->v[i]) / a->v[i]->d[0] : a->v[i]->n_d == 1? a->v[i]->d[0] : 1; in kann_feed_dim() 236 n = t->d[t->n_d - 1], m = kad_len(t) / n; in kann_class_error_core() 400 if (p->pre && p->n_d >= 2 && p->d[0] == B) { in kann_cost() 425 for (i = 1; i < p->n_d; ++i) d1 *= p->d[i]; in kann_eval_out() 539 p->n_d = n_d, p->flag = flag; in kann_new_leaf_array() 540 memcpy(p->d, d, n_d * sizeof(int32_t)); in kann_new_leaf_array() 543 if (p->n_d <= 1) { in kann_new_leaf_array() 560 va_start(ap, n_d); for (i = 0; i < n_d; ++i) d[i] = va_arg(ap, int); va_end(ap); in kann_new_leaf2() 660 va_start(ap, n_d); for (i = 0; i < n_d; ++i) d[i] = va_arg(ap, int); va_end(ap); in kann_new_leaf() [all …]
|
/dports/math/ipopt/Ipopt-3.12.13/Ipopt/src/Algorithm/ |
H A D | IpGenAugSystemSolver.cpp | 119 const Index n_d = rhs_dV[0]->Dim(); in MultiSolve() local 141 ds_vals_copy_ = new Number[n_d]; in MultiSolve() 142 TripletHelper::FillValuesFromVector(n_d, *D_s, ds_vals_copy_); in MultiSolve() 167 dd_vals_copy_ = new Number[n_d]; in MultiSolve() 168 TripletHelper::FillValuesFromVector(n_d, *D_d, dd_vals_copy_); in MultiSolve() 173 const Index dim = n_x+n_d+n_c+n_d; in MultiSolve() 181 TripletHelper::FillValuesFromVector(n_d, *rhs_dV[irhs], in MultiSolve() 183 TripletHelper::FillValuesFromVector(n_d, *rhs_sV[irhs], in MultiSolve() 194 retval = solver_interface_->MultiSolve(new_matrix, n_x, n_c, n_d, in MultiSolve() 217 TripletHelper::PutValuesInVector(n_d, &rhssol[irhs*dim+n_x+n_c], in MultiSolve() [all …]
|
/dports/misc/urbit/urbit-urbit-0.6.0/jets/d/ |
H A D | by_put.c | 23 u3_noun d, l_d, n_d, r_d; in u3qdb_put() local 50 u3r_trel(d, &n_d, &l_d, &r_d); in u3qdb_put() 53 (u3k(n_d), in u3qdb_put() 73 u3r_trel(d, &n_d, &l_d, &r_d); in u3qdb_put() 76 (u3k(n_d), in u3qdb_put()
|
H A D | in_dif.c | 17 u3_noun n_d, l_d, r_d; in _i_dif_join() local 20 if ( c3n == u3r_trel(d, &n_d, &l_d, &r_d) in _i_dif_join() 24 if ( c3y == u3qc_vor(n_d, n_e) ) { in _i_dif_join() 25 return u3nt(u3k(n_d), in _i_dif_join()
|
H A D | by_dif.c | 17 u3_noun n_d, l_d, r_d; in _b_dif_join() local 22 if ( c3n == u3r_trel(d, &n_d, &l_d, &r_d) in _b_dif_join() 24 || c3n == u3r_cell(n_d, &p_n_d, &q_n_d) in _b_dif_join() 29 return u3nt(u3k(n_d), in _b_dif_join()
|
/dports/audio/sphinx3/sphinx3-0.8/src/libs3decoder/libam/ |
H A D | cb2mllr_io.c | 137 int ret, i, n_d, n_r; in cb2mllr_read() local 149 n_d = *out_n_cb; in cb2mllr_read() 155 for (i = 0; i < n_d; i++) { in cb2mllr_read() 165 for (i = 0; i < n_d; i++) { in cb2mllr_read()
|
/dports/devel/git-delta/delta-0.9.2/src/ |
H A D | edits.rs | 194 let n_d = distance_contribution(minus_section); in annotate() localVariable 195 d_denom += n_d; in annotate() 196 d_numer += n_d; in annotate() 202 let n_d = distance_contribution(minus_section); in annotate() localVariable 203 d_denom += n_d; in annotate() 229 let n_d = distance_contribution(minus_section); in annotate() localVariable 230 d_denom += n_d; in annotate() 231 d_numer += n_d; in annotate() 239 let n_d = distance_contribution(plus_section); in annotate() localVariable 240 d_denom += n_d; in annotate() [all …]
|
/dports/science/cp2k-data/cp2k-7.1.0/src/ |
H A D | hfx_libint_interface.F | 430 m_max = n_a + n_b + n_c + n_d 447 IF (n_c < n_d) THEN 450 IF (n_a + n_b > n_c + n_d) THEN 1310 m_max = n_a + n_b + n_c + n_d 1311 mysize = nco(n_a)*nco(n_b)*nco(n_c)*nco(n_d) 1319 IF (n_c < n_d) THEN 1322 IF (n_a + n_b > n_c + n_d) THEN 1452 n_a, n_b, n_c, n_d, & argument 1493 m_max = n_a + n_b + n_c + n_d 1503 IF (n_c < n_d) THEN [all …]
|
H A D | libint_wrapper.F | 331 SUBROUTINE cp_libint_get_eris(n_d, n_c, n_b, n_a, lib, p_work, a_mysize) argument 332 INTEGER, INTENT(IN) :: n_d, n_c, n_b, n_a local 340 CALL C_F_PROCPOINTER(libint2_build_eri(n_d, n_c, n_b, n_a), pbuild) 345 MARK_USED(n_d) 434 SUBROUTINE cp_libint_get_derivs(n_d, n_c, n_b, n_a, lib, work_forces, a_mysize) argument 435 INTEGER, INTENT(IN) :: n_d, n_c, n_b, n_a local 438 (n_d), 12) :: work_forces 450 CALL C_F_PROCPOINTER(libint2_build_eri1(n_d, n_c, n_b, n_a), pbuild) 461 MARK_USED(n_d)
|
/dports/science/cp2k/cp2k-2e995eec7fd208c8a72d9544807bd8b8ba8cd1cc/src/ |
H A D | hfx_libint_interface.F | 430 m_max = n_a + n_b + n_c + n_d 447 IF (n_c < n_d) THEN 450 IF (n_a + n_b > n_c + n_d) THEN 1310 m_max = n_a + n_b + n_c + n_d 1311 mysize = nco(n_a)*nco(n_b)*nco(n_c)*nco(n_d) 1319 IF (n_c < n_d) THEN 1322 IF (n_a + n_b > n_c + n_d) THEN 1452 n_a, n_b, n_c, n_d, & argument 1493 m_max = n_a + n_b + n_c + n_d 1503 IF (n_c < n_d) THEN [all …]
|
H A D | libint_wrapper.F | 329 SUBROUTINE cp_libint_get_eris(n_d, n_c, n_b, n_a, lib, p_work, a_mysize) argument 330 INTEGER, INTENT(IN) :: n_d, n_c, n_b, n_a local 338 CALL C_F_PROCPOINTER(libint2_build_eri(n_d, n_c, n_b, n_a), pbuild) 343 MARK_USED(n_d) 432 SUBROUTINE cp_libint_get_derivs(n_d, n_c, n_b, n_a, lib, work_forces, a_mysize) argument 433 INTEGER, INTENT(IN) :: n_d, n_c, n_b, n_a local 436 (n_d), 12) :: work_forces 447 CALL C_F_PROCPOINTER(libint2_build_eri1(n_d, n_c, n_b, n_a), pbuild) 458 MARK_USED(n_d)
|
/dports/graphics/inkscape/inkscape-1.1_2021-05-24_c4e8f9ed74/src/livarot/ |
H A D | PathOutline.cpp | 513 if (n_d >= 0) in SubContractOutline() 515 dest->descr_cmd[n_d]->associated = curP; in SubContractOutline() 516 dest->descr_cmd[n_d]->tSt = 0.0; in SubContractOutline() 517 dest->descr_cmd[n_d]->tEn = 1.0; in SubContractOutline() 676 if (n_d >= 0) { in SubContractOutline() 678 dest->descr_cmd[n_d]->tSt = 0.0; in SubContractOutline() 679 dest->descr_cmd[n_d]->tEn = 1.0; in SubContractOutline() 1326 if (n_d >= 0) { in RecStdCubicTo() 1352 if (n_d >= 0) { in RecStdCubicTo() 1467 if (n_d >= 0) { in RecStdArcTo() [all …]
|
/dports/math/gecode/gecode-0916a1a/examples/ |
H A D | golomb-ruler.cpp | 81 const int n_d = (n*n-n)/2; in GolombRuler() local 84 IntVarArgs d(n_d); in GolombRuler() 97 rel(*this, d[0], IRT_LE, d[n_d-1]); in GolombRuler()
|
/dports/science/qwalk/mainline-1.0.1-300-g1b7e381/src/program_utils/ |
H A D | qmc_io.cpp | 387 doublevar n_d=n; in binary_write_checksum() local 391 fwrite(&n_d,sizeof(doublevar),1,f); in binary_write_checksum() 419 doublevar n_d; in binary_read_checksum() local 420 fread(&n_d,sizeof(doublevar),1,f); in binary_read_checksum() 421 int n=int(n_d); in binary_read_checksum() 422 if(n_d-n == 0 and ( nhint<0 or n==nhint)) { in binary_read_checksum()
|
/dports/cad/gnucap/gnucap-2013-04-23/apps/ |
H A D | d_mos.model | 83 omit="!OPT::cstray || _n[n_g].n_() == _n[n_d].n_()"; 121 v = "@n_d[V] - @n_s[V]"; 122 vds = "@n_d[V] - @n_s[V]"; 128 vgd = "@n_g[V] - @n_d[V]"; 129 vbd = "@n_b[V] - @n_d[V]"; 130 vsd = "@n_s[V] - @n_d[V]"; 131 vdm = "(@n_d[V] - @n_s[V] + @n_d[V] - @n_d[V]) / 2."; 135 vdg = "@n_d[V] - @n_g[V]"; 138 vdb = "@n_d[V] - @n_b[V]"; 141 vd = "@n_d[V]"; [all …]
|
/dports/science/qwalk/mainline-1.0.1-300-g1b7e381/utils/ |
H A D | convert_old_trace.cpp | 17 double n_d=n; in binary_write_checksum() local 21 fwrite(&n_d,sizeof(double),1,f); in binary_write_checksum()
|
/dports/science/dakota/dakota-6.13.0-release-public.src-UI/docs/KeywordMetadata/ |
H A D | interface-analysis_drivers-analysis_components | 12 of the number of drivers \f$n_d\f$, and the first \f$n_c/n_d\f$
|