Home
last modified time | relevance | path

Searched refs:xind (Results 1 – 25 of 167) sorted by relevance

1234567

/dports/math/symphony/SYMPHONY-releases-5.6.17/SYMPHONY/Applications/CNRP/src/Common/
H A Dnetwork.c72 if (*xind < total_edgenum){ in create_net()
73 nv0 = edges[(*xind) << 1]; in create_net()
74 nv1 = edges[((*xind)<< 1) + 1]; in create_net()
94 nv0 = edges[(*xind) << 1]; in create_net()
95 nv1 = edges[((*xind)<< 1) + 1]; in create_net()
198 if (xind[i] < total_edgenum){ in create_flow_net()
199 nv0 = edges[xind[i] << 1]; in create_flow_net()
200 nv1 = edges[(xind[i] << 1) + 1]; in create_flow_net()
215 if (xind[i] < total_edgenum){ in create_flow_net()
216 nv0 = edges[xind[i] << 1]; in create_flow_net()
[all …]
/dports/math/couenne/Couenne-releases-0.5.8/Couenne/src/standardize/
H A DconstrStandardize.cpp27 void replace (CouenneProblem *p, int wind, int xind);
129 int xind = rest -> Index (); in standardize() local
137 exprAux *w = new exprAux (new exprClone (p -> Var (xind)), wind, 1 + p -> Var (xind) -> rank (), in standardize()
144 replace (p, wind, xind); in standardize()
146 p -> auxiliarize (p -> Var (wind), p -> Var (xind)); in standardize()
209 int xind = (*i) -> Index (), iMax, iMin; in standardize() local
211 if (xind < wind) { in standardize()
213 iMin = xind; in standardize()
215 iMax = xind; in standardize()
247 *varStays = p -> Variables () [xind]; in replace()
[all …]
/dports/cad/ngspice_rework/ngspice-35/src/xspice/icm/table/support/
H A Dinterp.c153 V00 = td[yind][xind]; in BilinearInterpolation()
154 V10 = td[yind][xind+1]; in BilinearInterpolation()
155 V01 = td[yind+1][xind]; in BilinearInterpolation()
156 V11 = td[yind+1][xind+1]; in BilinearInterpolation()
176 V000 = td[zind][yind][xind]; in TrilinearInterpolation()
177 V100 = td[zind][yind][xind+1]; in TrilinearInterpolation()
178 V010 = td[zind][yind+1][xind]; in TrilinearInterpolation()
179 V001 = td[zind+1][yind][xind]; in TrilinearInterpolation()
180 V101 = td[zind+1][yind][xind+1]; in TrilinearInterpolation()
181 V011 = td[zind+1][yind+1][xind]; in TrilinearInterpolation()
[all …]
/dports/math/couenne/Couenne-releases-0.5.8/Couenne/src/convex/operators/
H A Dconv-exprOpp.cpp35 int xind = argument_ -> Index (); in generateCuts() local
37 if (xind < 0) { in generateCuts()
45 &xlb = cg -> Problem () -> Lb (xind), in generateCuts()
46 &xub = cg -> Problem () -> Ub (xind); in generateCuts()
51 cut -> setLbs (1, &xind, &xlb); in generateCuts()
52 cut -> setUbs (1, &xind, &xub); in generateCuts()
/dports/math/symphony/SYMPHONY-releases-5.6.17/SYMPHONY/Applications/CNRP/src/LP/
H A Dcnrp_lp_branch.c134 xind[cnt] = i; in user_select_candidates()
147 xind[cnt] = i; in user_select_candidates()
155 qsort_di(xval, xind, cnt); in user_select_candidates()
188 FREE(xind); in user_select_candidates()
199 for (; j < nz && xind[j] < xind[i] + total_edgenum; j++){ in user_select_candidates()
200 if (xind[i] == xind[j] + total_edgenum){ in user_select_candidates()
204 xind[j] -= total_edgenum; in user_select_candidates()
214 qsort_di(xval, xind, nz); in user_select_candidates()
220 FREE(xind); in user_select_candidates()
408 xind[cnt] = i; in user_select_candidates()
[all …]
/dports/math/py-statsmodels/statsmodels-0.13.1/statsmodels/sandbox/distributions/
H A Dquantize.py78 for xind in range(1, nx+1):
80 upper = (xind, yind)
81 lower = (xind-1, yind-1)
83 probs[xind-1,yind-1] = prob_bv_rectangle(lower, upper, cdf_func)
104 for xind in range(1, nx+1):
106 upper = (binsx[xind], binsy[yind])
107 lower = (binsx[xind-1], binsy[yind-1])
109 probs[xind-1,yind-1] = prob_bv_rectangle(lower, upper, cdf)
/dports/multimedia/mp4v2/mp4v2-2.0.0/libutil/
H A DTrackModifier.cpp73 TrackModifier::dump( ostream& out, const string& xind ) in dump() argument
79 out << left << xind << "track[" << trackIndex << "] id=" << trackId in dump()
81 << '\n' << xind << ind << setw( w ) << "enabled" << eq << toString( enabled ) in dump()
82 << '\n' << xind << ind << setw( w ) << "inMovie" << eq << toString( inMovie ) in dump()
83 << '\n' << xind << ind << setw( w ) << "inPreview" << eq << toString( inPreview ) in dump()
84 << '\n' << xind << ind << setw( w ) << "layer" << eq << layer in dump()
85 << '\n' << xind << ind << setw( w ) << "alternateGroup" << eq << alternateGroup in dump()
86 << '\n' << xind << ind << setw( w ) << "volume" << eq << toString( volume, 8, 8 ) in dump()
87 << '\n' << xind << ind << setw( w ) << "width" << eq << toString( width, 16, 16 ) in dump()
90 << '\n' << xind << ind << setw( w ) << "handlerName" << eq << handlerName; in dump()
[all …]
/dports/math/symphony/SYMPHONY-releases-5.6.17/SYMPHONY/Applications/VRP/src/Common/
H A Dnetwork.c34 network *createnet(int *xind, double *xval, int edgenum, double etol, in createnet() argument
63 qsort_di(xval, xind, edgenum); in createnet()
68 ind_high = xind + edgenum - 1; i < (edgenum/2); i++){ in createnet()
82 for (i = 0; i < edgenum; i++, xval++, xind++){ in createnet()
90 nv0 = net_edges->v0 = edges[(*xind) << 1]; in createnet()
91 nv1 = net_edges->v1 = edges[((*xind)<< 1) + 1]; in createnet()
185 qsort_di(xval, xind, edgenum); in createnet2()
190 ind_high = xind + edgenum - 1; i < (edgenum/2); i++){ in createnet2()
204 for (i = 0; i < edgenum; i++, xval++, xind++, stat++){ in createnet2()
215 nv0 = net_edges->v0 = edges[(*xind) << 1]; in createnet2()
[all …]
/dports/math/symphony/SYMPHONY-releases-5.6.17/SYMPHONY/Applications/CNRP/src/DrawGraph/
H A Dcnrp_dg.c42 int *xind; in user_dg_process_message() local
49 xind = (int *) malloc(length * ISIZE); in user_dg_process_message()
51 receive_int_array(xind, length); in user_dg_process_message()
54 win_cnrp->n = dg_createnet(win->g.nodenum, length, xind, xval); in user_dg_process_message()
55 FREE(xind); in user_dg_process_message()
/dports/math/symphony/SYMPHONY-releases-5.6.17/SYMPHONY/Applications/VRP/src/DrawGraph/
H A Dvrp_dg.c43 int *xind; in user_dg_process_message() local
50 xind = (int *) malloc(length * ISIZE); in user_dg_process_message()
52 receive_int_array(xind, length); in user_dg_process_message()
55 win_vrp->n = dg_createnet(win->g.nodenum, length, xind, xval); in user_dg_process_message()
56 FREE(xind); in user_dg_process_message()
/dports/math/symphony/SYMPHONY-releases-5.6.17/SYMPHONY/src/LP/
H A Dlp_pseudo_branch.c134 int *xind; in select_branching_object() local
699 xind[cnt] = i; in branch_close_to_half()
703 qsort_di(xval, xind, cnt); in branch_close_to_half()
724 cand->position = xind[i]; in branch_close_to_half()
755 xind[cnt] = i; in branch_close_to_half_and_expensive()
759 qsort_di(xval, xind, cnt); in branch_close_to_half_and_expensive()
779 qsort_di(xval, xind, cnt); in branch_close_to_half_and_expensive()
789 cand->position = xind[i]; in branch_close_to_half_and_expensive()
819 xind[cnt] = i; in branch_close_to_one_and_cheap()
822 qsort_di(xval, xind, cnt); in branch_close_to_one_and_cheap()
[all …]
H A Dlp_sp.c53 sol->xind = (int *) malloc(ISIZE*cnt); in sp_add_solution()
54 memcpy(sol->xind,indices,ISIZE*cnt); in sp_add_solution()
74 FREE(sp->solutions[position]->xind); in sp_delete_solution()
77 sp->solutions[i]->xind=sp->solutions[i+1]->xind; in sp_delete_solution()
/dports/math/couenne/Couenne-releases-0.5.8/Couenne/src/expression/operators/
H A DexprSin.cpp66 bool trigImpliedBound (enum cou_trig type, int wind, int xind, in trigImpliedBound() argument
71 CouNumber *xl = l + xind, wl = l [wind], in trigImpliedBound()
72 *xu = u + xind, wu = u [wind]; in trigImpliedBound()
99 chg [xind]. setLower (t_chg_bounds::CHANGED); in trigImpliedBound()
111 chg [xind]. setUpper (t_chg_bounds::CHANGED); in trigImpliedBound()
123 chg [xind]. setLower (t_chg_bounds::CHANGED); in trigImpliedBound()
135 chg [xind]. setUpper (t_chg_bounds::CHANGED); in trigImpliedBound()
H A DexprInv.cpp126 int xind = argument_ -> Index (); in isCuttable() local
129 x = problem -> X (xind), in isCuttable()
132 return (((problem -> Lb (xind) >= 0) && (x > 0) && (y*x <= 1)) || in isCuttable()
133 ((problem -> Ub (xind) <= 0) && (x < 0) && (y*x <= 1))); in isCuttable()
/dports/math/arpack++/arpackpp-2.3.0/include/
H A Darunspen.h154 if (xind[ix] == yind[iy]) { in SparseSaxpy()
155 zind[nz] = xind[ix]; in SparseSaxpy()
159 else if (xind[ix] < yind[iy]) { in SparseSaxpy()
160 zind[nz] = xind[ix]; in SparseSaxpy()
175 zind[nz] = xind[ix]; in SparseSaxpy()
205 zind[ix] = xind[ix]; in SparseSaxpy()
213 if (xind[ix] == yind[iy]) { in SparseSaxpy()
214 zind[nz] = xind[ix]; in SparseSaxpy()
218 else if (xind[ix] < yind[iy]) { in SparseSaxpy()
219 zind[nz] = xind[ix]; in SparseSaxpy()
[all …]
H A Darlnspen.h183 if (xind[ix] == yind[iy]) { in SparseSaxpy()
184 zind[nz] = xind[ix]; in SparseSaxpy()
188 else if (xind[ix] < yind[iy]) { in SparseSaxpy()
189 zind[nz] = xind[ix]; in SparseSaxpy()
204 zind[nz] = xind[ix]; in SparseSaxpy()
233 zind[ix] = xind[ix]; in SparseSaxpy()
241 if (xind[ix] == yind[iy]) { in SparseSaxpy()
242 zind[nz] = xind[ix]; in SparseSaxpy()
246 else if (xind[ix] < yind[iy]) { in SparseSaxpy()
247 zind[nz] = xind[ix]; in SparseSaxpy()
[all …]
/dports/math/R-cran-robustbase/robustbase/inst/xtraR/
H A Dtest_MCD.R231 xind <- sample(n,nbad) functionVar
232 X[xind,] <- X[xind, , drop=FALSE] + rep(b, each=nbad)
234 list(X=X, xind=if(nbad > 0) xind) nameattr
306 check(mcd, xx$xind)
311 check <- function(mcd, xind){ argument
312 mymatch <- xind %in% which(mcd@wt == 0)
313 length(xind) - sum(mymatch)
/dports/science/py-paramz/paramz-0.9.5/paramz/
H A Dmodel.py370 for xind in zip(transformed_index):
372 xx[xind] += step
374 xx[xind] -= 2.*step
384 if np.all(gradient[xind] == 0): # pragma: no cover
385 ratio = (f1 - f2) == gradient[xind]
387 ratio = (f1 - f2) / (2. * step * gradient[xind])
388 difference = np.abs(numerical_gradient - gradient[xind])
391 formatted_name = "\033[92m {0} \033[0m".format(names[xind])
394 formatted_name = "\033[91m {0} \033[0m".format(names[xind])
397 formatted_name = "\033[94m {0} \033[0m".format(names[xind])
[all …]
/dports/math/py-statsmodels/statsmodels-0.13.1/statsmodels/sandbox/examples/
H A Dtry_smoothers.py91 xind = np.argsort(x) variable
92 pmod = smoothers.PolySmoother(5, x[xind])
93 pmod.fit(y[xind])
95 yp = pmod(x[xind])
96 ax5.plot(x[xind], yp, 'k-')
/dports/math/couenne/Couenne-releases-0.5.8/Couenne/src/expression/operators/bounds/
H A DexprBQuad.cpp75 int xind = row -> first -> Index (); in computeQBound() local
87 if (xind == yind) { // term of the form q_ii x_i^2 in computeQBound()
99 printf ("Qii %d %g %g -> %g\n", xind, coe, term, bound + term); in computeQBound()
126 printf ("Qij %d %d %g %g -> %g\n", xind, yind, coe, term, bound + term); in computeQBound()
/dports/math/couenne/Couenne-releases-0.5.8/Couenne/src/branch/
H A DfeasibleRegion.cpp105 int xind = row -> first -> Index (); in feasibleRegion() local
107 val = info -> solution_ [xind]; in feasibleRegion()
108 solver -> setColLower (xind, val-TOL); in feasibleRegion()
109 solver -> setColUpper (xind, val+TOL); in feasibleRegion()
/dports/cad/k40-whisperer/K40_Whisperer-0.58_src/
H A Dg_code_library.py91 xind=0
347 POS[xind] = float(com[1])*scale + POS_LAST[xind]
369 CENTER[xind] = float(com[1])*scale + POS_LAST[xind]
521 xind=2
525 xind=1
529 xind=0
1451 xind=2
1455 xind=1
1459 xind=0
1463 R = sqrt( (cent[xind]-p1[xind])**2 + (cent[yind]-p1[yind])**2 )
[all …]
/dports/science/afni/afni-AFNI_21.3.16/src/
H A Dprf_common_circular.c417 int xind, yind, zind, tind; in convolve_dset() local
443 for( xind = 0; xind < nx; xind++ ) dbase[xind] = result[xind]; in convolve_dset()
608 int xind, yind, zind, tind; in THD_reorg_dset() local
641 for( xind = 0; xind < out_nx; xind++ ) { in THD_reorg_dset()
644 inslice = ((float *)DSET_ARRAY(din, xind)) + tind*in_nxy; in THD_reorg_dset()
647 outbase = newvol + xind + yind*out_nx; in THD_reorg_dset()
693 int xind, yind, zind, tind; in THD_reorg_dset_old() local
729 for( xind = 0; xind < out_nx; xind++ ) { in THD_reorg_dset_old()
732 inslice = ((float *)DSET_ARRAY(din, xind)) + tind*in_nxy; in THD_reorg_dset_old()
735 outbase = newvol + xind + yind*out_nx; in THD_reorg_dset_old()
/dports/science/erkale/erkale-8297aefe5aac9dbbb291e04c07661f3cff94a99a/src/emd/
H A Demdcube.cpp62 size_t xind=0, yind=0, zind=0; in emd_cube() local
71 p[np].x=px_arr[xind]; in emd_cube()
88 xind++; in emd_cube()
/dports/science/erkale-pseudopotentials/erkale-870e772f09631b3dbdd99a18e4f3d4786d684a01/src/emd/
H A Demdcube.cpp62 size_t xind=0, yind=0, zind=0; in emd_cube() local
71 p[np].x=px_arr[xind]; in emd_cube()
88 xind++; in emd_cube()

1234567