Home
last modified time | relevance | path

Searched refs:n_sub (Results 1 – 25 of 99) sorted by relevance

1234

/dports/math/cppad/CppAD-20210000.8/test_more/general/
H A Dsparse_sub_hes.cpp82 size_t n_sub = 4; in test_set() local
84 for(size_t j = 0; j < n_sub; j++) in test_set()
90 f.ForSparseJac(n_sub, r); in test_set()
101 for(size_t i = 0; i < n_sub; i++) in test_set()
151 size_t n_sub = 4; in test_bool() local
152 s_vector r(n * n_sub); in test_bool()
154 { for(size_t j = 0; j < n_sub; j++) in test_bool()
159 f.ForSparseJac(n_sub, r); in test_bool()
169 for(size_t i = 0; i < n_sub; i++) in test_bool()
187 { for(size_t j = 0; j < n_sub; j++) in test_bool()
[all …]
/dports/math/octave-forge-nurbs/nurbs-1.4.3/inst/
H A Dkntrefine.m11 % n_sub: number of new knots to be added in each interval.
41 function varargout = kntrefine (knots, n_sub, degree, regularity)
44 if (numel(n_sub)~=numel(degree) || numel(n_sub)~=numel(regularity) || ...
45 numel(n_sub)~=numel(knots))
50 if (numel(n_sub)~=numel(degree) || numel(n_sub)~=numel(regularity) || ...
51 numel(n_sub)~=1)
58 for idim = 1:numel(n_sub)
63 for idim = 1:numel(n_sub)
72 insk = linspace (z(ik-1), z(ik), n_sub(idim) + 2);
90 for idim = 1:numel(n_sub)
[all …]
/dports/math/py-statsmodels/statsmodels-0.13.1/statsmodels/nonparametric/
H A D_kernel_base.py46 ix_unord, n_sub, class_vars, randomize, bound): argument
57 sub_data = data[:n_sub, :]
91 fct = dispersion * n_sub**(-1. / (n_cvars + co))
92 fct[ix_unord] = n_sub**(-2. / (n_cvars + do))
93 fct[ix_ord] = n_sub**(-2. / (n_cvars + do))
187 n_sub = self.n_sub
199 bounds = [(i * n_sub, (i+1) * n_sub) for i in range(nobs // n_sub)]
200 if nobs % n_sub > 0:
201 bounds.append((nobs - nobs % n_sub, nobs))
243 self.n_sub = defaults.n_sub
[all …]
/dports/sysutils/anacron/anacron-2.3/
H A Dmatchrx.c34 match_rx(const char *rx, char *string, int n_sub, /* char **substrings */...) in match_rx() argument
51 sub_offsets = malloc(sizeof(regmatch_t) * (n_sub + 1)); in match_rx()
52 memset(sub_offsets, 0, sizeof(regmatch_t) * (n_sub + 1)); in match_rx()
55 r = regexec(&crx, string, n_sub + 1, sub_offsets, 0); in match_rx()
60 va_start(va, n_sub); in match_rx()
62 while (n <= n_sub) in match_rx()
/dports/science/code_saturne/code_saturne-7.1.0/src/fvm/
H A Dfvm_to_histogram.c201 w->n_sub, in _display_histogram_txt()
258 for (i = 0 ; i < w->n_sub-1 ; i++) in _display_histogram_tex()
267 for (i = 0 ; i < w->n_sub ; i++) in _display_histogram_tex()
340 for (i = 0; i < w->n_sub; i++) in _display_histograms()
379 BFT_MALLOC(count, w->n_sub, cs_gnum_t); in _histogram()
406 for (j = 0; j < w->n_sub; j++) in _histogram()
411 step = CS_ABS(max - min) / w->n_sub; in _histogram()
599 w->n_sub = 5; /* default */ in fvm_to_histogram_init_writer()
620 w->n_sub = 10; in fvm_to_histogram_init_writer()
626 w->n_sub = 10; in fvm_to_histogram_init_writer()
[all …]
H A Dfvm_to_vtk_histogram.cxx117 double var_step = CS_ABS(var_max - var_min) / w->n_sub; in fvm_to_vtk_display_histogram_png()
137 table->SetNumberOfRows(w->n_sub); in fvm_to_vtk_display_histogram_png()
139 for (int i = 0; i < w->n_sub; i++) { in fvm_to_vtk_display_histogram_png()
152 labels->SetNumberOfValues(w->n_sub); in fvm_to_vtk_display_histogram_png()
154 for (int i = 0; i < w->n_sub; i++) { in fvm_to_vtk_display_histogram_png()
/dports/math/deal.ii/dealii-803d21ff957e349b3799cd3ef2c840bc78734305/source/base/
H A Dpolynomials_abf.cc84 const unsigned int n_sub = polynomial_space.n(); in evaluate() local
92 p_values.resize((values.size() == 0) ? 0 : n_sub); in evaluate()
93 p_grads.resize((grads.size() == 0) ? 0 : n_sub); in evaluate()
94 p_grad_grads.resize((grad_grads.size() == 0) ? 0 : n_sub); in evaluate()
95 p_third_derivatives.resize((third_derivatives.size() == 0) ? 0 : n_sub); in evaluate()
96 p_fourth_derivatives.resize((fourth_derivatives.size() == 0) ? 0 : n_sub); in evaluate()
123 values[i + d * n_sub][d] = p_values[i]; in evaluate()
127 grads[i + d * n_sub][d][(d1 + d) % dim] = p_grads[i][d1]; in evaluate()
132 grad_grads[i + d * n_sub][d][(d1 + d) % dim][(d2 + d) % dim] = in evaluate()
139 third_derivatives[i + d * n_sub][d][(d1 + d) % dim] in evaluate()
[all …]
H A Dpolynomials_raviart_thomas.cc106 const unsigned int n_sub = polynomial_space.n(); in evaluate() local
107 p_values.resize((values.size() == 0) ? 0 : n_sub); in evaluate()
108 p_grads.resize((grads.size() == 0) ? 0 : n_sub); in evaluate()
109 p_grad_grads.resize((grad_grads.size() == 0) ? 0 : n_sub); in evaluate()
110 p_third_derivatives.resize((third_derivatives.size() == 0) ? 0 : n_sub); in evaluate()
111 p_fourth_derivatives.resize((fourth_derivatives.size() == 0) ? 0 : n_sub); in evaluate()
138 values[i + d * n_sub][d] = p_values[i]; in evaluate()
142 grads[i + d * n_sub][d][(d1 + d) % dim] = p_grads[i][d1]; in evaluate()
147 grad_grads[i + d * n_sub][d][(d1 + d) % dim][(d2 + d) % dim] = in evaluate()
154 third_derivatives[i + d * n_sub][d][(d1 + d) % dim] in evaluate()
[all …]
H A Dpolynomials_bdm.cc82 const unsigned int n_sub = polynomial_space.n(); in evaluate() local
92 p_values.resize((values.size() == 0) ? 0 : n_sub); in evaluate()
93 p_grads.resize((grads.size() == 0) ? 0 : n_sub); in evaluate()
94 p_grad_grads.resize((grad_grads.size() == 0) ? 0 : n_sub); in evaluate()
111 values[i + j * n_sub][j] = p_values[i]; in evaluate()
116 grads[i + j * n_sub][j] = p_grads[i]; in evaluate()
121 grad_grads[i + j * n_sub][j] = p_grad_grads[i]; in evaluate()
126 unsigned int start = dim * n_sub; in evaluate()
/dports/science/code_saturne/code_saturne-7.1.0/src/base/
H A Dcs_crystal_router.c648 const cs_lnum_t n_sub = *pn; in _dump_i() local
657 for (cs_lnum_t j = 0; j < n_sub; j++) in _dump_i()
662 s_idx += n_sub; in _dump_i()
1340 const cs_lnum_t n_sub = *pn; in _get_data_i() local
1344 data_idx[i+1] = data_idx[i] + n_sub; in _get_data_i()
1355 s_idx += n_sub; in _get_data_i()
1429 const cs_lnum_t n_sub = *pn; in _get_data_i_with_dest_id() local
1476 const cs_lnum_t n_sub = *pn; in _get_data_i_with_dest_id() local
1722 pn[0] = n_sub; in cs_crystal_router_create_i()
1769 pn[0] = n_sub; in cs_crystal_router_create_i()
[all …]
H A Dcs_field_pointer.c251 int n_sub = index+1; in cs_field_pointer_map_indexed() local
254 BFT_MALLOC(_field_pointer[e].p, n_sub, cs_field_t *); in cs_field_pointer_map_indexed()
256 BFT_REALLOC(_field_pointer[e].p, n_sub, cs_field_t *); in cs_field_pointer_map_indexed()
259 for (int i = _sublist_size[e]; i < n_sub; i++) in cs_field_pointer_map_indexed()
262 _sublist_size[e] = n_sub; in cs_field_pointer_map_indexed()
/dports/biology/rainbow/rainbow_2.0.4/
H A Daln_cigar.h221 int i, x, y, n_sub; in sub_cigars() local
222 n_sub = 0; in sub_cigars()
230 n_sub = _aln_cigar_add_cigar(dst, n_sub, y - off, cigars[i].type); in sub_cigars()
232 n_sub = _aln_cigar_add_cigar(dst, n_sub, off + len - x, cigars[i].type); in sub_cigars()
239 n_sub = _aln_cigar_add_cigar(dst, n_sub, cigars[i].len, cigars[i].type); in sub_cigars()
241 n_sub = _aln_cigar_add_cigar(dst, n_sub, off + len - x, cigars[i].type); in sub_cigars()
247 return n_sub; in sub_cigars()
/dports/math/SCIP/scip-7.0.3/src/cppad/local/optimize/
H A Drecord_csum.hpp211 size_t n_sub = work.sub_stack.size(); in record_csum() local
214 std::numeric_limits<addr_t>::max() >= n_add + n_sub in record_csum()
218 rec->PutArg( addr_t(n_sub) ); // arg[1] in record_csum()
231 for(size_t i = 0; i < n_sub; i++) in record_csum()
240 rec->PutArg( addr_t(n_add + n_sub) ); // arg[3 + arg[0] + arg[1]] in record_csum()
/dports/graphics/openfx-misc/openfx-misc-3ab0531/Shadertoy/presets/default/
H A Dspiral.frag.glsl18 float n_sub = 2.0;
20 float turn_sub = mod(float(n_sub) * turn_1, float(n_sub));
/dports/math/alberta/alberta3-920315ae1bbfd1b1fb6672d916619ac37a411e95/alberta/src/Common/
H A Dwrite_mesh_gmv.c478 n_sub = n_sub_elements[dim][max_degree]; in add_refined_data()
503 for(i = 0; i < n_sub; i++) { in add_refined_data()
513 TEST_EXIT(ne == mesh->n_elements * n_sub, in add_refined_data()
586 for(j = 0; j < n_sub; j++) in add_refined_data()
587 new_vecs[i][index*n_sub + j] = in add_refined_data()
664 for(i = 0; i < n_sub; i++) in add_refined_data()
667 for(i = 0; i < n_sub; i++) in add_refined_data()
670 ne += n_sub; in add_refined_data()
673 ne = mesh->n_elements * n_sub; in add_refined_data()
702 index = ne*n_sub; in add_refined_data()
[all …]
/dports/math/geogram/geogram-1.7.7/src/tests/test_nn_search/third_party/ANN/
H A Dbd_tree.cpp245 int n_sub = n; // number of points in subset in tryCentroidShrink() local
251 while (n_sub > n_goal) { // keep splitting until goal reached in tryCentroidShrink()
256 (*splitter)(pa, pidx, inner_box, n_sub, dim, cd, cv, n_lo); in tryCentroidShrink()
259 if (n_lo >= n_sub/2) { // most points on low side in tryCentroidShrink()
261 n_sub = n_lo; // recurse on lower points in tryCentroidShrink()
266 n_sub -= n_lo; in tryCentroidShrink()
/dports/graphics/autopano-sift-c/autopano-sift-C-2.5.1/APSCpp/ANN/
H A Dbd_tree.cpp245 int n_sub = n; // number of points in subset in tryCentroidShrink() local
251 while (n_sub > n_goal) { // keep splitting until goal reached in tryCentroidShrink()
256 (*splitter)(pa, pidx, inner_box, n_sub, dim, cd, cv, n_lo); in tryCentroidShrink()
259 if (n_lo >= n_sub/2) { // most points on low side in tryCentroidShrink()
261 n_sub = n_lo; // recurse on lower points in tryCentroidShrink()
266 n_sub -= n_lo; in tryCentroidShrink()
/dports/math/ann/ann_1.1.2/src/
H A Dbd_tree.cpp245 int n_sub = n; // number of points in subset in tryCentroidShrink() local
251 while (n_sub > n_goal) { // keep splitting until goal reached in tryCentroidShrink()
256 (*splitter)(pa, pidx, inner_box, n_sub, dim, cd, cv, n_lo); in tryCentroidShrink()
259 if (n_lo >= n_sub/2) { // most points on low side in tryCentroidShrink()
261 n_sub = n_lo; // recurse on lower points in tryCentroidShrink()
266 n_sub -= n_lo; in tryCentroidShrink()
/dports/cad/gmsh/gmsh-4.9.2-source/contrib/ANN/src/
H A Dbd_tree.cpp245 int n_sub = n; // number of points in subset in tryCentroidShrink() local
251 while (n_sub > n_goal) { // keep splitting until goal reached in tryCentroidShrink()
256 (*splitter)(pa, pidx, inner_box, n_sub, dim, cd, cv, n_lo); in tryCentroidShrink()
259 if (n_lo >= n_sub/2) { // most points on low side in tryCentroidShrink()
261 n_sub = n_lo; // recurse on lower points in tryCentroidShrink()
266 n_sub -= n_lo; in tryCentroidShrink()
/dports/cad/meshlab/meshlab-Meshlab-2020.05/src/plugins_unsupported/external/ann_1.1.1/src/
H A Dbd_tree.cpp245 int n_sub = n; // number of points in subset in tryCentroidShrink() local
251 while (n_sub > n_goal) { // keep splitting until goal reached in tryCentroidShrink()
256 (*splitter)(pa, pidx, inner_box, n_sub, dim, cd, cv, n_lo); in tryCentroidShrink()
259 if (n_lo >= n_sub/2) { // most points on low side in tryCentroidShrink()
261 n_sub = n_lo; // recurse on lower points in tryCentroidShrink()
266 n_sub -= n_lo; in tryCentroidShrink()
/dports/science/dakota/dakota-6.13.0-release-public.src-UI/packages/external/queso/src/contrib/ANN/src/
H A Dbd_tree.cpp245 int n_sub = n; // number of points in subset in tryCentroidShrink() local
251 while (n_sub > n_goal) { // keep splitting until goal reached in tryCentroidShrink()
256 (*splitter)(pa, pidx, inner_box, n_sub, dim, cd, cv, n_lo); in tryCentroidShrink()
259 if (n_lo >= n_sub/2) { // most points on low side in tryCentroidShrink()
261 n_sub = n_lo; // recurse on lower points in tryCentroidShrink()
266 n_sub -= n_lo; in tryCentroidShrink()
/dports/science/dakota/dakota-6.13.0-release-public.src-UI/packages/external/approxnn/src/
H A Dbd_tree.cpp245 int n_sub = n; // number of points in subset in tryCentroidShrink() local
251 while (n_sub > n_goal) { // keep splitting until goal reached in tryCentroidShrink()
256 (*splitter)(pa, pidx, inner_box, n_sub, dim, cd, cv, n_lo); in tryCentroidShrink()
259 if (n_lo >= n_sub/2) { // most points on low side in tryCentroidShrink()
261 n_sub = n_lo; // recurse on lower points in tryCentroidShrink()
266 n_sub -= n_lo; in tryCentroidShrink()
/dports/science/conduit/conduit-0.8.0/src/tests/conduit/
H A Dt_conduit_to_string.cpp165 Node &n_sub = n.append(); in TEST() local
166 n_sub.append().set({0,1,2,3,4,5,6,7,8,9}); in TEST()
167 n_sub.append().set({1,1,2,3,4,5,6,7,8,9}); in TEST()
168 n_sub.append().set({2,1,2,3,4,5,6,7,8,9}); in TEST()
169 n_sub.append().set({3,1,2,3,4,5,6,7,8,9}); in TEST()
/dports/math/SCIP/scip-7.0.3/src/cppad/local/subgraph/
H A Dentire_call.hpp44 size_t n_sub = subgraph.size(); in entire_call() local
45 for(size_t k = 0; k < n_sub; ++k) in entire_call()
/dports/math/cppad/CppAD-20210000.8/include/cppad/local/subgraph/
H A Dentire_call.hpp45 size_t n_sub = subgraph.size(); in entire_call() local
46 for(size_t k = 0; k < n_sub; ++k) in entire_call()

1234